Q.1
The postfix form of the expression (A+ B)*(C*D- E)*F / G is?
  • a) AB+ CD*E – FG /**
  • b) AB + CD* E – F **G /
  • c) AB + CD* E – *F *G /
  • d) AB + CDE * – * F *G /
Q.2
The data structure required to check whether an expression contains a balanced parenthesis is?
  • a) Stack
  • b) Queue
  • c) Array
  • d) Tree
Q.3
What data structure would you mostly likely see in non recursive implementation of a recursive algorithm?
  • a) Linked List
  • b) Stack
  • c) Queue
  • d) Tree
Q.4
The process of accessing data stored in a serial access memory is similar to manipulating data on a ________
  • a) Heap
  • b) Binary Tree
  • c) Array
  • d) Stack
Q.5
The postfix form of A*B+C/D is?
  • a) *AB/CD+
  • b) AB*CD/+
  • c) A*BC+/D
  • d) ABCD+/*
Q.6
Which data structure is needed to convert infix notation to postfix notation?
  • a) Branch
  • b) Tree
  • c) Queue
  • d) Stack
Q.7
What is the result of the following operation?
  • a) X
  • b) X+S
  • c) S
  • d) XS
Q.8
The prefix form of an infix expression (p + q) – (r * t) is?
  • a) + pq – *rt
  • b) – +pqr * t
  • c) – +pq * rt
  • d) – + * pqrt
Q.9
Which data structure is used for implementing recursion?
  • a) Queue
  • b) Stack
  • c) Array
  • d) List
0 h : 0 m : 1 s