Short Trick Find Day on a Particular Date

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/logical-reasoning/calendar/finding-day-on-a-given-date/asset-short-trick-find-day-on-a-particular-date-9393 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the course: About the Course
  2. Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
  4. General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge, राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge
  5. Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | 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, Transaction Management, Concurrency Control
  14. Unit 7 | 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js, Git & Github, PHP
  18. Unit 11 | 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
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks, Internet of Things
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This video is a tutorial on solving calendar-based aptitude questions, specifically determining the day of the week for a given date. The instructor, Yash Jain, uses a step-by-step method involving the division of the year into its constituent parts (thousands, hundreds, tens, and units) and applying a formula to calculate the total number of odd days. The process begins by breaking down the year 1987 into 1600 + 300 + 80 + 7. The number of odd days for each component is determined using a provided table: 1600 years contribute 0 odd days, 300 years contribute 1 odd day, 80 years contribute 2 odd days, and 7 years contribute 1 odd day. The sum of these odd days (0 + 1 + 2 + 1 = 4) is then used to find the day of the week. The instructor then adds the number of days in the months preceding September (January to August) and the days of September itself, calculating the total number of days. This total is divided by 7, and the remainder is used to determine the final day of the week, which is concluded to be Monday. The video also includes a second example for the date 22 October 1964, demonstrating the same method. 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 showing a calendar and the word 'CALENDAR'. It then transitions to a lecture format with a blackboard background. The main question is displayed: 'On what day does 28 September 1987 lie?'. A table on the left lists the number of odd days for different century years (100, 200, 300, 400, etc.). The instructor begins the solution by writing '1987' on the board and starts to break it down into its components: 1600 + 300 + 80 + 7. He explains that the number of odd days for 1600 years is 0, and for 300 years is 1, referencing the table.

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

    The instructor continues the calculation for 1987. He writes '80' and calculates the number of odd days for 80 years, which is 2. He then writes '7' and calculates the odd days for 7 years, which is 1. He adds these values: 0 (from 1600) + 1 (from 300) + 2 (from 80) + 1 (from 7) = 4. He then moves to the months, writing 'Jan -> 31', 'Feb -> 28', 'Mar -> 31', 'Apr -> 30', 'May -> 31', 'Jun -> 30', 'Jul -> 31', 'Aug -> 31'. He adds these days: 31+28+31+30+31+30+31+31 = 243. He then adds the 28 days of September, resulting in a total of 243 + 28 = 271 days. He writes '271' and begins to divide it by 7.

  3. 5:00 – 7:41 05:00-07:41

    The instructor completes the division of 271 by 7, writing '271 / 7 = 38 weeks and 5 odd days'. He then adds the 4 odd days from the year calculation to the 5 odd days from the month calculation, resulting in a total of 9 odd days. He divides 9 by 7, getting a remainder of 2. He states that 0 corresponds to Sunday, 1 to Monday, and 2 to Tuesday. However, he then corrects himself, stating that the remainder 2 corresponds to Monday. He then moves to the second question: 'On what day does 22 October 1964 lie?'. He breaks down 1964 into 1600 + 300 + 60 + 4. He calculates the odd days for 1600 (0), 300 (1), 60 (2), and 4 (1), summing to 4. He then adds the days of the months from January to September (31+29+31+30+31+30+31+31+30 = 274) and the 22 days of October, totaling 296. He divides 296 by 7, getting a remainder of 1. He adds this to the 4 odd days from the year, getting 5. He divides 5 by 7, getting a remainder of 5, which he states corresponds to Friday. The video ends with a 'Thanks for Watching' screen.

The video presents a structured, step-by-step method for solving calendar problems. The core concept is the calculation of 'odd days'—the remainder when the number of days in a period is divided by 7. The method involves breaking down the year into its constituent parts (1600, 300, 100, 10, 1) and using a table to find the number of odd days for each. These are summed, and then the number of days from the beginning of the year to the target date is added. The total is divided by 7, and the remainder determines the day of the week. The video demonstrates this process for two different dates, 28 September 1987 and 22 October 1964, reinforcing the method through repetition and application.

Loading lesson…