Sets RSSB PYQs
Duration: 3 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About the Course: About the Course
- Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
- Paper-1 & 2 | Data Interpretation: Data Interpretation
- Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
- Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
- Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
- Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
- Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
- Paper-2 | Fundamentals of Computer: Basics of COA, Number System, Floating Point Rep, Number Representation
- Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits
- Paper-2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Linux OS, Distributed Systems
- Paper-2 | Database Management System: 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
- Paper-2 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Paper 2 | Oops, C++, Java: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
- Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
- Paper 2 | Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Advanced Algorithms
- Paper 2 | Data Communication and Network Security: 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, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Ethical Hacking
- Paper-2 I Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Paper-2 | Computer Organization and Architecture: Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations
- Paper-2 | Web Development: JavaScript-Basics, HTML Basics, CSS, XML
- Pedagogy: Child Development, Concept of Pedagogy, Psychology, Theories, Inclusive Education, Experiential Pedagogy, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
- Live Sessions: RSSB Live Sessions
- RSSB Paper 1 - Full Mock Tests:
- RSSB Paper 2 - Full Mock Tests:
- SCI Previous Year Papers:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video segment presents a solved problem from previous year questions (PYQs) on Set Theory, specifically focusing on the Principle of Inclusion-Exclusion for two sets. The instructor guides students through a word problem involving language proficiency among a population of 1,865 people. The core task is to determine the number of individuals who speak both English and Hindi, given that 660 speak English, 1,305 speak Hindi, and 120 speak neither language. The lesson demonstrates the application of set notation (E ∪ H, E ∩ H) and algebraic manipulation to solve for the intersection of sets.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces a set theory problem involving 1,865 people where 660 speak English and 1,305 speak Hindi. Visible on-screen text states: 'Out of 1,865 people, 660 speak English and 1,305 speak Hindi. If 120 speak neither language,…'. The instructor writes the fundamental formula for the union of two sets: 'E U H = E + H - E ∩ H'. He identifies the total population and subsets, underlining key numbers in the question text. The teaching cue involves identifying the union by subtracting non-speakers from the total population, setting up the equation to solve for the intersection variable representing those who speak both languages.
2:00 – 2:37 02:00-02:37
The instructor completes the calculation using red handwritten notes visible on screen. He calculates 'Total - Neither' as 1865 minus 120 to get 1745. The equation 'Engl + Hindi - Both = At least One' is set up using the values 660 and 1305. The final calculation results in 220, which is boxed on the screen and corresponds to option (B). The visible text confirms the solution process: 'E ∪ H = E + H - E ∩ H' and 'Both = ?'. The lesson concludes by verifying the answer against multiple-choice options (A) 120, (B) 220, (C) 440, (D) 1085.
The video effectively demonstrates the application of set theory to real-world word problems. The central concept is the Principle of Inclusion-Exclusion, expressed as |E ∪ H| = |E| + |H| - |E ∩ H|. The instructor methodically breaks down the problem by first determining the size of the union (E ∪ H) using the total population minus those who speak neither language. This step is crucial as it isolates the group of interest before applying the inclusion-exclusion formula. The algebraic rearrangement to solve for the intersection (E ∩ H) is shown clearly, resulting in 220. This specific example reinforces the importance of correctly identifying 'neither' values to find the union, a common pitfall in set theory problems.