1. : What is the primary characteristic of a linear data structure?
(A) Elements are stored in a non-sequential manner
(B) Each element is connected to one or two elements
(C) Elements are stored in a sequential manner
(D) None of the above
2. : Which of the following is an example of a linear data structure?
(A) Tree
(B) Graph
(C) Stack
(D) None of the above
3. : What is the time complexity for accessing an element in an array?
(A) O(n)
(B) O(log n)
(C) O(1)
(D) O(n^2)
4. : Which linear data structure follows the Last In First Out (LIFO) principle?
(A) Queue
(B) Stack
(C) Array
(D) Linked List
5. : In a queue, elements are added at the…
(A) Front
(B) Middle
(C) Back
(D) Any position
6. : What type of linked list allows traversal in both directions?
(A) Singly Linked List
(B) Circular Linked List
(C) Doubly Linked List
(D) None of the above
7. : Which of the following operations has a time complexity of O(1) in a stack?
(A) Pop
(B) Search
(C) Traverse
(D) Insert
8. : What is the space complexity of a linked list with n nodes?
(A) O(1)
(B) O(n)
(C) O(n^2)
(D) O(log n)
9. : Which data structure is used to implement a function call stack?
(A) Queue
(B) Array
(C) Stack
(D) Linked List
10. : What is the worst-case time complexity for searching in a linked list?
(A) O(1)
(B) O(n)
(C) O(log n)
(D) O(n log n)
11. : Which operation is typically NOT performed on a queue?
(A) Enqueue
(B) Dequeue
(C) Peek
(D) Push
12. : What is the main advantage of using a linked list over an array?
(A) Faster access time
(B) Dynamic size
(C) Simplicity
(D) Better memory locality
13. : Which of the following is NOT a characteristic of a circular linked list?
(A) Last node points to the first node
(B) Can be singly or doubly linked
(C) Has a fixed size
(D) Allows continuous traversal
14. : What is the primary disadvantage of using an array as a data structure?
(A) Fast access time
(B) Fixed size
(C) Random access
(D) Sequential access
15. : Which of the following is a characteristic of a stack?
(A) First In First Out
(B) Last In First Out
(C) Allows random access
(D) Can grow in size dynamically
16. : What is the time complexity for inserting an element at the beginning of a linked list?
(A) O(1)
(B) O(n)
(C) O(log n)
(D) O(n^2)
17. : Which of the following operations has a time complexity of O(n) in a singly linked list?
(A) Insertion at the head
(B) Insertion at the tail
(C) Deletion from the head
(D) Searching for an element
18. : What is the space complexity of a stack with n elements?
(A) O(1)
(B) O(n)
(C) O(n^2)
(D) O(log n)
19. : Which of the following data structures allows for insertion and deletion from both ends?
(A) Stack
(B) Queue
(C) Deque
(D) Array
20. : What is the average time complexity for searching in a stack?
(A) O(1)
(B) O(n)
(C) O(log n)
(D) O(n^2)
21. : What type of data structure is used for implementing a breadth-first search?
(A) Stack
(B) Queue
(C) Array
(D) Linked List
22. : In a priority queue, elements are dequeued based on their…
(A) Insertion order
(B) Value
(C) Size
(D) Position
23. : Which of the following best describes a doubly linked list?
(A) Nodes can be traversed in one direction only
(B) Nodes contain a pointer to both the next and previous nodes
(C) It has a fixed number of nodes
(D) None of the above
24. : What is the main disadvantage of a stack?
(A) Limited size
(B) Random access
(C) LIFO order
(D) Complexity
25. : Which of the following operations in a queue has a time complexity of O(1)?
(A) Enqueue
(B) Dequeue
(C) Both A and B
(D) None of the above
26. : What is the time complexity for traversing a linked list?
(A) O(1)
(B) O(n)
(C) O(log n)
(D) O(n^2)
27. : In which data structure can you insert and delete elements at both ends?
(A) Stack
(B) Queue
(C) Circular Linked List
(D) Deque
28. : What is the primary purpose of a stack?
(A) To store data in a sorted manner
(B) To manage function calls
(C) To allow random access to elements
(D) To manage tasks in a specific order
29. : What is the time complexity for deleting the last element in a singly linked list?
(A) O(1)
(B) O(n)
(C) O(log n)
(D) O(n^2)
30. : Which of the following is NOT a type of linear data structure?
(A) Array
(B) Linked List
(C) Graph
(D) Stack
31. : What is the main characteristic of a queue?
(A) Elements are processed in a random order
(B) It follows the LIFO principle
(C) It follows the FIFO principle
(D) It allows duplicate elements
32. : What is the maximum number of elements in a stack of size n?
(A) n
(B) n+1
(C) 2n
(D) Unlimited
33. : Which data structure is more memory efficient for large datasets?
(A) Array
(B) Linked List
(C) Stack
(D) Queue
34. : What is the time complexity for accessing an element in a linked list?
(A) O(1)
(B) O(n)
(C) O(log n)
(D) O(n^2)
35. : What is a key advantage of a circular linked list?
(A) Simplicity
(B) Efficient memory usage
(C) Continuous traversal without NULL checks
(D) None of the above
36. : What is the time complexity of removing an element from the front of a queue?
(A) O(1)
(B) O(n)
(C) O(log n)
(D) O(n^2)
37. : Which of the following describes a stack’s behavior?
(A) First In First Out
(B) Last In First Out
(C) Both A and B
(D) None of the above
38. : What is the space complexity of an array of size n?
(A) O(1)
(B) O(n)
(C) O(n^2)
(D) O(log n)
39. : What is the primary operation of a stack?
(A) Enqueue
(B) Dequeue
(C) Push and Pop
(D) Insert and Delete
40. : What is the time complexity of inserting an element at the end of a doubly linked list?
(A) O(1)
(B) O(n)
(C) O(log n)
(D) O(n^2)
41. : Which of the following is a disadvantage of using arrays?
(A) Dynamic sizing
(B) Faster access time
(C) Wasted memory due to fixed size
(D) Easy to implement