Question Find Day on a Particular Date

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/IBPS-SO-IT-MAINS/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. About Course: About the Course
  2. English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
  3. Quantitative Aptitude & Numerical Ability: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
  4. Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
  5. Data Structures- Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  7. Python- Professional Knowledge: Python for Placements by Yash Sir, Collections & Strings, Functions & Modules, File Handling & Data Analysis, Python Basics
  8. Operating System- Professional Knowledge: Introduction to OS, Process Management, Process Synchronization, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Windows OS
  9. DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control, Relational Algebra, Relational Calculus, NoSQL, Data Warehousing & Mining
  10. Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security, Transport Layer Services, DLL: Flow Control, Cloud Computing
  11. Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer, Instr Formats & Modes
  13. Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  14. Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
  15. Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
  16. Programming Languages- Professional Knowledge: C Programming by Yash Sir, Language Design, DMA, Macros, Scoping & File Handling, Object Oriented Programming (OOPS), Programming in C++, Java, HTML, C Language Core
  17. Emerging Tech- Professional Knowledge: Emerging Tech Trends, MS Office Applications
  18. Artificial Intelligence: Artificial Intelligence
  19. Image Processing: Digital Image Fundamentals
  20. Internet & Web Technology: Website, Browser & Services, Internet Fundamentals, Server Side & Security, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Cyber Safety and Security, Ethical Hacking
  21. Descriptive Paper: English Writing Ability
  22. Mains - Unit Tests:
  23. Mains - Full Mock Tests:
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…