computer science A level ocr Data structures stack,queue tuples

Question 1

Define stack.

Answer 1

A linear data structure that follows the Last In First Out (LIFO) principle.

Question 2

What is the primary operation of a queue?

Answer 2

To add elements at the back and remove elements from the front.

Question 3

True or false: A stack allows insertion and deletion at both ends.

Answer 3

FALSE

A stack only allows operations at one end.

Question 4

Fill in the blank: A queue is also known as a _______ data structure.

Answer 4

FIFO (First In First Out)

Question 5

What does LIFO stand for?

Answer 5

Last In First Out, a principle of stack operations.

Question 6

Define tuple.

Answer 6

An ordered collection of elements, which can be of different types.

Question 7

True or false: Tuples are mutable in Python.

Answer 7

FALSE

Tuples cannot be changed after creation.

Question 8

What is the main use of a stack?

Answer 8

To manage function calls and undo mechanisms in applications.

Question 9

Fill in the blank: In a queue, the first element added is the first to be _______.

Answer 9

removed

Question 10

What is a priority queue?

Answer 10

A type of queue where elements are removed based on priority rather than order.

Question 11

Define enqueue.

Answer 11

The operation of adding an element to the back of a queue.

Question 12

Define dequeue.

Answer 12

The operation of removing an element from the front of a queue.

Question 13

True or false: Stacks can be implemented using arrays or linked lists.

Answer 13

TRUE

Question 14

What is the top operation in a stack?

Answer 14

It retrieves the last element added without removing it.

Question 15

Fill in the blank: A stack uses _______ to manage its elements.

Answer 15

push and pop operations

Question 16

What is the length of a tuple?

Answer 16

The number of elements it contains.

Question 17

True or false: A tuple can contain duplicate elements.

Answer 17

TRUE

Question 18

What is the difference between a list and a tuple?

Answer 18

Lists are mutable, while tuples are immutable.

Question 19

Define push.

Answer 19

The operation of adding an element to the top of a stack.

Question 20

What does pop do in a stack?

Answer 20

Removes and returns the top element of the stack.

Question 21

Fill in the blank: A deque is a double-ended _______.

Answer 21

queue

Question 22

What is a circular queue?

Answer 22

A queue where the last position is connected back to the first.

Question 23

True or false: Tuples can be nested within other tuples.

Answer 23

TRUE

Question 24

What is the first operation in a queue?

Answer 24

Enqueue, which adds an element to the back.

Question 25

Define **front** in the context of a queue.

Answer 25

The position of the first element that will be removed.

Question 26

What is a **stack overflow**?

Answer 26

An error that occurs when too many elements are added to a stack.

Question 27

Fill in the blank: A **queue** can be implemented using a _______.

Answer 27

linked list or array

Question 28

What is the **last** operation in a stack?

Answer 28

Pop, which removes the top element.

Question 29

True or false: A stack can be used to reverse a string.

Answer 29

TRUE

Question 30

Define **peek** in a stack.

Answer 30

To view the top element without removing it.

Question 31

What is the **size** of a stack?

Answer 31

The number of elements currently in the stack.

Question 32

Fill in the blank: A **tuple** is defined using _______ in Python.

Answer 32

parentheses

Question 33

What is the **pop** operation in a queue?

Answer 33

Queues do not have a pop operation; they use dequeue instead.

Question 34

True or false: Stacks are often used in recursive algorithms.

Answer 34

TRUE

Question 35

Define **overflow** in a stack.

Answer 35

Occurs when trying to add an element to a full stack.

Question 36

What is the **underflow** condition in a stack?

Answer 36

Occurs when trying to remove an element from an empty stack.

Question 37

Fill in the blank: A **queue** can be implemented using _______ data structures.

Answer 37

arrays or linked lists

Question 38

What is the **length** of a queue?

Answer 38

The number of elements currently in the queue.

Question 39

True or false: A tuple can contain lists as elements.

Answer 39

TRUE

Question 40

Define **FIFO**.

Answer 40

First In First Out, a principle of queue operations.

Question 41

What is a **stack frame**?

Answer 41

A section of the stack that contains function call information.

Question 42

Fill in the blank: The **enqueue** operation adds an element to the _______ of a queue.

Answer 42

back

Question 43

What is the **dequeue** operation?

Answer 43

Removes the front element from a queue.

Question 44

True or false: A stack can be used to evaluate expressions.

Answer 44

TRUE

Question 45

Define **immutable**.

Answer 45

An object that cannot be changed after its creation.

Question 46

What is a **linked list**?

Answer 46

A data structure consisting of nodes that point to the next node.

Question 47

Fill in the blank: A **tuple** can hold _______ types of data.

Answer 47

multiple

Question 48

What does **pop** return in a stack?

Answer 48

The last element added to the stack.

Question 49

True or false: A queue can be empty.

Answer 49

TRUE

Question 50

Define **data structure**.

Answer 50

A way to organize and store data for efficient access and modification.

Question 51

What is the **main** use of tuples?

Answer 51

To group related data together in a single compound data type.

Question 52

Fill in the blank: The **top** of a stack is the _______ element.

Answer 52

last added

Question 53

What is a **dynamic array**?

Answer 53

An array that can grow and shrink in size as needed.

Question 54

True or false: A stack can be implemented using a queue.

Answer 54

TRUE

Question 55

Define **abstract data type**.

Answer 55

A model for a data type where the implementation is hidden.

Question 56

What is the **main** characteristic of a queue?

Answer 56

Elements are processed in the order they were added.

Question 57

Fill in the blank: A **stack** is often used in _______ algorithms.

Answer 57

depth-first search

Question 58

What is a **hash table**?

Answer 58

A data structure that maps keys to values for efficient retrieval.

Question 59

True or false: Tuples can be used as dictionary keys.

Answer 59

TRUE

Question 60

Define **singly linked list**.

Answer 60

A linked list where each node points to the next node only.

Question 61

What is a **doubly linked list**?

Answer 61

A linked list where nodes point to both the next and previous nodes.

Question 62

Fill in the blank: A **stack** can be implemented using a _______.

Answer 62

linked list

Question 63

What is the **main** advantage of using a linked list?

Answer 63

Dynamic size and efficient insertions/deletions.

Question 64

True or false: A queue can be implemented using two stacks.

Answer 64

TRUE

Question 65

Define **array**.

Answer 65

A collection of elements identified by index or key.

Question 66

What is the **main** disadvantage of arrays?

Answer 66

Fixed size, which limits flexibility.

Question 67

Fill in the blank: A **tuple** is _______ than a list.

Answer 67

faster to access

Question 68

What is a **stack overflow** error?

Answer 68

Occurs when too many items are pushed onto a stack.

Question 69

True or false: Queues are used in breadth-first search algorithms.

Answer 69

TRUE