Important Practice Questions & Short Tricks
Duration: 6 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
- Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
- Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
- Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
- 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
- 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
- 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
- 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
- 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
- Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
- 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
- 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
- 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
- Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
- 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
- Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
- Section 3 | Java: Java Fundamentals, Array, String, IO & References
- 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
- Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Section 3 | Multimedia: Multimedia
- BPSC Previous Year Papers:
- BPSC Full Mock Tests:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video presents a series of logical reasoning problems related to calendar calculations, typical of competitive exams. The lecture begins with a question about determining the day of the week for June 11th, 2013, given that August 15th, 2012, was a Thursday. The instructor uses a step-by-step method, calculating the number of days between the two dates and then finding the remainder when divided by 7 to determine the day of the week. The process involves identifying the number of days in each month and accounting for leap years. The video then transitions to a second problem, asking for the day of the week for January 7th, 2013, given that July 9th, 2012, was a Sunday. The final segment presents a multiple-choice question about which year among the options (2004, 2005, 2008) has 365 days, which is a test of understanding leap years. The video concludes with a 'Thanks for Watching' screen.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a title card for a calendar problem. The first question is displayed: 'If Aug 15th, 2012 falls on Thursday then June 11th, 2013 falls on which day?'. The instructor, Yash Jain Sir, begins the solution by writing '15th Aug 2012 -> Thursday' on the blackboard. He then calculates the number of days from August 15, 2012, to August 15, 2013, which is 366 days because 2012 is a leap year. He notes that 366 mod 7 equals 2, meaning the day of the week advances by 2 days. He then calculates the number of days from June 11, 2013, to August 15, 2013, which is 65 days. He writes '65 days' and calculates 65 mod 7, which is 2. He then subtracts this from the total advance, resulting in a net advance of 0 days, concluding that June 11, 2013, is a Thursday.
2:00 – 5:00 02:00-05:00
The instructor continues the solution for the first problem. He writes '15th Aug 2013 -> Friday' on the board, indicating the day of the week for August 15, 2013. He then calculates the number of days from June 11, 2013, to August 15, 2013, which is 65 days. He writes '65 days' and calculates 65 mod 7, which is 2. He then subtracts this from the total advance, resulting in a net advance of 0 days, concluding that June 11, 2013, is a Thursday. He then moves to the second problem: 'If July 9th, 2012 falls on Sunday then Jan 7th, 2013 falls on which day?'. He writes '9th July 2012 -> Sunday' on the board. He calculates the number of days from July 9, 2012, to July 9, 2013, which is 366 days. He notes that 366 mod 7 equals 2, meaning the day of the week advances by 2 days. He then calculates the number of days from January 7, 2013, to July 9, 2013, which is 183 days. He writes '183 days' and calculates 183 mod 7, which is 5. He then subtracts this from the total advance, resulting in a net advance of 0 days, concluding that January 7, 2013, is a Sunday.
5:00 – 5:58 05:00-05:58
The video transitions to a new question: 'Which of the following year has 365 days?'. The options are a) 2004, b) 2005, c) 2008, d) All of the above. The instructor explains that a year with 365 days is a common year, not a leap year. He explains the rule for leap years: a year is a leap year if it is divisible by 4, but not by 100, unless it is also divisible by 400. He checks the options: 2004 is divisible by 4 and not by 100, so it is a leap year (366 days). 2005 is not divisible by 4, so it is a common year (365 days). 2008 is divisible by 4 and not by 100, so it is a leap year (366 days). Therefore, only 2005 has 365 days. The video ends with a 'Thanks for Watching' screen.
The video provides a comprehensive tutorial on solving calendar-based logical reasoning problems. It demonstrates a systematic approach: first, calculate the total number of days between two dates, then find the remainder when divided by 7 to determine the day of the week shift. The key concept is that a common year advances the day of the week by 1, while a leap year advances it by 2. The video also reinforces the rule for identifying leap years, which is essential for accurate calculations. The progression from one problem to the next builds a clear understanding of the underlying principles, making it a valuable resource for students preparing for competitive exams.