AP ECET COMPUTER SCIENCE AND ENGINEERING Multiple Choice Questions (MCQs)

46. Which of the following data structures is used to implement a recursive function call?

• a) Stack
• b) Queue
• c) Linked List
• d) Tree

Answer: a) Stack

47. In a doubly linked list, each node contains:

• a) A data field and a pointer to the next node
• b) A data field and a pointer to the previous node
• c) A data field, a pointer to the next node, and a pointer to the previous node
• d) None of the above

Answer: c) A data field, a pointer to the next node, and a pointer to the previous node

48. Which of the following searching algorithms has the best average case time complexity?

• a) Linear Search
• b) Binary Search
• c) Jump Search
• d) Interpolation Search

Answer: b) Binary Search

49. Which of the following is the correct representation of a queue using arrays?

• a) Front = 0, Rear = size-1
• b) Front = size-1, Rear = 0
• c) Front = Rear
• d) Front = Rear + 1

Answer: a) Front = 0, Rear = size-1

50. In a circular queue, what happens when the queue is full?

• a) The first element is overwritten by the new element
• b) The last element is removed
• c) The new element is ignored
• d) The new element is stored at the front

Answer: a) The first element is overwritten by the new element

51. Which of the following sorting algorithms is considered the most efficient in terms of time complexity in the average case?

• a) Bubble Sort
• b) Insertion Sort
• c) Quick Sort
• d) Selection Sort

Answer: c) Quick Sort

52. Which of the following is a non-linear data structure?

• a) Stack
• b) Queue
• c) Linked List
• d) Tree

Answer: d) Tree

53. In which of the following data structures is the "First In First Out" (FIFO) principle used?

• a) Stack
• b) Queue
• c) Array
• d) Tree

Answer: b) Queue

54. Which of the following operations is not typically associated with a stack?

• a) Push
• b) Pop
• c) Enqueue
• d) Peek

Answer: c) Enqueue

55. Which of the following searching algorithms works only on a sorted array or list?

• a) Linear Search
• b) Binary Search
• c) Jump Search
• d) Hashing

Answer: b) Binary Search

56. What is the time complexity of accessing an element in an array?

• a) O(1)
• b) O(log n)
• c) O(n)
• d) O(n log n)

Answer: a) O(1)

57. What type of tree structure is used to maintain an ordered collection of elements in a balanced manner?

• a) Binary Search Tree
• b) Binary Tree
• c) AVL Tree
• d) Heap

Answer: c) AVL Tree

58. In a singly linked list, what is the time complexity for inserting an element at the beginning?

• a) O(1)
• b) O(n)
• c) O(log n)
• d) O(n log n)

Answer: a) O(1)

59. What is the space complexity of storing a single linked list with n nodes?

• a) O(1)
• b) O(n)
• c) O(n log n)
• d) O(n^2)

Answer: b) O(n)

60. Which of the following data structures allows for efficient deletion and insertion of elements from both ends?

• a) Queue
• b) Stack
• c) Deque
• d) Linked List

Answer: c) Deque