Question 1 : Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only.
Given the representation, which of the following operation can be implemented in O(1) time?
i) Insertion at the front of the linked list
ii) Insertion at the end of the linked list
iii) Deletion of the front node of the linked list
iv) Deletion of the last node of the linked list

1. I and II
2. I and III
3. I, II and III
4. I, II and IV
View Answer   Discuss with Members

Question 2 : The process of accessing data stored in a serial access memory is similar to manipulating data on a ________

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

Question 3 : Which of the following application makes use of a circular linked list?

1. Undo operation in a text editor
2. Recursive function calls
3. Allocating CPU to resources
4. All of the mentioned
View Answer   Discuss with Members

Question 4 : Pushing an element into stack already having five elements and stack size of 5 , then stack becomes

1. Overflow
2. Crash
3. Underflow
4. User flow
View Answer   Discuss with Members

Question 5 : In Linked List implementation, a node carries information regarding

1. Data
2. Link
3. Data and Link
4. None of the mentioned
View Answer   Discuss with Members

Question 6 : You have two jars, one jar which has 10 rings and the other has none. They are placed one above the other. You want to remove the last ring in the jar. And the second jar is weak and cannot be used to store rings for a long time.

1. Empty the first jar by removing it one by one from the first jar and placing it into the second jar
2. Empty the first jar by removing it one by one from the first jar and placing it into the second jar and empty the second jar by placing all the rings into the first jar one by one
3. There exists no possible way to do this
4. Break the jar and remove the last one
View Answer   Discuss with Members

Question 7 : The prefix form of A-B/ (C * D ^ E) is?

1. -/*^ACBDE
2. -ABCD*^DE
3. -A/B*C^DE
4. -A/BC*^DE
View Answer   Discuss with Members

Question 8 : What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?

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

Question 9 : What is the result of the following operation
Top (Push (S, X))

1. X
2. Null
3. S
4. None of the mentioned
View Answer   Discuss with Members

Question 10 : You are asked to perform a queue operation using a stack. Assume the size of the stack is some value ‘n' and there are ‘m' number of variables in this stack. The time complexity of performing deQueue operation is (Using only stack operations like push and pop)(Tightly bound).

1. O(m)
2. O(n)
3. O(m*n)
4. Data is insufficient
View Answer   Discuss with Members