GATE CSE 2002 | Graph Theory Question 80 | Discrete Mathematics

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)$$

GATE CSE 1992

MCQ (Single Correct Answer)

-0.3

A non-planar graph with minimum number of vertices has

9 edges, 6 vertices

6 edges, 4 vertices

10 edges, 5 vertices

9 edges, 5 vertices

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

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

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

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

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