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 AnswerL et G be a simple undirected graph. Let TD be a depth first search tree of G. Let TB be a breadth first search tree of G. Consider the following statements. (I) No edge of G is a cross edge with respect to TD. (A cross edge in G is between two nodes neither of which is an ancestor of the other in TD.) (II) For every edge (u,v) of G, if u is at depth i and v is at depth j in TB, then |𝑖 − 𝑗| = 1. Which of the statements above must necessarily be true?1 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 AnswerT he postorder traversal of a binary tree is 8,9,6,7,4,5,2,3,1. The inorder traversal of the same tree is 8,6,9,4,7,2,5,1,3. The height of a tree is the length of the longest path from the root to any leaf. The height of the binary tree above is ______.1 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 AnswerA cylindrical wooden block of length 50 cm is floating in water in such a way that its axis is vertical. The densities of wood and water are 800 kg/m3 and 1000 kg/m3, respectively. The submerged depth, i.e., depth of immersion (in cm) of the cylinder is _______0 Answerhow to find the number of bounded faces in an undirected graph?1 AnswerA plane electromagnetic (EM) wave travelling vertically downwards with a frequency of 1000 Hz in a homogeneous medium has a skin depth of 100 m. The ratio of the amplitude of the EM wave at a depth of 75 m with respect to the amplitude at the Earth’s surface is ___________.0 AnswerMild steel is carburized at 1300 K for 1 hour to obtain a certain case depth. Keeping the time as 1 hour, the case depth can be doubled by increasing the temperature to ______________K (round off to the nearest whole number)0 Answer Net ultimate bearing capacity of a footing embedded in a clay stratum - gate civil 2017 1 AnswerDefine 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 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 Answer
Data structure with C 10CS35 unit-8Design and Analysis of Algorithms Subject Code : 10CSL47 Lab Manual PROGRAM-10Design and Analysis of Algorithms Subject Code : 10CSL47 Lab Manual PROGRAM-6Design and Analysis of Algorithms Subject Code : 10CSL47 Lab Manual PROGRAM-7Data structure with C 10CS35 unit-5COMPAILER DESIGN 10CS63 VTU NOTES UNIT-5GATE Mechanical Engineering Question Paper with Answer key 2000 download GATE Electronics and Communication Engineering Question Paper with Answer key 2000 downloadGATE Electrical Engineering Question Paper with Answer key 2000 downloadFILE STRUCTURES 10IS63
Loading More post