Question: Subject: Discrete Math Topics can be : 1. Algebraic Structures (Abstract Algebra, Binary structures) 2. Graph Theory 3. Graph Theory (Special graphs and Trees) 4.
Subject: Discrete Math
Topics can be :
1. Algebraic Structures (Abstract Algebra, Binary structures) 2. Graph Theory 3. Graph Theory (Special graphs and Trees) 4. Graph Theory Problems and Applications
LETTERS ONLY
38. Which of the following nodes should be the root of the Tree A so that nodes C and D will be of the same level? Tree A A. node I B. node E C. node F D. node H 6 er 9 exer 10 39. If the tree A is rooted at node G, then the tree will have a height of c Tree A A. 5 C. 3 B. 4 D. 2 40. If the tree A is rooted at node E, what will be the height of node B? Tree A A. 3 C. 1 B. 2 D. O 41. What is inorder listing of the nodes in binary Tree B? A Tree B A. FDBAGEJHC B. FDBAGEH JC C. BFDACGEJH D. BFDCGE JHA42. Suppose the postfix form of an expression is be * a d c + / - , what is its prefix form? A. - *be/+dca B. *+/- beadc C. *be - /a + dc D. - *be/a+ dc 7 43. Given the Graph C is bipartite, which of the following gives the grouping of the vertices of Graph C? Graph C A. X = {A, C, E, H, I}; Y={B, D, F, G, J} B. X = {A, D, F, H}; Y={B, C, E, G, I, J} C. X = {A, C, E, G, I}; Y={B, D, F, H, J} D. X = {A, D, E, G, I}; Y={B, C, F, H, J} 44. The leaves of a binary tree have labels B and C. If the preorder listing of the nodes of the tree is given by A B D E C, which of the following CANNOT be its inorder listing? A. BAECD B. BADCE C. BADEC D. BACDE 45. Given the postfix form C E F * D A - / + what is the root operation? A. + (Addition) B. * (Multiplication) C. - (Subtraction) D. / (Division) 2 H 6 D 3 3 5 E 2- 0 M 10 5 2 6 8 8 G
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
Students Have Also Explored These Related Mathematics Questions!