Practice Questions

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/engineering-maths/graph-theory/graph-isomorphism-definition-detection-and-problem-solving/asset-practice-questions-2285 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 is an academic lecture on graph theory, delivered by Sanchit Jain of Knowledge Gate Educator. The lesson focuses on identifying properties of graphs, specifically planarity and isomorphism, using hand-drawn diagrams on a whiteboard. The instructor systematically presents pairs of graphs, asking viewers to determine if they share specific properties, indicated by writing 'T' (True) or 'F' (False) below them. He uses red markings to highlight specific vertices and paths, guiding the viewer's attention to critical structural features.

Chapters

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

    The instructor begins with two complex graphs. The first has vertices labeled a through g, resembling a house shape with internal diagonals connecting to a central point. The second has vertices 1 through 7, forming a star-like structure with a central vertex. He circles vertices 'e', 'f', and 'c' in the first graph and vertex '4' in the second, possibly highlighting degrees or specific connections. He writes a 'J' below. He then shows a hexagon with internal diagonals and a rectangle with internal lines, marking them with a 'T'. He draws red squiggly lines on these graphs, tracing paths around vertices 'a', 'b', '6', and '7', likely demonstrating a traversal or checking for planarity.

  2. 2:00 – 5:00 02:00-05:00

    The lecture progresses to a new set of examples. A pentagon-like graph and a cone-shaped graph are shown and marked with a 'T'. The instructor draws red squiggly lines around vertices 'c', 'f', '1', and '6'. Next, a square graph with internal diagonals and a square with internal lines are presented and marked with an 'F'. He circles vertices 'a', 'b', 'c' and '1', '2', '4', indicating these might be the reason for the 'F' (perhaps non-planar subgraphs like K3,3 or K5). He continues with a prism graph and a rectangular graph, circling vertex 'b'. He then shows a square with a triangle attached and a square with internal lines, marking them 'T'. Finally, a square with internal lines and a larger square with internal lines are shown, marked 'F', and then another pair marked 'T' with vertex '6' circled.

  3. 5:00 – 6:34 05:00-06:34

    The final segment displays a collection of eight graphs arranged in two rows. The top row includes a cube-like graph, a hexagon with diagonals, a cube, and a bipartite graph (K3,3). The instructor draws red curved lines connecting the first three graphs to the bipartite graph, suggesting a discussion on isomorphism or equivalence. The bottom row features a bipartite graph, a hexagon, a tetrahedron, and a pentagon with diagonals. He draws red lines connecting the bipartite graph to the hexagon and the hexagon to the tetrahedron. He places a double underline under the final pentagon graph, possibly indicating it as the correct answer or a key example. The video ends with the 'Knowledge Gate Educator' branding.

The video provides a visual walkthrough of graph theory problems, likely from a competitive exam preparation context. The instructor uses a binary 'T'/'F' system to test the planarity or isomorphism of graph pairs. By circling vertices and drawing red paths, he guides the viewer's attention to critical structural features like cycles, crossings, or specific subgraphs (like K3,3 or K5) that determine the graph's properties. The final segment consolidates these concepts by showing a gallery of graphs and drawing connections between isomorphic pairs, reinforcing the idea that different drawings can represent the same underlying graph structure.

Loading lesson…