What will be the output of the following program?
main()
{
char str[]="hello india";
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
}
main()
{
char str[]="hello india";
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. helloindia
B. hello india
C. aidni olleh
D. india hello
Answer: Option C
This Question Belongs to Data Structure >> Stacks In Data Structures
Related Questions on Stacks in Data Structures
What is the time complexity of push operation in a stack implemented using an array?
A. O(1)
B. O(n)
C. O(log n)
D. O(n log n)
What is the stack's behavior when it's described as LIFO?
A. Last In First Out
B. Last In Last Out
C. First In First Out
D. First In Last Out
How can you implement a stack using a linked list?
A. By using a singly linked list
B. By using a doubly linked list
C. By using a circular linked list
D. All of the above
Join The Discussion