Category 3 Find Day on a Particular Date

Duration: 13 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/general-aptitude-reasoning/calendar/date-date-relationship-4-categories-method/asset-category-3-find-day-on-a-particular-date after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: 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, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video is a lecture on solving calendar-based problems, a common topic in quantitative aptitude for IT company placements. The instructor, Yash Jain Sir from Knowledge Gate Educator, begins by introducing the concept of finding the day of the week for a given date, using the example of 1st October 2010 being a Monday to find the day for 25th June 2015. He categorizes these problems into four types: (a) Month and Year Same, Date Different; (b) Date and Month Same, Year Different; (c) Date and Year Same, Month Different; and (d) All three different. The main focus is on the third category, where the date and year are the same but the month changes. To solve this, he introduces a method using a 2019 calendar to count the number of odd days between the two months. He demonstrates this by counting the days from January to November 2019, noting that the number of days in each month is either 31 or 30, and that the total number of days from January to November is 334. He then explains that 334 days is equivalent to 47 weeks and 2 days, meaning the day of the week advances by 2 days. The video then presents a specific problem: if 23rd March 2015 is a Tuesday, what day is 23rd November 2015? The instructor applies the same method, counting the days from March to November, which is 244 days, or 34 weeks and 6 days. Since 244 mod 7 = 6, the day advances by 6 days from Tuesday, resulting in Monday. The video concludes with a similar problem from Wipro, where 16th January 1992 is a Monday, and the task is to find the day for 16th December 1992, reinforcing the method for a leap year.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a title slide showing a calendar and the word 'CALENDAR'. The instructor, Yash Jain Sir, introduces the topic of calendar problems, which are frequently asked in IT company placements. He presents a sample problem: '1st October 2010 → Monday, 25th June 2015 → ???'. He then outlines four categories of such problems, with the first two being 'a) Month and Year Same, Date Different' and 'b) Date and Month Same, Year Different'. The on-screen text clearly labels these categories and provides examples for each.

  2. 2:00 – 5:00 02:00-05:00

    The instructor continues to explain the four categories of calendar problems. He introduces category 'c) Date and Year Same, Month Different', which is the focus of the current lesson. He provides an example: '1st October 2010 → Monday, 1st December 2010 → ???'. He then transitions to a method for solving this type of problem, which involves counting the number of days between the two months. He displays a 2019 calendar and begins to count the days from January to November, explaining that the number of days in each month is either 31 or 30, and that the total number of days from January to November is 334.

  3. 5:00 – 10:00 05:00-10:00

    The instructor continues to demonstrate the method for solving calendar problems. He explains that 334 days is equivalent to 47 weeks and 2 days, meaning the day of the week advances by 2 days. He then presents a specific problem from Accenture: 'Suppose if there is Tuesday on 23rd March 2015, then find day on 23rd November 2015?'. He applies the same method, counting the days from March to November, which is 244 days. He explains that 244 days is 34 weeks and 6 days, so the day advances by 6 days from Tuesday. He writes 'Tuesday + 6 days = Monday' on the screen, concluding that 23rd November 2015 is a Monday.

  4. 10:00 – 13:16 10:00-13:16

    The instructor presents a final problem from Wipro: '16th January 1992 → Monday, 16th December 1992 → ???'. He explains that 1992 is a leap year, which affects the number of days in February. He uses the same method of counting days from January to December, noting that the total number of days is 366. He explains that 366 days is 52 weeks and 2 days, so the day of the week advances by 2 days. He writes 'Monday + 2 days = Wednesday' on the screen, concluding that 16th December 1992 is a Wednesday. The video ends with a 'Thanks for Watching' screen.

The video provides a comprehensive, step-by-step guide to solving calendar problems, a key skill for quantitative aptitude tests. The core of the lesson is a practical method for finding the day of the week when the date and year are the same but the month changes. The instructor systematically breaks down the problem into manageable steps: identifying the category, counting the number of days between the months, calculating the number of odd days (the remainder when divided by 7), and then advancing the day of the week by that number of days. The use of a 2019 calendar as a visual aid makes the counting process clear. The lesson is reinforced with multiple worked examples, including one from Accenture and one from Wipro, demonstrating the method's application to both ordinary and leap years. The progression from a general concept to specific, real-world problems ensures a solid understanding of the technique.

Loading lesson…