21. Which of the following can be used as a criterion for classification of data structures used in language processing ?
a. nature of a data structure
b. purpose of a data structure
c. lifetime of a data structure
d. all of the above.
Answer: (d).all of the above.

22. The OS of a computer may periodically collect all the free memory space to form contiguous block of free space. This is called
a. Concatenation
b. Garbage collection
c. Collision
d. Dynamic Memory Allocation
Answer: (b).Garbage collection

23. A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a
a. queue
b. stack
c. tree
d. linked list
Answer: (a).queue

24. ___________ is neither an algorithm nor a program.
a. Computing
b. Pseudo code
c. Computer science
d. None of the above
Answer: (b).Pseudo code

25. The concepts in programming languages are essential knowledge to anyone who wants to become skilled in_________________.
a. Computer programming
b. Data structures
c. Decoding
d. None of the above
Answer: (a).Computer programming

26. Which model is used to organize data in the main memory is called data structure?
a. Logical
b. Mathematical
c. Debugging
d. All of the above
Answer: (d).All of the above

27. A ________is a linear list of data elements in which the addition of a new element or the deletion of an element occurs only at one end.
a. Top
b. Push and pop
c. Stack
d. None of the above
Answer: (c).Stack

28. The hierarchical relationship between data elements can be easily represented using a nonlinear data structure called_______.
a. Tree
b. Root node
c. Child nodes
d. None of the above
Answer: (a).Tree

29. What is the process of finding the location of a given data element in the data structure called?
a. Deletion
b. Insertion
c. Traversing
d. Searching
Answer: (d).Searching

30. What plays an important role in programming?
a. Data
b. Computer
c. Information
d. None of the above
Answer: (a).Data

Page 3 of 16