Tricks & Techniques to Solve Playing Cards Problem
Duration: 9 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Quantitative Aptitude: Number System, Divisibility Rules, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Mixture and Alligation, Partnership, Age Problems, Time and Work, Pipe and Cistern, Speed Time and Distance, Algebra, Arithmetic, Data Interpretation, Sequence and Series (Series), Logarithm, Powers and Exponents (Surds and Indices), Permutation and Combination, Probability, Speed Mathematics and Basic Mathematics, Trigonometry
- Logical Reasoning: Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Syllogisms, Inequality, Data Sufficiency, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Venn Diagram, Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
- Verbal Ability: Noun, Pronoun, Adjectives, Verb, Adverb, Tenses, Subject Verb Agreement (Verb Noun Agreement), Articles, Preposition, Conjunction, Modals, Determiner, Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
- Data Structures (Domain Test): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms (Domain Test): Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms
- OOPs (Domain Test): Object Oriented Programming (OOPS)
- DBMS (Domain Test): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
- SQL (Domain Test): SQL
- Operating Systems (Domain Test): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
- Computer Networks (Domain Test): 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, Network Security, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
- Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
- Written English Test: English Writing Ability
- Psychometric Test: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric 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
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: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.
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.