Help

4. What is the postfix expression for the infix: (a + b*(c - a)-d) (a) d b c a - *a+ (b) a b ca d--* (c) a b ca - *+ d- (d) None of the above 1) Which of the following data structure is Non- linear data structure? a) Queue b) Graphs c) Arrays d) None of above 2) Two main measures for the efficiency of an algorithm are a) Processor and memory b) Complexity and capacity c) Time and space d) Data and space 3) What is time required to insert an element in a stack with linked implementation? (a) (1 b) Ologn) c) C(n) d) C(n) 4) Consider the following definition of a recursive function f. int f( int x) { if(x== 0 ) return 1; return x * f(x); For which inputs x will the call f(x) terminate? (a) For x = 0 only (b) For all even inputs x only (c) For all odd inputs x only (d) For all innuts y