Thursday, 18 February 2016

Vocational Teacher in Computer Science (98/2013) Solved Paper 26/07/2013 - Part 3

21.       In algorithms O(n2) is called:
(A) linear           (B) exponential
(C) quadratic    (D) none of these
Answer: C
22.       Control abstraction is a term related to:
(A) dynamic programming     (B) greedy
(C) backtrack                            (D) none of these
Answer: D
23.       Performance measure of an algorithm is concerned with obtaining the space and ............. requirement.
(A) Complexity             (B) Time
(C) Direction                 (D) None of these
Answer: B
24.       The name backtrack was first coined by:
(A) D.H. Lehmer           (B) R.J. Waker
(C) S. Golomb              (D) L. Baumest
Answer: A
25.       In a state space tree a node which has been generated and all of whose children have not yet been generated is called:
(A) dead node              (B) leaf node
(C) live node                 (D) none of these
Answer: C

26.       Depth first node generation with bounding function is called:
(A) Knapsack   (B) Divide and conquer
(C) Greedy        (D) Backtracking
Answer: D
27.       The number of triominoes to be used in a defective chess board:
(A) (22k-1)/3                   (B) (22k-1)
(C) (23k-1)/3                   (D) none of these
Answer: A
28.       The defective chess board problem can be elegantly solved using:
(A) BFS                                     (B) Divide and conquer
(C) Hamiltonian circuit                       (D) None of these
Answer: B
29.       The time required by the Prim’s algorithm is:
(A) O(n)             (B) O(2n)
(C) O(n2)            (D) none of these
Answer: C
30.    If a binary search tree represents n identifiers, then there will be exactly ................
(A) n-1   (B) n+1
(C) n       (D) none of these
Answer: D



0 comments:

Post a Comment