Question 1: Define the term 'array' in the context of data structures and explain one advantage of using arrays.

Answer: An array is a collection of elements stored in contiguous memory locations, accessible via indices. An advantage is that arrays allow fast access to elements using their index.

Question 2: Describe the difference between a list and a tuple in Python.

Answer: A list is mutable, meaning its contents can be changed after creation, whereas a tuple is immutable, meaning its contents cannot be altered once created.

Question 3: Explain what a linked list is and how it differs from an array.

Answer: A linked list is a data structure consisting of nodes where each node contains data and a reference to the next node. Unlike arrays, linked lists do not store elements in contiguous memory locations, making insertion and deletion easier but access slower.

Question 4: Complete the truth table below for an AND gate: | Input A | Input B | Output | |---------|---------|--------| | 0 | 0 | | | 0 | 1 | | | 1 | 0 | | | 1 | 1 | |

Answer: 0, 0, 0, 1 (corresponding to each row)

Question 5: Complete the truth table below for an OR gate: | Input A | Input B | Output | |---------|---------|--------| | 0 | 0 | | | 0 | 1 | | | 1 | 0 | | | 1 | 1 | |

Answer: 0, 1, 1, 1

Question 6: Draw a logic circuit that represents the following Boolean expression: NOT (A AND B). Use standard logic gate symbols and include labels for each input.

Answer: A correct sketch would show an AND gate with inputs A and B, feeding into a NOT gate, with the output from the NOT gate labeled accordingly.

Question 7: Sketch a diagram of a stack data structure. Label the top of the stack, and illustrate the process of pushing an element onto the stack.

Answer: A proper sketch would display a vertical stack with elements, showing the new element added at the top during the push operation.

Question 8: Describe how a queue operates, including the terms 'enqueue' and 'dequeue'.

Answer: A queue operates on a First-In-First-Out (FIFO) basis. 'Enqueue' adds an element to the rear of the queue, and 'dequeue' removes an element from the front.

Question 9: Explain the difference between a binary search tree and a simple binary tree.

Answer: A binary search tree has the property that for each node, all elements in the left subtree are less than the node, and all elements in the right subtree are greater. A simple binary tree does not enforce this ordering.

Question 10: Draw a flowchart to represent a simple program that checks if a number is positive, negative, or zero. Include decision symbols and process symbols.

Answer: A correct flowchart will start with input, have decision symbols for checking if the number > 0, < 0, or equal to 0, and corresponding process/output symbols for each case.