data structures & algorithms set 1 Detailed Explanation And More Example

Question : 1

The operation of processing each element in the list is known as

a) Merging

b) Inserting

c) Traversal

d) All the above

Question : 2

The complexity of Binary search algorithm is

a) O(n)

b) O(log )

c) O(n log n)

d) None of the above

Question : 3

The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal

a) ABFCDE

b) ADBFEC

c) ABDECF

d) None of the above

Question : 4

This data structure allows deletions at both ends of the list but insertion at only one end.

a) Input-restricted deque

b) Output-restricted deque

c) Priority queues

d) None of the above

Question : 5

Which of the following is not a limitation of binary search algorithm ?

a) binary search algorithm is not efficient when the data elements are more than 1000.

b) must use a sorted array

c) requirement of sorted array is expensive when a lot of insertion and deletions are needed

d) there must be a mechanism to access middle element directly

Question : 6

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) None of the above