Q. What be the time complexity for any typical array order?

View solution

Q. Quick sort gives O(n log n) worst case performances if the pivot is selected as

View solution

Q. T (n) = (2n/3)+1 then T(n) is equal to

View solution

Q. A language developed to assist children in learning geometric shapes and computing aspects is

View solution

Q. Search tables used by compilers for efficient searching generally use

View solution

Q. A complete binary tree with 10 leaves

View solution

Q. Which of the following is not correct?

View solution

Q. Maximum possible height of an AVL tree with 7 nodes is

View solution

Q. What is the minimal number of edges which must be removed from a complete bi partite graph of 6 nodes k(6) so that the remaining graph is planer?

View solution

Q. A strictly binary tree with n leave always contain nodes?

View solution

Q. The following sequence of the operations is performed on a stack PUSH(10), PUSH(20), POP, PUSH(10), PUSH(20), POP, POP, POP, PUSH(20), POP the sequence of values popped out is

View solution

Q. The time complexity of comparison based sorting algorithm is

View solution

Q. Adjacency matrix for a digraph is

View solution

Q. The time required to insert an element in a stack with linked list implementation is

View solution

Q. The time required to search an element in a binary search tree having n element is

View solution

Q. Merge sort uses

View solution

Q. For merging two sorted lists of sizes m and n to a sorted list of size m+n, we require Comparisons of

View solution

Q. The search concept used in associative memory is

View solution

Q. Suppose we want to arrange the n numbers stored in an array such that all negative value before all positive ones, minimum number of exchanges required in the worst case

View solution

Q. The average time required to perform a successful sequential search for an element in an array A(1:n) is given by

View solution