II BSC.

CS(2020-2023 Batch)-Sem_III
Subject : Fundamentals of Data Structures
1. A refers to a single unit of values.
A. data value.
B. attribute value.
C. data item.
D. elementary.
ANSWER: C

2. Data items that are divided into subitems are called .

A. single items.
B. group items.
C. elementary items.
D. entity items.
ANSWER: B

3. Collection of field is called a .

A. sample.
B. folder.
C. record.
D. field.
ANSWER: C

4. In all the records contain the same data items with the same amount of space.
A. variable-length records.
B. fixed-length records.
C. subscripted variable.
D. superscripted variable.
ANSWER: B
5. The logical or mathematical model of a particular organization of data is called a .
A. data structure.
B. algorithms.
C. structure.
D. logic structure.
ANSWER: A

6. is a sequential representation of similar data types.

A. Queue.
B. Array.
C. Stack.
D. List.
ANSWER: B

7. The data structure which reflects relationship among elements is called a rooted tree graph or simply a .
A. graph.
B. list.
C. tree.
D. stack.
ANSWER: C

8. is combining the records in two different sorted files in to a single sorted file.
A. Sorting.
B. Searching.
C. Listing.
D. Merging.
ANSWER: D

9. Complexity of linear search algorithm is .

A. O(n).
B. O(log n).
C. O(n2).
D. O(n log n).
ANSWER: A

10. A linear search algorithm the Worst case occurs when .

A. The item is somewhere in the middle of the array.
B. The item is not in the array at all.
C. The item is the last element in the array.
D. The item is the last element in the array or is not there at all.
ANSWER: D
11. Arranging records in some logical order is called
A. Sorting.
B. Merging.
C. Searching.
D. Listing.
ANSWER: A

12. Deletion in queue take place at one end called .

A. start.
B. front.
C. rear.
D. mid.
ANSWER: B

13. Sub algorithms fall into two basic categories: function sub algorithms and sub algorithms.
A. procedure.
B. argument.
C. processor.
D. methods.
ANSWER: A

14. The indirect change of the value of a variable in one module by another module is called .
A. local.
B. global.
C. side effect.
D. variable.
ANSWER: C

15. Indexing is also called as .

A. matching.
B. elements.
C. pattern matching.
D. numbers.
ANSWER: C

16. Which of the following data structure is linear data structure?

A. Tree.
B. Graph.
C. Array.
D. Linked list.
ANSWER: C
17. The operation of processing each element in the list is known as .
A. sorting.
B. merging.
C. inserting.
D. traversal.
ANSWER: C

18. The memory address of the first element of an array is called .

A. floor address.
B. foundation address.
C. first address.
D. base address.
ANSWER: D

19. Which of the following is not the required condition for binary search algorithm?
A. The list must be sorted.
B. There should be the direct access to the middle element in any sub list.
C. There must be mechanism to delete and/or insert elements in list.
D. Direct access to the middle element in any sub list.
ANSWER: C

20. are simply values or sets of values.

A. Text.
B. Image.
C. Graph.
D. Data.
ANSWER: D

21. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called .
A. underflow.
B. overflow.
C. houseful.
D. saturated.
ANSWER: B

22. Which of the following is not an example for recursion?

A. Fibonacci series.
B. Factorial of a number.
C. Ackermann function.
D. Linear search.
ANSWER: D
23. Arithmetic expressions can be expressed in different notation.
A. 2.
B. 3.
C. 4.
D. 5.
ANSWER: B

24. Which of the following data structure is non-linear type?

A. Strings.
B. Lists.
C. Stacks.
D. Hierarchical.
ANSWER: D

25. To represent hierarchical relationship between elements, which data structure is suitable?
A. Dequeue.
B. Priority.
C. Tree.
D. Binary tree.
ANSWER: C

26. A binary tree whose every node has either zero or two children is called .
A. complete binary tree
B. binary search tree.
C. extended binary tree.
D. binary tree.
ANSWER: C

27. The depth of a complete binary tree is given by .

A. Dn = n log2n.
B. Dn = n log2n+1.
C. Dn = log2n.
D. Dn = log2n+1.
ANSWER: D

28. When converting binary tree into extended binary tree, all the original nodes in binary tree are .
A. internal nodes on extended tree.
B. external nodes on extended tree.
C. vanished on extended tree.
D. post order traversal.
ANSWER: A
29. The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal.
A. ABFCDE.
B. ADBFEC.
C. ABDECF.
D. ABDCEF.
ANSWER: C

30. Which of the following sorting algorithm is of divide-and-conquer type?

A. Bubble sort.
B. Insertion sort.
C. Quick sort.
D. Algorithm.
ANSWER: C

31. An algorithm that calls itself directly or indirectly is known as .

A. sub algorithm.
B. recursion.
C. polish notation.
D. traversal algorithm.
ANSWER: B

32. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are
called .
A. leaf.
B. branch.
C. path.
D. thread.
ANSWER: D

33. Breadth First search is used in .

A. binary tree.
B. stacks.
C. graphs.
D. both a and c.
ANSWER: C

34. is a single elementary unit of information representing an attribute of an entity.

A. Variable.
B. Dynamic variable.
C. Record.
D. Field.
ANSWER: D
35. The minimum number of edges in a connected cyclic graph on n vertices is .
A. n-1.
B. n+1.
C. n.
D. (n+2).
ANSWER: A

36. is the advantage of chained hash table over the open addressing scheme.
A. worst case complexity of search operations is less. b. c. d.
B. space used is less.
C. deletion is easier.
D. space used in high.
ANSWER: B

37. The average number of key comparisons done in a successful sequential search in a list of length n is .
A. log n
B. n-1/2.
C. n/2.
D. n+1/2.
ANSWER: D

38. data structures are the fundamental data types which are supported by a programming language.
A. Primitive.
B. Linear.
C. Static.
D. Dynamic.
ANSWER: A

39. In a graph if e = [u, v], Then u and v are called .

A. endpoints of e.
B. adjacent nodes.
C. neighbors.
D. all of above.
ANSWER: D

40. Expand ADT .

A. Access Data Type.
B. Automatic Data Transaction.
C. Abstract Data Type.
D. Abstract Data Transmission.
ANSWER: C
41. A list is a list where the last node contains null pointer.
A. circular header.
B. grounded header.
C. rounded header.
D. linked header.
ANSWER: B

42. A is a collection of elements such that each element has been assigned a priority.
A. priority queue.
B. array.
C. stack.
D. queue.
ANSWER: A

43. The comparison tree is also called as .

A. decision tree.
B. binary tree.
C. sequential tree.
D. b+ tree.
ANSWER: A

44. A linked list whose last node points back to the list node instead of containing the null pointer .
A. circular list.
B. linked list.
C. circular doubly linked list.
D. doubly linked list.
ANSWER: A

45. Process that takes place simultaneously is called as .

A. current process.
B. back tracking.
C. recursive process.
D. concurrent process.
ANSWER: D

46. data structures are those data structures which are created using primitive data structures.
A. Static.
B. Non-primitive.
C. User defined.
D. Table.
ANSWER: B
47. The for a linked list is a pointer variable that locates the beginning of the list.
A. anchor.
B. base.
C. footer.
D. header.
ANSWER: D

48. Two main measures for the efficiency of an algorithm are .

A. processor and memory.
B. complexity and capacity.
C. time and space.
D. data and space.
ANSWER: C

49. The time factor when determining the efficiency of algorithm is measured by .
A. counting microseconds.
B. counting the number of key operations.
C. counting the number of statements.
D. counting the kilobytes of algorithm.
ANSWER: B

50. The space factor when determining the efficiency of algorithm is measured by .
A. counting the maximum memory needed by the algorithm.
B. counting the minimum memory needed by the algorithm.
C. counting the average memory needed by the algorithm.
D. counting the maximum disk space needed by the algorithm.
ANSWER: A

51. The Worst case occur in linear search algorithm when .

A. item is somewhere in the middle of the array.
B. item is not in the array at all.
C. item is the last element in the array.
D. item is the last element in the array or is not there at all.
ANSWER: D

52. A queue, also called a system.

A. FOFI
B. FIFO
C. LIFO
D. FILO
ANSWER: B
53. A stack also called a system
A. LIFO.
B. LILO.
C. LOLI.
D. LOFI.
ANSWER: A

54. Which of the following way follows in Post order traversal?

A. Root -> Left sub tree -> Right sub tree.
B. Root -> Right sub tree -> Left sub tree.
C. Left sub tree -> Root -> Right sub tree.
D. Left sub tree -> Right sub tree -> Root.
ANSWER: D

55. A linked list is a linked list which always contains a special node called the header node, at the beginning of the list.
A. Doubly Linked List.
B. Circular List.
C. Header Linked List.
D. None.
ANSWER: C

56. is a header list where the last node points back to the header node.
A. Doubly header List.
B. Singly header List.
C. Grounder Header List.
D. Circular Header List.
ANSWER: D

57. The advantage of a two-way list and a circular header list is combined into a .
A. two-way circular header list.
B. two-way circular list.
C. two-way header circular list.
D. None.
ANSWER: A

58. The pointer of the last node contains a special value called .
A. null pointer.
B. index pointer.
C. pointer link.
D. address pointer.
ANSWER: B
59. The OS of a computer may periodically collect all the deleted space onto the free storage list. This technique is called .
A. buffering.
B. garbage collection.
C. deal location.
D. buffer collection.
ANSWER: B

60. Important part of any compiler is the construction and maintenances of a dictionary, this types of dictionary are called .
A. symbol table.
B. index table.
C. grammar table.
D. pointer table.
ANSWER: A

61. A graph is called if there is no single node whose removal causes the graph to break into two or more pieces.
A. pre-connected.
B. re-connected.
C. disconnected.
D. connected.
ANSWER: D

62. A tree of a graph is an undirected tree consisting of only those edges.

A. dense.
B. binary.
C. spanning.
D. parse.
ANSWER: C

63. Expansion of PERT is .

A. Program Evaluation and Review Testing.
B. Program Evaluation and Review Technique.
C. Process evaluation and Review Testing.
D. Problem evaluation and Review Technique.
ANSWER: B

64. The earliest use of sorting was in conjunction with network analysis.
A. topological.
B. bubble.
C. radix.
D. heap.
ANSWER: A
65. A data structure is a set of .
A. characters.
B. numbers.
C. domains.
D. tables.
ANSWER: C

66. A tree is a finite set of .

A. loops.
B. domains.
C. functions.
D. nodes.
ANSWER: D

67. Stack can be represented by means of .

A. Tree.
B. Graph.
C. One-way List.
D. None.
ANSWER: C

68. The hashing file space is divided into .

A. nodes and roots.
B. roots and slots.
C. buckets and slots.
D. slots and nodes.
ANSWER: C

69. Fibonacci search is always than binary tree.

A. good.
B. worse.
C. change.
D. secured.
ANSWER: B

70. Matrices with a relatively high proportion of zero entries are called matrices.
A. sparse.
B. Null.
C. Zero.
D. worse.
ANSWER: A
71. Postfix Notation is also called as .
A. Reverse Polish Notation.
B. Polish notation.
C. Prefix Notation.
D. None of the above.
ANSWER: A

72. Data structure which is capable of expressing more complex relationship than that of physical adjacency is called .
A. linear data structure.
B. linked list.
C. non linear data Structure
D. data structure.
ANSWER: C

73. A tree is a data structure which represents hierarchical relationship between individual .
A. data items.
B. fields.
C. nodes.
D. linked list.
ANSWER: A

74. In a directed tree any node which has out degree 0 is called a terminal node or .
A. a tree.
B. a list.
C. a node.
D. a leaf.
ANSWER: D

75. In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called tree.
A. directed.
B. structure.
C. ordered.
D. degree of.
ANSWER: C

76. a tree means processing it in such a way that each node is visited only once.
A. Traversing.
B. Implement.
C. Partition.
D. Node.
ANSWER: A
77. The length of the path is the number of on the path.
A. nodes.
B. fields.
C. data.
D. edges.
ANSWER: D

78. The children node of same parent is called .

A. binary tree.
B. tree.
C. sibling.
D. list.
ANSWER: C

79. A prototype of a priority Queue is a .

A. Real Time System.
B. Time sharing System.
C. Multiprogramming.
D. Multiprocessing.
ANSWER: B

80. A code which deals about short form of a program is called code.
A. program.
B. data.
C. pseudo.
D. derived.
ANSWER: C

81. Which of the application may use a stack?

A. A parentheses balancing program.
B. Keeping track of local variables at run time.
C. Syntax analyzer for a compiler
D. All of the above.
ANSWER: A

82. The queue which wraps around upon reaching the end of the array is called as .
A. circular queue.
B. linked queue.
C. doubly linked list.
D. representation of queue.
ANSWER: A
83. A is a reference to a memory location, which is used to store data that is described in a data type.
A. element.
B. variable.
C. pointer.
D. memory.
ANSWER: B

84. Which of the following is not a data structure operation?

A. Traversing.
B. Searching.
C. Inserting.
D. Modulo.
ANSWER: D

85. has certain attributes or properties which may be assigned values.

A. field system.
B. record.
C. entity.
D. files.
ANSWER: C

86. A file is a collection of

A. records.
B. datatypes.
C. dataitems.
D. None.
ANSWER: A

87. Maximum degree in any vector in a graph with n vertices is .

A. n.
B. n-1.
C. n+1.
D. 2n+1.
ANSWER: B

88. A header linked list is a linked list which always contains a special node called the .
A. header node.
B. circular header.
C. grounded header.
D. null pointer.
ANSWER: A
89. is a solution to a problem independent of programming language.
A. Efficient.
B. Linked list.
C. Data structure.
D. Algorithm.
ANSWER: D

90. is the situation where data-structure is empty.

A. Overflow.
B. Underflow.
C. Null.
D. Empty.
ANSWER: B

91. When elements are deleted the nodes go to .

A. registers.
B. free pool.
C. recycle bin.
D. gets deleted permanently.
ANSWER: B

92. A normal linked list have fields in each node.

A. 2.
B. 3.
C. 4.
D. 5.
ANSWER: A

93. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
A. elementary items.
B. atoms.
C. scalars.
D. structure.
ANSWER: D

94. While inserting a node in linked list, a new node is received from list.
A. LINK.
B. INFO.
C. AVAIL.
D. none.
ANSWER: C
95. Which of the following is two way lists?
A. Grounded header list.
B. Circular header list.
C. linked list with header, left pointer and right pointer nodes.
D. Singly linked list.
ANSWER: C

96. What is the worst-case time for heap sort to sort an array of n elements?
A. O(log n).
B. O(n).
C. O(n log n).
D. O(n²).
ANSWER: C

97. The denotes the greatest integer.

A. ceiling.
B. time.
C. space.
D. floor.
ANSWER: A

98. A binary tree of depth "d" is an almost complete binary tree if .

A. each leaf in the tree is either at level.
B. for any node.
C. both a and b.
D. None.
ANSWER: C

99. Program module contains its own list of variables called as .

A. global.
B. scope.
C. local.
D. external.
ANSWER: C

100. The number of nodes in a complete binary tree of level 5 is .

A. 15.
B. 20.
C. 63.
D. 71.
ANSWER: C
101. The string with zero characters is called .
A. null string.
B. zero string.
C. one string.
D. empty string.
ANSWER: D

102. The unit equal to the number of bits needed to represent a character is called a .
A. byte.
B. bit.
C. mega bytes.
D. kilo bytes.
ANSWER: A

103. Generally the strings are stored in types of structures.

A. four.
B. two.
C. one.
D. three.
ANSWER: D

104. In fixed- length storage all records have same .

A. record.
B. address.
C. code.
D. field.
ANSWER: A

105. In variable length storage two dollar signs are used to signal the .
A. end of the string.
B. beginning of the string.
C. mid-level of the string.
D. index.
ANSWER: A

106. The basic units of access in strings are usually .

A. substring.
B. node.
C. individual character.
D. numeric data.
ANSWER: B
107. In order traversal of binary search tree will produce .
A. Unsorted List.
B. Reverse of Input.
C. Sorted List.
D. Combined List.
ANSWER: C

108. Quick sort running time depends on the selection of .

A. size of array.
B. pivot element.
C. sequence of value.
D. depend on data.
ANSWER: B

109. Which mathematician named Polish notation?

A. Jan Lukasiewicz.
B. Charless Babbage.
C. C.P.Ramanujam.
D. Pythagoras.
ANSWER: A

110. Which of the following is not a linked list type?

A. Simple Linked List
B. Doubly Linked List
C. Circular Linked List
D. Tribly Linked List.
ANSWER: D

111. The length of the string can be listed as an additional item in .

A. base pointer.
B. pointer array.
C. node.
D. record.
ANSWER: B

112. The binary trees with special nodes called threads are called as .
A. threaded trees.
B. threaded cycles.
C. threaded graphs.
D. threaded lists.
ANSWER: A
113. For the heap sort, access to nodes involves simple operations.
A. binary.
B. arithmetic
C. algebraic
D. logarithmic
ANSWER: B

114. Divide-and-conquer as breaking the problem into a small number of .

A. pivot.
B. sieve.
C. smaller sub problems.
D. selection.
ANSWER: C

115. The number of edges in a regular graph of degree d and n vertices is .

A. maximum of n,d.
B. n+d.
C. nd.
D. nd/2
ANSWER: C

116. Which of the following is useful in traversing a given graph by Breath first search?
A. Stack.
B. Set.
C. List.
D. Queue.
ANSWER: D

117. A graph in which every edge is directed is called .

A. Digraph.
B. undirected graph.
C. directed edge.
D. None.
ANSWER: A

118. Allocating memory for arrays during program compilation is .

A. dynamic memory allocation.
B. memory allocation.
C. static allocation.
D. random allocation.
ANSWER: C
119. The elements of an array are allocated in spaces .
A. successively.
B. randomly.
C. alternately.
D. on any order.
ANSWER: A

120. Accessing and processing each array elements is called .

A. sorting.
B. traversing.
C. searching.
D. merging.
ANSWER: B

121. An m*n array has number of elements.

A. m.
B. n.
C. m2.
D. m*n.
ANSWER: D

122. The sequence (1,1) (2,1) (3,1) (1,2) (2,2) (3,2) ....... represents .
A. row major order.
B. column major order.
C. random order.
D. successive order.
ANSWER: B

123. Base address is the address of .

A. last element.
B. first element.
C. middle element.
D. pivot element.
ANSWER: B

124. Which of the following is collision resolution?

A. Linear Probing.
B. Non linear probing.
C. Collision procedure.
D. Probing procedure.
ANSWER: C
125. In collision resolution the ratio λ=n/m is called .
A. d factor.
B. load manager.
C. resolution factor.
D. collision factor.
ANSWER: C

126. The possibility of two different keys k1 & k2 yielding the same hash address is called .
A. merge.
B. obstacle.
C. overlapping.
D. collision.
ANSWER: C

127. Uniform distribution of the hash address throughout the given set L is .
A. reduce the number of collision.
B. increase the number of collision.
C. totally avoid collision.
D. manage address.
ANSWER: A

128. An edge e is a called if it has identical endpoints.

A. multiple edges.
B. loops.
C. finite.
D. digraph.
ANSWER: B

129. involves maintaining two tables in memory.

A. Arranging.
B. Bonding.
C. Combing.
D. Chaining.
ANSWER: D

130. Clustering in linear probing increases .

A. average search time for a record.
B. usage of memory space.
C. collision.
D. average writing time.
ANSWER: B
131. The data items in a record form a structure which can be described by means of level numbers.
A. hierarchical.
B. procedural.
C. indexed.
D. leveled.
ANSWER: A

132. A path P of length n from a node u to a node v is defined as a sequence of nodes.

A. n.
B. n+1.
C. n+2.
D. n-1.
ANSWER: B

133. The operator symbol placed before two operands called .

A. infix.
B. polish.
C. postfix.
D. reverse polish
ANSWER: B

134. A connected graph T without any cycles is called .

A. a tree graph.
B. free tree.
C. a tree.
D. all of the above.
ANSWER: D

135. If every node u in G is adjacent to every other node v in G, A graph is said to be .

A. isolate.
B. complete.
C. finite.
D. Strongly connected.
ANSWER: B

136. In a graph G if e=(u,v), then u and v are called .

A. endpoints.
B. adjacent nodes.
C. neighbours.
D. all of the above.
ANSWER: D
137. For arrays are considered as best data structures.
A. relatively permanent collections of data.
B. the size of the structure and the data in the structure are constantly changing.
C. both of above situation.
D. none of above situation.
ANSWER: A

138. Which of the following data structures are indexed structures?

A. Linear arrays.
B. Linked lists.
C. Arrays.
D. First address.
ANSWER: A

139. The term dequeue is a construction of the name .

A. double queue.
B. double ended queue.
C. single ended queue.
D. single queue.
ANSWER: B

140. A grounded header list is a header list where the last node contains the pointer.
A. NULL.
B. START.
C. EOF.
D. FRONT.
ANSWER: A

141. A graph G is said to be if for any pair u, v of nodes in G there is a path from u to v or a path from v to u.
A. bidirectional Graph.
B. unilaterally connected graph.
C. fully connected graph.
D. None.
ANSWER: B

142. The efficiency of a BFS algorithm is dependent on .

A. Algorithm.
B. Tree.
C. Problem.
D. Graph.
ANSWER: D
143. is a group of element that shares a common name and differentiated from one another by their positions.
A. Tree.
B. Graph.
C. Array.
D. List.
ANSWER: C

144. Divide and conquer is an important algorithm design paradigm based on .

A. multi-branched recursion.
B. single-branched recursion.
C. two-way recursion.
D. None.
ANSWER: A

145. The correctness of a divide and conquer algorithm is usually proved by .

A. mathematical theorem.
B. de-Morgan `s law.
C. mathematical induction.
D. none.
ANSWER: C

146. In every vertex of one set is adjacent to every vertex of second set.
A. Complete bipartite.
B. completed graph.
C. Vertex Tree.
D. None.
ANSWER: A

147. is finding a path/tour through the graph such that every vertex is visited exactly once.
A. Travelling Salesman tour.
B. Eulerian tour.
C. Hamiltonian tour.
D. None.
ANSWER: C

148. The dummy header in linked list contains .

A. Last record of the actual data.
B. First record of the actual data.
C. Pointer to the last record of the actual data.
D. None of the above.
ANSWER: B
149. data structure is used to implement Depth First search.
A. Array.
B. Linked list.
C. Queue.
D. Stack.
ANSWER: D

150. Process that takes place simultaneously is called as .

A. concurrent process.
B. recursive process.
C. back tracking.
D. current process.
ANSWER: A