GATE CS 2020 | Q40:Let G=(V,E) be a directed, weighted graph with weight function w:E→R. For some

GATE CS 2020 | Q40:Let G=(V,E) be a directed, weighted graph with weight function w:E→R. For some

GATE CS 2020 | Q 31:Let G=(V,E) be a weighted undirected graph and let T be a Minimum Spanning TreeПодробнее

GATE CS 2020 | Q 31:Let G=(V,E) be a weighted undirected graph and let T be a Minimum Spanning Tree

GATE CS 2020 | Q49:Consider a graph G=(V,E), where V={v1,v2,…,v100}, E={(vi,vj)∣1 i j 100}, and weigПодробнее

GATE CS 2020 | Q49:Consider a graph G=(V,E), where V={v1,v2,…,v100}, E={(vi,vj)∣1 i j 100}, and weig

GATE 2020 | DS | ALGORITHMS | FUNCTIONS | SOLUTIONS ADDA | GATE TEST SERIES | EXPLAINED BY VIVEKПодробнее

GATE 2020 | DS | ALGORITHMS | FUNCTIONS | SOLUTIONS ADDA | GATE TEST SERIES | EXPLAINED BY VIVEK

GATE CS 2022 | Question: 39Consider a simple undirected weighted graph G, all of whose edge weightПодробнее

GATE CS 2022 | Question: 39Consider a simple undirected weighted graph G, all of whose edge weight

GATE CSE 2020 Q ||Algorithms || GATE Insights Version: CSEПодробнее

GATE CSE 2020 Q ||Algorithms || GATE Insights Version: CSE

GATE CS 2012 | Q40:Consider the directed graph shown in the figure below. There are multiple shortПодробнее

GATE CS 2012 | Q40:Consider the directed graph shown in the figure below. There are multiple short

GATE 2017 CS Q26. Let G = (V, E) be any connected undirected edge-weighted graph.Подробнее

GATE 2017 CS Q26. Let G = (V, E) be any connected undirected edge-weighted graph.

GATE 2020 | ALGORITHMS | MINIMUM SPANNING T | SOLUTIONS ADDA | GATE TEST SERIES | EXPLAINED BY VIVEKПодробнее

GATE 2020 | ALGORITHMS | MINIMUM SPANNING T | SOLUTIONS ADDA | GATE TEST SERIES | EXPLAINED BY VIVEK

GATE CS 2012 | Q 29:Let G be a weighted graph with edge weights greater than one and G′ be the graphПодробнее

GATE CS 2012 | Q 29:Let G be a weighted graph with edge weights greater than one and G′ be the graph

GATE CS 2020 | Que 52 | GATE CS PYQs | GATE CS Solutions | Discrete Maths | Edge ColoringПодробнее

GATE CS 2020 | Que 52 | GATE CS PYQs | GATE CS Solutions | Discrete Maths | Edge Coloring

GATE CSE 2022 Question 4 | 1 marksПодробнее

GATE CSE 2022 Question 4 | 1 marks

GATE CS 2022 | Q48:Let G(V,E) be a directed graph, where V={1,2,3,4,5} is the set of vertices and EПодробнее

GATE CS 2022 | Q48:Let G(V,E) be a directed graph, where V={1,2,3,4,5} is the set of vertices and E

GATE CS 2017 Set 1 | Q26:Let G=(V,E) be any connected, undirected, edge-weighted graph. The weightsПодробнее

GATE CS 2017 Set 1 | Q26:Let G=(V,E) be any connected, undirected, edge-weighted graph. The weights

Algorithms | MST | CS GATE PYQs | GATE 2017 Set-1 Solutions | Solutions Adda | Q30 | GATE 2022Подробнее

Algorithms | MST | CS GATE PYQs | GATE 2017 Set-1 Solutions | Solutions Adda | Q30 | GATE 2022

GATE CSE 2020Подробнее

GATE CSE 2020

GATE CS 2021 Set 1 | Q40:Define Rn to be the maximum amount earned by cutting a rod of length nПодробнее

GATE CS 2021 Set 1 | Q40:Define Rn to be the maximum amount earned by cutting a rod of length n

GATE CSE 2016 SET 1 Q ||Algorithms || GATE Insights Version: CSEПодробнее

GATE CSE 2016 SET 1 Q ||Algorithms || GATE Insights Version: CSE

Graph Theory- Let G be a connected undirected weighted graph. Consider the following two statements.Подробнее

Graph Theory- Let G be a connected undirected weighted graph. Consider the following two statements.

GATE CS 2020 | Q 39: Which one of the following predicate formulae is NOT logically valid?Note thatПодробнее

GATE CS 2020 | Q 39: Which one of the following predicate formulae is NOT logically valid?Note that

События