Datastructure Set 1

Queue ✘ Stack ✘ Directed graph ✘ Threaded binary tree ✔

Arrays must be sorted. ✘ Requirement of a sorted array is expensive when a lot of insertion and deletions are required. ✘ A mechanism is required to access middle element directly. ✘ The binary search algorithm is inefficient when the number of data elements grow in number ✔

Table arrays ✘ Matrix arrays ✘ Both of these ✘ None of these ✔

Arrays are dense lists and static data structures. ✘ The data elements in a linked list need not be stored in adjacent spaces in the memory. ✘ Pointers store the next data element of a list. ✘ Linked lists are a collection of nodes that contain data and a pointer to the next node. ✔

Sorted linked list ✘ Sorted binary tree ✘ Sorted linear array ✘ Pointer array ✔

An underflow ✘ An overflow ✘ An unsaturated ✘ A saturated ✔

Underflow ✘ Overflow ✘ Unsaturated ✘ Saturated ✔

Arrays ✘ Lists ✘ Stacks ✘ All of the above ✔

Linked lists ✘ Stacks ✘ Queues ✘ Double-ended queues ✔

FAEKCDBHG ✘ FAEKCDHGB ✘ EAFKHDCBG ✘ FEAKDCHBG ✔