Given an array of size n, let‚Äö√Ñ√∂‚àö√ë‚àö¬•s assume an element is ‚Äö√Ñ√∂‚àö√ë‚àö‚â§touched‚Äö√Ñ√∂‚àö√ë‚àö¬• if and only if some operation is performed on it(for example, for performing a pop operation the top element is ‚Äö√Ñ√∂‚àö√ë‚àö‚â§touched‚Äö√Ñ√∂‚àö√ë‚àö¬•). Now you need to perform Dequeue operation. Each element in the array is touched atleast?$#

Given an array of size n, let‚Äö√Ñ√∂‚àö√ë‚àö¬�

1.	Given an array of size n, let‚Äö√Ñ√∂‚àö√ë‚àö¬•s assume an element is ‚Äö√Ñ√∂‚àö√ë‚àö‚â§touched‚Äö√Ñ√∂‚àö√ë‚àö¬• if and only if some operation is performed on it(for example, for performing a pop operation the top element is ‚Äö√Ñ√∂‚àö√ë‚àö‚â§touched‚Äö√Ñ√∂‚àö√ë‚àö¬•). Now you need to perform Dequeue operation. Each element in the array is touched atleast?$#
A.	Once
B.	Twice
C.	Thrice
D.	Four times
Answer» E.

Discussion

No Comment Found

Related MCQs

Given an array of size n, let’s assume an element is ‘touched’ if and only if some operation is performed on it(for example, for performing a pop operation the top element is ‘touched’). Now you need to perform Dequeue operation. Each element in the array is touched atleast?
Given only a single array of size 10 and no other memory is available. Which of the following operation is not feasible to implement (Given only push and pop operation)?
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.
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)
Consider you have a stack whose elements in it are as follows.5 4 3 2 << topWhere the top element is 2.You need to get the following stack6 5 4 3 2 << topThe operations that needed to be performed are (You can perform only push and pop):
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).
GIVEN_ONLY_A_SINGLE_ARRAY_OF_SIZE_10_AND_NO_OTHER_MEMORY_IS_AVAILABLE._WHICH_OF_THE_FOLLOWING_OPERATION_IS_NOT_FEASIBLE_TO_IMPLEMENT_(GIVEN_ONLY_PUSH_AND_POP_OPERATION)??$
Given an array of size n, let‚Äö√Ñ√∂‚àö√ë‚àö¬•s assume an element is ‚Äö√Ñ√∂‚àö√ë‚àö‚â§touched‚Äö√Ñ√∂‚àö√ë‚àö¬• if and only if some operation is performed on it(for example, for performing a pop operation the top element is ‚Äö√Ñ√∂‚àö√ë‚àö‚â§touched‚Äö√Ñ√∂‚àö√ë‚àö¬•). Now you need to perform Dequeue operation. Each element in the array is touched atleast?$#
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?
Consider yourself to be in a planet where the computational power of chips to be slow. You have an array of size 10.You want to perform enqueue some element into this array. But you can perform only push and pop operations .Push and pop operation both take 1 sec respectively. The total time required to perform enQueue operation is?

Discussion

No Comment Found

Related MCQs

Reply to Comment