8.7 Practice Question

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-PAPER-2/mathematics-i-ii-iii-iv/graph-theory/degree-of-vertex-isolated-and-pendant-vertices-handshaking-lemma-and-degree-sequence/asset-87-practice-question after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Programming, Data Structures, OOP & Java: 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, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  3. Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Access Technologies, Network Security, Society, Law & Ethics, Cloud Computing, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  4. Teaching Methodology / शिक्षण विधि: Growth and Development / वृद्धि और विकास, Concept of Pedagogy / शिक्षाशास्त्र की संकल्पना, Theories of Development / विकास के सिद्धांत, Inclusive Education / समावेशी शिक्षा, Experiential Pedagogy / अनुभवात्मक शिक्षाशास्त्र, Assessment and Evaluation / आकलन और मूल्यांकन, Socialisation and Gender / समाजीकरण और जेंडर, National Education Policy (NEP) 2020 / राष्ट्रीय शिक्षा नीति (NEP) 2020, Cognitive Processes / संज्ञानात्मक प्रक्रियाएँ, Teaching Planning and Teaching Skills / शिक्षण योजना और शिक्षण कौशल, Personality Development / व्यक्तित्व विकास, Teaching Methods / शिक्षण विधियाँ, Learning and Behavioural Theories / अधिगम और व्यवहारवादी सिद्धांत, Learners & Learning Process / अधिगमकर्ता और अधिगम प्रक्रिया, Factors Affecting Teaching / शिक्षण को प्रभावित करने वाले कारक, Teaching Methods and Approaches / शिक्षण विधियाँ एवं उपागम, Teaching-Learning Process and Classroom Management / शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन, Teaching Aids and Educational Technology / शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी, Microteaching and Classroom Communication / सूक्ष्म शिक्षण एवं कक्षा संप्रेषण, Assessment and Evaluation / आकलन एवं मूल्यांकन, Curriculum, Arts and Co-curricular Areas / पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र, Education of Children with Disabilities / दिव्यांग बच्चों की शिक्षा, Teacher: Qualities, Professional Ethics and Development / शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास
  5. Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  6. Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  7. Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  8. Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  9. Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep, Computer Fundamentals, Cyber Safety and Security, Computer Software, Operating System, Word Processing (MS Word), Computer Networks, Presentation Software (MS PowerPoint)
  10. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  12. Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  13. Mathematics - I, II, III, IV / गणित - I, II, III, IV: Permutation and Combination / क्रमचय और संचय, Logarithm / लघुगणक, Linear Algebra / रैखिक बीजगणित, Algebra / बीजगणित, Calculus / कलन, Trigonometry / त्रिकोणमिति, Vectors / सदिश, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps / शोध प्रक्रिया के चरण, Graph Theory, Sets, Relations, Functions and Discrete Mathematics / समुच्चय, संबंध, फलन और विविक्त गणित, Number Systems and Number Theory / संख्या पद्धति और संख्या सिद्धांत, Euclidean Geometry and Mensuration / यूक्लिडीय ज्यामिति और क्षेत्रमिति, Statistics and Probability / सांख्यिकी और प्रायिकता, Coordinate Geometry, Vectors and 3D Geometry / निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति, Polynomials, Equations and Complex Numbers / बहुपद, समीकरण और सम्मिश्र संख्याएँ, Plane Mensuration / समतल क्षेत्रमिति, Sampling / प्रतिचयन, Percentage / प्रतिशत, Simplification, Indices and Surds / सरलीकरण, घातांक और करणी, Ratio and Proportion / अनुपात और समानुपात
  14. Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  15. Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing, Trade, Marketing and Consumer Protection / व्यापार, विपणन एवं उपभोक्ता संरक्षण
  16. Statistical Techniques / सांख्यिकीय तकनीकें: Probability / प्रायिकता, Statistics / सांख्यिकी
  17. Interpolation - DI / अंतर्वेशन - DI: Data Interpretation / आँकड़ा निर्वचन
  18. Basis of Physics / भौतिकी का आधार: Scientific Achievements and Research / वैज्ञानिक उपलब्धियाँ और अनुसंधान
  19. Previous Year Paper:
  20. Business Studies and Management / व्यवसाय अध्ययन एवं प्रबंधन: Business Communication / व्यावसायिक संचार, Principles and Functions of Management / प्रबंध के सिद्धांत एवं कार्य, Accounting Fundamentals and Recording of Transactions / लेखांकन के आधार एवं लेन-देनों का अभिलेखन, Business Economics / व्यावसायिक अर्थशास्त्र, Depreciation, Final Accounts and Computerised Accounting / ह्रास, अंतिम खाते व कंप्यूटरीकृत लेखांकन, Knowledge Management & New Economy / ज्ञान प्रबंधन और नई अर्थव्यवस्था
  21. MIS / DSS / Expert Systems: Information Systems
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video segment focuses on solving a graph theory practice problem involving simple non-directed graphs. The instructor presents a question asking for the possible number of vertices in a graph with 24 edges where every vertex has an identical degree K. The core concept applied is the Handshaking Lemma, which states that the sum of all vertex degrees equals twice the number of edges. The instructor demonstrates how to translate this theorem into an algebraic equation by defining |V| = x for the number of vertices and deg(v) = K for the degree. Through this derivation, he establishes that x * K must equal 48 (since 24 edges multiplied by 2 equals 48). The solution process involves identifying that the number of vertices x must be a divisor of 48. By testing the provided multiple-choice options (20, 15, 10, and 8), the instructor eliminates values that do not divide 48 evenly. Specifically, he crosses out options a) 20, b) 15, and c) 10 because they are not factors of 48. The remaining option d) 8 is identified as the correct answer since 8 divides 48 to yield an integer degree K of 6. This exercise reinforces the relationship between edges, vertices, and regular graph properties.

Chapters

  1. 0:00 – 1:58 00:00-01:58

    The instructor introduces a graph theory problem displayed on screen asking for the possible number of vertices in a simple non-directed graph with 24 edges where every vertex has degree K. He immediately applies the Handshaking Lemma, writing '24 x 2' to represent twice the number of edges. He assigns variables |V| = x and deg(v) = K to set up the equation x * K = 48. The instructor then systematically evaluates the multiple-choice options a) 20, b) 15, c) 10, and d) 8. He crosses out options a), b), and c) because they are not divisors of 48, leaving d) 8 as the only valid solution where x * K results in an integer degree.

The video provides a concise demonstration of applying the Handshaking Lemma to determine graph properties. The central takeaway is that for a regular graph, the product of vertices and degree must equal twice the number of edges. This creates a divisibility constraint where the vertex count must be a factor of 2E. The instructor's method highlights a practical strategy for multiple-choice questions: calculate the total degree sum (2E), then check which option divides this sum evenly. This approach efficiently filters incorrect answers without needing to construct the actual graph, emphasizing algebraic verification over geometric visualization.

Loading lesson…