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 T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is _____. -gate computer science 20171 AnswerWhich of the following statements is/are TRUE for undirected graphs? -gate-computer science-20131 AnswerLet G be the non-planar graph with the minimum possible number of edges. Then G has -computer science-gate-20071 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 AnswerLet G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to -gate-computer science-20121 AnswerWhich of the following graphs has an Eulerian circuit? -computer science-gate-20071 AnswerConsider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is ½. What is the expected number of unordered cycles of length three? -gate-computer science-20121 AnswerLet G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to -gate-cse-20121 AnswerLet T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are: Note: The height of a tree with a single node is 0. -gate computer science 20171 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 AnswerUGC NET Computer Science Paper 2 5 A tree with n vertices is called graceful if its vertices can be labelled with integers 1 2 n such that the absolute value of the difference of the labels of adjacent vertices are all different Which of the1 AnswerLet G be a simple undirected planar graph on 10 vertices with 15edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to -gate-computer science-20121 AnswerShow that the points (-2, 3), (8, 3) and (6, 7) are the vertices of a right triangle. Mathematics CBSE class 10 20131 AnswerIf A (-4,8), B(-3,-4), C(0,-5) and D(5,6) are the vertices of a quadrilateral ABCD find its area. Mathematics CBSE class 10 20151 AnswerIf P(-5,-3),Q(-4,-6),R(2,-3) and S(1,2) are the vertices of a quadrilateral PQRS, find its area. Mathematics CBSE class 10 20152 AnswerIf A(5,2), B(2,-2) and C (-2,t) are the vertices of a right angled triangle with angle B = 90 degree, then find the value of t. Mathematics CBSE class 10 20151 AnswerLet k be an integer such that triangle with vertices (k, –3k), (5, k) and (–k, 2) has area 28 sq. units. Then the orthocentre of this triangle is at the point :-JEE MAINS-Mathematics-20171 AnswerConsider the following rooted tree with the vertex labelled P as the root: (-Gate Computer Science 2014)1 AnswerGate-cs-20161 AnswerUGC NET Computer Science Paper-2 December 2015 2. Which of the following statement(s) is/are false? 1 Answer