Time taken to perform (n-1) UNIONS is
(a) O(n2) (b) O(n3)
(c) O(n) (d) O(1)
Each path through the tree represents in the binary search
(a) Sequence of comparisons (b) Element comparisons
(c) Sequence of elements (d) Comparisons
Which of the following are disjoint set operations
(a) Make-set (b) Union
(c) Find-Set (d)All
Which of the following search is not efficient for large sets
(a) Binary (b) Sequential
(c) Both A&B (d) none
Average and worst case complexity Binary search
Theta notation expresses
(a) Tight rounds (b) Upper bounds
(c) ) Lower bounds (d) worst cases
Which of the following is the best sorting algorithm
(a) A) Merge Sort (b) Heap Sort
(c) Bubble Sort (d) Quick Sort
Which of the following sorting technique have same O(n log n) complexity in all the cases?
(a) Insertion Sort (b) Quick Sort
(c) Merge Sort (d) Selection Sort
The Average time complexity of quick sort
(a) ) O (n) (b) O (n log n)
(c) O (n)
(d) O (log n)
The time complexity stresses matrix multiplication
(a)3 (b)1
(c)2 (d)None
The recursive versions of binary search use a structure.
(a) Branch and bound (b) Dynamic programming
(c) Divide and conquer (d) Simple recursive
The optimization technique for particular classes of backtracking algorithms that repeatedly solve
sub-problems.
(a) Decrease and conquer (b) Dynamic programming
( c) Branch and bound (d) Divide and Conquer
The root node in the B-Tree technique has limit on the number of children?
(a) Lower (b) Upper and Lower
(c) Upper (d) No
Which one of the following helps in calculating the longest amount of time taken for the
completion of the algorithm?
(a) Theta notation (b) Big-Oh notation
(c) Omega notation (d) Time complexity
The algorithm is the amount of space required for it to execute.
(a) Time complexity (b) Space complexity
(c) Compiling time (d) Best case
within the limit deals with the behavior of a function for sufficiently large values of its parameter.
(a) Asymptotic notation (b) Big-Oh notation
(c) Omega notation (d) Theta notation
The recursive versions of binary search use a structure.
(a) Branch and bound (b) Dynamic programming
(c) Divide and conquer (d) Simple recursive
The measure of the longest amount of time possibly taken to complete an algorithm is expressed
as
(a) Little-O (b) b. Little-Omega
(c) Big-Omega (d) d. Big-O
An algorithm is the amount of time required for it to execute.
(a) Time Complexity (b) Space complexity
(c) Compiling time (d) Best case
The maximum amount of time an algorithm takes to execute a specific set of inputs.
(a) Running time (b) Average case time complexity
(c) Worst case time complexity (d) Best case time complexity
With in the limit deals with the behavior of a function for sufficiently large values of its
parameter.
(a) Asymptotic notation (b) Big-Oh notation
(c) Omega notation (d) Theta notation
The searching requires ___ comparisons to in the worst case when the array is sorted first.
The problem of counting graph’s paths can be solved with an algorithm for an appropriate power
of its.
The cities are represented by ___ and the roads between them are shown as edges.
The ___ algorithm is similar to the dynamic approach.
The Insertion, deletion and search operations of a binary search tree has an average-case
complexity of ___.
The asymptotic running time when we first run to calculate the nth Fibonacci number is ___.
We can implement Backtracking by constructing the ___.
Backtracking, in the ___ case, may have to generate all possible candidates in a problem state that
is growing exponentially.
A greedy strategy usually progresses in a ___ fashion.
The time taken to perform operations on a binary search tree is directly proportional to the ___ of
the tree.
Determining connected components of an undirected graph is an application set
Operation Find(i) determines the of the tree containing I
Any connected graph with n vertices must have at least edges
Binary search only works on list
Reading the input from the user and printing the output to the user done by------------
Transferring the values from the user to a variable or vice-verse is-------
An algorithm must be always--------------
Design of an algorithm is needed-----------------
Time complexity of quick sort in best case
is the expression of an algorithm in a programming language