Important Practice Questions & Short Tricks

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/logical-reasoning/calendar/formulas-and-high-yield-questions/asset-important-practice-questions-short-tricks-9407 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. 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
  7. 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
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, 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), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
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

  1. 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. 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.

  3. 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.

Loading lesson…