data structure

1. 1.A data structure in which linear sequence is maintained by pointers is known as
(A) Array
(B) Stack
(C) Linked list
(D) Pointer-based data structure
2. Which of the following data structure works on the principle of First Come First
Serve?
(A) Priority queue
(B) Heap
(C) Stack
(D) Queue
3. A queue where all elements have equal priority is a
(A) ILFO data structure
(B) LILO data structure
(C) FIFO data structure
(D) LIFO data structure
4. A file that is only read by a program is known as ____
(A) Input file
(B) Temporary file
(C) Work file
(D) Input/output file
5. Which of the following operations is a dictionary operation?
(A) Search
(B) Delete
(C) Insert
(D) All of above
6. Each attribute of an entity has a defined set of values. This set of values is called a
(A) Mapping
(B) Entity set
(C) Domain
(D) Range
7. A graph in which all vertices have equal degree is known as ____
(A) Complete graph
(B) Regular graph
(C) Multi graph
(D) Simple graph
8. Which of the following data structure can be used to represent many-to-many relation?

2. (A) B-tree
(B) Binary tree
(C) Graph
D) All of above
9. Which of the following is not a linear data structure?
(A) Stack
(B) Queue
(C) Linked list
(D) Binary tree
10. Which of the following data structure permits insertion and deletion operations only on
one end of the structure?
(A) Linked list
(B) Array
(C) Stack
(D) Queue