The search technique for searching a sorted file that requires increased amount of space is
_____________________________________________________________________________________

A graph in which all nodes are of equal degree is called
_____________________________________________________________________________________

The
sorting technique where array to be sorted is partitioned again and
again in such a way that all elements less than or equal to partitioning
element appear before it and those which are greater appear after it,
is called
_____________________________________________________________________________________

A binary tree with 27 nodes has _______ null branches.
_____________________________________________________________________________________

The postfix form of A*B+C/D is
_____________________________________________________________________________________

A desirable choice for the partitioning element in quick sort is
_____________________________________________________________________________________

A search technique where we keep expanding nodes with least accumulated cost so far is called
_____________________________________________________________________________________

Consider a linked list of n elements. What is the time taken to insert an element after an element pointed by some pointer?
_____________________________________________________________________________________

The goal of hashing is to produce a search that takes
_____________________________________________________________________________________

A BST is traversed in the following order recursively: Right, root, left.The output sequence will be in
_____________________________________________________________________________________


The in order traversal of tree will yield a sorted listing of elements of tree in
_____________________________________________________________________________________

The upper bound of computing time of m coloring decision problem is
_____________________________________________________________________________________

One can make an exact replica of a Binary Search Tree by traversing it in
_____________________________________________________________________________________

The minimum number of multiplications and additions required to evaluate the polynomial P = 4x3+3x215x+45 is
_____________________________________________________________________________________


The Worst case occur in linear search algorithm when
_____________________________________________________________________________________

Two isomorphic graphs must have
_____________________________________________________________________________________

The quick sort algorithm exploit _________ design technique
_____________________________________________________________________________________

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
_____________________________________________________________________________________

A sort which uses binary tree concept such that any number is larger than all the numbers in the subtree below it,is called
_____________________________________________________________________________________

Graphs are represented using
_____________________________________________________________________________________

The operation of processing each element in the list is known as
_____________________________________________________________________________________

The best average behaviour is shown by
_____________________________________________________________________________________

If every node u in G is adjacent to every other node v in G, A graph is said to be
_____________________________________________________________________________________


A binary tree can easily be converted into q 2tree
_____________________________________________________________________________________

An
algorithm is made up of two independent time complexities f (n) and g
(n). Then the complexities of the algorithm is in the order of
_____________________________________________________________________________________

The time complexity to build a heap of n elements is
_____________________________________________________________________________________

Breadth first traversal is a method to traverse
_____________________________________________________________________________________

Leaves of which of the following trees are at the same level ?
_____________________________________________________________________________________

The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal.
_____________________________________________________________________________________

Quick sort is also known as
_____________________________________________________________________________________

A graph in which all nodes are of equal degrees is known as
_____________________________________________________________________________________

Preorder is nothing but
_____________________________________________________________________________________

The number of distinct simple graphs with up to three nodes are
_____________________________________________________________________________________

The space factor when determining the efficiency of algorithm is measured by
_____________________________________________________________________________________

Let A be an adjacency matrix of a graph G. The th ij entry in the matrix K A , gives
_____________________________________________________________________________________

An advantage of chained hash table over the open addressing scheme is
_____________________________________________________________________________________

Number of vertices of odd degree in a simple graph is
_____________________________________________________________________________________

Consider the following pseudocode : If (A > B) and (C > D) then A = A + 1 B = B + 1 Endif The cyclomatic complexity of the pseudocode is
_____________________________________________________________________________________

A simple graph in which there exists an edge between pair of vertices is called
_____________________________________________________________________________________

What is the postfix form of the following prefix expression A/B*C$DE
_____________________________________________________________________________________

A given connected graph G is a Euler graph , if and only if all vertices of G are of
_____________________________________________________________________________________

The time factor when determining the efficiency of algorithm is measured by
_____________________________________________________________________________________

Hashing collision resolution techniques are
_____________________________________________________________________________________

The number of vertices of odd degree in a graph is
_____________________________________________________________________________________

A
sort which relatively passes through a list to exchange the first
element with any element less than it and then repeats with a new first
element is called
_____________________________________________________________________________________

One can convert a binary tree into its mirror image by traversing it in
_____________________________________________________________________________________

Every cut set of a connected euler graph
_____________________________________________________________________________________
