- Which of the following data structure is non-linear type?
A) Strings
B) Lists
C) Stacks
D) Tree
Ans:- (D) Tree
2. Which of the following data structure is linear type?
A) Array
B) Tree
C) Graphs
D) Hierarchy
Ans:- (A) Array
3. The logical or mathematical model of a particular organization of data is called a ………
A) Data structure
B) Data arrangement
C) Data configuration
D) Data formation
Ans:- (A) Data structure
4. The simplest type of data structure is ………………
A) Multidimensional array
B) Linear array
C) Two dimensional array
D) Three dimensional array
Ans:- (B) Linear array
5. Linear arrays are also called ……………….
A) Straight line array
B) One-dimensional array
C) Vertical array
D) Horizontal array
Ans:- (B) One-dimensional array
6. Arrays are best data structures …………
A) For relatively permanent collections of data.
B) For the size of the structure and the data in the structure are constantly changing
C) For both of above situation
D) For none of the above
Ans:- (A) For relatively permanent collections of data.
7. Which of the following data structures are indexed structures?
A) Linear arrays
B) Linked lists
C) Graphs
D) Trees
Ans:- (A) Linear arrays
8. node in a linked list has two pairs of ………….. and ……………….
A) Link field and information field
B) Link field and avail field
C) Avail field and information field
D) Address field and link field
Ans:- (A) Link field and information field
9. A …………………… does not keep track of address of every element in the list.
A) Stack
B) String
C) Linear array
D) Queue
Ans:- (C) Linear array
10. When does top value of the stack changes?
A) Before deletion
B) While checking underflow
C) At the time of deletion
D) After deletion
Ans:- (D) After deletion
11. Which of the following data structure is non-linear type?
A) Strings
B) Lists
C) Stacks
D) Tree
Ans:- (D) Tree
12. Which of the following data structure is linear type?
A) Array
B) Tree
C) Graphs
D) Hierarchy
Ans:- (A) Array
13. The logical or mathematical model of a particular organization of data is called a ………
A) Data structure
B) Data arrangement
C) Data configuration
D) Data formation
Ans:- (A) Data structure
14. The simplest type of data structure is ………………
A) Multidimensional array
B) Linear array
C) Two dimensional array
D) Three dimensional array
Ans:- (B) Linear array
15. Linear arrays are also called ……………….
A) Straight line array
B) One-dimensional array
C) Vertical array
D) Horizontal array
Ans:- (B) One-dimensional array
16. Arrays are best data structures …………
A) For relatively permanent collections of data.
B) For the size of the structure and the data in the structure are constantly changing
C) For both of above situation
D) For none of the above
Ans:- (A) For relatively permanent collections of data.
17. Which of the following data structures are indexed structures?
A) Linear arrays
B) Linked lists
C) Graphs
D) Trees
Ans:- (A) Linear arrays
18. Each node in a linked list has two pairs of ………….. and ……………….
A) Link field and information field
B) Link field and avail field
C) Avail field and information field
D) Address field and link field
Ans:- (A) Link field and information field
19. A …………………… does not keep track of address of every element in the list.
A) Stack
B) String
C) Linear array
D) Queue
Ans:- (C) Linear array
20. When does top value of the stack changes?
A) Before deletion
B) While checking underflow
C) At the time of deletion
D) After deletion
Ans:- (D) After deletion
21. Arrays are best data structures
A) for relatively permanent collections of data
B) for the size of the structure and the data in the structure are constantly changing
C) for both of above situation
D) for none of above situation
Ans:- (A) for relatively permanent collections of data
22. Which of the following data structure is not linear data structure?
A) Arrays
B) Linked lists
C) Both of the above
D) None of the above
Ans:- (D) None of the above
23. The disadvantage in using a circular linked list is …………………….
A) It is possible to get into infinite loop.
B) Last node points to first node.
C) Time consuming
D) Requires more memory space
Ans:- (A) It is possible to get into infinite loop.
24. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
A) Singly Linked List
B) Circular Linked List
C) Doubly Linked List
D) Linear Linked List
Ans:- (C) Doubly Linked List
25. A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
A) circular queue
B) random of queue
C) priority
D) dequeue
Ans:- (D) dequeue
26. In a priority queue, insertion and deletion takes place at ………………
A) front, rear end
B) only at rear end
C) only at front end
D) any position
Ans:- (D) any position
27. The time complexity of quick sort is …………..
A) O(n)
B) O(n2)
C) O(n log n)
D) O(log n )
Ans:- (C) O(n log n)
28. Which of the following is an application of stack?
A) finding factorial
B) tower of Hanoi
C) infix to postfix conversion
D) all of the above
Ans:- (D) all of the above
29. The data structure which is one ended is ………………
A) queue
B) stack
C) tree
D) graph
Ans:- (B) stack
30. A list which displays the relationship of adjacency between elements is said to be
A) queue
B) stack
C) tree
D) graph
Ans:- (A) queue
