1.4.2 Data Structures
No description yet. This curated deck is ready for daily study.
Card preview (20)
Which of the following data structures are ordered? • List • Record • Tuple • Array
List Array Tuple
Which of the following data structures can store multiple data types? • List • Record • Tuple • Array
List Record Tuple
Which of the following data structures are immutable (read-only)? • List • Record • Tuple • Array
Tuple Contents cannot be modified at run-time
Which of the following data structures have no predefined scope (dynamic)? • List • Record • Tuple • Array
List
Which of the following data structures can store multiple values under one identifier? • List • Record • Tuple • Array
All of them List Record Tuple Array
Which of the following data structures are accessed using an index? • List • Record • Tuple • Array
List Tuple Array
What is the purpose of the pointers in a queue?
• Front/Head - Used to identify the first item in the queue i.e the one to dequeue next • Rear/Tail- Used to identify the next free space in the queue i.e. the next element to be enqueued
How many pointers are used in a stack?
1 - Top
What pointer is impacted when you enqueue an item in a queue
Rear/Tail - Incremented by one
What pointer is impacted when you dequeue an item from a queue?
Front/Head - incremented by one
Which data structure operates on a FIFO basis?
Queue First in first out
Which data structure operates on a LIFO basis?
Stack Last in first out
Where might a queue be used?
Printer Queue Keyboard Buffer
Where might a stack be used?
Web Browser History Undo button in a word processor
What type of error could occur if an item is added to a full stack or queue?
Overflow Error
What type of error could occur if an item is removed from to an empty stack or queue?
Underflow Error
What is the process for enqueuing an item to a queue?
• Check if the queue is full, If it is then output message reporting an error. • If not full, then increment tail pointer by 1 • Add item to tail index (Assuming that the pointer is set to point at last item, and not the space after)
What is the process for dequeuing an item from a queue?
• Check if the queue is empty, If it is then output message reporting an error. • If it is not empty, then output the element located at the head pointer • Increment head pointer by 1
What is the process for popping an item from a stack?
• Check if the stack is empty, If it is then output message reporting an error. • If it is not empty, then output the element located at the top pointer • decrement the top pointer by one. The last two bullet points could happen in the opposite order depending on the stack implementation
What is the process for pushing an item to a stack?
• Check if the stack is full, If it is then output message reporting an error. • Increment the top pointer by one. • Add data item at top pointer The last two bullet points could happen in the opposite order depending on the stack implementation