Tricks to Solve Grouping Type Questions in P&C

Duration: 12 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-PAPER-2/mathematics-i-ii-iii-iv/permutation-and-combination/circular-grouping-permutations/asset-tricks-to-solve-grouping-type-questions-in-pc 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, संज्ञानात्मक प्रक्रियाएँ / 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, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), कंप्यूटर नेटवर्क / Computer Networks, प्रेज़ेंटेशन (MS PowerPoint) / 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: 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: आँकड़ा निर्वचन / 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
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video is a lecture on permutations and combinations, presented by an instructor from Knowledge Gate Educator. The video begins with a title slide that visually distinguishes between permutations and combinations using examples like a dice game and a fruit basket. The main content starts with a problem: "In how many ways can we arrange 4 boys and 5 girls?" The instructor explains that this is a permutation problem because the order of arrangement matters. He calculates the total number of arrangements as 9! (362,880), representing the permutation of 9 distinct individuals. The lecture then transitions to a more complex problem involving 5 boys and 4 girls, with four different constraints: (a) no two girls are together, (b) no two boys are together, (c) a particular pair of girls always sits together, and (d) a particular pair of girls do not sit together. For each case, the instructor uses the fundamental principles of permutations, including treating a group as a single unit and applying the formula nPk = n! / (n-k)!. The video concludes with a final 'Thanks for Watching' screen.

Chapters

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

    The video opens with a title slide that introduces the topic of permutations and combinations. The slide is divided into four quadrants: the top-left shows a dice game, the top-right shows a fruit basket, the bottom-left shows a pizza, and the bottom-right shows two people in an office. The words "PERMUTATION" and "COMBINATION" are prominently displayed. The scene then transitions to a presentation slide titled "Confused" with the question "Should I unlock with Permutation or Combination?". This slide features a cartoon detective character and two lockboxes labeled "Permutation" and "Combination". The instructor, Yash Jain, is visible in a small window in the bottom right corner. The slide also includes the branding for "Knowledge Gate Educator" and the text "Basic To Advance".

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

    The video displays a problem on a yellow background with a pattern of small shapes. The problem is: "q: In how many ways can we arrange 4 boys and 5 girls?" The instructor begins to solve this by identifying the total number of students as 9. He explains that since the question is about arranging people, the order matters, which makes it a permutation problem. He writes the formula for the total number of arrangements as 9!, which he calculates as 362,880. He also notes that the arrangement of the 4 boys is 4! and the arrangement of the 5 girls is 5!, but clarifies that for the total arrangement of all 9 individuals, it is simply 9!.

  3. 5:00 – 10:00 05:00-10:00

    The video presents a new problem: "q: 5 Boys and 4 Girls" with four sub-questions. The instructor begins to solve the first part, (a) "No two girls are together". He explains that to ensure no two girls are together, the boys must be arranged first, creating spaces between them where the girls can be placed. He writes the arrangement of 5 boys as B1 B2 B3 B4 B5, which creates 6 possible spaces (before, between, and after the boys). He then explains that the 4 girls must be placed in 4 of these 6 spaces, which is a permutation of 6 items taken 4 at a time, written as 6P4. He calculates this as 6! / (6-4)! = 6! / 2! = 360. He then multiplies this by the number of ways to arrange the 5 boys, which is 5!, to get the total number of arrangements for this condition.

  4. 10:00 – 12:22 10:00-12:22

    The instructor continues to solve the remaining parts of the problem. For part (b) "No two boys are together", he explains that the girls must be arranged first, creating spaces for the boys. He writes the arrangement of 4 girls as G1 G2 G3 G4, which creates 5 spaces. He then calculates the number of ways to place 5 boys in these 5 spaces as 5P5, which is 5!. He multiplies this by the number of ways to arrange the 4 girls, which is 4!, to get the total. For part (c) "Particular pair of girls always sit together", he treats the pair as a single unit, so there are 8 items to arrange (the pair and the other 7 individuals). He calculates the number of arrangements as 8! and multiplies it by 2! (the number of ways the pair can be arranged within their unit). For part (d) "A particular pair of girls do not sit together", he explains that this is the total number of arrangements minus the number of arrangements where the pair sits together. He writes the formula as #total - #sit together, which is 9! - (8! x 2!). The video ends with a black screen that says "THANKS FOR WATCHING".

The video provides a structured and progressive lesson on permutations and combinations. It begins by establishing the fundamental difference between the two concepts using visual metaphors. The core of the lesson is a series of worked examples that build in complexity. The first example is a straightforward permutation of 9 distinct individuals. The second example, involving 5 boys and 4 girls, systematically applies the principles of permutations to solve four different constrained arrangement problems. The instructor demonstrates key problem-solving techniques, such as treating a group as a single unit and using the principle of subtraction to find the number of arrangements where a condition is not met. The progression from simple to complex problems effectively reinforces the core concepts of permutation and combination.

Loading lesson…