A recursive problem like tower of hanoi can be rewritten without recur – McqOptions

MCQOPTIONS

1.	A recursive problem like tower of hanoi can be rewritten without recursion using:
A.	stack
B.	priority queue
C.	graph
D.	cycles
Answer» B. priority queue

Discussion

No Comment Found

Related MCQs

A stack can be implemented using queue, but then we need to use atleast:
_________ is First in Last Out kind of data structure.
In what order the elements of a pushdown stack are accessed?
A stack is implemented with an array of ‘A [0..N – 1]’ and a variable ‘pos’. The push and pop operations are defined by the following code.push(x) A[pos] ← x pos ← pos – 1end pushpop( ) pos ← pos + 1 return A[pos]end popWhich of the following will initialize an empty stack with capacity N for the above implementation?
A run-time stack cannot be used in a round-robin scheduling system because of the _________ nature of scheduling.
For implementation of recursion system uses _______ data structure.
A recursive problem like tower of hanoi can be rewritten without recursion using:
If the sequence of operations - push (1), push (2), pop, push (1), push (2), pop, pop, pop, push (2), pop are performed on a stack, the sequence of popped out values
THE_PID_TEMPERATURE_CONTROLLER_USING_8086_HAS?$
THE_BOOKS_ARRANGED_ONE_ON_THE_OTHER_ON_A_TABLE_IS_AN_EXAMPLE_OF?$