See Our team
Wondering how we keep quality?
Got unsolved questions? Ask Questions
Engineering GATE CBSE NCERT Psychology English Computer Constitution Astrology Yoga Economics Physics Biology Electronics Microprocessor Career Interview Anatomy Botany
Let G be an undirected graph. Consider a depth-first traversal of G, and let T be the resulting depth-first search tree GATE CSE 20001 AnswerThe preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the postorder traversal sequence of the same tree? -gate-computer science-20131 AnswerThe most appropriate matching for the following pairs -GATE CSE 20001 AnswerLet G = (V, E) be a simple undirected graph, and s be a particular vertex in it called the source. -gate-cse-20151 AnswerLet G be an undirected connected graph with distinct edge weight. GATE CSE 20001 AnswerLet w be the minimum weight among all edge weights in an undirected connected graph. Let e be a specific edge of weight w. Which of the following is FALSE?-computer science-gate-2007 1 AnswerThe inorder and preorder traversal of a binary tree are d b e a f c g and a b dec f g, respectively. -computer science-gate-20071 AnswerSuppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checking that the vertex has not been visited earlier. Then the maximum possible recurs1 AnswerLet G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1, 2, 3, 4, 5, and 6. The maximum possible weight that a minimum weight spanning tree of G can have is ____. Gate-cs-20161 Answer Net ultimate bearing capacity of a footing embedded in a clay stratum - gate civil 2017 1 Answerhow to find the number of bounded faces in an undirected graph?1 AnswerLet G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to A -gate-cse-20121 AnswerDiscuss the variation of acceleration due to gravity with depth. Show that the value of g at height h is same as the value of acceleration due to gravity at depth d = 2h. Physics Cbse class 11 1 AnswerThe correct conditions for which the hydraulically efficient rectangular channel will deliver maximum discharge are P – depth of water is equal to half the breadth of channel Q – depth of water is equal to breadth of channel R – depth of water 1 AnswerDefine undirected graph?1 AnswerWe are given a set of n distinct elements and an unlabeled binary tree with n nodes. -gate-cse-20111 AnswerLet G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive any distinct. Consider the following statements: -gate computer science 20171 AnswerWhat are the monocular cues of depth perception? Explain the role of binocular cues in the perception of depth? cbse-11-psychology-20151 AnswerLet LASTPOST, LASTIN and LASTPRE denote the last vertex visited in a postorder, inorder and preorder traversal, respectively, of a complete binary tree. GATE CSE 20001 AnswerQ45 - gate civil 2017 1 Answer