Design and Analysis of Algorithms Basics Questions

MCQ bookmark_border

41.

Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivotelementand:

A

There is explicit combine process as well to conquer the solution.

B

No work is needed to combine the sub-arrays, the array is already sorted

C

Merging the subarrays

D

None of above.

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

42.

Dijkstra

A

Has greedy approach to find all shortest paths

B

Has both greedy and Dynamic approach to find all shortest paths

C

Has greedy approach to compute single source shortest paths to all other vertices

D

Has both greedy and dynamic approach to compute single source shortest paths to all other vertices.

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

43.

What algorithm technique is used in the implementation of Kruskal

A

Greedy Technique

B

Divide-and-ConquerTechnique

C

Dynamic Programming Technique

D

The algorithm combines more than one of the above techniques

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

44.

. Which is true statement in the following?

A

Kruskal

B

Kruskal

C

Both of above

D

Kruskal

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

45.

Data by itself is not useful unless

A

It is massive

B

It is processed to obtain information

C

It is collected from diverse sources

D

It is properly stated

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

46.

Which of the following data structure is not linear data structure?

A

Arrays

B

Linked lists

C

Both of the above

D

None of the above

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

47.

The disadvantage in using a circular linked list is

A

It is possible to get into infinite loop.

B

Last node points to first node.

C

Time consuming

D

Requires more memory space

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

48.

A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..

A

Singly Linked List

B

Circular Linked List

C

Doubly Linked List

D

Linear Linked List

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

49.

A ____ is a linear list in which insertions and deletions are made to from either end of the structure.

A

circular queue

B

random of queue

C

priority

D

dequeue

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

50.

In a priority queue, insertion and deletion takes place at

A

front, rear end

B

only at rear end

C

only at front end

D

any position

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion