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
Never Miss an Update
Subscribe to eduladder news letter Today
In an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of time complexity, by -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 AnswerConsider the directed graph shown in the figure below. There are multiple shortest paths between vertices S and T. Which one will be reported by Dijstra?s shortest path algorithm? Assume that, in any iteration, the shortest path to a vertex v is upda1 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 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 AnswerConsider the C code fragment given below. -gate computer science 20171 AnswerLet G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? P: Minimum spanning tree of G does not change Q: Shortest pat1 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 Answerhow to find the number of bounded faces in an undirected graph?1 AnswerWhich of the following statements are TRUE? -gate-computer science-20131 AnswerLet G = (V, E) be a simple undirected graph, and s be a particular vertex in it called the source. -gate-cse-20151 AnswerConsider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue? Gate1 AnswerA queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT (n refers to the number of items in the queue)? Gate-cs-20162 AnswerWhat is the preferred method of resolving unhandled exceptions in Node.js?1 AnswerWhat is typically the first argument passed to a Node.js callback handler?1 AnswerCan we evaluate simple expression using Node REPL?1 AnswerThe cost of link N2-N3 reduces to 2 (in both directions). After the next round of updates, what will be the new distance vector at node, N3?-gate-computer science-20111 AnswerWhich of the following graphs has an Eulerian circuit? -computer science-gate-20071 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 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 Answer