1. In data structure, inserting a data element will be added only at the end of the given set of data.
True False
CORRECT ANSWER: B
2. Choosing a data representation and choosing a suitable are part of _____________________ of the Abstract Data Type.
a. Operation b. Collection c. Implementation d. Selection
CORRECT ANSWER: C
3. Only values can be stored in an array
A. True B. False
CORRECT ANSWER: B
4. The elements in a linked list are linked using a pointers.
A. True B. False
CORRECT ANSWER: A
5. A mathematical-model with a collection of operations defined on that model is called
a. Abstraction b. Data Structure
c. Abstract Data Type d. Algorithm
CORRECT ANSWER: C
6. Linked List is
a. data structure wherein 1st data elements is linked to another ADT
b. data structure wherein the elements are not stored in adjacent memory locations.
c. is sequential list of data elements linked to the parallel memory locations.
d. Is an application of First IN First OUT
CORRECT ANSWER: B
7. System defined data types is also called
a. Internal data types b. Basic data types
c. Simple data types d. Primitive data types
CORRECT ANSWER: D
8. Last In First Out is an application of a Stack data structure.
A. True B. False
CORRECT ANSWER: A
9 .Each kind of collection ADT is equipped with its own characteristic operations
A. True B. False
CORRECT ANSWER: A
10. A data structure where data elements are paired with the index of the data element.
a. Linked List b. Hash Table
c. Array C d. Binary Tree
CORRECT ANSWER: C
QUIZ
1. The elements of a linked list are linked using
a. Pointer A
b. multiple atorc. variabled. single indicator
CORRECT ANSWER: A
2. In deletion operation is removing an existing data element
A. True B. False
CORRECT ANSWER: A
3. A queue is a/an
a. Binary Tree b. LIFO List c. FIFO List d. Indexed Array
CORRECT ANSWER: C
4. Reversing a word is an application of a.
