yOuTh PuLsE: 10/01/2010

____ no of leaf nodes are available 4-queens:- 4

_____has a finite state control , a two way infinite tape:- turing machine

_____is the row wise reduction sum of the cost matrix:- 21

____are the example of NP-complete:- K-clique, subset-sum, 0/1 knap sack

____functions find a live node:- Least( )

____is the branch of the theory of computation that studies which problems:- computability theory

____is the column wise reduction sum of the cost matrix:- 4

____is the cumulative reduction of the cost matrix:- 0

____is the cumulative reduction sum of the cost matrix:- 25

____is the set of decision problems that can be solved by deterministic polynomial:- the complexity class P

____is the time complexity for the traveling salesperson problem:- 0(n2 2n)

____is the time complexity for the traveling sales person problem:- 0( )

____is the time complexity of the function choice(), success() & failure():- 0(1)

____problem can be phrased as given below”given a of a turing machines, ever completes”:- the halting problem

____problems involve finding a grouping, ordering or assignment of a descrete, finite set:- combinational

____process is one whose behaviour is non-deterministic, previous state of the environment:- stochastic

____search will run the same steps every time:- deterministic search

____shown in figure represents the commonly believed relationship b/w P and NP:- (no answer)

____states that satisfiability is in P if and only if P=NP:- cook’s theorem

2n does not overtake until:- n reaches 59

A boolean circuit is a circuit of AND, OR and NOT gates. The problem is called:- CIRCUIT-SAT Problem

A feasable solution for the job sequencing:- a subset J of jobs such that each job in this subset can be completed

A graph can not be drawn on a plane without cross over:- nonplanar

A graph G is biconnected if and only if:- it contains no articulation points

A graph with one or more edges:- 2-chromatic

A maximization problem easily converted to a mionimization problem:- by changing the sign of the objective function

A node which has been generated and all of those children:- live node

A nondeterministic algorithm terminates______signal:- unsuccesfully

A problem is intractable if all algorithms to solve the problem:- exponential time complexity

A search strategy uses a cost function to select the next E-node:- cost function

A sufficient condition for a simple graph G with vertices n have a hamilton cycle:- n/2

A terminal board configuration is one which represents__:- either a win, loose or draw

All NP-complete problems are:- NP-HARD

Alpha cutoff and Beta cutoff:- alpha-beta pruning

An LC search coupled with bounding :- LC branch and bound search

An optimal solution is a feasable solution with:- maximum value

An optimization problem is one which asks:- “what is optimal solution to problem X”

Any problem for which the answer is either zero or one is called:- a decision problem

Any problem that involves the identification of either minimum or:- optimization problem

Boolean satisfiability problem can be solved in polynomial:- deterministic turing machine

Branch and bound technique is applicable for only:- minimization problem

Breaking down of problem into several problems is known:- problem reduction

Depth first search is also called___:- D-search

Each node in the tree organization defines:- problem state

For infinite state space tree with no answer nodes:- LC search will terminate

For n queens problem, the time complexity is:- 0(log n)

From the given n distinct positive numbers:- sum of subsets problem

Game of NIM comes under:- finite gaming

Given a set S of n nonnegative integers___requires:- number partitioning problem

Given n people does there exist a group of size K such that_____problem:- calique problem

How do we reduce P to Q:- transform instances os P

How do we usually prove that a problem R is:- show R NP-complete problem

How many colors (minimum) are needed for graph in figure(a):- 3

If a graph is represented by its adjacency matrix nXn and colors by the integers 1,2..m, degree:- m

If a graph is represented by its adjacency matrix nXn and colors by the integers 1,2..m, height:- n+1

If adjacency matrix is used, what is time for BFS alg:- 0(n2)

If d is the degree of the given graph___colors:- d+1

If E= () and () where ~ indicates NOT, then problem is known as:- 3-SAT problem

If M=15 N=4, (10,10,12,18) and (2,4,6,9) of 0/1 knap sack max profit:- 38

If M=15 N=4, (10,10,12,18) and (2,4,6,9) of 0/1 knap sack solution:- (1,0,0,1)

If M=15 N=4, (10,10,12,18) and (2,4,6,9) of 0/1 knap sack the lower bound of node 1 is:- -38

If M=15 N=4, (10,10,12,18) and (2,4,6,9) of 0/1 knap sack the upper bound of node 1 is:- -32

If n=4 in the sum of subset problem, then the possible leafnodes:- 16

If S(n,e) represents the maximum additional space taken by DFS for an n –vertex, e- edge:- 0(n)

If T(n,e) represents the maximum time taken by DFS for an n –vertex, e- edge:- 0(n+e)

If T(n,e) represents the time complexity taken by DFS for an n –vertex, e- edge:- 0(n2)

If the array of integers a[1...n] are sorted by using backtracking, then criterion function P is:- for (3)

If the edge___is deleted from the graph of figure(a):- (5,1)

If the height of the binary tree is 2 then max number of nodes are 7

If the post order and pre order traversal of binary tree MLNKPOR, in order traversal:- MLNKPOR

If two queens are placed at postion (i,j) and (k,l) then:- i+j=k+l

If we represent solution space in the form of a tree:- state space tree

In 15-puzzle problem, each move creates a new arrangement of____of the puzzle:- states

In 8 queens problem, after applying conditions:- factorial 8 tuples

In a binary search tree, the number of terminal nodes are 10, number of nodes with two children :- 9

In AND/OR graph, the solvable nodes:- rectangles

In AND/OR graph, the____ :- AND

In backtracking method, modified criterion function is also:- bounding function

In backtracking, the function which needs to be maximized:- criterion function

In backtracking, the tree organization:- permutation tree

In backtracking__are the rules that determine:- implicit constraints

In backtracking__are the rules that restrict:- explicit constraints

In branch and bound method, for nodes representing C(x):- infinite

In branch and bound method, the three:- FIFO, LIFO and LC

In branch and bound terminology a D-search like state space search:- LIFO

In branch and bound terminology, a BFS like state space_____search:- FIFO

In FIFO branch and, if cost function:- the node gets killed

In FIFOBB, initially the queue of:- empty

In FIFOBB, square nodes indicates:- answer nodes

In figure (a), the optimal way to solve P1 is___ :- solve P6 first, then P3 and finally P1

In figure(a), ____is an AND node:- P2

In figure(a), is to be solved is:- P1

In finding the reduced cost matrix from a given cost matrix, element from first column:- column reduction

In finding the reduced cost matrix from a given cost matrix, element from first row:- row reduction

In general, a positive integer k has a length of____bits when represented in binary:- k+10

In job sequence dead lines problem n=4 , (100,10,15,27) and (2,1,2,1) find optimal:- job 4 followed by job1

In LC search, every time th child is checked:- the child is answer node or not

In many applications of backtracking, the desired solution is:- an n-tuple(X1,X2,..Xn)

In state space tree of 4-queens problem, initially, node 1 is the only one live node:- no queen has been placed

In sum of sub sets problem, if n weights are considered, solution space:- 2 to the power of n distinct tuples

In the 4-queens state space tree generated by FIFO____under them:- B

In the figure(a) , the removal of the following edge will not effect hamilton cycle:- (1,7)

In the figure(a) ___ is the total cost to solve the problem P2:- 2

In the figure(a) to solve the problem in a optimal way the total cost is:- 3

In the game tree of a 2-person, move of player A:- square

In the game tree of a 2-person, move of player B:- circle

In the job sequencing with deadlines problem, for any job i the profit Pi:- the job is completed by its deadline

In the job sequencing with deadlines problem, for th given set of n jobs:- only one machine is available

In the job sequencing with deadlines:- to select a subset J of n jobs such that all jobs in J can be completed by deadlines

In the least count(LC) search____for live nodes:- an intelligent ranking function

In the sum of subsets problem, if n=4, (w1,..w4)=(11,13,24,7) and m=31 then:- (0,1,1,0) and (1,0,0,1)

In the sum of subsets the implicit constraint is:- the sum of corresponding weights must be m

In the tree of fixed tuple size formulation, all paths from root to leaf node:- solution space

In the tree of fixed tuple size formulation, edges from level i node to level i+1:- the value of xi, which is either

In the tree of fixed tuple size formulation,nodes are numbered:- D-Search

In the tree of variable tuple size formulation, solution space:- all paths from the root node to any node

In the tree of variable tuple size formulation,nodes are numbered:- BFS

In travelling salesperson problem, the sales person needs to visit 1000 cities, complexity:- 0 (1000!)

In____algorithms, the result of over:- deterministic

In___algorithms, operations are allowed to choose anyone of the outcomes subject to:- nondeterministic

Knapsack problem is:- maximization problem

NP complete stands for:- nondeterministic polynomial

Only___can be NP-complete:- decision problems

Painting all the vertices of a graph with colors___ of the graph:- coloring

The 15-puzzle problem was invented by__:- Mr. Sam Loyd

The algorithm of FIFO branch and bound can:- 8

The articulation points in figure(a):- nodes 2,3 and 5

The BFS of the graph figure (a) starting at vertex 1, using adjacency list:- 12345678

The breaking down of complex problem into several problems can be represented by:- directed graph

The broken edges of the depth first spanning tree:- back edges

The common vertex of two biconnected components:- articulation point

The depth first numbers of depth first tree indicates:- the order in which the depth first search visits

The FIFO search coupled with:- FIFOBB

The LC branch and bound search of a tree will begin with:- 0

The live node whose children are currently:- E-node

The most famous unsolved problem in computer science is___:- P = NP or P? NP

The name backtrack was first coined by:- D.H.Lember

The number of biconnected components in figure(a) are:- five

The number of edges in the hamilton cycle of the figure(a):- 8

The problem is interactable, it means:- as the input size n increases, we are unable to solve

The set of problems that can not be solved i.e., no algorithm can be written:- undecidable problems

The solid edges of the depth first spanning tree:- tree edges

The solution space can be oraganized into a tree by means of:- variable tuple size, fixed tuple size

The solution space of tree of 8 queens:- 8 to the power of 8 tuples

The term_____refers to all:- branch and bound

The total number of different hamilton cycles in a complete graph of n vertices:- (no answer)

The value of feasible solution J for the job solution:- the sum of profits of the jobs in J

The value of optimal solution for n=4 , (100,10,15,27) and (2,1,2,1) in job sequence:- 127

To assign a numeric value to board configuration:- Evolution Function E(x)

To check whether the nodes of G can be colored in such a way___:- m-colorability decision problem

To identify articulation point:- depth first spanning tree

Tractability means:- practically useful algorithm

Traversing a tree means visiting each node exactly once

Two biconnected components can have:- atmost one vertex in common

Two problems are said to be polynomially equivallent if and only if:- (no answer)

We start at a particular node in the graph, with minimum cost:- travelling sales person problem

What do you mean when you say a problem is in NP:- a solution can be verified in polynomial time

What do you mean when you say a problem is in P:- a solution can be found in polynomial time

What does it mean if Q is NP complete:- Q is NP-Hard and Q NP

What does it mean if Q is NP hard:- every problem P NP lep Q

What is clique problem:- to findout “how large is the maximum size clique in graph

What is clique:- a clique is a subset of vertices fully connecteed to each other

What is K-coloring problem:- given a graph G and an integer K, can G be painted with K colors?

What is nondeterminstic computer:- a computer that can guess the right answer or solution

What is the another name for adjacency matrix:- boolean matrix

What is the chromatic number of the graph in figure(a):- 3

What is the directed hamilton cycle in the graph of figure(a):- 1,2,3,4,5,1

What is the hamilton cycle in the graph of figure(a):- 1,2,8,7,6,5,4,3,1

What is the hamilton cycle in the graph of figure(a):- no hamilton cycle

What is the problem staement of N queens prob:- N queens are to be place N x N so that no two

What is the relation b/w P and NP?:- P? NP , but no one

What is the time complexity of graph coloring:- 0(n*m to the power of n)

What is true in case of calique problem:- the calique problem is NP

What, intuitively, does it mean if we can reduce:- “P is no harder than” Q

When comparing binary tree with general tree, statement is true binary tree consists of left & right, where as general

Which algorithm will produce output same as order revolution:- min-max algorithm

Which is not true in case of LC search:- LC search algorithm gives the answer node, but it may

Which of the following is not true in case of binary tree:- there is no node with degree greater than two

Which of the following statement is not true in case of adjacency matrix :- for undirected graph

Which of the following statement is not true in case of BFS:- in BFS all unvisited vertices

Which of the following statement is not true in case of DFS:- DFS is suitable for unconnected graph also

Which of the following statement is not true in case of graph:- the number of nodes on the path is path length

Which of the following statement is true in case of expression trees all nodes other than leaf nodes represent exprs

Which statement is not true as far as game:- each player paly to minimize

Which statement is not true as far as graph in figure(a):- the graph contains no articulation

Which statement is not true in case of AND/OR graph:- the presence of a directed cycle in AND/OR

Which statement is not true in case of back tracking method:- backtracking cannot be used for N-queen

Which statement is not true in case of back tracking method:- for a given solution space a unique

Which statement is not true in case of game of NIM:- removing either 1 or 2 or 3 of tooth

Which statement is not true in case of hamilton cycle:- a graph may contain more than one hamilton cycle

Posted by Rahul Teja at 10:01:00 PM 0 comments

how is my blog

Blog Archive

About Me

Followers

Sorted DCS Bits

Sorted MPI bits

Computer Graphics Sorted Bits

Bits password removed

We are not responsible for any consequences.

Sorted bits of DAA