A binary tree with 27 nodes has _______ null branches.
_____________________________________________________________________________________
The complexity of multiplying two matrices of order m*n and n*p is
_____________________________________________________________________________________
A graph is planar if and only if
_____________________________________________________________________________________
One can convert a binary tree into its mirror image by traversing it in
_____________________________________________________________________________________
Time complexities of three algorithms are given. Which should execute the slowest for large values of N?
_____________________________________________________________________________________
Which of the following sorting procedure is the slowest?
_____________________________________________________________________________________
The space factor when determining the efficiency of algorithm is measured by
_____________________________________________________________________________________
A hash function f defined as f(key) = key mod 7, with linear probing used to resolve collisions. Insert the keys 37, 38, 72, 48, 98 and 11 into the table indexed from 0 to 6. What will be the location of 11 ?
_____________________________________________________________________________________
In ______, the difference between the height of the left sub tree and height of the right tree, for each node, is almost one
_____________________________________________________________________________________
A BST is traversed in the following order recursively: Right, root, left.The output sequence will be in
_____________________________________________________________________________________
A sorting technique which uses the binary tree concept such that label of any node is larger than all the labels in the subtrees, is called
_____________________________________________________________________________________
In order to get the information stored in a Binary Search Tree in the descending order, one should traverse it in which of the following order?
_____________________________________________________________________________________
If x is a string then x^{R} denotes the reversal of x. If x and y are strings, then (xy)^{R} =
_____________________________________________________________________________________
When representing any algebraic expression E which uses only binary operations in a 2-tree,
_____________________________________________________________________________________
A sort which uses binary tree concept such that any number is larger than all the numbers in the subtree below it,is called
_____________________________________________________________________________________
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?
_____________________________________________________________________________________
In a Heap tree
_____________________________________________________________________________________
In worst case Quick Sort has order
_____________________________________________________________________________________
Which of the following algorithms solves the all pair shortest path problem?
_____________________________________________________________________________________
Tree
_____________________________________________________________________________________
A graph in which all nodes are of equal degrees is known as
_____________________________________________________________________________________
What is the postfix form of the following prefix *+ab–cd
_____________________________________________________________________________________
Which of the following sorting method is stable?
_____________________________________________________________________________________
FIRST(1st) TRUE statement in following is
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
The complexity of searching an element from a set of n elements using Binary search algorithm is
_____________________________________________________________________________________
Assuming P ? NP, which of the following is TRUE?
_____________________________________________________________________________________
Using the standard algorithm ,what is the time required to determine that a number n is prime?
_____________________________________________________________________________________
The data structure required for breadth first traversal on a graph is
_____________________________________________________________________________________
A binary tree can easily be converted into q 2-tree
_____________________________________________________________________________________
The number of vertices of odd degree in a graph is
_____________________________________________________________________________________
The minimum number of multiplications and additions required to evaluate the polynomial P = 4x3+3x2-15x+45 is
_____________________________________________________________________________________
Number of ordered trees with 3 nodes A,B,C is
_____________________________________________________________________________________
A program that checks spelling works in the following way. A hash table has been defined in which each entry is a Boolean variable initialized to false. A hash function has been applied to each word in the dictionary, and the appropriate entry in
the hash table has been set to true. To check the spelling in a document, the hash function is applied to every word in the document, and the appropriate entry in the table is examined. Which of the following is (are) correct?
I. true means the word was int the dictionary.
II. false means the word was not in the dictionary.
III. Hash table size should increase with document size.
_____________________________________________________________________________________
Id one uses straight two way merge sort algorithm to sort the following elements in ascending order
20,47,15,8,9,4,40,30,12,17
then order of these elements after the second pass of the algorithm is
8,9,15,20,47,4,12,17,30,40
8,15,20,47,4,9,30,40,12,17
15,20,47,4,8,9,12,30,40,17
4,8,9,15,20,47,12,17,30,40
_____________________________________________________________________________________
The upper bound of computing time of m coloring decision problem is
_____________________________________________________________________________________
Leaves of which of the following trees are at the same level ?
_____________________________________________________________________________________
Quick sort is also known as
_____________________________________________________________________________________
If every node u in G is adjacent to every other node v in G, A graph is said to be
_____________________________________________________________________________________
The pre order and post order traversal of a Binary Tree generates the same output. The tree can have maximum
_____________________________________________________________________________________
_____________________________________________________________________________________
Which of the following statements are TRUE? (1) The problem of determining whether there exists a cycle in an undirected graph is in P. (2) The problem of determining whether there exists a cycle in an undirected graph is in NP. (3) If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.
_____________________________________________________________________________________
A simple graph in which there exists an edge between every pair of vertices is called
_____________________________________________________________________________________
Two isomorphic graphs must have
_____________________________________________________________________________________
The Worst case occur in linear search algorithm when
_____________________________________________________________________________________
The most common hash functions use the__________to compute hash address.
_____________________________________________________________________________________
If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is
_____________________________________________________________________________________
If each node in a tree has value greater than every value in its left subtree and has value less than every in the its right subtree ,the tree is called
_____________________________________________________________________________________
Every cut set of a connected euler graph