Design and Analysis of Algorithms Basics Questions

MCQ bookmark_border

51.

Which of the following is an application of stack?

A

finding factorial

B

tower of Hanoi

C

infix to postfix conversion

D

all of the above

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

52.

The data structure which is one ended is

A

queue

B

stack

C

tree

D

graph

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

53.

A list which displays the relationship of adjacency between elements is said to be

A

linear

B

non linear

C

linked list

D

trees

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

54.

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

None of above

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

55.

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 above

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

56.

An algorithm that calls itself directly or indirectly is known as

A

Sub algorithm

B

Recursion

C

Polish notation

D

Traversal algorithm

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

57.

In a Heap tree

A

Values in a node is greater than every value in left sub tree and smaller than right sub tree

B

Values in a node is greater than every value in children of it

C

Both of above conditions applies

D

None of above conditions applies

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

58.

The in order traversal of tree will yield a sorted listing of elements of tree in

A

Binary trees

B

Binary search trees

C

Heaps

D

None of above

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

59.

The application of heap tree is

A

To Sort the elements in array

B

To evaluate the mathematical expression

C

To search the element in array

D

None of these

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

60.

The deletion mechanism in the stack is called as

A

PUSH

B

POP

C

Delete

D

None of these

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion