Question 51 : ‘Array implementation of Stack is not dynamic', which of the following statements supports this argument?

1. space allocation for array is fixed and cannot be changed during run-time
2. user unable to give the input for stack operations
3. a runtime exception halts execution
4. all of the mentioned
View Answer   Discuss with Members

Question 52 : A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?

1. Queue
2. Stack
3. Tree
4. Linked list
View Answer   Discuss with Members

Question 53 : Which of the following is false about a circular linked list?

1. Every node has a successor
2. Time complexity of inserting a new node at the head of the list is O(1)
3. Time complexity for deleting the last node is O(n)
4. None of the mentioned
View Answer   Discuss with Members

Question 54 : Which of the following statements are correct with respect to Singly Linked List(SLL) and Doubly Linked List(DLL)?

1. Complexity of Insertion and Deletion at known position is O(n) in SLL and O(1) in DLL
2. SLL uses lesser memory per node than DLL
3. DLL has more searching power than SLL
4. All of the mentioned
View Answer   Discuss with Members

Question 55 : What is not a disadvantage of priority scheduling in operating systems?

1. A low priority process might have to wait indefinitely for the CPU
2. If the system crashes, the low priority systems may be lost permanently
3. Interrupt handling
4. None of the mentioned
View Answer   Discuss with Members

Question 56 : Assuming int is of 4bytes, what is the size of int arr[15];?

1. 15
2. 19
3. 11
4. 60
View Answer   Discuss with Members

Question 57 : The data structure required for Breadth First Traversal on a graph is?

1. Stack
2. Array
3. Queue
4. Tree
View Answer   Discuss with Members

Question 58 : What is the need for a circular queue?

1. effective usage of memory
2. easier computations
3. all of the mentioned
4. none of the mentioned
View Answer   Discuss with Members

Question 59 : A Double-ended queue supports operations such as adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What are the total number of stacks required for this operation?(you can reuse the stack)

1. 1
2. 2
3. 3
4. 4
View Answer   Discuss with Members

Question 60 : A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?

1. Queue
2. Circular queue
3. Dequeue
4. Priority queue
View Answer   Discuss with Members