Programming Data Structures-II

Is this your test? Login to manage it. If not, you can make a test just like it.

This is a non-interactive preview of the quiz content.

1 point

A procedure that calls itself is called

illegal call

reverse polish

recursive

none of the above

1 point

The complexity of Bubble sort algorithm is

O(n)

O(log n)

O(n2)

O(n log n)

1 point

A circular linked list can be used for

Stack

Queue

Both Stack & Queue

Neither Stack or Queue

1 point

Heap is an example of

spanning tree

sparse tree

binary search tree

complete binary tree

1 point

Graph traversal is different from a tree traversal, because

trees are not connected.

trees have root.

graphs may have loops.

None is true as tree is a subset of graph

1 point

push() and pop() functions are found in

queues

lists

stacks

trees

1 point

Quick sort algorithm is an example of

Greedy approach

Improved binary search

Dynamic Programming

Divide and conquer

1 point

For a binary search algorithm to work, it is necessary that the array (list) must be

sorted

unsorted

in a heap

popped out of stack

1 point

Which of the following algorithm is not stable?

Bubble Sort

Quick Sort

Merge Sort

Insertion Sort

10.

1 point

Which one of the below mentioned is linear data structure

Queue

Stack

Arrays

All of the above

Home Features Pricing FAQs Legal Sample Tests Build a Test Login/Sign Up