Java Programming

Java MCQ: In a Doubly Linked List, what does the first node’s previous pointer point to? A) The second node B) The last node C) Itself D) Null Answer: D) Null Explanation: In a Doubly Linked List, the first node’s previous pointer points to null. This indicates that the first node does not have any […]

Java MCQ: In a Singly Linked List, what does the last node’s next pointer point to? A) The first node B) The second last node C) Null D) Itself Answer: C) Null Explanation: In a Singly Linked List, the last node’s next pointer points to null, indicating the end of the list. The null pointer

Java MCQ: What is the primary advantage of a Circular Linked List over a Simple Linked List? A) It uses less memory B) It allows for O(1) insertions at the end of the list C) It allows us to traverse the whole list starting from any node D) It does not require a sentinel node

Java MCQ: What is the time complexity of searching for an element in a Linked List? A) O(1) B) O(log n) C) O(n) D) O(n log n) Answer: C) O(n) Explanation: The time complexity for searching an element in a Linked List is O(n), where ‘n’ is the number of elements in the list. This

Java MCQ: In which scenario is the Linked List an excellent data structure? A) When you need to insert elements at the end of the list B) When you need to insert elements in the middle of the list C) When you need to access elements in sequential order D) When you need quick access

Java MCQ: What is a Doubly Linked List in data structure? A) It is a type of linked list where each node contains a data field and two references, one to the next node and one to the previous node. B) It is a type of linked list where each node contains a data field

Java MCQ: What is a Linked List in data structure? A) It is a linear data structure where each element is stored at a contiguous location and elements are accessed sequentially from the first element. B) It is a type of data structure that consists of nodes, where each node contains a data field and

Java MCQ: What is a circular queue? A) A queue where the last element points to the first B) A queue where the first element points to the last C) A queue that can only hold circular objects D) None of the above Answer: A) A queue where the last element points to the first

Java MCQ: What is the time complexity to get the front element from the queue? A) O(1) B) O(n) C) O(n log n) D) O(n²) Answer: A) O(1) Explanation: The time complexity to get the front element from a queue is O(1), meaning it is performed in constant time. This operation, typically done using the

Java MCQ: Which is a type of Queue? A) Priority Queue B) LIFO Queue C) FILO Queue D) None of the above Answer: A) Priority Queue Explanation: A priority queue is a type of queue where each element is associated with a priority. Elements with higher priority are dequeued before elements with lower priority, regardless

Java MCQ: What is the front of a Queue? A) The last element added B) The first element added C) The middle element D) None of the above Answer: B) The first element added Explanation: The front of a queue refers to the first element that was added to the queue. In a queue, elements

Java MCQ: Is a Queue a dynamic data structure? A) Yes B) No Answer: A) Yes Explanation: Yes, a queue is a dynamic data structure because its size can change during the execution of a program. Unlike static data structures, where the size is fixed at compile-time, a dynamic queue can grow or shrink as

Java MCQ: What is the time complexity of enqueue operation in a queue? A) O(n) B) O(n log n) C) O(1) D) O(n²) Answer: C) O(1) Explanation: The time complexity of the enqueue operation in a queue is O(1), meaning that the operation is performed in constant time, regardless of the number of elements in

Java MCQ: What does ‘underflow’ mean in a Queue? A) Queue is full B) Queue is empty C) There is an error in the queue D) Queue has only one element Answer: B) Queue is empty Explanation: ‘Underflow’ in a queue refers to a situation where an attempt is made to remove an element from

Java MCQ: What is the operation to remove an element from the Queue? A) Push B) Pop C) Enqueue D) Dequeue Answer: D) Dequeue Explanation: The operation used to remove an element from a queue is called “dequeue.” The dequeue operation removes the element from the front of the queue, which is the first element

Java MCQ: Which operation is used to add an element in the Queue? A) Push B) Pop C) Enqueue D) Dequeue Answer: C) Enqueue Explanation: The operation used to add an element to a queue is called “enqueue.” The enqueue operation adds an element to the rear (or end) of the queue, following the FIFO

Java MCQ: Which of the following is not a real-life example of a Queue? A) Waiting in line to order food at a restaurant B) Waiting in line to buy movie tickets C) Managing tasks on a CPU D) Using a stack of dishes Answer: D) Using a stack of dishes Explanation: Using a stack

Java MCQ: Which principle is followed by the Queue data structure? A) LIFO B) FIFO C) LILO D) FILO Answer: B) FIFO Explanation: The principle followed by the Queue data structure is FIFO, which stands for First In First Out. This means that the first element added to the queue will be the first one

Java MCQ: What is the time complexity to get the minimum element from the Stack? A) O(1) B) O(n) C) O(n log n) D) O(n²) Answer: B) O(n) Explanation: If a stack does not maintain a separate data structure to track the minimum element, the time complexity to get the minimum element is O(n). This

Java MCQ: What is another name for the top of the Stack? A) Head B) Front C) Rear D) Peak Answer: D) Peak Explanation: The top of the stack is often referred to as the “peak” or “top.” The term “peak” is used because it represents the highest point of the stack, where the most

Java MCQ: Which of the following applications may use a Stack? A) Recursion B) Parsing C) Browser history D) All of the above Answer: D) All of the above Explanation: All of the listed applications—recursion, parsing, and browser history—use stacks as an underlying data structure to manage their operations. The stack’s Last-In-First-Out (LIFO) behavior is

Java MCQ: Is the Stack a static data structure? A) Yes B) No Answer: B) No Explanation: The stack is not a static data structure; it is dynamic. This means that a stack can grow and shrink at runtime as elements are added and removed. The dynamic nature of the stack makes it flexible and

Java MCQ: What is the maximum number of elements a Stack can hold? A) Stack can hold a limited number of elements B) Stack can hold an infinite number of elements C) It depends on the memory available D) It depends on the data type of the elements Answer: C) It depends on the memory

Java MCQ: What is the time complexity of a push operation in a Stack? A) O(n) B) O(n log n) C) O(1) D) O(n²) Answer: C) O(1) Explanation: The time complexity of a push operation in a stack is O(1), which means that the operation is performed in constant time, regardless of the number of

Java MCQ: What happens when you try to pop an element from an empty Stack? A) It returns null B) It returns the top element C) It causes an underflow D) It causes an overflow Answer: C) It causes an underflow Explanation: When you try to pop an element from an empty stack, it causes