1. The simplest type of data structure in the choices belowis

a. Multidimensional array

b. Three dimensional array

c. Linear array

d. Two dimensional array

2. ................... level is where the model becomescompatible executable code

a. Application level

b. Abstract level

c. implementation level

d. all of the above

3. Which of the following are the operations applicable anprimitive data structures?

Select one:

a. Destroy

b. Traverse

c. Create

d. Update

4. A linear list in which each mode has pointers to point to thepredecessor and successors nodes is called as................................

Select one:

a. Circular Linked List

b. Linear Linked List

c. Singly Linked List

d. Doubly Linked List

5. Which of the following is true about the characteristics ofabstract data types?

i) It exports a type.

ii) It exports a set of operations

Select one:

a. i. True, ii. True

b. i.True, ii. False

c. i. False, ii. True

d. i. False, ii. False

6. which is not the application(s) of stack?

Select one:

a. Evaluation of arithmetic expressions

b. Large number Arithmetic

c. Represent people waiting for service in a bank

d. Function Calls

7. Inserting an item into the stack when stack is not full iscalled................................ Operation and deletion ofitem form the stack, when stack is not empty iscalled......................... Operation.

Select one:

a. insert, delete

b. pop, push

c. delete, insert

d. push, pop

8. The disadvantage in using a circular linked listis............................................

Select one:

a. Time consuming

b. It is possible to get inot infinite loop

c. Requires more memory space

d. Last node points to first node.

9. Which of the following is not an application of stack?

Select one:

a. solving tower of Hanoi problem

b. finding lowest common multiple of prime numbers

c. infix to postfix conversion

d. finding factorial

10......................... is a pile in which items are addedat one end and removed from the other.

Select one:

a. Array

b. Queue

c. Stack

d. List