Gate 1994

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/engineering-maths/graph-theory/number-of-graphs-counting-of-simple-undirected-unlabeled/asset-gate-1994-2209 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics, Network Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. Paper-2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video features an educational lecture on graph theory, specifically analyzing counting problems from GATE examinations. The instructor solves two distinct questions: one involving the summation of graphs with up to three nodes, and another deriving the general formula for the number of undirected graphs on n vertices. The lesson emphasizes the relationship between the number of vertices, possible edges, and the total number of distinct simple graphs.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor tackles a GATE-1994 question asking for the number of distinct simple graphs with up to three nodes. He underlines 'up to three nodes' to highlight that the answer requires summing the counts for 1, 2, and 3 vertices. He writes |V|=1, |V|=2, and |V|=3 on the screen. He introduces the formula for the number of possible edges, n(n-1)/2, and the total number of graphs, 2^(n(n-1)/2). He calculates the specific counts: 1 graph for 1 node (2^0), 2 graphs for 2 nodes (2^1), and 8 graphs for 3 nodes (2^3). Although he briefly circles option (c) 8, he proceeds to sum these (1+2+8) to arrive at the total of 11, identifying the correct option.

  2. 2:00 – 2:18 02:00-02:18

    The lecture shifts to a GATE-2001 question asking for the number of undirected graphs constructible from a set of n vertices. The instructor underlines 'undirected graphs' and 'not necessarily connected' to define the problem constraints. He circles option (D), 2^(n(n-1)/2). He explains that for n vertices, the number of possible edges is n(n-1)/2. Since each edge has two states (present or absent), the total number of graphs is 2 raised to the power of the number of edges. He writes |V|=n and derives the edge count formula to justify the final answer, confirming the exponential relationship.

The lesson progresses from a specific numerical example to a general theoretical formula. The instructor first demonstrates the calculation for small n to build intuition, showing that 'up to n' implies a summation of cases. Then, he generalizes this to finding the total number of graphs for a fixed n, reinforcing the exponential relationship based on the number of possible edges. This progression helps students understand both the calculation method and the underlying combinatorial logic required for such problems.

Loading lesson…