Question Find Day on a Particular Date

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/reasoning/calendar/finding-day-on-a-given-date/asset-question-find-day-on-a-particular-date after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. 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
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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, Complexity Theory
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This video is a tutorial on calculating the day of the week for a given date, specifically 14 March 1965. The instructor, Yash Jain, uses a step-by-step method involving the calculation of odd days. The process begins by breaking down the year 1964 into 1600 and 364. The number of odd days for 1600 years is taken as 0, as per the standard rule. For the remaining 364 years, the calculation involves finding the number of leap years and ordinary years. The instructor calculates that 364 years contain 86 leap years and 278 ordinary years, resulting in a total of 400 odd days. This is then reduced to 1 odd day (400 mod 7 = 1). The next step is to calculate the odd days for the months of January and February 1965, which are 31 and 28 days respectively, totaling 59 days, which is 3 odd days (59 mod 7 = 3). Finally, the odd days for the 14 days of March are calculated as 14 mod 7 = 0. The total number of odd days is the sum of all these components: 0 (from 1600) + 1 (from 364 years) + 3 (from Jan-Feb) + 0 (from March) = 4. The instructor then maps this to a day of the week, stating that 0 is Sunday, 1 is Monday, and so on, concluding that 4 corresponds to Thursday. The video uses a digital blackboard with a table of odd days for different century years and a list of month lengths.

Chapters

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

    The video opens with a title card showing a calendar and the word 'CALENDAR'. The main content begins with a question displayed on a digital blackboard: 'On what day does 14 March 1965 lie?'. The instructor, Yash Jain, introduces the problem. A table on the left lists the number of odd days for different century years: 100 years have 5 odd days, 200 have 3, 300 have 1, and 400, 800, 1200, and 1600 have 0 odd days. The instructor begins the calculation by writing '1964 = 1600 + 364' on the board, breaking down the year into a base of 1600 and the remaining 364 years. The instructor explains that 1600 years have 0 odd days, which is a standard rule in this method.

  2. 2:00 – 4:46 02:00-04:46

    The instructor continues the calculation for the 364 years. He explains that 364 years consist of 86 leap years and 278 ordinary years. He calculates the total odd days as (86 * 2) + (278 * 1) = 172 + 278 = 450. He then reduces this to 450 mod 7, which is 1 odd day. Next, he calculates the odd days for the months of January and February 1965, writing 'Jan -> 31' and 'Feb -> 28'. The sum is 59 days, which is 59 mod 7 = 3 odd days. He then calculates the odd days for the 14 days of March, which is 14 mod 7 = 0. The total number of odd days is the sum: 0 (from 1600) + 1 (from 364 years) + 3 (from Jan-Feb) + 0 (from March) = 4. The instructor then states that 0 is Sunday, 1 is Monday, 2 is Tuesday, 3 is Wednesday, and 4 is Thursday. Therefore, 14 March 1965 was a Thursday. The video ends with a 'THANKS FOR WATCHING' screen.

The video presents a complete, step-by-step solution to a classic calendar problem. It demonstrates a systematic method for finding the day of the week for any date by breaking the problem into manageable parts: calculating odd days for centuries, the remaining years, the months, and the days. The core of the method relies on the fact that a non-leap year has 1 odd day and a leap year has 2 odd days. The instructor uses a digital blackboard to clearly show the calculations, referencing a table of odd days for centuries and the number of days in each month. The final answer is derived by summing all the odd days and using a simple mapping to the days of the week, concluding that 14 March 1965 was a Thursday.

Loading lesson…