Data Structure Questions and Answers – Reverse a Word using Stack

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Reverse a Word using Stack”.

1. Reversing a word using stack can be used to find if the given word is a palindrome or not.
a) True
b) False
View Answer

2. Which is the most appropriate data structure for reversing a word?
a) queue
b) stack
c) tree
d) graph
View Answer

3. Operations required for reversing a word or a string using stack are push() and pop().
a) True
b) False
View Answer

4. What is the time complexity of reversing a word using stack algorithm?
a) O (N log N)
b) O (N²)
c) O (N)
d) O (M log N)
View Answer

5. What will be the word obtained if the word “abbcabb” is reversed using a stack?
a) bbabbca
b) abbcabb
c) bbacbba
d) bbacabb
View Answer

6. How many stacks are required for reversing a word algorithm?
a) one
b) two
c) three
d) four
View Answer

7. What will be result if the given stack is popped?

a) pat
b) tap
c) atp
d) apt
View Answer

8. What will be output if the following sequence of operations are executed?

Push(a,s);
Push(b,s);
Pop(b);
Push(c,s);

a) abc
b) b
c) ac
d) acb
View Answer

9. What are the set of functions that are to be executed to get the following output?
cat
a) 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(a); pop(t);
d) push(c,s); push(a,s); pop(t);
View Answer

10. How will your stack look like if the word ‘java’ is pushed?
a)
b)
c)
d)
View Answer

11. Find the error (if any) in the following code snippet for pop operation.

void pop() //removing an element from a stack
{
     printf(“%s”, stack[top++]);
}

a) run time error
b) compile time error
c) pop operation is performed, but top moved in wrong direction
d) pop operation is performed properly
View Answer

12. What will be the output of the following program?

main()  
{  
   char str[]="san foundry";  
   int len = strlen(str);  
   int i;  
 
   for(i=0;i<len;i++)  
        push(str[i]);  // pushes an element into stack
 
   for(i=0;i<len;i++)  
      pop();  //pops an element from the stack
}

a) sanfoundry
b) san foundry
c) yrdnuof nas
d) foundry nas
View Answer

Sanfoundry Global Education & Learning Series – Data Structure.

To practice all areas of Data Structure, here is complete set of 1000+ Multiple Choice Questions and Answers.