Vowels & Consonants Type Questions in P&C

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/digital-logic-circuits-discrete-math-structures/permutation-and-combination/permutations-with-without-repetition/asset-vowels-consonants-type-questions-in-pc after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | Computer Networks: 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research
  19. GS Paper | 05 | Elementary Maths: संख्या पद्धति / Number System, Divisibility Rules, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, प्रतिशत / Percentage, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, समय और कार्य / Time and Work, समय, चाल और दूरी / Time, Speed and Distance, Algebra, घन क्षेत्रमिति / Solid Mensuration, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), मिश्रण और एलिगेशन / Mixture and Alligation, Calculus, Trigonometry, Vectors, संख्या पद्धति और संख्या सिद्धांत / 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, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: समसामयिकी / Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video is a lecture on permutations and combinations, specifically focusing on arranging letters of a word with constraints. The video begins with an introduction to the concepts of permutation and combination using a visual metaphor of a lock, where the order of digits matters for a permutation and does not for a combination. The main content is a detailed, step-by-step solution to a problem involving the word 'EQUATION'. The instructor first identifies the vowels (E, U, A, I, O) and consonants (Q, T, N) in the word. The problem asks for the number of arrangements under five different conditions: (a) all vowels together and all consonants together, (b) all vowels and consonants together (a single block), (c) not all vowels together, (d) no two consonants together, and (e) no two vowels together. The instructor demonstrates the solution for each part, using the fundamental principle of counting and the formula for permutations of n objects, n!, and permutations of n objects with r identical objects, n!/r!. The video concludes with a 'Thanks for Watching' screen.

Chapters

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

    The video opens with a title card that visually distinguishes between 'PERMUTATION' and 'COMBINATION' using a dice and a fruit basket. It then transitions to a presentation slide titled 'Confused' with the question 'Should I unlock with Permutation or Combination?'. This slide uses a cartoon detective to illustrate the difference: a permutation lock requires a specific order (e.g., 1-2-3), while a combination lock does not. The slide also shows the 'Knowledge Gate Educator' logo and the instructor's name, Yash Jain Sir. The video then moves to a new slide with a pink background and space-themed graphics, titled 'Vowels and Consonants Type of Questions', setting the stage for the main problem.

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

    The instructor begins the problem-solving section. The slide displays the question: 'Consider the word EQUATION, find number of ways of arrangements such that'. The word 'EQUATION' is underlined. The instructor identifies the vowels and consonants in the word. On the slide, he writes 'E U A I O -> 5 vowels' and 'Q T N -> 3 consonants'. He explains that the total number of letters is 8, so the total number of arrangements without any restrictions is 8!. He then begins to solve part (a) of the question, which is 'All vowels together and consonants together'. He explains that this means the 5 vowels form one block and the 3 consonants form another block, so there are 2 blocks to arrange, which can be done in 2! ways. He also notes that the vowels can be arranged among themselves in 5! ways and the consonants in 3! ways. The total arrangements for (a) are therefore 2! × 5! × 3!.

  3. 5:00 – 9:21 05:00-09:21

    The instructor proceeds to solve the remaining parts of the question. For part (b) 'All vowels and consonants together', he explains this is the same as part (a) and the answer is 2! × 5! × 3!. For part (c) 'Not all vowels together', he explains this is the total number of arrangements minus the number of arrangements where all vowels are together. He writes the formula: 8! - 5! × 4! (where 4! represents the arrangements of the vowel block and the 3 consonants). For part (d) 'No two consonants are together', he explains that the vowels must be placed first to create gaps. He writes '5 vowels -> 6 gaps' and then calculates the number of ways to place the 3 consonants in these 6 gaps as 6P3. For part (e) 'No two vowels are together', he explains that the consonants must be placed first to create gaps. He writes '3 consonants -> 4 gaps' and then calculates the number of ways to place the 5 vowels in these 4 gaps as 4P5. The video ends with a 'Thanks for Watching' screen.

The video provides a clear and structured lesson on permutations and combinations. It starts with a conceptual introduction to the difference between permutation and combination, using a relatable analogy. The core of the video is a comprehensive, step-by-step walkthrough of a complex problem involving the word 'EQUATION'. The instructor methodically breaks down the problem into five distinct parts, applying the fundamental principles of counting and permutation formulas to each. The visual aid of the slide, with handwritten notes and calculations, effectively guides the viewer through the logical process, making the abstract concepts of combinatorics tangible and easier to understand.

Loading lesson…