Data structure

CBSE NET Q. Convert the following infix expression into its equivalent post fix expression (A + B^ D) / (E – F) + G (A) … Read more

CBSE NET JUNE 2015 Paper II Q. The in-order and pre-order Traversal of binary Tree are dbeafcg and abdecfg respectively. The post-order Traversal  is______. A)dbefacg          B)debfagc         … Read more

CBSE NET DECEMBER 2012 PAPER II Q. Given an empty stack, after performing push (1), push (2), Pop, push (3), push (4), Pop, Pop, push … Read more

CBSE NET JUNE 2012 PAPER II Q. The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal. (A) ABFCDE (B) … Read more

CBSE NET JUNE 2012 PAPER II Q. The postfix expression AB + CD – * can be evaluated using a (A) Stack (B) Tree (C) … Read more

CBSE NET  Q. Consider the following transportation problem. The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel’s Approximation … Read more

CBSE NET June 2011 Q. The number of different trees with 8 nodes is (A) 256 (B) 255 (C) 248 (D) None of the above … Read more

CBSE NET December 2010 PAPER II Q. A binary tree with 27 nodes has _______ null branches. (A) 54 (B) 27 (C) 26 (D) None … Read more

CBSE NET December 2010 PAPER II Q. What is the maximum number of nodes in a B-tree of order 10 of depth 3 (root at … Read more

CBSE NET July 2016 PAPER II Q. What is the value returned by the function f given below when n=100 ? int f (int n) … Read more