GATE CSE 2007 | Greedy Method Question 31 | Algorithms

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

GATE CSE 2006

MCQ (Single Correct Answer)

-0.6

Consider the following graph: GATE CSE 2006 Algorithms - Greedy Method Question 34 English

Which one of the following cannot be the sequence of edges added, in that order, to a minimum spanning tree using Kruskal’s algorithm?

$$(a-b),(d-f),(b-f),(d-c),(d-e)$$

$$(a-b),(d-f),(d-c),(b-f),(d-e)$$

$$(d-f),(a-b),(d-c),(b-f),(d-e)$$

$$(d-f),(a-b),(b-f),(d-e),(d-c)$$

GATE CSE 2004

MCQ (Single Correct Answer)

-0.6

Suppose we run Dijkstra’s single source shortest-path algorithm on the following edge-weighted directed graph with vertex P as the source.
GATE CSE 2004 Algorithms - Greedy Method Question 35 English

GATE CSE 2004 Algorithms - Greedy Method Question 35 English

In what order do the nodes get included into the set of vertices for which the shortest path distances are finalized?

$$P,Q,R,S,T,U$$

$$P,Q,R,U,S,T$$

$$P,Q,R,U,T,S$$

$$P,Q,T,R,U,S$$

GATE CSE 2003

MCQ (Single Correct Answer)

-0.6

What is the weight of a minimum spanning tree of the following graph? GATE CSE 2003 Algorithms - Greedy Method Question 19 English

PREVIOUS NEXT

GATE CSE Subjects

Browse all chapters by subject

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

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

Digital Logic

Boolean Algebra K Maps 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

Syntax Directed Translation Parsing Lexical Analysis 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

Function and Recursion Basic of Programming Language 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