Given two queues with their standard operations (enqueue, dequeue, isempty, size), implement a stack with its standard operations (pop, push, isempty, size).
To solve this problem first we have to declare one queue as working queue then enqueue the first element in to that queue. after that when we have to push another element then we push another element in other queue then dequeue all elements of working queue one by one till it is empty and enqueue all into other queue in same order and set other queue as working queue. this is for pushing elements into stack(implemented in queues). for pop operation we just have to dequeue element from working queue that will be the top element for the stack. isempty = same isempty operation on working queue. size= size of the working queue.
Implement a function getbits, that returns the(right adjusted) n bits that begin at position p of an integer. Assume bit position 0 is at the right end and that n and p are sensible positive values.
You are given n real numbers in an array. A number in the array is called a decimal dominant if it occurs more than n/10 times in the array. Give an O(n) time algorithm to determine if the given array has a decimal dominant.
This comment has been removed by the author.
ReplyDeleteTo solve this problem first we have to declare one queue as working queue then enqueue the first element in to that queue.
ReplyDeleteafter that when we have to push another element then we push another element in other queue then dequeue all elements of working queue one by one till it is empty and enqueue all into other queue in same order and set other queue as working queue.
this is for pushing elements into stack(implemented in queues).
for pop operation we just have to dequeue element from working queue that will be the top element for the stack.
isempty = same isempty operation on working queue.
size= size of the working queue.
@gaurav yes this will work fine..:)
ReplyDelete