In _______ operations method incident edges is called once for each vertex.
a) Tree b) Stack c) Graph d) Hash
In prims algorithm process is repeated until a ____ is formed.
a) Spanning tree b) Vertex c) Flag d) High
_______ finds a minimum cost spanning tree by selecting edges from the graph.
a) Prim’s algorithm b) Kruskal algorithm c) Jarnik algorithm d) Analysis and algorithm
Prims algorithm start at a source vertex and grow a ______.
a) Two trees b) Single tree c) Multiple tree d) Tree set
Partition splits array in two sub-arrays of size ______.
a) n+3 b) n/3 c) n/2 d) n
Partitioning loops through, _______ elements below/above pivot.
a) Sorting b) Traversing c) Swapping d) Grouping
The _________ are stored in the original data array.
a) Sub-variables b) Sub-arrays c) Keys d) Variables
First step in quick sort is _______.
a) Combine the sorted s1 b) Recursively sort s1 and s2 c) Pick any element(pivot) d) Group
Quick sort is used to ______.
a) Sorting objects b) Joining objects c) Deleting objects d) Replacing objects
Worst case is ________.
a) 2logn b) O(n2) c) n log n d) n
Best case is _____ same as merge sort.
a) 2logn b) O(n logn) c) n logn d) log n
The main idea is to find the _____ position for the pivot element P.
a) Left b) Right c) Above d) Below
If the input is random, then we can choose the key in position _______ as pivot.
a) A[left] b) A[right] c) Left d) Right
An optimal quick sort is ________ ?
a) 2 logn b) O logn c) (O(N log N)) d) 2n
A tree is also known as _______ sort.
a) Quick b) Shell c) Heap d) Selection
The advantages of insertion sorting are ________.
a) Simple implementation b) Adaptive c) All the above