1.4 data types,data structures and algorithms

Question 1

1.4.1 data types

Answer 1

uhhhh here we go

Question 2

how to represent negative numbers in binary

Answer 2

-sign and magnitude
-2’s constant

Question 3

sign and magnitude

Answer 3

the leftmost bit (most significant bit) is used as the sign bit. sign bit of 0 means its a positive number, sign bit of 1 means negative number. Remaining bits represent the value of number.
-first convert number to binary then if negative number put the sign bit as 1

Question 4

sign and magnitude example

Answer 4

-binary 173: 10101101
-sign magnitude +173: 010101101
-sign magnitude -173: 110101101

Question 5

two’s compliment

Answer 5

-most significant bit is 128 which is represented as -128
-if decimal number, first convert to binary. copy the binary number until the first zero then flip the rest of the bits (make 0 to 1, make 1 to 0)

Question 6

two’s compliment example

Answer 6

binary 7: 00000111
two’s compliment: 11111001 (represents -7 as it starts with 1)
(-128+64+32+16+8+1 = -7)

Question 7

1.4.1 text, images numbers and sound

Question 9

1.4.2 data structures

Answer 9

bjkh

Question 10

what is a stack?

Answer 10

a last in first out data structure, where items can only be removed from and added to the top of the list

Question 11

where might stacks be used

Answer 11

-back button in a web page
-undo buttons

Question 12

operations on stack

Answer 12

-Push: Adds an element to the top of the stack.
-Pop: Removes and returns the top element of the stack.
-Peek: Returns the top element of the stack without removing it.
-IsEmpty: Checks if the stack is empty.
-Size: Returns the number of elements in the stack
-isFull: checks if stack is full and returns boolean value

Question 13

what is a queue

Answer 13

first in first out (FIFO) data structure; items are added to the end of the queue
and are removed from the front of the queue

Question 14

where are queues used

Answer 14

printers, keyboards and simulators

Question 15

operations on queues

Answer 15

-Enqueue: Adds an element to the end (rear) of the queue.
-Dequeue: Removes and returns the front element of the queue.
-isEmpty():checks to see if the queue is empty
-isFull(): checks to see if the queue is full

Question 16

stacks and queues differences

Answer 16

-In Stack, elements are added and removed from the same end (the top). In Queue, elements are added at the rear and removed from the front
-stacks use a single pointer to manage the top element, while queues use two pointers to manage both the front and the rear elements.

Question 17

static data structure
-example

Answer 17

those that have a fixed size and structure at compile time
-array

Question 18

dynamic data structure
-example

Answer 18

The memory capacity of a dynamic data structure is not fixed
-list