Vowels & Consonants Type Questions in P&C

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/UP-POLICE-COMPUTER-OPERATOR/reasoning/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 the course: About the Course
  2. General Knowledge: Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, GK- Current Affairs, Indian Economy, Static General Knowledge, Environment, Evolution of Indian Banking (Banking & Financial Awareness)
  3. Mental Aptitude and Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Vocabulary, Profit and Loss, Arithmetic, Mental Ability, Percentage, Algebra, Mensuration and Geometry, Age Problems, Clock, Calendar, Verbal Analogy (Word Based Analogy), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Analogy, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Selection Decision Table (Decision Making), Cubes & Dices, Blood Relations, Venn Diagram, Logical Sequence Of Words, Inequality, Directions (Direction Test), Data Arrangement, Facts, Inference and Judgements, Syllogisms, Seating Arrangements, Ranking, Order and Sequence
  4. CS | Computer Fundamentals: Basics of COA, Number System, Number Representation, C Fundamentals, Algorithm Analysis, Input Output Organisation
  5. CS | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, SQL
  6. CS | Workplace productivity Tools: MS Office Applications, Keyboard Shortcuts
  7. CS | Computer Networks: Introduction to CN, Data Communication, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, Application Layer, Hardware Basics, Network Security
  8. CS | The Internet: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Web Publishing & Hosting, Server Side & Security, Emerging Technologies
  9. CS | Emerging Technologies: Artificial Intelligence, Emerging Tech Trends, Introduction to OS, Windows OS, Linux OS, Unix OS, JavaScript-Basics
  10. CS | Boolean algebra: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware
  11. CS | Data Structures: Introduction to DS, Array, Stack, Queue
  12. CS | Cryptography: Society, Law & Ethics, 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
  13. UP Police Previous Year Papers:
  14. UP Police Full Mock Tests:
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…