DS ASSIGNMENT1

Are stacks FIFO or FILO?

• FILO
• FIFO
• LIFO
• LILO

How many stacks are needed to implement a queue. Consider the situation where no other data structure like arrays, linked list is available to you.

• 1

• 2

• 3

• 4

Which of the following is true about linked list implementation of queue?

• In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end.

• In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning.

• Both of the above

• None of the above

The five items: A, B, C, D, and E are pushed in a stack, one after other starting from A. The stack is popped four items and each element is inserted in a queue. The two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is

• A

• B

• C

• D

• E

Consider the following operations performed on a stack of size 5 : Push (a); Pop() ; Push(b); Push(c); Pop(); Push(d); Pop();Pop(); Push (e) Which of the following statements is correct?

• Underflow occurs

• Stack operations are performed smoothly

• Overflow occurs

• None of the above

Which of the following is not an inherent application of stack?

• Implementation of recursion

• Evaluation of a postfix expression

• Job scheduling

• Reverse a string

7. 7. Name the three functions of a stack data structure.

• 
  push, pop, peek

• push, pop, seek

• push, pop

• None of the above

8.Which of the following is not an inherent application of stack?

• 
  Implementation of recursion

• Job scheduling

• Evaluation of a postfix expression

• Reverse a string

9. 9.In stack insertion and deletion can take place only at one end call the ____________________ of the stack.

• Bottom

• Top

• Function

• Path

10.What is a "Stack-Underflow"?

• a half-full stack (or half-empty😂)

• a full stack

• 
  an empty stack

• None of the above