1) "The operation performed on data structure:"
Ans: "All of these
2) "Performance based on the criteria of algorithm, which has to do with its storage requirement is _______.
Ans: "space complexity
3) "Which algorithm specifies the addition of edges to the Spanning Tree in an increasing order of cost?
Ans: Kruskal's
4) "Which type of linked lists comprises a node containing a pointer to predecessor as well as successor?
Ans: "Both a and b
5) "The smallest element of an array’s index is called:
Ans: "lower bound
6) "Which method uses to search element in sorted list?
Ans: "Binary Search
7) "Which sort is a divide-conquer technique?
Ans: "Merge sort
8) "Heapify() procedure belongs to which sort?
Ans: "Heap sort
9) "A Vertex comprising only incoming edges without any outgoing edges, specifically known as _________.
Ans: "Sink
10) "Deleting an item from the stack when stack is not empty is called _____ operation.
Ans: Pop
11) "Condition of overflow in stack is:
Ans: "TOP = Maxsize - 1
12) "f(n) ≤ c(g(n)) function represents which notation?
Ans: "Big Oh
13) "The concept where insertion and deletion takes place in one end is:
Ans: Stack
14) "Linear arrays are also called _____.
Ans: "1D array
15) "How many rotation operation are there in AVL tree?
Ans: 4
16) "How many types of data types are there?
Ans: 4
17) "How many types of queue are there?
Ans: 4
18) "Collection of field values of a given entity is called:
Ans: Record
19) "The complexity of linear search is:
Ans: "O(n)
20) "How many operations are there in 1D array?
Ans: 7
21) "The use of pointers to refer elements of a data structure in which elements are logically adjacent is:
Ans: "linked allocation
22) "Insertion takes place at _____ in queue.
Ans: Rear
23) "Which amongst the following cannot be a balance factor of any node of an AVL tree?
Ans: 2
24) "Partition procedure belongs to which sort?
Ans: "Quick sort
25) "A binary tree whose every node has either zero or two children in called:
Ans: "Extended binary tree
