GATE CSE 2009 | Greedy Method Question 25 | Algorithms

PREVIOUS NEXT

GATE CSE 2009

MCQ (Single Correct Answer)

-0.6

Consider the following graph: GATE CSE 2009 Algorithms - Greedy Method Question 28 English

Which one of the following is NOT the sequence of edges added to the minimum spanning tree using Kruskal’s algorithm?

(b,e)(e,f)(a,c)(b,c)(f,g)(c,d)

(b,e)(e,f)(a,c)(f,g)(b,c)(c,d)

(b,e)(a,c)(e,f)(b,c)(f,g)(c,d)

(b,e)(e,f)(b,c)(a,c)(f,g)(c,d)

GATE CSE 2008

MCQ (Single Correct Answer)

-0.6

GATE CSE 2008 Algorithms - Greedy Method Question 29 English

Dijkstra's single source shortest path algorithm when run from vertex a in the above graph, computes the correct shortest path distance to

only vertex a

only vertices a,e,f,g,h

only vertices a,b,c,d

all the vertices

GATE CSE 2007

MCQ (Single Correct Answer)

-0.6

Let 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?

There is a minimum spanning tree containing e.

If e is not in a minimum spanning tree T, then in the cycle formed by adding e to T, all edges have the same weight.

Every minimum spanning tree has an edge of weight w .

e is present in every minimum spanning tree.

GATE CSE 2007

MCQ (Single Correct Answer)

-0.6

Suppose the letters a, b, c, d, e, f have probabilities 1/2, 1/4, 1/8, 1/16, 1/32, 1/32 respectively. What is the average length of Huffman codes?

2.1875

2.25

1.9375

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 P and NP Concepts Dynamic Programming

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