Convert the following expression from reverse polish notation to infix notation. A B C D E + * - /
Asked in RPSC 23Feb 2016Question Paper for VicePrincipal/Superintendent ITI Screening Test 2012(Computer Science)VICE PRINCIPAL/SUPDT. ITI - 2012
Show answer
Answer: B. A/(B - C * (D + E) )
More RPSC Prelims previous year questions questions
- Consider the following statements S1, S2 and S3 : S1 : In call-by-value, anything that is passed into a function call is unchanged in the caller's scope when the function returns. S2 : In call-by-reference, a function receives implicit reference to a variable used as argument. S3 : In call-argument. caller is unable to see the modified variable used as argument.
- The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the postorder traversal sequence of the same tree?
- exponentiation operator. The top two elements of the stack after the first * is evaluated are:
- Ques #:38 In an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of time complexity, by
- Ques #:39 In design phase more emphasis is given on :-
- Ques #:40 Which of the following is not true in the function f(n) = 2n - 4 ?
- Ques #:42 Consider a set of 5 processes whose arrival time, CPU time needed and the priority are given below [Table: Process P1 Arrival time 0 CPU 5 Time priority needed (in ms) 5; P2 Arrival time 1 CPU 7 Time priority needed (in ms) 2; P3 Arrival time 2 CPU 3 Time priority needed (in ms) 1; P4 Arrival time 4 CPU 15 Time priority needed (in ms) 3; P5 Arrival time 5 CPU 20 Time priority needed (in ms) 4] Note: Higher number smaller priority. If the CPU scheduling policy is SJF. Average waiting (without Preemption) will be ______ ms
- Ques #:43 Match the definition or explanation in the right column with the left column. List - I List - II A. Deadlock Prevention P. Requires the re-cognition of unsafe state B. Deadlock Recovery Q. Pretend as if deadlock never occur C. Deadlock Avoidance R. Dissatisfy one of the necessary conditions D. Deadlock Ignorance S. Always requires the abortion of one, more executing process