MCQs > IT & Programming > Data Structures And Algorithms MCQs > Basic Data Structures and Algorithms MCQs

Basic Data Structures and Algorithms MCQ

1. Infiniband can support data transfer speeds of ____ per second.

Answer

Correct Answer: 2.5 billion bits (2.5 gigabits)

Note: This Question is unanswered, help us to find answer for this one

2. The __________ places new orders when inventory levels fall to predetermined points.

Answer

Correct Answer: Economic order quantity

Note: This Question is unanswered, help us to find answer for this one

3. A(n) ____ control is any type of input mechanism on a form.

Answer

Correct Answer: Input.

Note: This Question is unanswered, help us to find answer for this one

4. In a(n) ____________________ data type, each data item is a collection of other data items.

Answer

Correct Answer: Structured data type

Note: This Question is unanswered, help us to find answer for this one

5. With a(n) ____, you perform an action or task, and then you perform the next action, in order.

Answer

Correct Answer: Sequence Structure

Note: This Question is unanswered, help us to find answer for this one

6. With a hollow structure, the organization ____.

Answer

Correct Answer: Has a central core of key functions and outsources others to vendors who are less expensive or faster

Note: This Question is unanswered, help us to find answer for this one

7. Members of a(n) ________ union have names, but the union itself has no name.

Answer

Correct Answer: Anonymous

Note: This Question is unanswered, help us to find answer for this one

8. In a function template, the programmer substitutes ________ for ________.

Answer

Correct Answer: Parameters, data types

Note: This Question is unanswered, help us to find answer for this one

9. Because “a” is always less than “b”, alphabetic sorts are ____ sorts.

Answer

Correct Answer: Ascending

Note: This Question is unanswered, help us to find answer for this one

10. A ____ read is an added statement that gets the first input value in a program.

Answer

Correct Answer: Priming

Note: This Question is unanswered, help us to find answer for this one

11. When computers sort data, they always use ____ values when making comparisons between values.

Answer

Correct Answer: Numeric

Note: This Question is unanswered, help us to find answer for this one

12. Assume s is "abcabc", the method ________ returns an array of characters.

Answer

Correct Answer: s.toCharArray()

Note: This Question is unanswered, help us to find answer for this one

13. A collection in the items stored there are of different types is referred to as a(n) ________ type.

Answer

Correct Answer: Heterogeneous

Note: This Question is unanswered, help us to find answer for this one

14. The ____ is skewed by a few very high or low values.

Answer

Correct Answer: Mean

Note: This Question is unanswered, help us to find answer for this one

15. Structures can be stacked or connected to one another at their ____.

Answer

Correct Answer: Entry or exit points

Note: This Question is unanswered, help us to find answer for this one

16. A(n) ____ tells the user what to enter.

Answer

Correct Answer: Prompt

Note: This Question is unanswered, help us to find answer for this one

17. A variable usually is passed into a method by ____.

Answer

Correct Answer: Value

Note: This Question is unanswered, help us to find answer for this one

18. A ____ is a rectangular area into which the user can type text.

Answer

Correct Answer: Text box

Note: This Question is unanswered, help us to find answer for this one

19. A(n) ____ is shorthand for the detail you want to use in a search filter.

Answer

Correct Answer: File property name

Note: This Question is unanswered, help us to find answer for this one

20. A(n) ______ is a process or set of operations in a calculation.

Answer

Correct Answer: Algorithm

Note: This Question is unanswered, help us to find answer for this one

21. Two-dimensional arrays can be thought of as containing ________.

Answer

Correct Answer: Rows and columns

Note: This Question is unanswered, help us to find answer for this one

22. Suppose integer x = new integer(3); x holds ________.

Answer

Correct Answer: A reference value to an Integer object

Note: This Question is unanswered, help us to find answer for this one

23. The body of a ______-test loop is always executed at least once.

Answer

Correct Answer: Posttest

Note: This Question is unanswered, help us to find answer for this one

24. A variable defined inside a method is referred to as ________.

Answer

Correct Answer: A local variable

Note: This Question is unanswered, help us to find answer for this one

25. The ____ function is used to create a constant.

Answer

Correct Answer: Define()

Note: This Question is unanswered, help us to find answer for this one

26. In comparison with unstructured information, semi-structured information ________.

Answer

Correct Answer: Is easier to query and aggregate

Note: This Question is unanswered, help us to find answer for this one

27. A(n) ________ search uses a loop to sequentially step through an array.

Answer

Correct Answer: Linear.

Note: This Question is unanswered, help us to find answer for this one

28. A ________ search uses a loop to sequentially step through an array.

Answer

Correct Answer: Linear

Note: This Question is unanswered, help us to find answer for this one

29. The rijndael algorithm is better known today as __________.

Answer

Correct Answer: Advanced Encryption Standard (AES

Note: This Question is unanswered, help us to find answer for this one

30. When working with multiple sets of data, one would typically use a ________.

Answer

Correct Answer: Nested list

Note: This Question is unanswered, help us to find answer for this one

31. Every node (except of the last node) in a singly linked list contains ____.

Answer

Correct Answer: The address of the next node

Note: This Question is unanswered, help us to find answer for this one

32. To arrange the elements in an array in ascending order, you use the ____ method.

Answer

Correct Answer: Array.Sort

Note: This Question is unanswered, help us to find answer for this one

33. The number of elements in an array is called the ____ of the array.

Answer

Correct Answer: Size

Note: This Question is unanswered, help us to find answer for this one

34. Programmers sometimes refer to a situation in which nothing goes wrong as the ____ case.

Answer

Correct Answer: Sunny day

Note: This Question is unanswered, help us to find answer for this one

35. In all languages, subscript values must be sequential ____.

Answer

Correct Answer: Integers

Note: This Question is unanswered, help us to find answer for this one

36. In a ____, items in a list are compared with each other in pairs.

Answer

Correct Answer: Bubble sort

Note: This Question is unanswered, help us to find answer for this one

37. If a one-dimensional array contains five elements, its highest subscript is ____.

Answer

Correct Answer: Subscript

Note: This Question is unanswered, help us to find answer for this one

38. Each element in a two-dimensional array requires ____ subscript(s) to reference it.

Answer

Correct Answer: Two

Note: This Question is unanswered, help us to find answer for this one

39. An array whose elements you can access using a single subscript is a ____ array.

Answer

Correct Answer: One dimensional

Note: This Question is unanswered, help us to find answer for this one

40. When mathematicians use a two-dimensional array, they often call it a ____ or a table.

Answer

Correct Answer: Matrix

Note: This Question is unanswered, help us to find answer for this one

41. The starting value of an algorithm used to generate a range of numbers is called the _________.

Answer

Correct Answer: Seed

Note: This Question is unanswered, help us to find answer for this one

42. The ________ function does the same thing as using the mathematical ∧ operator.

Answer

Correct Answer: Sqrt

Note: This Question is unanswered, help us to find answer for this one

43. The following pseudocode is an example of ____.

Answer

Correct Answer: Decision

Note: This Question is unanswered, help us to find answer for this one

44. When an array is passed to a function, it is actually ________ the array that is passed.

Answer

Correct Answer: The starting memory address of

Note: This Question is unanswered, help us to find answer for this one

45. Pseudocode uses the end-structure statement ____ to clearly show where the structure ends.

Answer

Correct Answer: Endif

Note: This Question is unanswered, help us to find answer for this one

46. A(n) ________ member variable may be accessed before any objects of the class have been declared.

Answer

Correct Answer: Static

Note: This Question is unanswered, help us to find answer for this one

47. A bubble sort is sometimes called a ____.

Answer

Correct Answer: Sinking sort

Note: This Question is unanswered, help us to find answer for this one

48. A ________ is used to travel through a linked list and search for data.

Answer

Correct Answer: Pointer.

Note: This Question is unanswered, help us to find answer for this one

49. The ________ represents a special value that marks the end of a list of values.

Answer

Correct Answer: Sentinel

Note: This Question is unanswered, help us to find answer for this one

50. After you create an array variable, you still need to ____ memory space.

Answer

Correct Answer: Reserve

Note: This Question is unanswered, help us to find answer for this one

51. If an exception occurs in a try-catch block, the code in the finally clause ________.

Answer

Correct Answer: Is executed

Note: This Question is unanswered, help us to find answer for this one

52. Fill in the code in comparable________ c = new date();

Answer

Correct Answer:

Note: This Question is unanswered, help us to find answer for this one

53. Before a structure variable can be created, the structure must be _________.

Answer

Correct Answer: Declared

Note: This Question is unanswered, help us to find answer for this one

54. The expression score[5] is pronounced ________.

Answer

Correct Answer: Score sub 5

Note: This Question is unanswered, help us to find answer for this one

55. The elements of an array are stored in __________ storage locations in the computer?s memory.

Answer

Correct Answer: Consecutive

Note: This Question is unanswered, help us to find answer for this one

56. A variable or a value listed in a call to a method is called ________.

Answer

Correct Answer: An argument

Note: This Question is unanswered, help us to find answer for this one

57. A two-dimensional array can be viewed as ___________ and _____________.

Answer

Correct Answer: Rows, columns

Note: This Question is unanswered, help us to find answer for this one

58. A three-dimensional array can be thought of as ________ of two-dimensional arrays.

Answer

Correct Answer: Pages

Note: This Question is unanswered, help us to find answer for this one

59. Data can be organized and processed sequentially using an array, called a(n) ____ list.

Answer

Correct Answer: Sequential

Note: This Question is unanswered, help us to find answer for this one

60. Selection sort requires ________ passes to put n data items in order.

Answer

Correct Answer: N-1

Note: This Question is unanswered, help us to find answer for this one

61. To describe a queuing system, we use the term ____ for the object that provides the service.

Answer

Correct Answer: Server

Note: This Question is unanswered, help us to find answer for this one

62. A ____ is a copy that is kept in case values need to be restored to their original state.

Answer

Correct Answer: Backup file

Note: This Question is unanswered, help us to find answer for this one

63. The maximum number of entry points that any programming structure can have is ____.

Answer

Correct Answer: One

Note: This Question is unanswered, help us to find answer for this one

64. Attaching structures end to end is called ____ structures.

Answer

Correct Answer: Stacking

Note: This Question is unanswered, help us to find answer for this one

65. Java.util.vector is a subtype of ________.

Answer

Correct Answer: Java.util.AbstractList

Note: This Question is unanswered, help us to find answer for this one

66. Arrays, unlike simple built-in types, are passed by ____.

Answer

Correct Answer: Reference

Note: This Question is unanswered, help us to find answer for this one

67. A loop within another loop is known as a(n) ____ loop.

Answer

Correct Answer: Nested

Note: This Question is unanswered, help us to find answer for this one

68. A loop must return to the ____ question at some later point in a structure.

Answer

Correct Answer: Loop-controlling

Note: This Question is unanswered, help us to find answer for this one

69. When you derive a class from an existing class, you ________ add new data and functions.

Answer

Correct Answer: May

Note: This Question is unanswered, help us to find answer for this one

70. The number of elements an array will hold is known as the ____ of the array.

Answer

Correct Answer: Size

Note: This Question is unanswered, help us to find answer for this one

71. When you return an array from a method, the method returns ________.

Answer

Correct Answer: The reference of the array

Note: This Question is unanswered, help us to find answer for this one

72. When you create a ____ report, the records must have been sorted in order by a key field.

Answer

Correct Answer: Control Break

Note: This Question is unanswered, help us to find answer for this one

73. When an array is sorted from highest to lowest, it is said to be in ________ order.

Answer

Correct Answer: Descending

Note: This Question is unanswered, help us to find answer for this one

74. To build a list initially, you can use a(n) ________ routine.

Answer

Correct Answer: Append

Note: This Question is unanswered, help us to find answer for this one

75. The following pseudocode is an example of a ____ structure.

Answer

Correct Answer: Sequence

Note: This Question is unanswered, help us to find answer for this one

76. You use the ________ operator to access members of an object.

Answer

Correct Answer: .

Note: This Question is unanswered, help us to find answer for this one

77. The sequential search algorithm uses a(n) ____ variable to track whether the item is found.

Answer

Correct Answer: Bool

Note: This Question is unanswered, help us to find answer for this one

78. ________ is a data structure to store data in sequential order.

Answer

Correct Answer: A list

Note: This Question is unanswered, help us to find answer for this one

79. ________ allows for very recent file changes to be restored.

Answer

Correct Answer: Shadowing

Note: This Question is unanswered, help us to find answer for this one

80. ________ algorithms are used to arrange random data into some order.

Answer

Correct Answer: Sorting

Note: This Question is unanswered, help us to find answer for this one

81. ____ methods are methods that exist to be used with an object created from a class.

Answer

Correct Answer: Nonstatic

Note: This Question is unanswered, help us to find answer for this one

82. In a truth table, the expression ____ is true

Answer

Correct Answer: True and true

Note: This Question is unanswered, help us to find answer for this one

83. In a truth table, the expression ____ is false.

Answer

Correct Answer: False OR false

Note: This Question is unanswered, help us to find answer for this one

84. Every element in an array is assigned a unique number known as a ________.

Answer

Correct Answer: Subscript

Note: This Question is unanswered, help us to find answer for this one

85. Each object of a class has its own copy of the class's ________.

Answer

Correct Answer: Member variables

Note: This Question is unanswered, help us to find answer for this one

86. A(n) ________ informs the compiler that a class will be declared later in the program.

Answer

Correct Answer: Forward declaration

Note: This Question is unanswered, help us to find answer for this one

87. A member function that is declared ________ may not access any non-static data members in the class

Answer

Correct Answer: Static

Note: This Question is unanswered, help us to find answer for this one

88. A heuristic is a(n) ____.

Answer

Correct Answer: Shortcut to problem solving, also known as a rule of thumb

Note: This Question is unanswered, help us to find answer for this one

89. Which of the following points is/are true about Linked List data structure when it is compared with array

Answer

Correct Answer: All of the above

Note: This Question is unanswered, help us to find answer for this one

90. Assume that reference of head of following doubly linked list is passed to above function 1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6. What should be the modified linked list after the function call?

Answer

Correct Answer: 2 <--> 1 <--> 4 <--> 3 <--> 6 <-->5

Note: This Question is unanswered, help us to find answer for this one

91. The time required to search an element in a linked list of length n is

Answer

Correct Answer: O (n)

Note: This Question is unanswered, help us to find answer for this one

92. Which of the following operations is performed more efficiently by doubly linked list than by linear linked list?

Answer

Correct Answer: Deleting a node whose location is given

Note: This Question is unanswered, help us to find answer for this one

93. Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among union, intersection, membership, cardinality will be the slowest?

Answer

Correct Answer: union, intersection

Note: This Question is unanswered, help us to find answer for this one

94. Is it possible to create a doubly linked list using only one pointer with every node.

Answer

Correct Answer: Yes, possible by storing XOR of addresses of previous and next nodes.

Note: This Question is unanswered, help us to find answer for this one

95. In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

Answer

Correct Answer: n

Note: This Question is unanswered, help us to find answer for this one

96. Which of these is the correct big -Oh expression for 1+2+3+...+n?

Answer

Correct Answer: O(n)

Note: This Question is unanswered, help us to find answer for this one

97. What is the minimum number of nodes in a full binary tree with height 3?

Answer

Correct Answer: 7

Note: This Question is unanswered, help us to find answer for this one

98. Which of the following operations is more expensive in the array implementation of the linked list than it is in the dynamically created linked list?

Answer

Correct Answer: Insertion

Note: This Question is unanswered, help us to find answer for this one

99. Which of the following tree traversal techniques reads the root before its children nodes?

Answer

Correct Answer: In order

Note: This Question is unanswered, help us to find answer for this one

100. Let A be a sorted array of n=10 elements. Assume that only one comparison is required to determine whether the target is equal to, less than, or greater than A[i]. Which of the following denotes the average successful time of finding an arbitrary element x in A using the binary search?

Answer

Correct Answer: 2.9

Note: This Question is unanswered, help us to find answer for this one

101. What kind of list is the best to answer questions such as "Which is the item at position n?"

Answer

Correct Answer: Lists implemented with an array

Note: This Question is unanswered, help us to find answer for this one

102.


Quicksort is run on two inputs shown below to sort them in the ascending order.


i) 1,2,3,...n

ii) n,n-1,n-2,...2,1


If C1 and C2 be the number of comparisons made for the inputs (i) and (ii) respectively, then

Answer

Correct Answer: C1=C2

Note: This Question is unanswered, help us to find answer for this one

103. In a selection sort algorithm, the number of passes required to perform the sort are ______.

Answer

Correct Answer: N-1

Note: This Question is unanswered, help us to find answer for this one

104. Which of the following operations is more expensive in the dynamically created linked list than it is in the conventional array?

Answer

Correct Answer: Finding Kth element

Note: This Question is unanswered, help us to find answer for this one

105. A binary tree, all the levels of which except possibly the last have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as:

Answer

Correct Answer: Complete binary tree

Note: This Question is unanswered, help us to find answer for this one

106. What do we call a binary tree in which all the levels, except possibly the last level, have the maximum number of nodes, and in which all the nodes at the last level appear as far left as possible?

Answer

Correct Answer: Complete binary tree

Note: This Question is unanswered, help us to find answer for this one

107. The number of distinct simple graphs with up to three nodes is _______.

Answer

Correct Answer: 7

Note: This Question is unanswered, help us to find answer for this one

108. You have implemented a queue with a linked list keeping track of a front pointer and a rear pointer. Which of these pointers will you change during an insertion in the middle of a NONEMPTY queue?

Answer

Correct Answer: Both change

Note: This Question is unanswered, help us to find answer for this one

109.

Consider this binary search tree.

This question is based upon the figure shown below

Consider this binary search tree.

Which will be the new root if you remove the root and replace it with something from the left subtree?

Answer

Correct Answer:

5


Note: This Question is unanswered, help us to find answer for this one

110. What is the maximum depth of recursive calls a function may make?

Answer

Correct Answer: There is no fixed maximum

Note: This Question is unanswered, help us to find answer for this one

111. A binary search tree is generated by inserting the following integers in the order: 50,15,62,5,20,58,91,3,8,37,60,24. How many nodes are in the left and right subtrees, respectively?

Answer

Correct Answer: (7,4)

Note: This Question is unanswered, help us to find answer for this one

112. Suppose we have a circular array implementation of a queue, with ten items in the queue stored at data[2] through data[11]. The CAPACITY is 42. Where does the enqueue member function place the new entry in the array?

Answer

Correct Answer: data[12]

Note: This Question is unanswered, help us to find answer for this one

113. Which of these are standard operations of Stack Data Structure?

Answer

Correct Answer: Push, pop

Note: This Question is unanswered, help us to find answer for this one

114. Which of the following is the worst-case scenario for operations on heaps?

Answer

Correct Answer: Both insertion and removal are better than linear

Note: This Question is unanswered, help us to find answer for this one

115. What is the minimum number of edges and vertices possible in a non- planar graph?

Answer

Correct Answer: 10 edges, 5 vertices

Note: This Question is unanswered, help us to find answer for this one

116. If h is the depth of the tree, which formula will be used to find the maximum number of nodes n in a perfect binary tree?

Answer

Correct Answer: 2h + 1 - 1

Note: This Question is unanswered, help us to find answer for this one

117. What will happen if in data structure a pop operation on the stack causes the stack pointer to move past the origin of the stack?

Answer

Correct Answer: Underflow

Note: This Question is unanswered, help us to find answer for this one

118. In the linked representation of a sparse matrix, the head node for a column list stores_____

Answer

Correct Answer: All of the above

Note: This Question is unanswered, help us to find answer for this one

119. You have implemented a queue with a circular array keeping track of the first item, the last item, and the count (the number of items in the array). Suppose the address of the first is zero, and that of the last is CAPACITY-1, what can you say about the count?

Answer

Correct Answer: The count must be CAPACITY

Note: This Question is unanswered, help us to find answer for this one

120. Which of the following operations in the simple linked list will modify the beginning of the linked list?

Answer

Correct Answer: Deletion of the first node

Note: This Question is unanswered, help us to find answer for this one

121. A matrix is called sparse when______

Answer

Correct Answer: most of its elements are zero

Note: This Question is unanswered, help us to find answer for this one

122. Which of the following data structures has a balanced condition?

Answer

Correct Answer: AVL Tree

Note: This Question is unanswered, help us to find answer for this one

123. A given connected graph G is a Euler graph if and only if all vertices of G are of ______.

Answer

Correct Answer: even degrees

Note: This Question is unanswered, help us to find answer for this one

124. What is the meaning of the statement: "Entries in a stack are 'ordered'"?

Answer

Correct Answer: There is a first entry, a second entry, and so on

Note: This Question is unanswered, help us to find answer for this one

125. Four characters are placed in a queue in the following order: D, C, B, and A. If they are removed one at a time, what will be the order of their removal?

Answer

Correct Answer: DCBA

Note: This Question is unanswered, help us to find answer for this one

126. Which of the following operations is performed more efficiently by the doubly linked list than by the linear linked list?

Answer

Correct Answer: Deleting a node the location of which is given

Note: This Question is unanswered, help us to find answer for this one

127. You have implemented a queue with a linked list keeping track of a front pointer and a rear pointer. Which of these pointers will you change during an insertion into a NONEMPTY queue?

Answer

Correct Answer: Only rear_ptr changes

Note: This Question is unanswered, help us to find answer for this one

128. Which of the following techniques is used to resolve collision in hashing?

Answer

Correct Answer: All of the above

Note: This Question is unanswered, help us to find answer for this one

129. The number of nodes in the largest maximal independent set of the complete bipartite graph K(4,2) is_____ .

Answer

Correct Answer: 4

Note: This Question is unanswered, help us to find answer for this one

130. What kind of initialization needs to be done for a chained hash table?

Answer

Correct Answer: Both B and C must be carried out

Note: This Question is unanswered, help us to find answer for this one

131. Which queue allows insertion and deletion at both ends?

Answer

Correct Answer: Circular queue

Note: This Question is unanswered, help us to find answer for this one

132. The operation for removing an entry from a stack is traditionally called _______.

Answer

Correct Answer: pop

Note: This Question is unanswered, help us to find answer for this one

133. Which of the operations is simpler in the doubly linked list than it is in the simple linked list?

Answer

Correct Answer: Both a and b

Note: This Question is unanswered, help us to find answer for this one

134. In a graph G having the cut set matrix C(G) and an incidence matrix A(G), the rank of C(G) would be____

Answer

Correct Answer: More than that of A(G)

Note: This Question is unanswered, help us to find answer for this one

135. How many real links are required for a sparse matrix having 10 rows, 10 columns and 15 non-zero elements? (Pick the nearest answer)

Answer

Correct Answer: 50

Note: This Question is unanswered, help us to find answer for this one

136. Which of the following statements about binary trees is false?

Answer

Correct Answer: Every Node must have at least two children

Note: This Question is unanswered, help us to find answer for this one

137. Which operations require linear time for their worst-case behavior in the linked-list version of a queue?

Answer

Correct Answer: empty

Note: This Question is unanswered, help us to find answer for this one

138. Let A be a sorted array of n=10 elements. Assume that only one comparison is required to determine whether the target is equal to, less than, or greater than A[i]. Which of the following denotes the average successful time of finding an arbitrary element x in A using the binary search?

Answer

Correct Answer: 2.5

Note: This Question is unanswered, help us to find answer for this one

139. A simple graph in which there exists an edge between every pair of vertices is called a/an _________.

Answer

Correct Answer: complete graph

Note: This Question is unanswered, help us to find answer for this one

140. A one dimensional array A has indices 1...75. Each element is a string and takes up three memory words. The array is stored starting at location 1120 decimal. The starting address of A[49] is:

Answer

Correct Answer: 1264

Note: This Question is unanswered, help us to find answer for this one

141. A circuit which is a connected graph and which includes every vertex of the graph is known as_____.

Answer

Correct Answer: Hamiltonian

Note: This Question is unanswered, help us to find answer for this one

142. A non- planar graph with the minimum number of vertices has:

Answer

Correct Answer: 9 edges, 6 vertices

Note: This Question is unanswered, help us to find answer for this one

143. What is the worst-case scenario for quicksort to sort an array of n elements?

Answer

Correct Answer: O(n2)

Note: This Question is unanswered, help us to find answer for this one

144. If a max heap is implemented using a partially filled array called data, and the array contains n elements (n > 0), where is the entry with the greatest value?

Answer

Correct Answer: data[0]

Note: This Question is unanswered, help us to find answer for this one

145. State whether True or False. For all possible inputs, a linear algorithm to solve a problem must perform faster than a quadratic algorithm to solve the same problem.

Answer

Correct Answer: True

Note: This Question is unanswered, help us to find answer for this one

146. A procedure that calls itself in a program is called _______.

Answer

Correct Answer: Recursion

Note: This Question is unanswered, help us to find answer for this one

147. In which data structure is the concept of rotation used?

Answer

Correct Answer: AVL tree

Note: This Question is unanswered, help us to find answer for this one

148. Consider a hashing function that resolves collision by quadratic probing. Assume that the address space is indexed from 1 to 8. If a collision occurs at position 4, the location which will never be probed is:

Answer

Correct Answer: 2

Note: This Question is unanswered, help us to find answer for this one

149. What is the worst-case scenario for mergesort to sort an array of n elements?

Answer

Correct Answer: O(n log n)

Note: This Question is unanswered, help us to find answer for this one

150. If X is the adjacency matrix of a graph G with no self loops, the entries along the principle diagonal of X are ______.

Answer

Correct Answer: both zeros and ones

Note: This Question is unanswered, help us to find answer for this one

151. What is true of the complete bipartite graphs K(3,3) and K(2,4)?

Answer

Correct Answer: None of these

Note: This Question is unanswered, help us to find answer for this one

152. What is the minimum number of nodes in a complete binary tree with depth 3?

Answer

Correct Answer: 15

Note: This Question is unanswered, help us to find answer for this one

153. Which term is used to describe an O(n) algorithm?

Answer

Correct Answer: Linear

Note: This Question is unanswered, help us to find answer for this one

154. Where does the push member function place the new entry on the linked list in the linked list implementation of a queue?

Answer

Correct Answer: At the tail

Note: This Question is unanswered, help us to find answer for this one

155. Using which traversal in a sorted binary insertion tree can a sorted array of numbers be obtained?

Answer

Correct Answer: In order traversal

Note: This Question is unanswered, help us to find answer for this one

156. One difference between a queue and a stack is:

Answer

Correct Answer: Queues use two ends of the structure but stacks use only one

Note: This Question is unanswered, help us to find answer for this one

157. The post-order traversal of a binary tree starts with:

Answer

Correct Answer: Post-order traversal of the left sub tree

Note: This Question is unanswered, help us to find answer for this one

158. Which situation occurs frequently if the selected hash function is poor?

Answer

Correct Answer: Collision

Note: This Question is unanswered, help us to find answer for this one

159. The linked list implementation of sparse matrices is superior to the generalized dope vector method because it is __________.

Answer

Correct Answer: all of these

Note: This Question is unanswered, help us to find answer for this one

160. Which information is not saved in the activation record when a function call is executed?

Answer

Correct Answer: Current depth of recursion

Note: This Question is unanswered, help us to find answer for this one

161.

In a graph G, F is a spanning forest of G if

 

(i)F is a subgraph of G containing all the nodes of G

(ii)F is an order forest containing trees T1,T2,...Tn

(iii)Ti contains all the nodes that are reachable in G from the root Ti and are contained in Tj for some j

 

Which of the above conditions is/are true?

Answer

Correct Answer: (i),(ii) and (iii)

Note: This Question is unanswered, help us to find answer for this one

162. In a complete binary tree of n nodes, how far are the most distant two nodes? Assume each in the path counts 1. Assume log(n) is log base 2.

Answer

Correct Answer: about 2*log(n)

Note: This Question is unanswered, help us to find answer for this one

163. Suppose X is a B-tree leaf containing 41 entries and has at least one sibling. Which of the statements would be true in this case?

Answer

Correct Answer: Any sibling of X is also a leaf

Note: This Question is unanswered, help us to find answer for this one

164. Consider a linked list of n elements which is pointed by an external pointer. What is the time taken to delete the element which is a successor of the pointed element by a given pointer?

Answer

Correct Answer: O(1)

Note: This Question is unanswered, help us to find answer for this one

165. In a complete binary tree, the parent of any node k can be determined by ________.

Answer

Correct Answer: K/2

Note: This Question is unanswered, help us to find answer for this one

166. The recurrence relation T(n)=mT(n/2)+an2 is satisfied by___

Answer

Correct Answer: T(n)=O(n*log(m))

Note: This Question is unanswered, help us to find answer for this one

167. What is the worst-case scenario for heapsort to sort an array of n elements?

Answer

Correct Answer: O(n log n)

Note: This Question is unanswered, help us to find answer for this one

168. Which additional requirement is placed on an array so that binary search may be used to locate an entry?

Answer

Correct Answer: The array must be sorted

Note: This Question is unanswered, help us to find answer for this one

169. What is the maximum number of statements that may be recursive calls in a single function declaration?

Answer

Correct Answer: There is no fixed maximum

Note: This Question is unanswered, help us to find answer for this one

170. A graph in which all nodes are of an equal degree is known as:

Answer

Correct Answer: Regular graph

Note: This Question is unanswered, help us to find answer for this one

171. What is the best definition of a collision in a hash table?

Answer

Correct Answer: Two entries with different keys have exactly the same hash value

Note: This Question is unanswered, help us to find answer for this one

172. In which dynamically created linked list can the first node be recovered after moving to the second node?

Answer

Correct Answer: Both b and c

Note: This Question is unanswered, help us to find answer for this one

173. A chained hash table has an array size of 512. What is the maximum number of entries that can be placed in the table?

Answer

Correct Answer: There is no maximum limit

Note: This Question is unanswered, help us to find answer for this one

174. What is the formulae to find maximum number of nodes n in a perfect binary tree?

Answer

Correct Answer: 2h + 1 - 1

Note: This Question is unanswered, help us to find answer for this one

175. In which data structure do the insertion and deletion take place at the same end?

Answer

Correct Answer: Stack

Note: This Question is unanswered, help us to find answer for this one

176. Suppose T is a complete binary tree with 14 nodes. What would be the minimum possible depth of T?

Answer

Correct Answer: 3

Note: This Question is unanswered, help us to find answer for this one

177. The minimum number of interchanges needed to convert the array 89,19,14,40,17,12,10,2,5,7,11,6,9,70 into a heap with the maximum element at the root is:

Answer

Correct Answer: 2

Note: This Question is unanswered, help us to find answer for this one

178. What is the value of the post-fix expression 6 3 2 4 + - *?

Answer

Correct Answer: Something between -15 and -100

Note: This Question is unanswered, help us to find answer for this one

179. Which of the following applications may use a stack?

Answer

Correct Answer: All of the above

Note: This Question is unanswered, help us to find answer for this one

180. Which of the following is false?

Answer

Correct Answer: If the search argument is greater than the value located in the middle of the binary, the binary search continues in the lower half of the array

Note: This Question is unanswered, help us to find answer for this one

181. For a complete binary tree with depth d, the total number of nodes is:

Answer

Correct Answer: 2d+1-1

Note: This Question is unanswered, help us to find answer for this one

182.

Suppose we have a circular array implementation of a queue, with ten items in the queue stored at data[2] through data[11]. The CAPACITY is 42. Where does the push member function place the new entry in the array?

Answer

Correct Answer: data[12]

Note: This Question is unanswered, help us to find answer for this one

183.

Here is a code for an integer variable n

   while (n > 0)

   {

     n = n/10; // Use integer division

   }

What is the worst case scenario analysis for the above loop?

Answer

Correct Answer: O(log n)

Note: This Question is unanswered, help us to find answer for this one

184. Tree algorithms typically run in time O(d) . What is d?

Answer

Correct Answer: The depth of the tree

Note: This Question is unanswered, help us to find answer for this one

185. What happens if you make a recursive call without making the problem smaller?

Answer

Correct Answer: The run-time stack overflows, halting the program

Note: This Question is unanswered, help us to find answer for this one

186. Which feature of heaps allows them to be efficiently implemented using a partially filled array?

Answer

Correct Answer: Heaps are complete binary trees

Note: This Question is unanswered, help us to find answer for this one

187. What is the minimum number of edges which must be removed from a complete bipartite graph of six nodes K(6) so that the remaining graph is a planar?

Answer

Correct Answer: 6

Note: This Question is unanswered, help us to find answer for this one

188. A simple graph with n vertices and k components can have at the most _______.

Answer

Correct Answer: (n-k)(n-k+1)/2 edges

Note: This Question is unanswered, help us to find answer for this one

189. Which graph traversal algorithm uses a queue to keep track of the vertices which need to be processed?

Answer

Correct Answer: Breadth-first search

Note: This Question is unanswered, help us to find answer for this one

190. A full binary tree with 2n+1 nodes contains:

Answer

Correct Answer: n non-leaf nodes

Note: This Question is unanswered, help us to find answer for this one

191. You have a file with 4 billion 32-bit integers. The distribution of the integers is random but uniform. You are supposed to find a number NOT in the file. If you created a bit array and used the index to that array to determine if a number existed in the file approximately how much memory would you need?

Answer

Correct Answer: 512 Megabytes

Note: This Question is unanswered, help us to find answer for this one

192. What is the worst-case time complexity of the simple Ford-Fulkerson algorithm for finding the maximum flow in a graph given a source and a sink, and all integer capacities on edges? Assume the graph G = (V,E) has a finite, integer maximum flow value of f.

Answer

Correct Answer: O(|E|f)

Note: This Question is unanswered, help us to find answer for this one

193. What is the worst-case time complexity of finding a maximum cardinality matching in a bipartite graph G = (V,E)?

Answer

Correct Answer: O(|E|*sqrt(|V|))

Note: This Question is unanswered, help us to find answer for this one

194. The path length from a node to the deepest leaf under it is the _________.

Answer

Correct Answer: Height

Note: This Question is unanswered, help us to find answer for this one

195. If a node having two children is deleted from a binary tree, it is replaced by its:

Answer

Correct Answer: Inorder successor

Note: This Question is unanswered, help us to find answer for this one

196. Can Dijkstra's be used to find the longest-path in a graph?

Answer

Correct Answer: No, they can't

Note: This Question is unanswered, help us to find answer for this one

197. Which sort will you use if you want to optimize sorting time?

Answer

Correct Answer: Merge sort

Note: This Question is unanswered, help us to find answer for this one

198. Which is the best possible complexity to sort an array?

Answer

Correct Answer: O(NlogN)

Note: This Question is unanswered, help us to find answer for this one

199. A technique for direct search is _______.

Answer

Correct Answer: Hashing

Note: This Question is unanswered, help us to find answer for this one

200. Which is a way of organizing data that considers not only the items stored, but also their relationship to each other?

Answer

Correct Answer: Data Structure

Note: This Question is unanswered, help us to find answer for this one

201. Heapsort's worst case performance is

Answer

Correct Answer: O(n * log n)

Note: This Question is unanswered, help us to find answer for this one

202. Worst case insert for a dynamic array is

Answer

Correct Answer: O(n)

Note: This Question is unanswered, help us to find answer for this one

203. What is the correct order for a in-order binary tree traversal?

Answer

Correct Answer: Left Child - Parent - Right Child

Note: This Question is unanswered, help us to find answer for this one

204. The path length from root to farthest leaf node is the ______ of the tree.

Answer

Correct Answer: Depth

Note: This Question is unanswered, help us to find answer for this one

205. Which data structure provides the fastest lookup time

Answer

Correct Answer: HashMap

Note: This Question is unanswered, help us to find answer for this one

206. What is the time complexity to insert an item into a B-Tree?

Answer

Correct Answer: O(log N)

Note: This Question is unanswered, help us to find answer for this one

207. What is the minimum number of queues needed to implement a priority queue?

Answer

Correct Answer: Two

Note: This Question is unanswered, help us to find answer for this one

208. In tree there may be more than one path from root to leaf node

Answer

Correct Answer: False

Note: This Question is unanswered, help us to find answer for this one

209. A balanced binary search tree search average output is

Answer

Correct Answer: O(log n)

Note: This Question is unanswered, help us to find answer for this one

210. Which of the following problems has the fastest algorithms?

Answer

Correct Answer: Find the maximum value in an array.

Note: This Question is unanswered, help us to find answer for this one

211. Bubble sort's worst case performance is

Answer

Correct Answer: O(n^2)

Note: This Question is unanswered, help us to find answer for this one

212. What is the time complexity to compute the average of a N×M matrix?

Answer

Correct Answer: O(N*M)

Note: This Question is unanswered, help us to find answer for this one

213. Which is a collection of distinct unordered elements with a common type and no duplicates?

Answer

Correct Answer: Set

Note: This Question is unanswered, help us to find answer for this one

214. In which of the following areas is data structures NOT applied extensively?

Answer

Correct Answer: Website design

Note: This Question is unanswered, help us to find answer for this one

215. Collision resolution is not required if a hash function is perfect

Answer

Correct Answer: True

Note: This Question is unanswered, help us to find answer for this one

216. What is the data structures used to perform recursion?

Answer

Correct Answer: Stack

Note: This Question is unanswered, help us to find answer for this one

217. What is the data structure used to perform recursion?

Answer

Correct Answer: Stack

Note: This Question is unanswered, help us to find answer for this one

218. A perfect hash function is

Answer

Correct Answer: maps each valid input to a different hash value

Note: This Question is unanswered, help us to find answer for this one

219. Which is an access mechanism that transforms the search key into a storage address, thereby providing very fast access to stored data?

Answer

Correct Answer: Hashing

Note: This Question is unanswered, help us to find answer for this one

220. Which of the following is NOT a basic function of a linked list?

Answer

Correct Answer: Deletion of a leaf

Note: This Question is unanswered, help us to find answer for this one

221. A stack must always be implemented using an array

Answer

Correct Answer: False

Note: This Question is unanswered, help us to find answer for this one

222. What is the running time of finding Nth element in array using quick sort? (For example: Find the 4th smallest element in an unsorted array.)

Answer

Correct Answer: n * log(n)

Note: This Question is unanswered, help us to find answer for this one

223. Which is an ordered collection of elements in which insertions are restricted to the rear end and deletions are restricted to the front end?

Answer

Correct Answer: Queue

Note: This Question is unanswered, help us to find answer for this one

224. BFS and DFS are two types of

Answer

Correct Answer: Searching algorithms

Note: This Question is unanswered, help us to find answer for this one

225. All binary trees are balanced

Answer

Correct Answer: False

Note: This Question is unanswered, help us to find answer for this one

226. The most common solution to the Towers of Hanoi involves the use of which datastructure

Answer

Correct Answer: Stack

Note: This Question is unanswered, help us to find answer for this one

227. A(n) ______ is the data structure used more than any other data structure.

Answer

Correct Answer: Array

Note: This Question is unanswered, help us to find answer for this one

228. What is the difference between the stack and queue data structures?

Answer

Correct Answer: Stack is LIFO; Queue is FIFO.

Note: This Question is unanswered, help us to find answer for this one

229. Which starts with an empty list and adds elements one-by-one to create a sorted list?

Answer

Correct Answer: Insertion sort

Note: This Question is unanswered, help us to find answer for this one

230. Minimum number of queues needed to implement the priority queue?

Answer

Correct Answer: Two. One queue is used for actual storing of data and another for storing priorities.

Note: This Question is unanswered, help us to find answer for this one

231. What is the most suitable data structure for a situation where tasks must be scheduled for execution on a computer and the tasks include system tasks?

Answer

Correct Answer: Priority Queue

Note: This Question is unanswered, help us to find answer for this one

232. Can a binary tree be implemented using an array?

Answer

Correct Answer: Yes

Note: This Question is unanswered, help us to find answer for this one

233. What is the process a procedure goes through when one of the steps of the procedure involves invoking the procedure itself?

Answer

Correct Answer: Recursion

Note: This Question is unanswered, help us to find answer for this one

234. The smalled element of an array's index is called its:

Answer

Correct Answer: Lower bound

Note: This Question is unanswered, help us to find answer for this one

235. Which is the most suitable data structure for hierarchical data models?

Answer

Correct Answer: Tree

Note: This Question is unanswered, help us to find answer for this one

236. Which of the following data structures is efficient in tree construction?

Answer

Correct Answer: Linked List

Note: This Question is unanswered, help us to find answer for this one

237. Which represents data as a chain of nodes and provides dynamic growth of data?

Answer

Correct Answer: Linked List

Note: This Question is unanswered, help us to find answer for this one

238. Which steps through an array sequentially until a match is found?

Answer

Correct Answer: Sequential Search

Note: This Question is unanswered, help us to find answer for this one

239. What compares adjacent elements and exchanges them to put an array in order?

Answer

Correct Answer: Bubble sort

Note: This Question is unanswered, help us to find answer for this one

240. External sorting is a way of

Answer

Correct Answer: sorting data that is too large to fit into RAM

Note: This Question is unanswered, help us to find answer for this one