HP Placement Paper - Data Structure Questions And Answers

HP Previous Years Solved Sample Placement Papers

1. Process of inserting an element in stack is called ____________
   

   a) Create

   b) Push

   c) Evaluation

   d) Pop

   Answer: b) Push
2. Process of removing an element from stack is called __________
   

   a) Create

   b) Push

   c) Evaluation

   d) Pop

   Answer: d) Pop
3. In a stack, if a user tries to remove an element from an empty stack it is called _________
   

   a) Underflow

   b) Empty collection

   c) Overflow

   d) Garbage Collection

   Answer: a) Underflow
4. Pushing an element into stack already having five elements and stack size of 5, then stack becomes ___________
   

   a) Overflow

   b) Crash

   c) Underflow

   d) User flow

   Answer: a) Overflow
5. Entries in a stack are “ordered”. What is the meaning of this statement?
   

   a) A collection of stacks is sortable

   b) Stack entries may be compared with the ‘<‘ operation

   c) The entries are stored in a linked list

   d) There is a Sequential entry that is one by one

   Answer: d) There is a Sequential entry that is one by one
6. Which of the following is not the application of stack?
   

   a) A parentheses balancing program

   b) Tracking of local variables at run time

   c) Compiler Syntax Analyzer

   d) Data Transfer between two asynchronous process

   Answer: d) Data Transfer between two asynchronous process
7. Consider the usual algorithm for determining whether a sequence of parentheses is balanced. The maximum number of parentheses that appear on the stack AT ANY ONE TIME when the algorithm analyzes: (()(())(()))?
   

   a) 1

   b) 2

   c) 3

   d) 4 or more

   Answer: c) 3
8. Consider the usual algorithm for determining whether a sequence of parentheses is balanced. Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order). The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?
   

   a) 1

   b) 2

   c) 3

   d) 4 or more

   Answer: b) 2
9. What is the value of the postfix expression 6 3 2 4 + – *?
   

   a) 1

   b) 40

   c) 74

   d) -18

   Answer: d) -18
10. Here is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?
    

    a) 1

    b) 2

    c) 3

    d) 4

    Answer: d) 4