Assume that the operators +, -, × are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, x , +, -. The postfix expression corresponding to the infix ex

  1. Home

- Online Exam Test Papers | - MCQs[multiple choice questions and answers ] | - Mock Test Papers | - Practice Papers | - Sample Test Papers |

Question:
Assume that the operators +, -, × are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, x , +, -. The postfix expression corresponding to the infix ex

1.abc × + def ^ ^ -

2.abc × - def ^ ^ +

3.abc × + de ^ f ^ -

4.abc + × def ^ ^ -

More MCQS Questions and answers

  1. "Following is C like pseudo code of a function that takes a number as an argument, and uses a stack S to do processing. void fun(int n) { Stack S; // Say it creates an empty stack S while "
  2. 0
  3. A function f defined on stacks of integers satisfies the following properties. f(∅) = 0 and f (push (S, i)) = max (f(S), 0) + i for all stacks S and integers i. If a stack S contains the intege
  4. A priority queue Q is used to implement a stack S that stores characters. PUSH(C) is implemented as INSERT(Q, C, K) where K is an appropriate integer key chosen by the implementation. POP is implement
  5. A single array A[1..MAXSIZE] is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables top1 and top2 (topl< top 2) point to the location of the topmost element in
  6. After insertion the following node in AVL tree what will be the root node ? 10,20,30,40,50,15,5
  7. Array is collection of similar data type while structure is collection of:-
  8. Assume that the operators +, -, × are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, x , +, -. The postfix expression corresponding to the infix ex
  9. Balancing Factor of each node in AVL tree may be:-
  10. Balancing Factor of each node in B and B+ tree is
  11. Best Data Structure for Searching?
  12. Consider n elements that are equally distributed in k stacks. In each stack, elements of it are arranged in ascending order (min is at the top in each of the stack and then increasing downwards). Give
  13. Consider the following operations performed on a stack of size 5 : Push (a); Pop() ; Push(b); Push(c); Pop(); Push(d); Pop();Pop(); Push (e) Which of the following statements is correct?
  14. Consider the following pseudocode that uses a stack declare a stack of characters while ( there are more characters in the word to read ) { read a character push the character on the stack
  15. Consider the following statements: i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LIST
  16. Consider the postfix expression 2 3 2 * 6 / 5 + + 8 / 1 + Solve this expression by using stack and it give:-
  17. Convert the following infix expression into its equivalent post fix expression (A + B^ D) / (E * F) + G
  18. Hashing is a powerful data structure for the:-
  19. If the sequence of operations - push (1), push (2), pop, push (1), push (2), pop, pop, pop, push (2), pop are performed on a stack, the sequence of popped out values
  20. In circular link list, the last node contain the address of the:-
  21. In max Heap, the cost of finding largest element is :-
  22. In max Heap, the cost of finding smallest number is:-
  23. In min Heap, the cost of finding smallest elements is:-
  24. int func(struct node *ptr) { if(ptr==NULL) return; func(ptr->left); func(ptr->right); printf("%d",ptr->data); } The above function computes the :-
  25. int func(struct node *ptr) { if(ptr==NULL) return; func(ptr->left); printf("%d",ptr->data); func(ptr->right); } The above function computes the :-
  26. int func(struct node *ptr) { if(ptr==NULL) return; printf("%d",ptr->data); func(ptr->left); func(ptr->right); } The above function computes the :-
  27. Let S be a stack of size n >= 1. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform n pop operations. Assume that Push and Pop operation take X se
  28. Stack A has the entries a, b, c (with a on top). Stack B is empty. An entry popped out of stack A can be printed immediately or pushed to stack B. An entry popped out of the stack B can be only be pri
  29. Stack is implemented by:-
  30. Suppose a stack is to be implemented with a linked list instead of an array. What would be the effect on the time complexity of the push and pop operations of the stack implemented using linked list (
  31. The best data structure to check whether an arithmetic expression has balanced parenthesis is a
  32. The cost of construct the Heap is :-
  33. The five items: A, B, C, D, and E are pushed in a stack, one after other starting from A. The stack is popped four items and each element is inserted in a queue. The two elements are deleted from the
  34. The following node are inserted sequentially in Binary search tree:- 30,3,50,10,5,70,80,75,60,45 what will be the Inorder of above BST?
  35. The following node are inserted sequentially in Binary search tree:- 30,3,50,10,5,70,80,75,60,45 what will be the preorder of above BST?
  36. The following postfix expression with single digit operands is evaluated using a stack: 8 2 3 ^ / 2 3 * + 5 1 * - Note that ^ is the exponentiation operator. The top two elements of t
  37. The minimum number of stacks needed to implement a queue is
  38. The result evaluating the postfix expression 10 5 + 60 6 / * 8 – is
  39. The seven elements A, B, C, D, E, F and G are pushed onto a stack in reverse order, i.e., starting from G. The stack is popped five times and each element is inserted into a queue.Two elements are del
  40. To evaluate an expression without any embedded function calls:
  41. Which of the following are true:
  42. Which of the following are true:
  43. Which of the following are True?
  44. Which of the following is not an inherent application of stack?
  45. Which of the following is true about linked list implementation of stack?
  46. Which of the following permutation can be obtained in the same order using a stack assuming that input is the sequence 5, 6, 7, 8, 9 in that order?
  47. Which of the following sorting are the stable sorting:-
  48. Which of the following tree support the sequential search?
  49. Which one of the following is an application of Stack Data Structure?
  50. Worst Time complexity for searching an element in Binary search tree is:
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!