GATE Question Bank » CSE » DESIGN AND ANALYSIS OF ALGORITHMS


 
A) Boolean Matrix
B) Digraph Matrix
C) Tree Matrix
D) Traversal Matrix

 
A) Game tree
B) Inorder traversal algorithm
C) Depth first spanning tree
D) Chinese remainder theorem


 
A) D.H.Lehmer
B) J.D.Ullman
C) K.Thompson
D) R.E.Bellman

 
A) Bounding function
B) Solution space
C) Explicit constraints
D) Implicit constraints

 
A) Criterion function
B) Maxmin function
C) Backtracking function
D) Leveling function


 
A) BFS tree
B)  DFS tree
C) State space tree
D) Min - cost spanning tree

 
A) 8 tuples
B) 8* 8 tuples
C) Tuples
D) 8 to the power of 8 tuples

Pages   1    2   3   4   5 

facebook
twitter
google plus
linkedin
pinterest

Enter your E-Mail to receive updates