Tricks & Techniques to Solve Playing Cards Problem

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/part-2-primary-maths/probability/classical-problems-cards-dice-coins-digits-number-objects/asset-tricks-techniques-to-solve-playing-cards-problem after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow 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
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive lesson on probability, specifically focusing on the application of probability concepts to a standard deck of 52 playing cards. The instructor begins by introducing the topic of probability and then systematically explains the structure of a deck of cards, detailing the four suits (spades, hearts, diamonds, clubs), the color distribution (26 black, 26 red), and the face cards (King, Queen, Jack). A visual diagram is used to illustrate the hierarchical breakdown of the deck. The core of the lesson involves solving a multi-part probability problem: finding the probability of drawing a face card, a black king, and an ace or a jack from a well-shuffled deck. The instructor demonstrates the standard probability formula, P(event) = (Number of favorable outcomes) / (Total number of possible outcomes), and applies it to each part of the question, showing the calculations step-by-step on the screen. 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 featuring the word 'PROBABILITY' in a purple box, surrounded by four images: dice on a green felt table, a basket of fruit, a pizza box, and a business meeting. This transitions to a presentation slide with a pink background and the title 'PROBABILITY'. The instructor, Yash Jain, is visible in a small window. The slide then changes to a new topic, 'Playing Cards', with a space-themed background. The instructor begins to explain the structure of a standard deck of 52 playing cards, stating that they are divided into four suits: spades, hearts, diamonds, and clubs, and that spades and clubs are black cards while hearts and diamonds are red cards.

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

    The instructor continues to explain the composition of a deck of playing cards. The slide displays text stating that there are 52 cards, divided into 4 suits of 13 cards each. It specifies that the cards in each suit are ace, king, queen, jack, and the numbered cards from 10 down to 2. The instructor identifies King, Queen, and Jack as face cards, noting there are 12 in total (3 per suit). A diagram on the slide shows the four face cards (King, Queen, Jack) of the spades suit. The instructor then uses a diagram to illustrate the total number of cards (52), the 26 black cards (13 spades + 13 clubs), and the 26 red cards (13 hearts + 13 diamonds), reinforcing the color distribution.

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

    The video presents a probability question: 'One card is drawn from a well-shuffled pack of 52 playing cards, find the probability of getting (i) a face card (ii) a black king (iii) an ace or a jack'. The instructor begins solving part (i). He identifies the total number of outcomes as 52 and the number of favorable outcomes (face cards) as 12. He writes the formula P(i) = 12/52 and simplifies it to 3/13. For part (ii), he identifies the favorable outcomes as the black kings (King of Spades and King of Clubs), so the number of favorable outcomes is 2. He writes P(ii) = 2/52, which simplifies to 1/26. For part (iii), he identifies the favorable outcomes as the aces (4) and the jacks (4), so the total is 8. He writes P(iii) = 8/52, which simplifies to 2/13. The video ends with a 'THANKS FOR WATCHING' screen.

The video presents a clear, step-by-step tutorial on calculating probabilities using a standard deck of playing cards. It begins with a foundational explanation of the deck's structure, including suits, colors, and face cards, which is essential for solving the subsequent problems. The core of the lesson is the application of the basic probability formula, P(event) = favorable outcomes / total outcomes, to three distinct scenarios. The instructor methodically breaks down each problem, identifying the correct number of favorable outcomes for each event (face card, black king, ace or jack) and performing the calculation. The visual aids, including the diagram of the deck and the step-by-step handwritten calculations, effectively reinforce the concepts, making the lesson accessible for students learning probability.

Loading lesson…