Question Find Day on a Particular Date

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/NTA-UGC-NET-PAPER-2/paper-1-unit-5-mathematical-reasoning-and-aptitude/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. Course Overview: About the Course
  2. Paper - 1 | Unit - 1 | Teaching Aptitude: Nature, Objectives & Characteristics of Teaching, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Teaching-Learning Aids & ICT Integration, Evaluation, Assessment & Measurement
  3. Paper - 1 | Unit - 2 | Research Aptitude: Introduction to Research, Validity & Reliability, Research Paradigms & Types of Research, Research Process Steps, Research Ethics, Writing & Publication
  4. Paper - 1 | Unit - 3 | Comprehension: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions)
  5. Paper - 1 | Unit - 4 | Communication: Communication Basics, Language and Semiotics, Types of Communication, Communication Models, Mass Communication, Mass Media, Journalism, General Knowledge and General Studies related to Communication
  6. Paper - 1 | Unit - 5 | Mathematical Reasoning and Aptitude: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Number System, Percentage, Ratio and Proportion (Ratios), Simple Interest and Compound Interest, Speed Time and Distance, Powers and Exponents (Surds and Indices), Profit and Loss, Average, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Verbal Analogy (Word Based Analogy), Divisibility Rules, Calendar, Miscellaneous, Time and Work, Algebra
  7. Paper - 1 | Unit - 6 | Logical Reasoning: Syllogisms, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Venn Diagram, School Of Thoughts, Fallacy, Western Logic
  8. Paper - 1 | Unit - 7 | Data Interpretation: Data Interpretation
  9. Paper - 1 | Unit - 8 | Information and Communication Technology: MS Office Applications, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Electronic Data Interchange and E-Commerce, Internet Fundamentals, Web Design & Development, Web Publishing & Hosting, Emerging Technologies, Terms & Abbreviations, Artificial Intelligence, Society, Law & Ethics, Keyboard Shortcuts, Website, Browser & Services
  10. Paper - 1 | Unit - 9 | People Development and Environment: Ecosystem, Biomes & Environmental Issues, MDG & SDG, Air Pollution, Water Pollution, Soil, Noise Pollution and Waste Management, Natural Resources, Energy & Disaster Management, Global Environmental Conventions – COP, Protocols & ISA
  11. Paper - 1 | Unit - 10 | Higher Education System: Vedic Education, Jainism & Buddhism, Ancient Universities, Pre-Independence Commissions, Post-Independence Policy, Higher Education Structure & Accreditation, Universities & Learning Programmes, Types of Education & NEP 2020
  12. Paper 2 | Unit 1 | Discrete Structures and Optimization: Propositional and Predicate Logic, Set Theory, Relations, Functions, Permutation and Combination, Probability, Graph Theory, Group Theory, Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Optimization
  13. Paper 2 | Unit 2 | Computer System Architecture: Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Basics of COA, Register Transfer and Microoperations, Programming the Basic Computer, Instr Formats & Modes, Control Unit Design, Pipelining, Input Output Organisation, Cache Memory Organization, Multiprocessors
  14. Paper 2 | Unit 3 | Programming Languages and Computer Graphics: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, HTML Basics, XML, JavaScript-Basics, Java, Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, OOPS with C++, Java Fundamentals
  15. Paper 2 | Unit 4 | Database Management Systems: 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, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  16. Paper 2 | Unit 5 | System Software and Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  17. Paper 2 | Unit 6 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  18. Paper 2 | Unit 7 | Data Structures and Algorithms: 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
  19. Paper 2 | Unit 8 | Theory of Computation and Compilers: 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
  20. Paper 2 | Unit 9 | Data Communication and Computer Networks: 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, Mobile Technology, Cloud Computing and IoT, Cloud Computing
  21. Paper 2 | Unit 10 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  22. Live Classes: NTA UGC NET 2025 Live Class
  23. Paper 1 | Full Mock Tests:
  24. Paper 2 | Full Mock Tests:
  25. Paper 1 | Previous Year Papers:
  26. Paper 2 | Previous Year Papers:
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…