Important Practice Questions & Short Tricks
Duration: 7 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 प्रश्न (निश्चित)): رسم الخط، حروفِ تہجی اور املا / Script, Alphabet and Spelling, اسم، ضمیر اور صفت / Nouns, Pronouns and Adjectives, الفاظ، محاورے اور ضرب الامثال / Vocabulary, Idioms and Proverbs, تفہیمِ عبارت، انشا اور ترجمہ / Comprehension, Writing and Translation, Comprehension
- Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): শব্দার্থ, বাগধারা ও ভাষাশুদ্ধি / Meaning, Idioms and Correct Usage, বাক্য ও বাচ্য / Sentences and Voice, শব্দগঠন ও শব্দভান্ডার / Word Formation and Vocabulary, অনুবাদ, বোধপরীক্ষণ ও রচনা / Translation, Comprehension and Composition
- Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Verbs and Tenses, Pronoun, Verb, Adverb, Prepositions and Conjunctions, Parts of Speech, Determiner, Conjunction, Modals, Transformation of Sentences, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Structure and Common Errors, Reading Comprehension, Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
- Section 2 | Primary Maths & Reasoning: अनुपात और समानुपात / Ratio and Proportion, Divisibility Rules, मिश्रण और एलिगेशन / Mixture and Alligation, Permutation and Combination, संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Sequence and Series (Series), समय, चाल और दूरी / Time, Speed and Distance, श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, अशाब्दिक तर्क / Non-Verbal Reasoning, प्रतिशत / Percentage, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, Age Problems, Arithmetic, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Algebra, Probability, Trigonometry, Syllogisms, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, Analytical Reasoning (Counting Figures Reasoning), गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, कैलेंडर एवं घड़ी / Calendar and Clock, Clock, घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, Data Arrangement, Inequality, सादृश्यता एवं वर्गीकरण / Analogy and Classification, क्रम एवं रैंकिंग / Order and Ranking, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
- Section 2 | General Awareness (GK + Current Affairs): Polity, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Biology, राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge, Chemistry, History, Geography, Indian Economy, Environment, समसामयिकी / 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): कंप्यूटर के मूल सिद्धांत / Computer Fundamentals, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications, व्यापार, विपणन एवं उपभोक्ता संरक्षण / Trade, Marketing and Consumer Protection, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर सॉफ़्टवेयर / Computer Software, ऑपरेटिंग सिस्टम / Operating System, कंप्यूटर नेटवर्क / Computer Networks, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), Terms & Abbreviations, प्रेज़ेंटेशन (MS PowerPoint) / Presentation Software (MS PowerPoint)
- 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, OOPS with Java
- 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.
The video is a lecture on solving calendar-based aptitude questions, presented by an instructor from Knowledge Gate. The first problem, from HP 2017, asks when Virat Kohli will celebrate his next wedding anniversary on the same day of the week, given that he celebrated it on Monday, December 11, 2007. The instructor explains that this requires calculating the day of the week for December 11, 2018, by determining the number of odd days between the two dates. He uses a table to calculate the number of odd days for each century (100, 200, 300, etc.), noting that 100 years have 5 odd days, 200 have 3, 300 have 1, and 400 have 0. He then calculates the total odd days from 2007 to 2018, which is 11 years, and finds that 2018 is 11 days ahead of 2007. Since 11 days is 1 week and 4 days, the day of the week advances by 4 days. Starting from Monday, adding 4 days results in Friday. The second problem, from Capgemini 2016, asks which day of the week cannot be the last day of a century. The instructor uses the same table of odd days for centuries to show that the last day of a century can be Friday (for 100, 200, 300 years), Wednesday (for 400 years), and Monday (for 800 years), but never Tuesday or Thursday. 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, from HP 2017, is displayed: 'Virat Kohli Celebrated his wedding anniversary on Monday on 11th December 2007, when will he celebrate his next wedding anniversary on the same day?'. The instructor, Yash Jain, begins to solve the problem by explaining that the next anniversary will be on December 11, 2018. He states that to find the day of the week, one must calculate the number of odd days between 2007 and 2018. He introduces a table on the screen that lists the number of odd days for different century lengths: 100 years have 5 odd days, 200 have 3, 300 have 1, and 400 have 0. He explains that a century is 100 years, and the number of odd days is the remainder when the total number of days is divided by 7.
2:00 – 5:00 02:00-05:00
The instructor continues to solve the first problem. He calculates the number of odd days from 2007 to 2018. He writes '2007' and '2018' on the screen and adds a '+11' to indicate the 11 years between the two dates. He explains that 11 years consist of 8 ordinary years and 3 leap years. He calculates the total number of days as (8 * 365) + (3 * 366) = 4018 days. He then divides 4018 by 7 to find the number of odd days, which is 4018 / 7 = 574 weeks and 0 days. He then adds the 4 odd days from the century calculation (100 years have 5 odd days, but since 2007 is not a century year, he uses the 5 odd days from the 100-year cycle). He concludes that the day of the week advances by 4 days from Monday, which is Friday. He then transitions to the second problem.
5:00 – 6:37 05:00-06:37
The second problem is introduced: 'The last day of a century cannot be'. The options are Monday, Wednesday, Tuesday, and Friday. The instructor refers to the table of odd days for centuries. He explains that the last day of a century can be Friday (for 100, 200, 300 years), Wednesday (for 400 years), and Monday (for 800 years). He states that the last day of a century can never be Tuesday or Thursday. He uses the table to show that the number of odd days for 100, 200, 300, and 400 years are 5, 3, 1, and 0 respectively. He then explains that the last day of a century can be Friday (5 odd days), Wednesday (3 odd days), and Monday (1 odd day), but never Tuesday or Thursday. The video ends with a 'Thanks for Watching' screen.
The video presents a structured approach to solving two common calendar aptitude problems. The first problem involves calculating the day of the week for a future date by determining the number of odd days between two years, using a table of odd days for centuries. The second problem uses the same table to determine which day of the week cannot be the last day of a century, based on the pattern of odd days. The instructor uses a clear, step-by-step method, writing out calculations and referencing the table, to demonstrate the logic behind the solutions.