ALGORITHM & GRAPH THEORY 1. Finite set of instructions is called _______ a. Relation b. Function c. Algorithm* 2.

The word algorithm belongs to which author ______ a. English b. Parisian* c. British 3. The expression of an algorithm is called ______ a. Flowchart b. Algorithm c. Program* 4. The field of study is _______ a. Analysis* b. Design 5. The algorithm is executed by ______ a. DMA b, CPU 6. Process of executing is _______ a. Process b. Profile c. Implementation c. MU c. Debugging*

d. Flowchart d. None d. None d. Testing d. None d. Performance d. None d. None d. c/Sp d. T (r) d. None d. None d. None

7. Measuring the time of execution ______ a. Profiling* b. Process c. Debug 8. The size (or) number of inputs & outputs ________ a. Size b. Space* c. Time 9. Space requirement s(p) ________ a. c + Sp* b. c-Sp 10. Time complexity is denoted by a. T (p)* b. T(q) c. c * Sp c. T (t)

11. The sum of compile time and execution time is _______ a. P* b. Q c. R 12. The runtime is denoted by a. t c b. t r 13. Execution time also called as ______ a. Compile time b. Run time* c. t p* c. Both

14. tp(n) = a. Ca ADD (n) + Cs SUB (n) + Cm MUL (n) +Cd DIV (n) + .* b. Ca ADD? (n) Cs SUB (n) * Cm MUL (n) Cd DIV (n) + .. c. Both d. None 15. The instance character of ADD is denoted by a. Ca * b. Cs c. Cm 16. Comment count as _______ step a. 1 b. 2 c. 3 d. Cd d. 0*

1 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451

ALGORITHM & GRAPH THEORY

17. The statement does not involve any calls, takes ______ steps a. 0 b. 1* c. 2 18. In laps we consider the steps a. Initialize b. control part* c. Increment

d. Infinite d. None d. 3 d. s/c* d. n + 3 d. All* d. None d. None d. Exponential* d. None d. None d. None d. None d. None d. None

19. How many methods for determine the no. of slips a. 0 b. 1 c. 2* 20. Steps for execution is denoted by _______ a. p/c b. q/c c. r/c 21. Frequency of the for statement ______ a. n b. n + 1* c. n + 2 22. Asymptotic complexity is denoted by ______ a. C b. c. 23. The function 3n + 2 is denoted by _______ a. O (n)* b. O (n2) c. O (n3) 24. The function 3n2 + 3n + 2 is denoted by _______ a. O (n) b. O (n2)* c. O (n3) 25. O (2n) is called _____ a. Linear b. Quadratic c. Cubic c. Both c. Both c. Both *

26. f (n) = O (g(n)) where g( n) is _____ a. Lower bound b. Upper bound* 27. f (n) = (g(n)) where g(n) is _______ a. Lower bound* b. Upper bound 28. f (n) = (g(n)) where g (n) is ______ a. Lower bound b. Upper bound 29. Ordered list is called ______ a. stack b. Queue 30. Stacks are sometimes referred to as a. LIFO* b. FIFO

c. Both * c. Both

31. In stacks, the operation are made ______ end a. Bottom b. Top * c. Both

2 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451

ALGORITHM & GRAPH THEORY 32. In stacks, the insertion is called ______ a. PUSH* b. POP c. Both 33. If Top = n-1 a. Empty 34. If Top = -1 a. Empty b. No elements b. No elements c. Full * c. Both a& b* c. Both c. Both

d. None d. Only one element d. None d. None d. None d. None d. r = f d. Tree* d. a, c* d. None d. Both b, c

35. In queues, the insertion possible at a. Front end b. Rear* 36. In queue, the deletion is possible at a. Front end* b. Rear

37. In queue, the front end is initialized to ______ a. f = 0* b. f = -1 c. f = n-1 38. In queue, the rear end is initialized to _____ a. r = 0 b. r = -1* c. r = n -1 39. A finite set of one or more nodes _____ a. Stack b. Queue c. Linked list 40. The maximum level of any node is _____ a. Length b. Breadth c. Height 41. A function call itself is _____ a. Recursion* b. Argument 42. Heap is a ______ a. Tree b. Binary Tree c. Both

c. complete binary tree*

43. In Heap Tree, the root nodes have always a. Small value b. +ve value c. ve value 44. A data structure known as ______ a. Stack b. Queue 45. Hashing is provide ______ searching a. Slow b. Fast* 46. Computational procedures ______ i. Defective ii. Effective a. Only i b. Only ii c. Heap

d. Large value* d. Hashing* d. None iv. Finite d. All

c. Medium iii. Infinite c. Both I and ii *

3 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451

ALGORITHM & GRAPH THEORY 47. Testing means _____ i. Debugging ii. Profiling a. Only I b. Only ii 48. S (p) = C +Sp, C means _____ i. Constant ii. Coefficient a. Only I b. Only ii

iii. Performance c. Both I and ii* iii. Co-relation c. Both I and ii*

iv. Measure d. None iv. Couple d. None

49. How many steps takes the following algorithm Algorithm sum (a, n) { S:= For I : = 1 to n do S : = S + a [i] ; Return S ; } a. 2n + 1 b. 2n +2 c. 2n + 3* 50. Match the following. 1. O 2. 3. a. (1, i), (2, ii), (3, iii) c. (1, iii), (2, ii), (3, i) (i) Omega (ii) Theta (iii) Oh

d. 2n

b. (1, ii), (2, i), (3, iii) d. (1, iii), (2, i), (3, ii)*

51. All algorithms must satisfy the following criteria Rearranging them. 1. Definiteness 2. Input 3. Effectiveness a. 1,2,3,4,5 b. 2,5,1,4,3* c. 4,2,1,3,5

4. Finiteness 5. Output d. 1,2,4,5,3

52. Re-arranging the following data 1. Analyze algorithm 2. Test a program 3. Validate algorithm 4. Devise algorithm a. 2, 3, 1, 4s b. 1, 2, 3, 4 c. 4, 3, 2, 1 d. 4, 3, 1, 2* 53. Match the following. 1. Sum 2. Subtraction 3. Multiplication 4. Division a. (1, iii), (2, i), (3, iv), (4, ii) c. (1, ii), (2, iii), (3, i), (4, iv) 54. Give an sequential order 1. O (n log n) 2. O (ns) 6. O (n) 7. O (n2) i. Cs ii. Cd iii. Ca iv. Cm b. (1, i), (2, ii), (3, iii), (4, iv) d. None 3. O (1) 4. O (log n) 5. O (2n)

4 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451

ALGORITHM & GRAPH THEORY a. 1, 2,3, 4, 5, 6, 7 c. 6, 2, 3, 5, 7, 1, 4 55. Find out the Heap Trees (i) 80 90 70 40 a. Only I
n +1 2

b. 7, 6, 5, 4, 3, 2, 1 d. 3, 4, 6, 1, 7, 2, 5*

(ii) 80 45

90 70 35 c. Only iii 50

(iii) 70 40 45 d. All*

90 80 50 30

b. Only ii

DIVIDE AND CONQUER 1. The splitting process is called _______ a. Divide b. Combine c. Both * 2. The condition of Divide and Conquer is _______ a. 1 <k n* b. 1 k n c. 1 k < n 3. Divide and Conquer is expressed by ______ a. Division b. Recursive* c. Function 4. T (n) = g(n), where n is a. Small* b. Large 5. If T (n) = T (1), where n is a. 0 b. 1* 6. T (n) = a T (n/b) + f (n) , where n is a. n = 0 b. n <1 7. Binary search condition is ai = a. 1 I n* b. 1 < I n c. Both c. 2 c. n = 1 c. 1 I < n

d. None d. None d. None d. Zero d. Infinite d. n >1* d. 1 < I < n

8. In binary search, middle element is ______ a. [n/2] b. [

n +1 2

]*

c. [n2/2]

d. None

9. For successful search ________ no. of comparison a. n * b. n + 1 c. n + 2 10. For unsuccessful search _____ no. of comparisons a. n b. n + 1* c. n + 2

d. n + 3 d. n + 3

5 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451

ALGORITHM & GRAPH THEORY

11. Merge means ______ a. Divide b. Combine* c. Both d. None 12. Which is the fastest sort a. Bubble sort b. Merge sort c. Quick sort* d. None 13. Match the following data 1. T (n) = g(n) 2. T (n) = T (n1) + T (n2) + ... T (n k) a. (1, i), (2, ii) b. (1, ii), (2, i) * 14. Match the following data. 1. T (n) = T (1) 2. T (n) = a, (r/b) + f (n) a. (1, i), (2, ii)* b. (1, ii), (2, i) 15. Match the following data 1. Successful search 2. Unsuccessful search i. otherwise ii. n is small c. Both a , b i. n = 1 ii. n>1 c. Both a, b i. 1 + 1/n ii. E / n+1 iii. a. (1, i), (2, ii)* b. (1, iii), (2, i)s
n +1 2

d. None

d. None

c. (2, iii), (1, ii)

d. None

16. Match the following data. . 1. T (n) = g (n) i. n > 1 2. T (n) = T (n1) + T (n2) + ..+ T (n2) ii. n small 3. T (n) = 2 T (n/2) + f (n) iii. n<1 4. T (n) = T (1) iv. n = 1 5. T (n) = a T (n/b) + f (n) v. Otherwise a. (1, ii), (2, iii), (3, i), (4, iv) b. (1, i), (2, ii), (3, iii), (4, iv), (5, v) c. (1, ii), (2, v), (3, iv), (4, iv) , (5, i)* d. None 17. Match the following data. 1. Best case 2. Worst case 3. Average case a. (1, i), (2, ii), (3, iii) (i). 2 (n-1) elements (ii). 3/2 (n-1) (iii). (n-1) b. (1, ii), (2, iii), (3, ii) c. (1, iii), (2, i), (3, ii)* d. None

18. Match the following data. 1. T (n) = T ([n/2]) + T ([n/2])+ 2 (i). n > 2 2. T (n) = 1 (ii). n = 2 3. T (n) = 0 (iii). n = 1 a.(1, i), (2, ii), (3, iii)* b. (1, iii), (2, ii), (3, i) c. (1, ii), (2, i), (3, iii) d. None Greedy Method 1. Subset of solutions satisfies some constraints is called ______ 6 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451

ALGORITHM & GRAPH THEORY a. feasible solution* b. optimal solution c. both d. None d. None d. None d. None d. None d. all* d. all

2. A feasible solution that either max or min object function ____ a. feasible solution b. optimal solution* c. both 3. Usually an obvious way to determine _______ solution a. feasible * b. optimal c. both 4. for determining the optimal solution ______ method a. Greedy* b. Greenburg c. Gassordon 5. Input is added to ______ solution (If input is feasible) a. feasible b. optimal c. partial* 6. In Greedy method, what is paradigm? a. select b. feasible c. union

7. ______selects an input from array and removes it a. select* b. feasible c. union

8. _____ id determines whether x can be induced into the solution veet a. select b. feasible* c. union d. all 9. _____ combines x with the solution and updates a. select b. feasible c. union* 10. Greedy method is also called as _____ a. order b. paradigm 11. MRT stands for ______ a. Meridian Time c. Minimum Rate time c. both a, b d. all d. ordering paradigm*

b. Mean Rate time d. Mean retrieval time* d. 1< I n

12. Each program I is a length l, condition is ______ a. 1 I n* b. 1< I < n c. 1 I < n 13. MRT = a. 1 I n t s* b.
1 n

1< I < n t s

c. n 1 I n t s

d. None

14. MRT is equivalent to minimizing d(l) = a. 1 j n 1 k j l Ik* b. 1 < j n 1 < k n l Ik 15. Increasing the d value by a. 1 j n l Ik + l j b. 1 < j n l Ik l j

c. Both a, b

d. None

c. Both a, b

d. None

7 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451

ALGORITHM & GRAPH THEORY

16. Total retrieval time (TD) _______ a. o < j m 1 d (l j ) b. o < j

m+1d

(l j )

c. o j

m1d

(l j )*

d. All

17. The general rule is that program I is stored on tape _______ a. T5 mod m b. TJ mod n c. T I mod n 18. Knapsack problem maximize is a. 1 I n p i x I * b. 1 I n w i x I c. Both

d. T I mod m* d. None d. O (n)* d. None d. All d. All

19. Knapsack algorithm required _______ time a. O (1) b. O (n log n) c. O (log n) 20. Greedy algorithm for sequencing unit time jobs with a. deadlines b. profits c. both a & b* 21. The worst case computing time for Js is a. O (n2) b. ( n2 ) c. (s)* 22. Js needs _____ amount of space for J a. O (s) b. (s) 23. Merging mean _____ a. Combine two files c. combine two sorted files c. (s)*

b. combine two or more files d. combine two or more sorted files*

24. Merging an n-record file and an m-record file requires possible a. n + m* b. n-m c. nm d. None 25. Match the following. 1. Storage on tapes 2. Knapsack problem 3. Optimal merge 4. shortlist path a. (1, I), (2, ii), (3, iii), (4, iv) c. (1, ii), (3, i), (4, iii), (2, iv) i. o (n log n) time ii. ( n2 ) time (a asymptotic) iii. ( n2 ) time iv. ( n ) time b. (1,iv), (2, iii), (3, ii), (4, i) d. (1, iv), (2, iii), (3, i), (4, ii)*

26. Find the optimal ordering for the optimal storage on tapes. N = 3, (l1, l2, l3) (5, 10, 3) a. 38 b. 41 c. 26

d. 29*

27. What is the shortest path in the following diagram: (form vertex 1 to 3) 45 8 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451

ALGORITHM & GRAPH THEORY

50 1 15 10 4 15 a. 25 b. 35 20 20 5 2 35

10 3 30 6 3 c. 45* d. 55

28. Find the feasible solutions for the following job N = 4, (P1, P2, P3, P4) = (100,10,15,15,27) & (d1, d2, d3, d4) = ( 2, 1 a. 100 & 27 b. 100 & 15 c. 100 & 10* d. All

29. Find the feasible solutions for the following knapsack N = 3, m = 20 (P1, P2, P3, P4) = (25, 24 ,15) And (W1, W2, W3) = (18, 15, 10) a. 10 b. 20 c. 30 d. None*

Dynamic Programming 1. This method is used for ______ a. One decision b. sequence of decision* c. Two d. None

2. Decision sequences containing subsequence that are suboptimal are not ____ a. Consider* b. Solution c. Not solution d. None 3. The total no. of different decision sequences to _______ a. Power b. Square c. Logarithmic 4. Dynamic programming algorithms often have a _____ a. Dynamic complexity b. Polynomial complexity* c. Both 5. Dynamic programming approach is ______ a. Detect recomputing b. Avoid recomputing value* c. Both 6. In multistage graph, the vertices are partitioned into a. K 2 b. K < 2 c. K > 2 7. The multistage graph is to find ______ a. Maximum cost b. Minimum cost* c. Both d. K 2* d. None d. Exponential* d. None d. None

8. Resource allocation problem saving ______ stages 9 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451

ALGORITHM & GRAPH THEORY a. r b. r-1 c. r + 1 * b. c (j, l) x cost (i + l, l) d. None c. c (j, l) + cost (i + l, l)

9. Cost (i, j) = min { a. C (j, l) cost (i+1, l)

10. All pair shortest paths A (I, j) = a. min { min 1 k n { A k 1 (I , k) + A k 1 (k, j) } cos (i, j)* b. min { min 1 k n { A k 1 (I , k) - A k 1 (k, j) } c. min { min 1 k n { A k 1 (I , k) * A k 1 (k, j) } d. None 11. All pair shortest path solved by ______ a. n b. n c.
n

d. None d. ( n4 ) d. None d. O (n 2 n) iii) Traveling salesman problems d. All*

12. In all pair shortest path, time for all paths a. (n) b. ( n2 ) c. ( n3 )* 13. Traveling salesman problem for finding ______ a. Minimum cost * b. Max c. Both 14. The main drawback of Dynamic problem is ______ a. O(n) b. O (2n) c. O (2n) 15. Dynamic programming applicable for i) Multistage graphs ii) All pair shortlist paths a. Only I b. Only ii c. Only iii 16. Match the following data. 1. for j: = n-1 to K step-1 do 2. for j : = 2 to -1 do p [j]: = d [ p (j-1)] 3. Total time a. (1, i), (2, ii), (3, iii)

i. ( |V| + |E| ) ii. ( |V| + |E| ) iii. (K) c. (1, iii), (2, ii), (3, i) iv) All d. None d. None d. Only iii*

b. (1, i), (2, iii), (3, ii)*

17. Drawback of dynamic program is ______ i) n ii) 2n iii) n.2n a. Only I b. Only ii c. Only iii* 18. In all pair shortest path iterated _____ time i) n ii) n iii) n a. Only I b. Only ii c. Both I & ii

Backtracking 1. Searching for a set of solutions ____ 10 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451

ALGORITHM & GRAPH THEORY a. Greedy Method b. Dynamic programming c. Backtracking* c. H. Lehmer c. 1950 * d. None

2. The name backtrack was first coined by a. D Lehmer b. D. H. Lehmer* 3. The name backtrack was in a. 1930 b. 1940

d. None d. 1960 d. None

4. The backtrack method, the desired solution to ______ tuples a. n * b. n 1 c. n + 1

5. A collection of problems whose solution are best done using ______ a. Greedy b. Dynamic c. Backtracking * d. All 6. In 8-Queens problem, solution space consist of ____ tuples 8 a. 8 x 8 b. 8 c. 8 ! d. None 7. Reduce the size of the space 8 to ______ 8 a. 8 x 8 b. 8 * c. 8 !
8

d. None

8. For an 8 x 8 chessboard there are _____ possible ways a. 64p8 b. 64c8 * c. 64 x 8 d. 8 x 64 9. The total roof nodes in the 8 queen static space is a. 69280 b. 69281 c. 69282 10. Sum of subsets are represented in ______ a. Binary* b. Decimal c. Octal 11. If n=4, then the tree having _____ no. of leaf nodes a. 2 x 4 b. 4 c. 2/4 12. In knapsack problem, m is denoted _______ a. Capacity* b. Weight c. Profit 13. Knapsack problem having ______ways a. 2 x n b. n ! c. 2! 14. The Backtracking method is applicable for ______ i) 8 queen problem ii) sum of subjects a. Only I b. Only ii c. Only iii D. 2n iii) knapsack problem d. All* d. 24* d. None d. None d. Hexadecimal

15. Backtracking having ______ constraints I) Explicit ii) Implicit iii) Equal a. Only I b. Only ii c. Both I & ii*

d. None

11 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451

ALGORITHM & GRAPH THEORY

16. n = 4, m = 3 and (W1, W2, W3, W4) = (11, 13, 24, 7) having ______ subset i) 1 ii) 2 iii) (11, 37), (24, 7) a. Only I b. Only ii c. Both ii & iii * d. Only iii 17. The solution of 8-queen problem is a. (2, 7, 1, 4, 3, 5) c. (4, 6, 8, 2, 7, 1, 5, 3) b. (1, 4, 2, 6, 8, 7, 5) d. (4, 6, 8, 2, 7, 1, 3, 5)*

BRANCH AND BOUND 1. Branch and bound refers to ______ a. one state space b. two sate space c. Three 2. Bounding functions are used for to avoid ______ a. Tree b. Subtree* c. Both a & b 3. a. 4. a. BFS (Breads First Search ) like ______ FIFO* b. LIFO c. Both a & b DFS (Depth First Search ) like _____ FIFO b. LIFO* c. Both a & b

d. All state space* d. None d. None d. None d. Branch and bound* d. Branch and bound*

5. _____ technique is sure any problem a. Greedy b. Dynamic program c. backtracking 6. The Drawback of Dynamic program solved by ______ a. Greedy b. Dynamic program c. backtracking 7. Branch and bound used for i) Knapsack problem a. Only I b. Only ii
5 3 9 16

ii) Traveling salesman c. Both I & ii*

30 10 11 16 4 2 2 4 18 3 7 16 1 0 2 0*

d. None

8. The reduced cost Matrix of the following cost Matrix is _______

20 5 6 4

a.

n(n + 2) 2

b.

10 17 0 12 11 2 0 3 0 15 3 12 11 0 0 12

c. No solution d. None 9. What is the minimum cost of the following cost Matrix. 12 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451

ALGORITHM & GRAPH THEORY

5 3 9 16 20 5 6 4 30 10 11 16 4 2 2 4 18 3 7 16

a. 25 *

b. 35

c. 52

d. 53

Additional Features 1. _____ is the lower bound on time for any algorithm a. f(n) = O (g(n)) b. f(n) = (g(n))* c. (n) = (g(n)) 2. In general, _____ is the lower bound for any algorithm a. O (n) b. (n) * c. (n)

d. None d. None d. None

3. _____ trees are used for comparison for searching & sorting a. Tree b. Binary tree* c. Complete binary tree 4. The time complexity for searching FIND (n) is a. log n b. log n 2 c. log n+1 5. The time complexity for sorting T (n) is a. log n !* b. log n+1 c. log n 6. Cooks theorem sates that p = a. N b. P c. NP*

d. log n3 d. None d. None

7. A k-clique in a graph in a graph G is a complete sub-graph of G with ______ vertices a. K * b. 5 c. 2 d. All 8. K-clique problem is a. NP hard b. NP complete 9. Approximate algorithm for a. NP complete b. NP hard* 10. E approximate algorithms for ____ a. NP complete b. NP hard c. Both c. Constant c. Constant* d. None d. All d. None d. None d. O (|V| _ |E|) d. O (n4)

11. _____ algorithm for p |F (l) F (l) | K (K is constant) a. Approximate b. E- approximate* c. Both 12. The time complexity of planar graph colouring is _____ a. O (|V|) b. O (|E|) c. O (|V| + |E|) * 13. _____ time is needed to obtain the storage assignment a. O (n)* b. O (n2) c. O (n3)

13 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451

ALGORITHM & GRAPH THEORY

14. Bin packing for finding the_______ a. Constant bins b. Minimum bins* 15. Planar graph coloring is an ______ algorithm a. NP complete b. NP hard* c. Both 16. Bin packing is _____ algorithm a. NP complete b. NP hard 17. Cluster having ______ types i) Polynomial a. Only I b. Only ii c. Both

c. Maximum bins

d. All

d. None d. None

ii) Non -polynomial c. both I & ii*

d. None

18. Match the following. 1. Traveling salesman i. O (n2 2n) 2. Knapsack problem ii. O (2 n/2) a. (1, i), (2, ii) b. (1, ii), (2,i) c. Both * 19. Which program are disk1 & disk2 L = 10, n = 4 (l1, l2, l3, l4) = (2, 3, 4, 5) i) 1 & 2 on disk1 & 3 on disk2 ii) 1 & 3 on disk1 & 2 on disk2 iii) 1 & 4 on disk1 & others on disk2 a. Only I b. Only ii c. Both I & ii

d. None

d. Only iii*

20. What is the finishing time M = 3, n = 2, (t1, t2, t3, t4, t5, t6) = (8, 7, 6, 5, 4, 3) a. 10 b. 11* c. 12 d. None

21. Arrange the following NP hard problems A/c to text 1. Bin packing 2. Planar graph coloring 3. t approximation 4. Polynomial time approx a. 1, 2, 3, 4 b. 4, 3, 2, 1 c. 2, 1, 4, 3 d. 2, 3, 1, 4*

Graphs 1. A set of vertices and Edges is called _______ a. Graph* b. Planar c. Euler 2. Diagraph itself is referred to as a. Planar b. Graph* c. Euler

d. None d. None

3. An edge having the same vertex as its end vertices is called 14 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451

ALGORITHM & GRAPH THEORY a. Double loop b. triple bond c. Self loop* d. None

4. Allows more than one edge associated with a giver pair of vertices a. Self edges b. Edges c. Cross edges d. Parallel edges* 5. A graph has no self-loop or parallel edger is called a. Simple graph* b. Multiple graph c. Non-simple d. None

6. A graph has every edge (a b) there is also an edge (b, a) is called _____ a. Asymmetric b. Symmetric* c. Diagraph d. None 7. Every vertex is joined to every other vertex is called ______ a. Cycle b. Path c. Complete* 8. a walk is also referred to as an edge train or a chain _______ a. Cycle b. Complete c. Bipartite 9. In path, we have _____ types a. 2* b. 3 c. 4 d. Bipartite d. Path* d. None d. None d. None
n( n 1) 3

10. A closed walk, no vertex appear more than once a. Cycle b. Circuit* c. Path 11. The no. of edges on a vertex is called ______ a. Indegree b. Outdegree c. Degree* 12. A complete graph has no. of edges is ______ a. n(n + 1) b. n(n + 2) c. n(n + 1)
2
2
3

d.

13. At least one path between every pair of vertex in G _____ a. Connectivity* b. Relation c. Conjunction 14. An edge whose removal disconnects the graph ______ a. Path b. Bridge* c. Block 15. The largest non-separable sub graphs is called a. Path b. Bridge c. Block* 16. A connected graph without any circuits is ______ a. Path b. Bridge c. Block 17. The sorting of Tree is called _______ a. Decision Tree b. Sorting Tree 18. A tree with n vertices has _____ edges c. Both a & b*

d. None d. None d. None d. Tree* d. None

15 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451

ALGORITHM & GRAPH THEORY a. n b,. n -1 * c. n-2 d. n 3 d. Hamilton d. None d. None d. 1736* d. None d. None d. None d. Circuit d. None d. None d. None

19. All the vertices and all the edges of g are in G ______ a. Graph b. sub-graph* c. Planar 20. If T is a sub-graph of G and T contain all the vertices a. Tree b. Spanning Tree* c. Sub-Tree 21. A collection of Trees is called _____ a. Trees b. Blocks 22. Graph theory was born in _____ a. 1733 b. 1836 c. Forest* c. 1833

23. A closed walk running through every edge of G exactly a. Eater line b. Eater path c. Both a & b 24. A Graph t6hat consist of an Eater line is called a. Eater graph* b. Eater line c. Eater path 25. All vertices of G are of even degree is called _____ a. Eater graph* b. Hamilton c. Planar 26. All vertices of G are of odd degree (at least one vertex also) a. Eater graph b. Hamilton* c. Planar 27. A Graph can be decomposed into circuits _____ a. Eater graph* b. Hamilton c. Planar 28. A closed walk running through every vertex of G exactly or a. Eater circuit b. Hamilton circuit* c. circuit 29. Remove any one edge from a Hamiltonian circuit. It become a. Hamiltonian path* b. Eater path c. Both a & b 30. No. of Hamiltonian circuits in a complete graph with n vertices a.
( n + 1)! 2

b. (n 1)
2

c. (n 1)!
2

d. None

31. A Graph having without crossovers ______ a. Eater b. Hamiltonian c. Planar* 32. The complete graphs of five vertices is ______ a. Planar b. None of the above-planar* 33. A planar graph with n vertices, edges has _____ regions

d. None c. Eater d. Hamilton

16 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451

ALGORITHM & GRAPH THEORY a. e n + 2* b. e + n + 2 c. e n 2 c. Even d. None d. Odd

34. The painting of vertex is called ______ a. Painting number b. chromatic*

35. The vertices of every planar graph can be properly colored with a. 3 color b. 4 color c. 5 color* d. None 36. Representation of Graph we have _____ types a. 1 b. 2 c. 3* 37. The minimum length between two vertices is ______ a. Shortest path b. Open path c. Closed path 38. Which algorithm for labeling the vertices ______ a. Kruskal b. Kurtosis c. Dijkstra* 39. Mentioned the length of the edge is called ______ a. vertex label b. Edge label* c. Both 40. Mentioned the length of all the edges is called ______ a. Graph b. Planar c. Non -weighted 41. Which algorithm for planarity _______ a. Kuratowski b. Dijskstra 42. DETECTION for planarity is ______ a. DFS b. BFS 43. DFS stands for a. Depth First Search c. Both c. Both* c. Both d. 4 d. None d. None d. None d. Weighted Graph* d. None d. None d. None d. None d. None d. None d. Directed d. None

b. Breath First Search

44. Which algorithm used for finding the DFS a. kuratowski b. Disjkstra c. DES * 45. Circuit-path Decomposition for testing of ______ a. Planarity* b. Eater c. Hamiltonian 46. Which algorithm to find a minimal spanning Tree a. Kruskals* b. Kuratowski c. Dijskstra 47. A sub-Tree having all the vertices of Tree T is called a. Tree b. Sub-Tree c. Spanning Tree* 48. Every Graph itself a _______ a. Sub-graph * b. Spanning c. Both

17 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451

ALGORITHM & GRAPH THEORY 49. Asymmetric diagraph is also called as ______ a. Tournament b. Complete tournament 50. Match the following. 1. Indegree 2. Outdegree a. (1, i), (2, ii)* 51. Match the following. 1. Indegree 2. Outdegree 3. Degree a. (1, i), (2, ii), (3, iii) 52. Match the following. 1. Graph 2. Vertex 3. Edge a. (1, i), (2, ii), (3, iii)* (i) Towards vertex (ii) Outwards vertex b. (1, ii), (2, i) (i) dt (v) (ii) d (v) (iii) d (v) b. (1, iii), (2, ii), (3, i) c. (1, i), (2, iii), (3, ii)* d. None c. Both d. None

c. Both a, b*

d. None

(i) Linear complex, 1 complex, 1 dimensional (ii) node, function, point, o cell, o simplex (iii) branch, line, element, 1 cell, arc, a- som b. (1, iii), (2, ii), (3, i) c. (1, i), (2, iii), (3, ii) d. None

53. Match the following. 1. Vo = Vn (i) Initial vertex 2. Vo = Vn (ii) Closed path 3. Vo (iii) Final vertex 4. Vn (iv) Open path a. (1, i), (2, ii), (3, iii), (4, iv) b. (1, ii), (2, iv), (3, i), (4, iii)* 54. Hamiltonian path means (i) Exactly 1 vertex (ii) Exactly 1 edge (iii) Exactly 1 vertex

c. None

a. Only I* b. Only ii c. Only I and ii d. All 55. The no. of possible choices Hamiltonian circuits in a Graph (i) (n 1)! (ii) n 1 (iii) (n 1)! /2 a. Only I* b. Only ii c. Both I and ii d. None

56. Chromatic number of bipartite Graph is (i) depend on no. of vertices (ii) only 2 a. Only I b. Only ii*

(iii) 1 less no. of vertices d. None

c. Both I and ii (i) Adjacent Matrix

57. Match the following. 1. Vertex edge

18 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451

ALGORITHM & GRAPH THEORY 2. Vertex vertex a. (1, i), (2, ii) (ii) Incident Matrix b. (1, ii), (2, i)* c. Both d. None

58. Detection of planarity (i) DFS (ii) BFSW a. Only I b. Only ii

(iii) Both I and ii c. Only iii* d All

59. Match the following. 1. Simple Graph 2. Non simple 3. Multiple 4. Cycle a. (1, i), (2, ii), (3, iii), (4, iv) c. (1, iv), (2, iii), (3, ii), (4, i) 60. Match the following data 1. Cycle 2. Wheat 3. Null 4. b partite 5. Complete

(i) Vt = Vn (ii) having multiple edges between two (iii) self loop (iv) without self loop b. (1, iv), (2, iii), (3, ii), (4, i) d. None (i) (ii) : : (iii) (iv)

a. (1, iii), (2, iv), (3, ii), (4, v), (5, i)* c. (1, ii), (2, i), (3, iii), (4, iv), (5, v) 61. Match the following. 1. Complete graph 2. Tree 3. b : partite Graph K mn a. (1, i), (2, ii), (3, iii)

b. (1, i), (2, ii), (3, iii), (4, iv), (5, v) d. None

(i) mn edges (ii) n (n -1 ) /2 edges (iii) (n 1) edges b. (1, iii), (2, ii), (3, i) (i) (p 2) (ii) )p + 2) (iii) 2 n (iv) e n + 2 b. (1,i), (2, ii0, (3, iii), (4, iv) d. All c. (1, ii), (2, iii), (3, i)* d. None

62. Match the following data 1. Eaters Formula 2. Sum of all angles 3. Sum of interior angles 4. Sum f exterior angles a. (1, iv), (2, iii), (3, i), (4, ii)* c. (I, i), (2, iv), (3, ii), (4, iii)

19 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451

ALGORITHM & GRAPH THEORY

63. Arranging the following data in sequential 1. Triangle is 3 chromatic 2. isolate vertex is 1 chromatic 3. one or more vertex is 2 chromatic a. 1, 2, 3 b. 3, 2, 1 c. 2, 1, 3 (i) 5! (ii) 6 (iii) 24 (iv) 48 (v) 0 b. (1, v), (2, iv), (3, ii), (4, iv), (5, i) d. None d. 2, 3, 1*

64. Match the chromatic polynomial 1. C1 2. C2 3. C3 4. C4 5. C5 a. (1, i), (2, ii), (3, iii), (4, iv), (5, v) c. (1, v), (2, iv), (3, iii), (4, ii),(5, i)

65. Incident Matrix of the following graph V1 E3

0 0 1 1 0 1 1 0 0

E1 V3

V2 E2
0 0 1 1 0 1 1 0 0

a.

b.

1 0 0 0 1 0 0 0 1

c.

d. None*

66. What is the Minimal path in the above Diagram a. (b, c), (d, f), (a, g), (c, d), (c, e), (a, b), (f, h) b. (b, c), (d, f), (a, g), (c, d), (c, e),(a, b), (g, h) c. Both a and b* d. None 67. What is the Minimum cost of the following Diagram? a 5 15 g 15 h a. 25 b. 52* 18 4 15 f 15 c. 225 d 5 3 c 5 e d. 252 15 b

20 Bhargavi Institute of Management and Technology, KPHB, Ph:-040-23068451