Data Structure Algorithms Online Test - 3

28. Which of the following is useful in implementing quick sort?

a. List      
b. Stree
c. Stack
d. Queue

Answer: c. Stack

29. The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is

a. 5
b. 6   
c. 7   
d. 8

Answer: a. 5

30. Which algorithm design technique is used in the quick sort algorithm?

a. Recursion
b. Divide and rule  
c. Greedy method
d. Divide and conquer

Answer: d. Divide and conquer

31. ____________ is the transformation of a string of characters into a usually shorter fixed-length value or key that represents the original string

a. Binary Search   
b. Linear Search   
c. Hashing
d. Tree Search   

Answer: c. Hashing

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

a. Inorder predecessor   
b. Inorder successor
c. Preorder predecessor   
d. Post order

Answer: b. Inorder successor

33. Polish Notation is also known as

a. Reverse Polish Notation
b. Prefix notation
c. Postfix notation
d. Polish Reverse Notation

Answer: b. Prefix notation

34. Which technique does not require the data to be in sorted form?

a. Binary Search
b. Linear Search
c. Interpolation search
d. All of the above

Answer: a. Binary Search

35. An array is a static data structure

a. True
b. False

Answer: a. True

36. A circularly linked list is used to represent a __________.

a. Queue
b. Stack
c. Array
d. None of the above

Answer: a. Queue

37. What data structure is used for breadth first traversal of a graph?

a. List
b. Stack
c. Queue
d. All of the above

Answer: c. Queue

38. A procedure that calls itself is called

a. illegal call
b. reverse polish
c. recursive
d. All of the above

Answer: c. recursive