Vowels & Consonants Type Questions in P&C

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/aptitude/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. Database Management System: 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
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Divisibility Rules, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Speed Mathematics and Basic Mathematics, TCS NQT Advanced Quantitative Ability, Gamified / Game Based Aptitude, Linear Algebra, Trigonometry
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Sentence Construction, Active Passive Voice (Voice), Determiner, Facts, Inference and Judgements, Adverb, Interjection, Verb, English Writing Ability
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
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…