PATNI Placement Paper -: Data Structure & Programming Questions With Answers

PATNI Previous Years Solved Sample Placement Papers

1. A typical modern computer uses:

   • a) magnetic cores for secondary storage
   • b) LSI chips (Ans)
   • c) magnetic tape for primary memory
   • d) more than 10,000 vacuum tubes

2. A collection of 8 bits is called:

   • a) byte (Ans)
   • b) record
   • c) word
   • d) nibble

3. General-purpose computers are those that can be adopted to countless uses simply by changing their:

   • a) output device
   • b) input device
   • c) processor
   • d) program (Ans)

4. The current generation of computers:

   • a) second
   • b) fifth
   • c) fourth (Ans)
   • d) third

5. Non-volatility is an important advantage of:

   • a) CCDs
   • b) magnetic tapes and disks
   • c) magnetic bubbles
   • d) both b and c (Ans)

6. What is the corresponding postfix expression for the given infix expression? a*(b+c)/d

   A) ab*+cd/

   B) ab+*cd/

   C) abc*+/d

   D) abc+*d/ (Ans)

7. What is the corresponding postfix expression for the given infix expression? a+(b*c(d/e^f)*g)*h)

   A) ab*cdef/^*g-h+

   B) abcdef^/*g*h*+ (Ans)

   C) abcd*^ed/g*-h*+

   D) abc*de^fg/*-*h+

8. What is the correct postfix expression for the following expression? a+b*(c^d-e)^(f+g*h)-i

   A) abc^de-fg+*^*+i

   B) abcde^-fg*+*^h*+i

   C) abcd^e-fgh*+^*+i (Ans)

   D) ab^-dc*+ef^gh*+i

9. Why do we need a binary tree which is height balanced?

   • a) to avoid formation of skew trees (Ans)
   • b) to save memory
   • c) to attain faster memory access
   • d) to simplify storing

   Explanation: In real-world scenarios, dealing with random values is often not possible. The probability of encountering non-random values (like sequential ones) often leads to skew trees, causing worst-case scenarios. Thus, height balance is maintained by rotations.

10. Which data structure is used to implement queues, trees, graphs?

    A: Stack

    B: List

    C: Array

    D: None

    Ans: C

11. In which data structure do addition and deletion of elements take place from the same position?

    A: Stack

    B: List

    C: Array

    D: Queue

    Ans: A

12. When an operand is read, which of the following is done?

    a) It is placed on to the output

    b) It is placed in operator stack

    c) It is ignored

    d) Operator stack is emptied

    Answer: a

    Explanation: While converting an infix expression to a postfix expression, when an operand is read, it is placed on to the output. When an operator is read, it is placed in the operator stack.

13. Which of the following is true?

    A) Larger the order of B-tree, less frequently the split occurs (Ans)

    B) Larger the order of B-tree, more frequently the split occurs

    C) Smaller the order of B-tree, more frequently the split occurs

    D) Smaller the order of B-tree, less frequently the split occurs

14. How many children does a binary tree have?

    A) 2

    B) Any number of children

    C) 0 or 1 or 2 (Ans)

    D) 0 or 1

15. What is/are the disadvantages of implementing a tree using normal arrays?

    A) Difficulty in knowing children nodes of a node

    B) Difficult in finding the parent of a node

    C) Have to know the maximum number of nodes possible before creation of trees (Ans)

    D) Difficult to implement

16. What must be the ideal size of an array if the height of the tree is ‘l’?

    A) 2^l-1 (Ans)

    B) l-1

    C) l

    D) 2^l

17. What are the children for node ‘w’ of a complete binary tree in an array representation?

    A) 2w and 2w+1 (Ans)

    B) 2+w and 2-w

    C) w+1/2 and w/2

    D) w-1/2 and w+1/2

18. What is the parent for a node ‘w’ of a complete binary tree in an array representation when w is not 0?

    A) floor((w-1)/2) (Ans)

    B) ceil((w-1)/2)

    C) (w-1)/2

    D) w/2