GATE CSE 2003 | Graph Theory Question 73 | Discrete Mathematics

GATE CSE 2003

MCQ (Single Correct Answer)

-0.3

Let $$G$$ be an arbitrary graph with $$n$$ nodes and $$k$$ components. If a vertex is removed from $$G$$, the number of components in the resultant graph must necessarily lie between

$$k$$ and $$n$$

$$k - 1$$ and $$k + 1$$

$$k - 1$$ and $$n - 1$$

$$k + 1$$ and $$n -k$$

GATE CSE 2002

MCQ (Single Correct Answer)

-0.3

Maximum number of edges in a n - node undirected graph without self loops is

$${n^2}$$

$$n\left( {n - 1} \right)/2$$

$$n - 1$$

$$\left( {n + 1} \right)\left( n \right)/2$$

GATE CSE 1994

MCQ (Single Correct Answer)

-0.3

The number of distinct simple graph with upto three nodes is

GATE CSE 1992

MCQ (Single Correct Answer)

-0.3

Which of the following is/are tautology?

$$\left( {a \vee b} \right) \to \left( {b \wedge c} \right)$$

$$\left( {a \wedge b} \right) \to \left( {b \vee c} \right)$$

$$\left( {a \vee b} \right) \to \left( {b \to c} \right)$$

$$\left( {a \to b} \right) \to \left( {b \to c} \right)$$

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

Undecidability Finite Automata and Regular Language Push Down Automata and Context Free Language 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

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Database Management System

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

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

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability

Discrete Mathematics

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

Programming Languages

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

Computer Organization

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