**1)Void pointer can point to which type of objects?**

a)int

b)float

c)double

d)all of the mentioned

e)None of these

**2)The Knapsack problem is an example of ____________**

a)Greedy algorithm

b)2D dynamic programming

c)1D dynamic programming

d)Divide and conquer

e)None of these

**3)Which of the following methods can be used to solve the Knapsack problem?**

a)Brute force algorithm

b)Recursion

c)Dynamic programming

d)All of the mentioned

e)None of these

**4)What is the time complexity of the brute force algorithm used to solve the Knapsack problem?**

a)O(n)

b)O(n!)

c)O(2n)

d)O(n3)

e)None of these

**5)What is the time complexity of the above dynamic programming implementation of the Knapsack problem with n items and a maximum weight of W?**

a)O(n)

b)O(n + w)

c)O(nW)

d)O(n2)

e)None of these

**6)What is the space complexity of the above dynamic programming implementation of the Knapsack problem?**

a)O(nW)

b)O(n + w)

c)O(n)

d)O(n2)

e)None of these

**7)What is the time complexity of the recursive implementation used to find the nth fibonacci term?**

a)O(1)

b)O(n2)

c)O(n!)

d)Exponential

e)None of these

**8)Consider the strings “PQRSTPQRS” and “PRATPBRQRPS”. What is the length of the longest common subsequence?**

a)9

b)8

c)7

d)6

e)None of these

**9)Which of the following application makes use of a circular linked list?**

a)Undo operation in a text editor

b)Recursive function calls

c)Allocating CPU to resources

d)All of the mentioned

e)None of these

**10)Binary Decision Diagram is a type of __________**

a)Multigraph

b)Cyclic Graph

c)Directed Acyclic Graph

d)Directed Acyclic Word Graph

e)None of these

**Answers:**

1)d

2)b

3)d

4)c

5)c

6)a

7)d

8)c

9)c

10)c