Stack MCQ : Miscellaneous Questions ( Multiple Choice)
Congratulations - you have completed Data Structure.
You scored %%SCORE%% out of %%TOTAL%%.
Your performance has been rated as %%RATING%%
Your answers are highlighted below.
Question 1 |
Stack can be implemented using ___________ and _________.
Array and Graphs | |
Array and Linked List | |
Queue and Graphs | |
Trees and Linked List |
Question 2 |
Well formed parenthesis can be checked using following data structure ?
Queue | |
Stack | |
List | |
Hash Map |
Question 3 |
Post fix form of
A + (B * C)is -
AB + C * | |
ABC * + | |
AB * C + | |
ABC + * |
Question 4 |
Post fix form of -
(A + B) * C
ABC * + | |
ABC + * | |
AB * C + | |
AB + C* |
Question 5 |
When user switch from one function to other then the details of previous function are stored into the stack !
False | |
True |
Once you are finished, click the button below. Any items you have not completed will be marked incorrect.
There are 5 questions to complete.