Vowels & Consonants Type Questions in P&C

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/engineering-mathematics/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. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
  9. Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
  10. Paper 2 | Programming and Data Structures: 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
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: 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 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
  15. Paper 2 | DataBase Management System/DBMS: 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 Database Recovery
  16. Paper 2 | 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 Hardware Basics
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
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…