9.2 Practice Question

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/unit-i-discrete-mathematical-structure/graph-theory/minimum-and-maximum-degree-relationships-degree-constraints-and-havel-hakimi-theorem/asset-92-practice-question-19536 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK / राज्यवार सामान्य ज्ञान (GK)
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs / GK- समसामयिकी
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. 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, Complexity Theory
  13. 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video segment focuses on solving graph theory practice problems using the Handshaking Lemma. The instructor demonstrates how to determine vertex constraints based on edge counts and degree limits. Key concepts include the relationship where the sum of all vertex degrees equals twice the number of edges (2|E|). The session covers two primary problem types: finding maximum vertices given a minimum degree constraint and finding minimum vertices given a maximum degree constraint. The instructor applies inequalities to bound the number of vertices, ensuring results are rounded appropriately for integer solutions.

Chapters

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

    The instructor begins by addressing a problem asking for the maximum number of vertices in a simple graph with 35 edges where each vertex has a degree of at least 3. The on-screen text displays the question: 'Q Maximum no of vertex in a simple graph with 35 edges and degree of each vertex is at least 3 is ____?'. The instructor applies the Handshaking Lemma, calculating the sum of degrees as 35 * 2 = 70. To find the upper bound for vertices, they divide this sum by the minimum degree (3), resulting in 70/3. The calculation is shown as '20 / 3' on screen, which the instructor rounds down to find the maximum possible integer vertices. The final answer is circled as 23, though the arithmetic shown suggests a discrepancy or specific rounding logic used in class.

  2. 2:00 – 2:25 02:00-02:25

    The video transitions to a second problem asking for the minimum number of vertices possible in a simple graph with 41 edges where each vertex has a degree of at most 5. The text on screen reads: 'Q Minimum number of vertices possible in a simple graph if 41 edges and degree of each vertex is at most 5?'. The instructor calculates the total degree sum as 41 * 2 = 82. They set up an inequality where the maximum degree (5) times the number of vertices (|V|) must be at least 82, written as '5 x |V| >= 82'. Solving for |V| gives approximately 16.4, which is displayed as '< 16.4'. Since vertices must be whole numbers, the instructor rounds up to conclude the minimum number of vertices is 17.

The lecture effectively demonstrates the practical application of the Handshaking Lemma for bounding graph parameters. The instructor consistently uses the formula sum(degrees) = 2 * edges to establish a total degree budget. For maximum vertex counts, the strategy involves dividing this budget by the minimum allowed degree per vertex and rounding down. Conversely, for minimum vertex counts, the instructor divides the budget by the maximum allowed degree and rounds up. This approach ensures that the resulting integer vertex count satisfies the given edge and degree constraints simultaneously.

Loading lesson…