# Important Data structure and algorithm Set 2

Read important Data structure and algorithm MCQS For Exam.These General Knowledge Mcqs Contain  of World technology,  Science & Literature, events Mcqs, Data structure and algorithm  Mcqs and International Organizations. These general knowledge questions are very important for all type of exams.

##### Note: The bold option is the right answer for the given MCQ’S:

1.Which of the following data structures are indexed structures?
A.Linear arrays
B. Linked lists
C. Queue
D. Stack

2. Which of the following data structure store the homogeneous data elements?

A. Arrays
B. Records
C. Pointers
D. Lists

3. When new data are to be inserted into a data structure, but there is not available space; this situation is usually called ….

A. Underflow
B. overflow
C. houseful
D. saturated

4. A data structure where elements can be added or removed at either end but not in the middle is called …
A. linked lists
B. stacks
C. queues
D. dequeue

5. Operations on a data structure may be …..
A. creation
B. destruction
C. selection
D. all of the above

6. The way in which the data item or items are logically related defines …..
A. storage structure
B. data structure
C. data relationship
D. data operation

7. Which of the following are the operations applicable an primitive data structures?
A. create
B. destroy
C. update
D. all of the above

8. The use of pointers to refer elements of a data structure in which elements are logically adjacent is ….
A. pointers
B. linked allocation
C. stack
D. queue

9. 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 non of above situation

10. Which of the following statement is false?
A. Arrays are dense lists and static data structure.
B. Data elements in linked list need not be stored in adjacent space in memory
C. Pointers store the next data element of a list.

D. Linked lists are collection of the nodes that contain information part and next pointer.

11. Which of the following data structure is non-linear type?
A) Strings
B) Lists
C) Stacks
D) Tree

12. Which of the following data structure is linear type?
A) Array
B) Tree
C) Graphs
D) Hierarchy

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

14. The simplest type of data structure is ………………
A) Multidimensional array
B) Linear array
C) Two dimensional array
D) Three dimensional array

15. Linear arrays are also called ……………….
A) Straight line array
B) One-dimensional array
C) Vertical array
D) Horizontal 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

17. Which of the following data structures are indexed structures?
A) Linear arrays
B) Linked lists
C) Graphs
D) Trees

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

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

21. Which of the following data structure is non-linear type?
A) Strings
B) Lists
C) Stacks
D) Tree

22. Which of the following data structure is linear type?
A) Array
B) Tree
C) Graphs
D) Hierarchy

23. 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

24. The simplest type of data structure is ………………
A) Multidimensional array
B) Linear array
C) Two dimensional array
D) Three dimensional array

25. Linear arrays are also called ……………….
A) Straight line array
B) One-dimensional array
C) Vertical array
D) Horizontal array

26. 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

27. Which of the following data structures are indexed structures?
A) Linear arrays
B) Linked lists
C) Graphs
D) Trees

28. 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

29. A …………………… does not keep track of address of every element in the list.
A) Stack
B) String
C) Linear array
D) Queue

30. When does top value of the stack changes?
A) Before deletion
B) While checking underflow
C) At the time of deletion
D) After deletion

31. 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

32. 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

33. 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

34. 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

35. 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

36. 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

37. The time complexity of quick sort is …………..
A) O(n)
B) O(n2)
C) O(n log n)
D) O(log n)

38. 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

39. The data structure which is one ended is ………………
A) queue
B) stack
C) tree
D) graph

40. A list which displays the relationship of adjacency between elements is said to be
A) linear
B) non linear
C) linked list
D) trees