1). All NP-Complete problems are _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ a). NP-Hard b). P-Hard c). P d). NP 2).

_ _ _ _ _ _ _ _ _ _ process is one whose behaviour is non-deterministic i.e., the next state of the environment is not fully determined by the previous state of the environment. a). Stochastic b). Prefix tree c). Kraft`s inequality d). Genotype 3). _ _ _ _ _ _ _ _ _ _ is the set of decision problems that can be solved by a Deterministic machine in polynomial time a).The complexity class P b).The complexity class NP c). Co-NP class d). Gamecomplexity 4). Only _ _ _ _ _ _ _ _ _ can be NP-complete a). linear problems b). Non-linear problems c). decision problems d). hard problems 5). What is true in case of Clique problem ? a). The clique problem is not in NP b). The clique problem is in NP c). The time complexity for clique problem in O(n) where n is the number of verticies . d). clique problem is also known as vertex cover problem 6). _ _ _ _ _ _ _ _ _ _ _ _ search will run the same steps every time if it is given the same input. a). Deterministic Search b). Nondeterministic Search c). TABU search d). Huffman search 7). Any problem that involves the identification of either minimum or maximum value of a given cost function is known as _ _ _ _ _ _ _ _ _ _ _ . a). min problem b). max problem c).decision problem d).optimization problem 8). _ _ _ _ _ _ _ _ _ is the time complexity of the function choice(), success() & failure() a). O (1) b). O (n) c). O (nlogn) d). O(n2) 9). An optimal solution is a feasible solution with _ _ _ _ _ _ _ _ _ _ a). maximum value b). minimum value c). zero value d). infinite value 10). Knapsack problem is _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ a). Maximization problem c). an example of divide and conquer technique b). minimization problem d). is an example of multi stage graph problem 11). A maximization problem is easily converted to a minimization problem _ _ _ _ _ a). by changing the sign of the objective function b). by taking the reciprocal of the objective function c). by taking the square root of the objective function d). by taking the functional value of the objective function 12). _ _ _ _ _ _ is the time complexity for the traveling salesperson problem , if it is solved by using dynamic programming. a). O( ) b). O (n2 ) c). O( 2n) d). O(n ) 13). we start at a particular node in the graph, visiting all nodes exactly once and come back to Initial node with minimum cost. This is known as _ _ _ _ _ _ _ a). 0/1 knapsack problem b). optimal storage on tapes

c). minimum cost spaning tree d). traveling sales person problem 14). If M=15, n=4, =(10,10,12,18) and =(2,4,6,9) of 0/1 knapsack problem then the maximum profit is _ _ _ _ _ _ a). 32 b). 34 c). 36 d). 38 15). In Job sequencing with deadlines problem, for any Job i the profit Pi is earned if and only if ________ a). the Job is completed by its deadline. b). the Job is initiated before the deadline. c). half of the Job is completed by its deadline. d). 75 % of the Job is completed by its deadline 16). The value of a feasible solution J for the Job sequencing with deadlines problem is ____ a). the average of the profits of the jobs in J b). the sum of the profits of the Jobs in J c). the square root of the sum of the profits of the Jobs in J d). the max. difference in the profits of the Jobs in J 17). What does it mean if Q is NP-Hard ? a). Every problem P NP lep Q b). Every problem NP P gep Q c). Every problem P NP geP Q d). Every problem NP P leP Q 18). What does it mean if Q is NP-Complete ? a). Q is NP- Hard and Q NP b). Q is nearly NP-Hard c). Q is NonDeterministic Turing Machine d). Q is Deterministic turing Machine 19). What is the relation between P and NP? a). P? NP, but no one knows whether P= NP b). P = NP c). P > NP d). P < NP 20). In the tree of variable tuple size formulation, the solution space is defined by _ _ __ a). All paths from the root node to any node in the tree b). All paths from the root node to the leaf node c). All paths from one leaf node to another leaf node d). All paths in the left sub tree