DAA OBJECTIVE QUESTION AND ANSWERS
1) Maximum number of possible optimal tree patterns when number nodes = 4
a) 13 b) 14 c) 15 d) 16
2) A walk which visits every vertex, returning to its starting vertex, is called a ?
a) Tour b) Extended walk c) Spanning tree d) Path
3) 0/1 knapsack is based on method
a) greedy method b) backtracking c) dynamic programming d) divide and conquer
4) In Huffman coding, data in a tree always occur?
a) roots b) leaves c) left sub trees d) right sub trees
5) Which of the problems cannot be solved by backtracking method?
a) n-queen problem b) subset sum problem c) Hamiltonian circuit problem
d) travelling salesman problem
6) Backtracking algorithm is implemented by constructing a tree of choices called as?
a) State-space tree b) State-chart tree c) Node tree d) Backtracking tree
7) You are given a knapsack that can carry a maximum weight of 60. There are 4 items with weights
{20, 30, 40, 70} and values {70, 80, 90, 200}. What is the maximum value of the items you can carry
using the knapsack?
a) 160 b) 200 c) 170 d) 90
8) Which of the following is not a backtracking algorithm?
a) Sum of subsets problem b) N queen problem c) Tower of Hanoi d) M coloring problem
9) Which is not return optimal solution from the following methods
a) Greedy method b) Branch and bound c) Dynamic programming d) Backtracking
10) Which of the following methods can be used to solve n-queen’s problem?
a) greedy algorithm b) divide and conquer c) iterative improvement d) backtracking
11) How many fundamental solutions are there for the eight queen puzzle?
a) 92 b) 10 c) 11 d) 12
12) Branch and bound is a __________
a) problem solving technique b) data structure c) sorting algorithm d) type of tree
13) Which of the following is not a branch and bound strategy to generate branches?
a) LIFO branch and bound b) FIFO branch and bound c) Lowest cost branch and bound
d) Highest cost branch and bound
14) Which of the following branch and bound strategy leads to depth first search?
a) LIFO branch and bound b) FIFO branch and bound c) Lowest cost branch and bound
d) Highest cost branch and bound
15) State space tree is used in the following algorithm design strategy
a) Branch and Bound b) Back tracking c) Both a and b d) Greedy
16) Backtracking algorithm is implemented by constructing a tree of choices called as?
a) State-space tree b) State-chart tree c)Node-tree d) Backtracking tree
17) Which of the problems cannot be solved by backtracking method?
a) n-queens b) sum of subsets c) Hamiltonian circuit d) travelling sales person
18) What is the time complexity of the brute force algorithm used to solve the Knapsack problem?
a) O(n) b) O(2n) c) O (logn) d) O(n2)
19) Which of the following is not a branch and bound strategy to generate branches?
a) LIFO BB b) FIFO BB c)Least cost BB d) Highest cost BB
20) Which of the following can traverse the state space tree only in DFS manner?
a) branch and bound b) dynamic programming c) greedy algorithm d) backtracking
21) A_ round trip path along n edges of G that visits every vertex once and returns to its starting position.
a) MST b) Travelling scales men problem c) Multi stage problem d) Hamiltonian cycle
22) What is 7 mod 3?
a) 1 mod 3 b) 3 mod 3 c) 0 mod 3 d) 2 mod 3
23) To which of the following class does a CNF-satisfiability problem belong?
a) NP class b) P class c) NP complete d) NP hard
24) is the class of decision problems that can be solved by non-deterministic polynomial
algorithms.
a) NP b) P c) Hard d) Complete
25) The comparison tree is also called as .
a) binary tree. b) decision tree. c) sequential tree. d) b+ tree
26) Worst case efficiency of which search is O(n)?
a) Sequential search b) Binary search c) Indexed search d) Hashing
27) What does 36 mod 13 look like using the Quotient Remainder Theorem?
a) 36 = 10 * 3 + 6 b) 36 = 13 * 2 + 10 c) 13 = 36 * 1 - 23 d) 6 = 36 - 10 * 3
28) For modular Arithmetic what value is most important?
a) The given number b) The reminder c) The divisor d)None of the above
29) For problems X and Y, Y is NP-complete and X reduces to Y in polynomial time. Which of the follow-
ing is TRUE?
a) If X can be solved in polynomial time, then so can Y b) X is NP-complete
c) X is NP-hard d) X is in NP, but not necessarily NP-complete
30) Which of the following will not return an optimal solution?
a) Dynamic Programming b) Branch and Bound c) Backtracking d) Greedy Methods
31) Single source shortest path with general weights can be solved using which of the following
approaches
a) Divide and Conquer b) Greedy c) Dynamic Programming d) Backtracing
32) The time complexity of evaluating a polynomials at ‘n’ points using Horners rule is
a) O(n) b) O(n 2 ) c) O(n 3 ) d) O(n logn)
33) The minimum number of comparisons required in the worst case by any comparison based search
algorithm is
a)n b) nlogn c) logn d)2
34)
Which of the following is true regarding the following algorithms
(a) P is subset of NP (b) NP-hard is subset of NP-complete (c ) NP is subset of P (d) None of the
above
35) Problems that can be solved in polynomial time are known as?
a) intractable b) tractable c) decision d) complete
36) How many steps are required to prove that a decision problem is NP complete?
a) 1 b) 2 c) 3 d) 4
37) Calculating the chromatic number of a graph is a
a) P problem b) NP hard problem c) NP complete problem d) cannot be identified as any of the
given problem types
38)
To which of the following class does a CNF-satisfiability problem belong?
a) NP class b) P class c) NP complete d) NP hard
39)
The upper bound on the time complexity of the nondeterministic sorting algorithm is
(a) O(n) (b) O(n log n) (c) O(1) (d) O(n 2 )
40)
The time complexity of evaluating a polynomials at ‘n’ points using FFT is
a) O(n) b) O(n 2 ) c) O(n 3 ) d) O(n log n)
