1. ---- collections of data which are fixed in size when the programme is compiled.
Ans=Static Data Structure.

2. The stack is usually implemented with two basic operations known as -----
Ans=\"push\"and\"pop\".

3. Hash tree is generalization of ----
Ans=Hash List.

4. A ----- is a linear data structure in which all insertion and deletions of data are made only at one end of the stack.
Ans=Stack.

5. Which of these exception handlers cannot be type parameterized?
Ans=All of the above.

6. A queue is referred to as a ----
Ans=First-In-First-Out.

7. What is meant by the term generics
Ans=Parameterized Types.

8. A stack is referred to as a ---
Ans=Last-In-First-Out.

9. A ---- is a searchable container
Ans=Hash Table

10. The ---- method does the actual work of counting the words in the input file.
Ans=Wordcounter.