GATE CSE 2021 Set 2 | Greedy Method Question 6 | Algorithms

GATE CSE 2021 Set 2

MCQ (Single Correct Answer)

-0.33

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

S₁: There exists a minimum weight edge in G which is present in every minimum spanning tree of G.

S₂: If every edge in G has distinct weight, then G has a unique minimum spanning tree. Which one of the following options is correct?

S1 is false and S2 is true.

S1 is true and S2 is false.

Both S1 and S2 are true.

Both S1 and S2 are false.

GATE CSE 2017 Set 1

MCQ (Single Correct Answer)

-0.33

Consider the following table :

Algorithms	Design Paradigms
(P) Kruskal	(ii) Greedy
(Q) Quicksort	(i) Divide and Conquer
(R) Floyd–Warshall	(iii) Dynamic Programming

Match the algorithms to the design paradigms they are based on.

$(\mathrm{P}) \leftrightarrow$ (ii), $\quad(\mathrm{Q}) \leftrightarrow$ (iii), (R) $\leftrightarrow$ (i)

$(\mathrm{P}) \leftrightarrow$ (iii), (Q) $\leftrightarrow$ (i), $\quad$ (R) $\leftrightarrow$ (ii)

$(\mathrm{P}) \leftrightarrow$ (ii), $\quad(\mathrm{Q}) \leftrightarrow$ (i), $\quad(\mathrm{R}) \leftrightarrow$ (iii)

$(\mathrm{P}) \leftrightarrow$ (i),$\quad(\mathrm{Q}) \leftrightarrow$ (ii), $\quad(\mathrm{R}) \leftrightarrow$ (iii)

GATE CSE 2016 Set 1

MCQ (Single Correct Answer)

-0.3

Let $$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 path between any pair of vertices does not change

$$P$$ only

$$Q$$ only

Neither $$P$$ nor $$Q$$

Both $$P$$ and $$Q$$

GATE CSE 2006

MCQ (Single Correct Answer)

-0.3

To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is:

Queue

Stack

Heap

B-Tree

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

Finite Automata and Regular Language Push Down Automata and Context Free Language Undecidability Recursively Enumerable Language and Turing Machine

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection

Algorithms

Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method Dynamic Programming P and NP Concepts

Digital Logic

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

Database Management System

Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

Concepts of Layering Data Link Layer and Switching Network Layer Application Layer Protocol Routing Algorithm TCP UDP Sockets and Congestion Control Lan Technologies and Wi-Fi Network Security

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Verbal Ability Logical Reasoning Numerical Ability

Discrete Mathematics

Set Theory & Algebra Linear Algebra Graph Theory Combinatorics Mathematical Logic Probability Calculus

Programming Languages

Basic of Programming Language Function and Recursion Pointer and Structure in C

Computer Organization

Computer Arithmetic Pipelining Machine Instructions and Addressing Modes Memory Interfacing IO Interface Alu Data Path and Control Unit Secondary Memory