Data Structure Reverse Word Stack Online Exam Quiz
Data Structure Reverse Word Stack GK Quiz. Question and Answers related to Data Structure Reverse Word Stack. MCQ (Multiple Choice Questions with answers about Data Structure Reverse Word Stack
What will be the word obtained if the word “abbcabb” is reversed using a stack?
Options
A : bbabbca
B : abbcabb
C : bbacbba
D : bbacabb
What is the time complexity of reversing a word using stack algorithm?
Options
A : O (N log N)
B : O (N2)
C : O (N)
D : O (M log N)
How many stacks are required for reversing a word algorithm?
Options
A : one
B : two
C : three
D : four
What will be result if the given stack is popped?
Options
A : pat
B : tap
C : atp
D : apt
Which is the most appropriate data structure for reversing a word?
Options
A : queue
B : stack
C : tree
D : graph
Operations required for reversing a word or a string using stack are push() and pop().
Options
A : True
B : False
C :
D :
Reversing a word using stack can be used to find if the given word is a palindrome or not.
Options
A : True
B : False
C :
D :
Data Structure Adjacency List more Online Exam Quiz
Data Structure Queue Operations
Data Structure Queue Using Stacks
Data Structure Search Element Array Recursion 1