Abstract Data Types

What operation removes the top element from a stack?

• PUSH

• POP

• PEEK

• ENQUEUE

What does each node in a singly linked list contain?

• Data and Pointer

• Data and Index

• Data and Value

• Data and Reference

Given a circular queue, in what index is the tail/rear/back pointing?

• Index 0

• Index 1

• Index 2

• Index 3

What would be the new values of the pointer column when a node is deleted in the back?

• 1 → 3 → 0 → ∅

• 1 → 2 → 0 → ∅

• 1 → 3 → 2 → ∅

• 1 → 0 → ∅

What principle does a queue follow?

• LIFO (Last In First Out)

• FIFO (First In First Out)

• Random Access

• Priority Based

Given the following stack operations: Push(2), Push(4), Push(6), Pop(), Push(8). What will be the stack’s final content (from top to bottom)?

• 8, 4, 2

• 6, 4, 2

• 8, 6, 4

• 4, 2, 6

What operation adds an element to a stack?

• PUSH

• POP

• PEEK

• INSERT

Which abstract data structure is best for managing printer tasks?

• Stack

• Queue

• Linked List

• Tree

Given a stack, which data gets popped first?

• A

• B

• C

• D

What principle does a stack follow?

• FIFO (First In First Out)

• LIFO (Last In First Out)

• FILO (First In Last Out)

• LILO (Last In Last Out)