1.

A process is a __________ actually being carried out to solve a

problem.
A sequence of activities

Step-by step procedure

flow of information

both b and c

Score 0 of 1
(skipped)
2. An algorithm must terminate after a finite number of steps is known as
Definiteness

A finiteness

Correctness

Effectiveness

Score 0 of 1
(skipped)
3. When the sequence of execution of instructions is to be the same as
the sequence in which instruction are written in program text is known
as _________.
A direct sequencing

indirect sequencing

direct selection

indirect selection

(skipped)
1. A procedure, which can call _________, is said to be __________,
procedure/algorithm
A itself, recursive

by othere program, recursive

 itself, non-recursive

some other function, recursive

Score 0 of 1
(skipped)
2. It may be noted that the _______ condition is a special case of
__________.
A FINITENESS, EFFECTIVENESS

definiteness, effectiveness

finiteness, definiteness

Correctness, finiteness

1. state weather the statement is true or false for Understanding the

problem we should know the following things.
1). The type of problem
2). The type of inputs and the type of expected/ desired outputs
3). Special cases of the problem, which may need different treatment for
solving the problem
A 1. True, 2. true, 3. true

1. true, 2. false, 3.true

1. false, 2. false, 3. false

1. true, 2. true, 3. false

re 0 of 1
(skipped)
1. Each of the floor function and ceiling function is a monotonically
increasing function but not __________.
A strictly monotonically increasing function

monotonically decreasing function

strictly monotonically decreasing function

Mod function
 Score 0 of 1
(skipped)
2. maps each real number x to the integer, which is the greatest of all
integers less than or equal to
ceiling function

A Floor Function

monotonically increasing function

Exponentiation Function

Score 0 of 1
(skipped)
3. The concept of logarithm is defined indirectly by the definition of
__________.
A exponential

Floor Function

ceiling function

monotonically increasing function

Score 0 of 1
(skipped)

1.
A a

Score 0 of 1
(skipped)
2. There are two approaches for determining complexity (or time
required) for executing an algorithm.
A empirical (or a posterior), theoretical (or priori)
 empirical, logical

external time, internal time

external, theoretical

Score 0 of 1
(skipped)
1. State weather the following statement is true or false
1). Shell sort is also called diminishing-increment sort
2). A tree is called a binary tree, if it is either empty, or it consists of a node
called the root
3). The concept of mathematical expectation is needed in best case
analysis of algorithms.
1. True, 2. true, 3. true

1. true, 2. false, 3. true

1. false, 2. false, 3. false

A 1. true, 2. true, 3. false

Score 0 of 1
(skipped)
1. Before executing MergeSort, the n elements should be placed in a [1:n].
A [1:n]

[2n:n]

[1:2n]

[2:n]

Score 0 of 1
(skipped)

2.
A a

c
 d

Score 0 of 1
(skipped)
3. merge sort is an example of
A Divide and conquer

decrease and conquer

space and time tredoff

gready method

Score 0 of 1
(skipped)

1.

A a

c
 d

Score 0 of 1
(skipped)
2. The worst case efficiency for quick sort is
A O(n2).

O(2n).

O(log n2).

nlog n

Score 0 of 1
(skipped)
1. A feasible solution that either maximizes or minimizes a given objective
function is called an
A optimal solution

Local solution

exact solution

corrcet solution

Score 0 of 1
(skipped)
2. In a graph, when does Dijkstra's algorithm stop?
When the minimum spanning tree is constructed

When all the vertices in the graph are included to the path

When the vertices together form a cycle

A When the shortest path to the destination vertex is found

Score 0 of 1
(skipped)
3. Knapsack Problem is an example of
Divide and conquere technique

A greedy technique
 dcrease and conquer technique

time and space tredoff

Score 0 of 1
(skipped)
2. To formulate a greedy-based algorithm to generate the shortest paths,
we must conceive of a _____________, solution to the problem and also
___________ measure.
A Multistage, an optimization

single stage, an optimization

single stage, simple

Multistage, simple

(skipped)
1. state weather the following statement is true or false for Single Source
Shortlist Pathse
1). The problem is to determine the shortest paths from v0 to all the
remaining vertices of G.
2). It is assumed that all the weights are positive.
3). The greedy way to generate the shortest paths from v0 to the remaining
vertices is to generate these paths in non-decreasing order of path length.
1. True, 2. true, 3. true

A 1. true, 2. false, 3.tru

1. false, 2. false, 3. false

1. true, 2. true, 3. false

Score 0 of 1
(skipped)
1. A multistage graph G = (V,E) is a __________.
Undirected graph

A directed graph

directed as well as undirected graph

 type of tree

Score 0 of 1
(skipped)
2. The all pairs shortest path problem is to determine a __________ such
that A (i,j) is the length of a shortest path from i to j.
A matrix A

Array A

graph A

Tree A

Score 0 of 1
(skipped)
3. The multistage graph problem can also be solved using the
_________.
A backward approach

Farward approach

top down approach

bottoms up approach

1. The time needed by All paths is especially ___________ to determine

because the looping is ____________ of the data in the matrix A.
A Easy, independent

difficult, dependent

difficult, independent

easy, dependent

Score 0 of 1
(skipped)
2. The travelling salesperson problem is to find a tour of __________ and
principle of _________ holds.
maximum cost, optimality
 maximum cost, generality

minimum cost, generality

A minimum cost ,optimallity

Score 0 of 1
(skipped)
1. All solutions to the 8-queens problem can be represented as
___________ where xi is the column on which queen i is placed.
A 8-tuples (x1...... x8),

12-tuples (x1...... x12),

16-tuples (x1...... x16),

4-tuples (x1...... x4),

Score 0 of 1
(skipped)
2. Backtracking algorithms determine problem's solutions by
___________ searching the solution space for the given problem
instance
A Systematically

logically

periodically

non- systematically

Score 0 of 1
(skipped)
3. The estimated no. of unbounded nodes is only _________ of the total
no of nodes in the 8 queen state space tree.
3.34%

A 2.34%

1%

4.34%
Score 0 of 1
(skipped)
1. A classic combinational problem is to place _________ on 8x8
chessboard so that no two “attack” that is, so that no two of them are on
the _________, colours or diagonal.
A eight queens, same row

four queens, same column

four queens, same row

8-quenes, same column

Score 0 of 1
(skipped)
2. Backtracking algorithms for the knapsack problem can be arrived at
using either of these two state space trees.what are they?
tuple size, input size

A fixed tuple size formulation, variable tuple size formulation

input size, output size

local input, fixed global input

Score 0 of 1
(skipped)
1. state weather the following statement is true or false for Sum of Subsets
1). Given positive numbers wi, 1≤ i ≤n, and m, this problem calls for finding
all subsets of the wi whose sums are m.
2). In general, all solutions are k-tuples (x1, x2...... xk), 1 ≤ k ≤ n, and
different solutions may have different sized tuples
3). implicit constraints that is imposed is xi<xi+1, I ≤ i < k.
1. True, 2. true, 3. true

A 1. true, 2. false, 3. true

1. false, 2. false, 3. false

1. true, 2. true, 3. false

1. A D-search-like state space search will be called __________.
FIFO

A LIFO

FILO

LILO

Score 0 of 1
(skipped)
2. In branch-and-bound terminology, a BFS-like state space search will
be called _________.
A FIFO

LIFO

LILO

FILO

Score 0 of 1
(skipped)
3. To use the branch-and-bound technique to solve any problem, first, it
is necessary to conceive of a ___________ for the problem
A state space tree

binary search tree

syntex tree

flowchart

1. The cost c(.) is such that the solution node with least c(.) corresponds to
a ………………….. in G
A shortest tour

longest tour

cost calculator
 cost definition

Score 0 of 1
(skipped)
2. To search the travelling salesperson state space tree, we need to
define a ___________ and two other functions č(.) and u(.) such that (r) ≤
c(r) ≤ u(r) for all nodes r
A cost function c (.), (r) ≤ c(r) ≤ u(r)

copy function, (r) ≤ c(r) ≤ u(r)

cost function c (.), (r) > c(r) > u(r)

copy function, (r) > c(r) > u(r)

1. Each internal node in binary tree represents a _____________.

A Comparision

differenciation

multiplication

division

Score 0 of 1
(skipped)
2. For many problems it is possible to easily observe that a lower bound
________ to n exists where n is the number of input to the problem
Decendent

A identical

differ

local
1. If A[i] is less than A[j], then the algorithm proceeds down the _________
of the tree; otherwise, it proceeds down the _________.
depth, height

right branch., left branch

A left branch, right branch.

right branch, depth

Score 0 of 1
(skipped)
2. If the algorithm __________ , following a left or right branch, then no i
has been such that x=A[i] and the algorithm must declare the search
__________.
A Terminates, unsuccessful

starts, successful

starts , unsuccessful

Terminates, successful

Score 0 of 1
(skipped)
1. state weather the following statement is true or false for NP Hard and
NP Complete Problems
1). The theory of NP-completeness, which we present here, does not
provide a method of obtaining polynomial time algorithms for problems in
the second group.
2). Nor does it say that algorithms of this complexity do not exist.
3). we establish two classes of problems. These are given names, NP-hard
and NP-Complete.
1. True, 2. true, 3. true

A 1. true, 2. false, 3.true

1. false, 2. false, 3. false

1. true, 2. true, 3. false

Score 0 of 1
(skipped)
1. a An edge having the same vertex as both its end vertices called a
___________.
A self loop

Open loop

closed vertex

open vertex

Score 0 of 1
(skipped)
2. A circuit is a closed, __________ walk.
A Nonintersecting

intersecting

crossed

easy

Score 0 of 1
(skipped)
3. A graph is also called a ___________.
linear complex

1 - complex

one-dimensional complex

A linear complex,or a 1 - complex, or a one-dimensional complex

1. A linear graph (or simply a graph) G = (V,E) consists of a set of objects

V = {v1,v2…..} called …………..., and another set E = {e1,e2…}, whose
elements are called ………..
A Vertices, edges

node , path

weight , direction
 vertices , weight

Score 0 of 1
(skipped)
2. The number of edges incident on a vertex vi with _________ counted
________ , is called the degree, d(vi), of vertex vi.
A self-loops, twice

simple edge , once

simple edge, twice

self-loop, once

Score 0 of 1
(skipped)
1. State weather the following statement is true or false for Trees
1). A tree is a connected graph with circuits.
2). A graph must have at least one vertex, and therefore so must a tree.
3). a tree without any vertices called null tree.
1. false , 2. true, 3. true

A 1. true, 2. false, 3.true

1. false, 2. false, 3. false

1. true, 2. true, 3. false

(skipped)
1. A connected graph is said to be ____________ connected if the
removal of any one edge from the graph provides a ______________.
A Minimally, disconnected graph

maximum, connected graph

maximum, disconnected graph

Minimally, connected graph

Score 0 of 1
(skipped)
 2. The sum of path lengths from the root to all pendent vertices is called
the __________ (or) __________ of a tree.
A path length, external path length

path length, internal path length

depth of a tree, internal path length

depth of a tree, external path length

1. State weather the following statement is true or false for Spanning Trees
1). A tree T is said to be a spanning tree of a connected graph G if T is a
subgraph of G and T contains all the vertices of G.
2). Spanning trees are the largest (with the maximum number of edges)
trees among all trees in G.
3). Spanning is defined only for a connected graph
A 1. True, 2. true, 3. true

1. true, 2. false, 3.true

1. false, 2. false, 3. false

1. true, 2. true, 3. false

(skipped)
1. A closed walk running through every edge of the graph G exactly once
is called an ___________.
Euler path

A Euler line

Euler forest

Euler tree

Score 0 of 1
(skipped)
2. A connected graph G is a Euler graph if and only if it can be
decomposed into _____________.
A circuits.

multiple path
 mulitple vertices

forest

Score 0 of 1
(skipped)
3. Graph theory was born in ________ with Euler’s famous paper
A 1736

1730

1836

1730

1. A Hamiltonian circuit in a connected graph is defined as a

_______________ that traverses every vertex of G exactly once, except
________________.
A closed walk , starting vertex

open walk , starting vertex

closed walk , end vertex

open walk, end vertex

Score 0 of 1
(skipped)
2. If we remove any __________ edge from a Hamiltonian circuit, we are
left with a path. This path is called a __________.
A one , Hamiltonian path

two , Hamiltonian circuit

two , Hamiltonian path

one , Hamiltonian circuit

1. state weather the following statement is true or false for Hamiltonian

Circuit and Path
1). Every connected graph has a Hamiltonian circuit.
2). Every graph that has a Hamiltonian circuit also has a Hamiltonian path.
3). A given graph may contain more than one Hamiltonian circuit.
 A 1. True, 2. true, 3. true

1. true, 2. false, 3.true

1. false, 2. false, 3. false

1. true, 2. true, 3. false

(skipped)
1. A matrix whose entries are only either 0 or 1, is called a __________.
(0, 1)-matrix

binary matrix

A both a and b

weight matrix

Score 0 of 1
(skipped)
2. Any graph can be represented with the help of ________.
adjacency matrix

adjacency linked list matrix

A both a and b

stack

Score 0 of 1
(skipped)
3. Let g be a subgraph of a graph G. Suppose I(g) and I(G) are the
incidence matrices of g and G respectively. Then I(g) is called a
___________ of I(G)
A Submatrix

linked matrix

simple matrix

both b and c
2. Two graphs G1 and G2 are isomorphic if and only if their
______________ I(G1) and I(G2) differ only by ___________ of rows and
columns.
A incidence matrices, permutations

adjecency linked list matrix, permutations

incidence matrices, addition

adjecency linked list matrix, susbtraction

Score 0 of 1
(skipped)
1. state weather the following statement is true or false for Circuit Matrix.
1). i) If a column of B(G) contains all zeros, then the related edge does not
belong to any circuit.
2). iii) If a row contains only one "1", then the related edge is a self-loop
3). ii) Each row of B(G) corresponds to a circuit. So each row may be
called as a circuit vector
A 1. True, 2. true, 3. true

1. true, 2. false, 3.true

1. false, 2. false, 3. false

1. true, 2. true, 3. false

1. A directed graph is also refered to as _____________

A an oriented graph.

Tree

forest

connected graph

Score 0 of 1
(skipped)
2. A vertex v is said to be an ___________ vertex if the out degree of v
and the indegree of v are equal to zero.
Connected
 A isolated

directed

pendent

Score 0 of 1
(skipped)
3. Two directed edges are said to be __________ edges if they are
mapped onto the same ordered pair of vertices.
A parallel

directed

vertical

simple

1. A digraph that has neither ________ nor _____________ is called a

simple digraph
A self-loops, parallel edges

isoleted vertex, parallel edges

isoleted vertex, vertical edges

self-loops, vertical edges

Score 0 of 1
(skipped)
2. Digraphs that have at most __________ edge between any pair of
vertices, but are allowed to have self-loops are called the
A one directed, asymmetric (or) anti-symmetric digraphs.

one directed, symmetric digraphs.

two directed, symmetric digraphs.

two directed, asymmetric

Score 0 of 1
(skipped)
1. state weather the following statement is true or false for Binary Euler’s
Digraphs
1). D is said to be a Euler digraph if it contains a directed Euler line
2). A closed directed walk which traverses every edge of D exactly once, is
called a directed Euler line
3). A directed walk that starts and ends at the different vertex is called a
closed directed walk.
1. True, 2. true, 3. true

1. true, 2. false, 3.true

1. false, 2. false, 3. false

A 1. true, 2. true, 3. false

1. A functions differing from each other by constant factors, should be

treated as ___________.
A complexity-wise equivalent

complexity-wise different

space wise equivalent

space wise different

Score 0 of 1
(skipped)
2. The idea of NP-completeness was introduced by Stephen Cook in
_________.
A 1971

1960

1871

1981

Score 0 of 1
(skipped)
3. The problems which require so large amount of computational
resources and can not be solved by computational means. These
problems are called ___________.
 Non-interectable problems

A intractable problems.

difficult problem

classical problem

1. A Hamiltonian circuit of a graph G = (V, E) is a set of edges that

connects the nodes into a ____________ , with each node appearing
exactly ____________.
A single cycle, once

single cycle, twice

double cycle, once

double cycle, twice

Score 0 of 1
(skipped)
2. Two graphs H1 = (V1, E1) and H2 = (V2, E2) are said to be
___________ if we can rename the vertices in V2 in such a manner that
after renaming, the graph H1 and H2 look _________.
A isomorphic, identical

isomorphic,different

tree, identical

tree, different
1. State weather the following statement is true or false for NP-Complete
and NP-Hard Problems
1). A problem is called NP-Complete if P has atleast one Non-Deterministic
Polynomial-time solution.
2). The process of transformation of the instances of the problem already
known to the decidable to instances of the problem, is called reduction
3). A Polynomial-time reduction is a polynomial-time algorithm
1. True, 2. true, 3. true

A 1. true, 2. false, 3.true

1. false, 2. false, 3. false

1. true, 2. true, 3. false