Data Structures (NCO)
Tests knowledge of data structures, abstract data types, and related algorithms including queues, stacks, trees, searching techniques, and sorting methods.
Questions
Which data structure allows deleting of data elements from front and insertion at rear?
- Stacks
- Queues
- Dequeues
- Binary search tree
- _
Which technique is used for direct search?
- Binary search
- Linear search
- Tree search
- Hashing
- _
The operation of processing each element in a list is called
- sorting
- merging
- inserting sort
- traversal
- _
Which of the following data structures is non-linear?
- Queues
- Stacks
- Lists
- Tree
- _
Which of the following sorting algorithms has average-case and worst-case running time of O?
- Bubble sort
- Insertion sort
- Merge sort
- Quick sort
- _
Which searching technique takes O time to find a data?
- Linear search
- Binary search
- Hashing
- Tree search
- _
Which of the following is a probabilistic data structure?
- Bloom filter
- Hash table
- Hash tree
- Finger tree
- _
Which of the following is not an abstract type?
- Dequeue
- List
- Record
- Container
- _
Which of the following is not a composite type?
- Tagged union
- Union
- Record
- List
- _
To represent hierarchical relationship between elements, which data structure is not suitable?
- Priority
- Tree
- Dequeue
- Queue
- _
Which data structure is needed to convert infix notation to postfix notation?
- Branch
- Tree
- Stack
- Queue
- _
Which of the following sorting algorithms is of divide-and-conquer type?
- Bubble sort
- Insertion sort
- Quick sort
- Selection sort
- _
What is a mathematical model with a collection of operations defined on that model called?
- Data structure
- Abstract data type
- Algorithm
- Primitive data type
- _
Which of the following does not relate to stacks?
- Piles
- FIFO lists
- LIFO lists
- Push
- _