Prodex Previous Years Solved Sample Placement Papers
-
Yesterday Sagher earned Rs. 100 less than Bilal, and today Sagher earned Rs. 75 more than Bilal. Which of the following must be true about Sagher's total earnings for the two days compared to Bilal's?
a) Sagher earned % of what Bilal earned
b) Sagher earned $17.50 more than Bilal
c) Sagher earned $2.50 more than Bilal
d) Sagher earned $25 less than Bilal
Answer: c) Sagher earned $2.50 more than Bilal -
QUESTION: 81, 9, 64, ______, 49, 7
A: 8
B: 9
C: 10
D: 11
Ans: A -
QUESTION: AGMS, agms, _______________
A: ABCD abcd
B: abcd ABCD
C: BHNT bhnt
D: bhnt BHNT
Ans: D -
QUESTION: aa, bbb, cccc, ______________
A: ddd
B: ddddd
C: dddd
D: DDDD
Ans: C -
QUESTION: ACF acf G_______
A: IL gil
B: JL gil
C: IL gjl
D: LL gli
Ans: A -
QUESTION: aB bB cD dD _________
A: ef
B: gH
C: fG
D: eF
Ans: B -
What should be done when a left parenthesis ‘(‘ is encountered?
a) It is ignored
b) It is placed in the output
c) It is placed in the operator stack
d) The contents of the operator stack is emptied
Answer: c
Explanation: When a left parenthesis is encountered, it is placed on to the operator stack. When the corresponding right parenthesis is encountered, the stack is popped until the left parenthesis and remove both the parenthesis.
-
Which of the following is an infix expression?
a) (a+b)*(c+d)
b) ab+c*
c) +ab
d) abc+*
Answer: a
Explanation: (a+b)*(c+d) is an infix expression. +ab is a prefix expression and ab+c* is a postfix expression.
-
What is the time complexity of an infix to postfix conversion algorithm?
a) O(N log N)
b) O(N)
c) O(N²)
d) O(M log N)
Answer: b
Explanation: The time complexity of an infix to postfix expression conversion algorithm is mathematically found to be O(N).
-
What is the postfix expression for the corresponding infix expression?
a+b*c+(d*e)
a) abc*+de*+
b) abc+*de*+
c) a+bc*de+*
d) abc*+(de)*+
Answer: a
Explanation: Using the infix to postfix expression conversion algorithm, the corresponding postfix expression is found to be abc*+de*+.
-
Parentheses are simply ignored in the conversion of infix to postfix expression.
a) True
b) False
Answer: b
Explanation: When a parenthesis is encountered, it is placed on the operator stack. When the corresponding parenthesis is encountered, the stack is popped until the other parenthesis is reached and they are discarded.
-
It is easier for a computer to process a postfix expression than an infix expression.
a) True
b) False
Answer: a
Explanation: Computers can easily process a postfix expression because a postfix expression keeps track of precedence of operators.
-
What is the postfix expression for the infix expression?
a-b-c
a) -ab-c
b) ab – c –
c) – -abc
d) -ab-c
Answer: b
Explanation: The corresponding postfix expression for the given infix expression is found to be ab-c- and not abc- -.
-
What data structure is used when converting an infix notation to prefix notation?
(a) Stack
(b) Queue
(c) B-Trees
(d) Linked-list
Answer: (a)
Explanation: To convert infix to prefix, reverse the equation and use the infix-to-postfix algorithm. This process utilizes stacks for operator precedence and association. -
What would be the Prefix notation for the given equation?
A+(B*C)
(a) +A*CB
(b) *B+AC
(c) +A*BC
(d) *A+CB
Answer: (c)
Explanation: Reverse the equation or scan from right to left. Apply the infix-to-postfix algorithm. Inside the brackets, the result isCB*, and outside the brackets, it isA+. Reversing gives+A*BC. -
What would be the Prefix notation for the given equation?
(A*B)+(C*D)
(a) +*AB*CD
(b) *+AB*CD
(c) **AB+CD
(d) +*BA*CD
Answer: (a)
Explanation: Reverse the equation or scan from right to left. Apply the infix-to-postfix algorithm. Brackets evaluate toDC*andBA*, resulting in+*AB*CDafter reversal. -
What would be the Prefix notation for the given equation?
A+B*C^D
(a) +A*B^CD
(b) +A^B*CD
(c) *A+B^CD
(d) ^A*B+CD
Answer: (a)
Explanation: Reverse the equation or scan from right to left. Apply the infix-to-prefix algorithm. The order of precedence is+*and^. The reversed expression evaluates to+A*B^CD.