**1)Disadvantage of dynamic RAM over static RAM is**

a)Higher power consumption

b)Variable speed

c)Need to refresh the capacitor charge every once in two milli second

d)Lower packing density

e)None of these

**2)What is a hash table?**

a)A structure that maps values to keys

b)A structure that maps keys to values

c)A structure used for storage

d)A structure used to implement stack and queue

e)None of these

**3)If several elements are competing for the same bucket in the hash table, what is it called?**

a)Diffusion

b)Replication

c)Collision

d)Variable

e)None of these

**4)Pancake Sorting appears in which of the following?**

a)Frequency Scaling

b)Storage Virtualization

c)Parallel Processing

d)Neural Networking

e)None of these

**5)When we realize a specific implementation of a pancake algorithm, every move when we find the greatest of the sized array and flipping can be modeled through __________**

a)Combinations

b)Exponential functions

c)Logarithmic functions

d)Permutations

e)None of these

**6)The Pancake Problems (1975, 1979, 1973) did NOT involve which of the following people?**

a)Bill Gates

b)Jacob Goodman

c)Christos Papadimitriou

d)John Goodman

e)None of these

**7)A dynamic RAM consists of**

a)6 transistors

b)2 transistors and 2 capacitors

c)1 transistor and 1 capacitor

d)4 transistors

e)None of these

**8) In a virtual memory system the address space specified by the address lines of the CPU must be ———–than the physical memory size and ———–than the secondary storage size.**

a)smaller, smaller

b)larger, larger

c)smaller, larger

d)larger, smaller

e)None of these

**9)Which of the following is NOT a Catalan number?**

a)1

b)5

c)14

d)43

e)None of these

**10)Which of the following methods can be used to find the nth Catalan number?**

a)Recursion

b)Binomial coefficients

c)Dynamic programming

d)All of the mentioned

e)None of these

**Answers:**

1)c

2)b

3)c

4)c

5)d

6)d

7)c

8)d

9)d

10)d