* ue LOTT) DAYANANDA SAGAR COLLEGE OF ENGINEERING (An Autonomous nstieuteAfiated to VTU, Belagav) ShavigeMalleshwara Hills, Kumaraswamy Layout, Bengalurs-560078 Department of information Sefence and Engineering ‘Continuous Internal Assessment - Il etd snp coursecoue 191540 CDA anise Duration: 90 Mins rate | a B | Gourse Outcome 51s 5 (= |e 7 Program Outcome z [2 z af |mea faz] Bioomstever 7 [3 z zp [3 z (Question Number 1, 2and 3 are Compulsory, Answer one full question from 4 or 5 and 6 or 7) Marks 1A Asingle solution ton-queens problem for any n >=4 can be found in__Time. 1x10 ‘A) Quadratic B) Linear ©). Exponential D) Polynomial B__ InBranch and Bound techniques, non-terminated, stil promising leaves are called _ ‘A)_ Dead Nodes B) Promising C)_ Livenodes D) Non-Promising C Thelower bound for multiplications of n*n matrices is A) O(n) B) An) ©) O(n7) D) Q{n7) DAbinary tree with T leaves and height“h’, the following relation is true A) h2[ logs! B)hsTlogat] —C) hsLlogall D) h2Ltog2 1) E The mumber of processors used ina work-optimal algorithm for prefix computation is Ayn 8) n/logn ©) logan D) n# F — Inwhat manner isa state-space tree for a backtracking algorithm constructed? A) DES B) BFS ©) Twice around tree) Nearest neighbor first G Which one of the following is an application of the backtracking algorithm? A) Crossword 3B) Ludo ©) Shortest Path b) TSP 1 Imhow many directions do queens attack each other? —~ a) B) 2 O38 bya 1 Problems that can be solved in polynomial time are known as ‘\) intractable B) tractable C) decision ) complete J Towhich ofthe following class does a CNF-satisfability problem belong? ‘A) NP class. 'B) P class ©) NPComplete —D) NPHard 2 Explain Branch and Bound Technique. Apply Branch and Bound algorithm to solve the Traveling 10 Salesman problem for the following graph 3a Let W=(3,5,6,7) and m=15. Find all possible subsets of W that sum to m. Draw the state space tree that is 7 generated. b Differentiate between Backtracking and Branch and Bound methods 3 4 Explain Backtracking method? Draw the state space tree to generate solutions to 4-Queen’s problem 10 OR 5 Explain the classes of NP-Hard and NP-Complete 10 © Whatare PRAM Algorithms? Explain the different variants of PRAM 10 oR 7 Explain the Algorithm for prefix computation that takes work-optimal logarithmic time with an example 10