ExamSIDE (Powered by ExamGOAL)
Questions
PREVIOUS
1
GATE CSE 1991
Fill in the Blanks
+2
-0
The maximum number of possible edges in an undirected graph with a vertices and $$k$$ components is _________ .
2
GATE CSE 1990
MCQ (Single Correct Answer)
+2
-0.6
A graph is planar if and only if,
A
it does not contain subgraphs homeomorphic to K5 and K3, 3.
B
it does not contain subgraphs isomorphic to K5 or K3, 3.
C
it does not contain subgraphs isomorphic to K5 and K3, 3.
D
it does not contain subgraphs homeomorphic to K5 or K3, 3.
3
GATE CSE 1989
Subjective
+2
-0
Which of the following graphs is / are planar? (see fig.) GATE CSE 1989 Discrete Mathematics - Graph Theory Question 21 English
PREVIOUS
GATE CSE Subjects
Discrete Mathematics
Mathematical Logic Probability Set Theory & Algebra Combinatorics Linear Algebra Graph Theory Calculus
Programming Languages
Basic of Programming Language Function and Recursion Pointer and Structure in C
Theory of Computation
Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine Undecidability
Operating Systems
Process Concepts and Cpu Scheduling Synchronization and Concurrency File System IO and Protection Deadlocks Memory Management
Digital Logic
K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits
Computer Organization
Computer Arithmetic Memory Interfacing Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit Secondary Memory
Database Management System
Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing
Data Structures
Trees Hashing Arrays Linked List Graphs Stacks and Queues
Computer Networks
Concepts of Layering Lan Technologies and Wi-Fi Data Link Layer and Switching Network Layer Routing Algorithm TCP UDP Sockets and Congestion Control Application Layer Protocol Network Security
Algorithms
Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method P and NP Concepts Dynamic Programming
Compiler Design
Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization
Software Engineering
Software Engineering
Web Technologies
Web Technologies
General Aptitude
Numerical Ability Verbal Ability
EXAM MAP
Joint Entrance Examination
JEE MainJEE AdvancedWB JEEBITSATMHT CETKCETCOMEDKVITEEE
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12