MCQOPTIONS
Bookmark
Saved Bookmarks
→
Data Structures and Algorithms
→
Evaluation Infix Expression Not Parenthesized in Data Structures and Algorithms
→
Which is the most appropriate data structure for r..
1.
Which is the most appropriate data structure for reversing a word?
A.
queue
B.
stack
C.
tree
D.
graph
Answer» C. tree
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Find the error (if any) in the following code snippet for pop operation.
What are the set of functions that are to be executed to get the following output?cata) push(c, s); push(a, s); push(t, s); pop(s); pop(s); pop(s);b) push(c,s); pop(s); push(a,s); pop(s);push(t,s);pop(s);c) pop(c ); pop(
What will be result if the given stack is popped?
What will be the word obtained if the word “abbcabb” is reversed using a stack?
Operations required for reversing a word or a string using stack are push() and pop().
WHAT_ARE_THE_SET_OF_FUNCTIONS_THAT_ARE_TO_BE_EXECUTED_TO_GET_THE_FOLLOWING_OUTPUT??$
What will be output if the following sequence of operations are executed?
How many stacks are required for reversing a word algorithm?
What will be the word obtained if the word “abbcabb” is reversed using a stack?$
What is the time complexity of reversing a word using stack algorithm?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply