NEW
Font size
WorksheetsData Structures (linear DS)
Total questions: 15
Worksheet time: 15mins
Given 6 items A,B,C,D,E & F are pushed in a stack S1, one after another starting from A. The stack is popped 3 items and each element is inserted in queue Q1. Again the stack S1 is popped 3 items and pushed to another stack S2. The two elements are deleted from the queue Q1 and pushed back to stack S1. Then three elements popped from stack S2 and each element is inserted in a queue Q1, then two elements from stack S1 are popped and inserted to queue Q1. What is the true statement Statement 1: both stacks S1 and S2 are equal Statement 2: All the elements (A,B,C,D,E,F) are present in queue Q1 Statement 3: both stacks S1 and S2 are empty Statement 4: Queue Q1 is empty
Statement 1 and Statement 2 are false
Statement 1 and Statement 2 are true
Statement 3 is false
Statement 3 and 4 are true
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
2
3
4
You are given a queue of characters representing the instructions for a robot. The robot can move forward ('F') or turn around ('T'). The initial position of the robot is facing right and position with coordinates (0,0). Your task is to determine the final position and direction of the robot after executing all the instructions. Hint:Create variables to keep track of the current position (X, Y coordinates) and the current direction (right, left, up, down). Initialize these variables accordingly. If the instruction is 'F', update the position based on the current direction. If the instruction is 'T', update the direction based on the current position and the turning rules right -> down -> left -> up -> right(Eg:if the current direction is right, instruction T is given, it will turn down). For instruction 'T' the robot should only turn around in the same position, but it should not move. Instruction:['F', 'T', 'F', 'F', 'T', 'T', 'F', 'F', 'F']
Position :(-1,3) direction:UP
Position :(1,1) direction:UP
Position :(-1,-1) direction:LEFT
Position :(1,1) direction:DOWN
The optimal data structure used to solve Tower of Hanoi is _________
Tree
Queue
Stack
Linkedlist
In an event-driven system, events are inserted into a priority queue based on their urgency. During execution, some event priorities may change (increase or decrease).
What challenge does this create for a typical binary heap-based priority queue?
The queue must be rebalanced manually
Changed priorities are automatically updated
The heap size changes
Priority changes are handled in constant time
What happens if two elements have the same priority in a priority queue?
Only one is inserted
They are sorted by name
The queue may return either one first
The queue throws an error
Below snippet code deletes values from the front in an circular deque
What is the purpose of this line “front = (front + 1) % capacity;”?
Moves the front pointer backward
Moves the front pointer forward circularly
Always resets front to 0
Moves the rear pointer instead
What is the number of moves required to solve Tower of Hanoi problem for k disks?
2^k– 1
2^k+1
2*k-1
2*k+1
You are given the string: "((()[{]}]){}("
You are using a stack to check for balanced parentheses.What will be the final state of the stack after processing all characters in the string?
[ ( (
( ( ]
[ } }
[ ( )
Below code supposed to find minimum number of jumps to reach the end of an array, but there is some logical error in this code example: arr={2, 3, 1, 1, 4}
farthest = max(farthest, i + nums[i]) should be inside an if condition
The condition i == farthest is checked twice and causes a logic error
The return type of the function should be bool instead of int
There should be a nested loop to try all paths
Consider a Linked list of values 1,2,3,4,5,6,7,8,9,10. what is the functionality of the following code
Reverse alternate kth node in a singly linked list
Finds kth node in given linked list
Finds kth node from end of linked list
Rotate linked list from Kth node
Below code finds the loop in a linked list,A loop in a linked list occurs when any node points to a previously visited node
for example: 1 2 3 4 3 (3->4->3 makes a loop).
Which of the following inputs will have no loop.
[1,2,3,4,5,7,8,3,5]
[1,2,3,4,3,7,4,3,5]
[10,18,17,16,15,19,16,18,15,16,19]
[10,18,17,16,18,19,10]
Given array elements [3, 2, 4, 5, 7, 8] What is the functionality of the below code
Checks given array is non-decreasing order
Checks given array is non-Increasing order
Checks given array is unsorted order
Checks given array is empty after performing stack operations
Which of the following is a good real-world use case for a priority queue?
Saving user data in a file
Simulating call center task handling based on urgency
Displaying images in a gallery
Rotating banner ads
Which use case is best suited for a min-heap?
Finding the maximum score in real-time
Scheduling tasks with earliest deadline
Sorting data in descending order
Implementing a LIFO stack
