Tag: Fundamentals of Computer Algorithms

(A) v edges
(B) v – e + 5 edges
(C) v + e edges
(D) None of these

(A) Lists require less space than matrices but take longer to find the weight of an edge (v1,v2)
(B) Lists require less space than matrices and they are faster to find the weight of an edge (v1,v2)
(C) Lists require more space than matrices and they take longer to find the weight of an edge (v1,v2)
(D) Lists require more space than matrices but are faster to find the weight of an edge (v1,v2)

(A) True
(B) False
(C) NA
(D) NA

(A) 2^(h+1) – 1
(B) 2 * (h+1) – 1
(C) 2 * (h+1)
(D) ((h+1) ^ 2) – 1

(A) T(n)
(B) T(1/1+n)
(C) T(n/2)
(D) T((n/2) +n)

(A) Smaller Sub Problems
(B) Pivot
(C) Sieve
(D) Solutions

(A) O(1)
(B) O(n^2)
(C) O(n)
(D) O(n log n)

(A) True
(B) False
(C) NA
(D) NA