PREVIOUS NEXT
1
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
Consider the following graph: GATE CSE 2009 Algorithms - Greedy Method Question 29 EnglishWhich one of the following is NOT the sequence of edges added to the minimum spanning tree using Kruskal’s algorithm?
A
(b,e)(e,f)(a,c)(b,c)(f,g)(c,d)
B
(b,e)(e,f)(a,c)(f,g)(b,c)(c,d)
C
(b,e)(a,c)(e,f)(b,c)(f,g)(c,d)
D
(b,e)(e,f)(b,c)(a,c)(f,g)(c,d)
2
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
GATE CSE 2008 Algorithms - Greedy Method Question 30 English Dijkstra's single source shortest path algorithm when run from vertex a in the above graph, computes the correct shortest path distance to
A
only vertex a
B
only vertices a,e,f,g,h
C
only vertices a,b,c,d
D
all the vertices
3
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-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. Which of the following is the Huffman code for the letter a, b, c, d, e, f?
A
0, 10, 110, 1110, 11110, 11111
B
11, 10, 011, 010, 001, 000
C
11, 10, 01, 001, 0001, 0000
D
110, 100, 010, 000, 001, 111
4
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-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?
A
There is a minimum spanning tree containing e.
B
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.
C
Every minimum spanning tree has an edge of weight w .
D
e is present in every minimum spanning tree.
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
Sequential Circuits Boolean Algebra K Maps Combinational Circuits Number Systems
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
Software Engineering
Compiler Design
Syntax Directed Translation Parsing Lexical Analysis Code Generation and Optimization
Web Technologies
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 Pointer and Structure in C Function and Recursion
Computer Organization
Computer Arithmetic Pipelining Machine Instructions and Addressing Modes Memory Interfacing IO Interface Alu Data Path and Control Unit Secondary Memory
EXAM MAP

Browse past year questions by exam & subject

Joint Entrance Examination
JEE Main JEE Advanced MHT CET BITSAT COMEDK WB JEE KCET VITEEE AP EAPCET TS EAMCET IAT (IISER)
Medical
NEET AIIMS MHT CET (Biology)
Graduate Aptitude Test in Engineering
GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN GATE Data Science and Artificial Intelligence
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12