Tricks & Techniques to Solve Playing Cards Problem

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/probability-and-statistics/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 Course: About the Course
  2. Paper 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. 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, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | 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
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, 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), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, 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, Venn Diagram, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
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…