2. Standard approach for implementation of a list is/are of
Correct : B. 2 type
3. First link node of list is accessed from a pointer named
Correct : B. head
4. A linked list is made up of a set of objects known as
Correct : A. nodes
5. How do you calculate the pointer difference in a memory efficient double linked list?
Correct : B. pointer to previous node xor pointer to next node
6. A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
Correct : D. dequeue
7. Which of the following name does not relate to stacks?
Correct : A. fifo lists
8. A data structure where elements can be added or removed at either end but not in the middle is called …
Correct : D. deque
9. The postfix form of the expression (A + B)∗(C∗D − E)∗F / G is
Correct : A. ab + cd∗e − fg /∗∗
10. What is the postfix form of the following prefix expression -A/B*C$DE ?
Correct : A. abcde$*/-
11. The data structure required to evaluate a postfix expression is
Correct : B. stacks
12. What is the postfix form of the following prefix:
*+ab–cd
Correct : A. ab+cd–*
13. A queue is a,
Correct : A. fifo (first in first out) list
14. In stack terminology, the __________operations are known as push and pop operations respectively.
Correct : C. both (a) and (b)
15. A common example of a queue is people waiting in line at a__________.
Correct : A. bus stop
16. What is one of the common examples of a stack?
Correct : A. a pile of books
17. When a stack is organized as an array, a variable named Top is used to point to the top element of the stack. Initially, the value of Top is set to_______to indicate an empty stack.
Correct : A. -1
18. What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?
Correct : A. overflow
19. The total number of elements in a stack at a given point of time can be calculated from the value of______.
Correct : B. top
20. When the push operation is performed on stack the value of TOS will be ______
Correct : B. increment
21. A double linked list contains reference to _____
Correct : D. both a & b
22. Data Structure that are created by user as per their requirement are known as
Correct : A. primitive data structure
23. To insert element at start, the previous pointer of newly added node would point to ______
Correct : A. null
24. In linked list implementation, a node carries information regarding
Correct : C. both a & b
25. Which of the following data structure is linear type?
Correct : D. all of these
26. Stack is ____ type of data structure.
Correct : A. lifo
27. In stack deletion operation is referred as _____
Correct : B. pop
28. Queue is _____ type of data structure.
Correct : B. fifo
29. Data structre is divided into _____ parts.
Correct : C. 2
30. In ___ Data Structure data can be processed one by one sequentially
Correct : B. linked list
31. When we insert an element in Queue, which pointer is increased by one?
Correct : B. rear
32. Which of the following is not the possible operation on stack?
Correct : D. enqueue
33. Which of the following is a possible operation on queue?
Correct : D. enqueue
34. In stack, to display the lastly inserted element without removing it, which function is used?
Correct : D. peek
35. if there are no nodes in linked list then start pointer will point at which value?
Correct : A. null
36. Worst space complexity of queue data structure is
Correct : A. o(n)
37. Worst space complexity of stack data structure is
Correct : D. o(n)
38. Worst space complexity of singly linked list is
Correct : A. o(n)
39. Minimum number of fields in each node of a doubly linked list is____
Correct : B. 3
40. A graph in which all vertices have equal degree is known as ____
Correct : A. Complete graph
41. A vertex of in-degree zero in a directed graph is called a/an
Correct : C. Sink
42. A graph is a tree if and only if graph is
Correct : B. Contains no cycles
43. The elements of a linked list are stored
Correct : C. Anywhere the computer has space for them
44. A parentheses checker program would be best implemented using
Correct : C. Stack
45. To perform level-order traversal on a binary tree, which of the following data structure will be required?
Correct : B. Queue
46. Which of the following data structure is required to convert arithmetic expression in infix to its equivalent postfix notation?
Correct : D. None of above
47. A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.
Correct : B. Complete binary tree
48. Which of following data structure is more appropriate for implementing quick sort iteratively?
Correct : C. Stack
49. The number of edges in a complete graph of n vertices is
Correct : B. n(n-1)/2
50. If two trees have same structure and but different node content, then they are called ___
Correct : D. Similar trees
51. If two trees have same structure and node content, then they are called ____
Correct : C. Equivalent trees
52. Finding the location of a given item in a collection of items is called ……
Correct : C. Searching
53. The time complexity of quicksort is ……..
Correct : D. O(n logn)
54. Quick sort is also known as ……..
Correct : D. partition and exchange sort
55. ………. sorting is good to use when alphabetizing a large list of names.
Correct : C. Radix
56. The total number of comparisons in a bubble sort is ….
Correct : A. O(n logn)
57. ……… form of access is used to add and remove nodes from a queue.
Correct : B. FIFO, First In First Out
58. New nodes are added to the ……… of the queue.
Correct : B. Back
59. The term push and pop is related to
Correct : C. Stacks
60. Which of the following is an application of stack?
Correct : D. all of the above
61. The operation of processing each element in the list is known as ……
Correct : D. traversal
62. The situation when in a linked list START=NULL is ….
Correct : A. Underflow
63. Which of the following are two-way lists?
Correct : D. List traversed in two directions
64. Which is the pointer associated with the availability list?
Correct : B. AVAIL
65. Which of the following data structure can’t store the non-homogeneous data
elements?
Correct : A. Arrays
66. Which of the following is non-liner data structure?
Correct : D. Trees
67. To represent hierarchical relationship between elements, which data
structure is suitable?
Correct : C. Tree
68. Identify the data structure which allows deletions at both ends of the list but
insertion at only one end.