Related Questions

Which of the following statements are CORRECT? 1) Static allocation of all data areas by a compiler makes it impossible to implement recursion. 2) Automatic garbage collection is essential to implement recursion 3) Dynamic allocation of activation records is essential to implement recursion 4) Both heap and stack are essential to implement recursion
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).
Why is implementation of stack operations on queues not feasible for a large dataset (Asssume the number of elements in the stack to be n)?
Which of the following statements regarding Stacks is/are True? i) The stack always grows towards higher addresses ii) The stack always grows towards lower addresses iii) The stack has a fixed size iv) The width of the stack is 32 bits
To implement a stack using queue(with only enqueue and dequeue operations), how many queues will you need?
During the scarcity of potatoes, long queues were made outside the defendant's shop who having a licence to sell fruits and vegetables used to sell only 1 kg of potatoes per ration card. The queues extended on to the highway and also caused some obstruction to the neighbouring shops. The neighbouring shopkeepers brought an action for nuisance against the defendant.
Which one of the following decisions will be correct in this suit?
Which of the following statements are true/false?
1. A minimum rate of wages for the time spent by employees for the production of output is minimum time rate.
2. Minimum piece rate is the rate based on the quantity of the output employees have produced.
3. The guaranteed time rate is a minimum rate of remuneration to apply in the case of employees employed on piece work for the purpose of securing to such employees a minimum rate of wages on a time work basis.
4. A minimum rate of remuneration to apply in the case of employees employed on piece work for the purpose of securing to such employees a minimum rate of wages on a time work basis is overtime rate.
Pushing an element into stack already having five elements and stack size of 5, then stack becomes ___________
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)
A double-ended queue supports operations like 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’s the time complexity of performing addFront and addRear? (Assume ‘m’ to be the size of the stack and ‘n’ to be the number of elements)