Basic Concepts & Short Tricks

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/part-2-primary-maths/calendar/basics-of-calendar-year-month-week-day-system/asset-basic-concepts-short-tricks after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि और वर्ण, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, पद-भेद और रूप-विकार, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, शब्द-भंडार, अपठित बोध, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): رسم الخط، حروفِ تہجی اور املا / Script, Alphabet and Spelling, اسم، ضمیر اور صفت / Nouns, Pronouns and Adjectives, الفاظ، محاورے اور ضرب الامثال / Vocabulary, Idioms and Proverbs, تفہیمِ عبارت، انشا اور ترجمہ / Comprehension, Writing and Translation, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): শব্দার্থ, বাগধারা ও ভাষাশুদ্ধি / Meaning, Idioms and Correct Usage, বাক্য ও বাচ্য / Sentences and Voice, শব্দগঠন ও শব্দভান্ডার / Word Formation and Vocabulary, অনুবাদ, বোধপরীক্ষণ ও রচনা / Translation, Comprehension and Composition
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Verbs and Tenses, Pronoun, Verb, Adverb, Prepositions and Conjunctions, Parts of Speech, Determiner, Conjunction, Modals, Transformation of Sentences, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Structure and Common Errors, Reading Comprehension, Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: अनुपात और समानुपात / Ratio and Proportion, Divisibility Rules, मिश्रण और एलिगेशन / Mixture and Alligation, Permutation and Combination, संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Sequence and Series (Series), समय, चाल और दूरी / Time, Speed and Distance, श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, अशाब्दिक तर्क / Non-Verbal Reasoning, प्रतिशत / Percentage, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, Age Problems, Arithmetic, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Algebra, Probability, Trigonometry, Syllogisms, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, Analytical Reasoning (Counting Figures Reasoning), गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, कैलेंडर एवं घड़ी / Calendar and Clock, Clock, घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, Data Arrangement, Inequality, सादृश्यता एवं वर्गीकरण / Analogy and Classification, क्रम एवं रैंकिंग / Order and Ranking, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Biology, राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge, Chemistry, History, Geography, Indian Economy, Environment, समसामयिकी / Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): कंप्यूटर के मूल सिद्धांत / Computer Fundamentals, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications, व्यापार, विपणन एवं उपभोक्ता संरक्षण / Trade, Marketing and Consumer Protection, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर सॉफ़्टवेयर / Computer Software, ऑपरेटिंग सिस्टम / Operating System, कंप्यूटर नेटवर्क / Computer Networks, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), Terms & Abbreviations, प्रेज़ेंटेशन (MS PowerPoint) / Presentation Software (MS PowerPoint)
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References, OOPS with Java
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video is a lecture on calendar problems, specifically focusing on determining the day of the week for a given date. The instructor, Yash Jain Sir, begins by posing the question: "On what day does 21 June 1984 lie?" He then systematically breaks down the problem using a step-by-step method. The first step involves calculating the total number of days from a known reference point, which is 1984. He explains that a year has 365 days, a leap year has 366, and a week has 7 days. He calculates the total days from 1984 to the present, noting that 1984 is a leap year. The second step is to find the remainder when the total number of days is divided by 7, which gives the number of odd days. The video then transitions to a section on how to identify leap years, explaining the rule: a year is a leap year if it is divisible by 4, but if it is a century year (ending in 00), it must be divisible by 400. The final part of the video covers a method for finding the day of the week for a future date, using a table that assigns a code to each day of the week (e.g., Monday = 1, Tuesday = 2, etc.). The instructor demonstrates this by calculating the day of the week for the 23rd day of a month, given that the 1st is a Monday. The video concludes with a summary of the key concepts and a thank you message.

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 green banner: "On what day does 21 June 1984 lie?". The instructor, Yash Jain Sir, is visible in a small window in the bottom right corner. The background is a blackboard with various educational doodles. The instructor introduces the topic of calendar problems and states that the video will solve the question in 60 seconds. He begins by explaining the basic components of a calendar: Year, Months, Weeks, and Days. He writes "Year" on the board and explains that a year has 365 days, which is an ordinary year. He then writes "Months" and states there are 12 months. He writes "Weeks" and says there are 52 weeks. Finally, he writes "Days" and explains that a week has 7 days. He also mentions that a leap year has 366 days. The instructor then begins to calculate the total number of days from 1984 to the present, starting with the year 1984.

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

    The instructor continues the calculation of the total number of days. He writes "365" on the board, representing the number of days in an ordinary year. He then writes "366" for a leap year. He explains that to find the day of the week, we need to find the remainder when the total number of days is divided by 7. He writes "365 / 7 = 52 weeks and 1 odd day". He then explains that a leap year has 366 days, which is 52 weeks and 2 odd days. He writes "366 / 7 = 52 weeks and 2 odd days". He then calculates the total number of odd days from 1984 to the present. He writes "1984" on the board and explains that 1984 is a leap year. He then calculates the number of odd days from 1984 to 2023. He writes "1984" and then "2023". He calculates the number of years between 1984 and 2023, which is 39 years. He then calculates the number of leap years in that period. He writes "39" and then "10". He explains that there are 10 leap years in that period. He then calculates the total number of odd days. He writes "39 * 1 = 39" and "10 * 2 = 20". He adds these together to get 59. He then divides 59 by 7 to get the remainder, which is 3. He writes "59 / 7 = 8 weeks and 3 odd days". He then explains that the day of the week for 21 June 1984 is 3 days after the day of the week for 1 January 1984. He then moves on to the next part of the video.

  3. 5:00 – 9:03 05:00-09:03

    The video transitions to a new section titled "Helpful Tips". The instructor explains how to determine if a year is a leap year. He writes the rule on the board: "A year is a leap year if it is divisible by 4, but if it is a century year (ending in 00), it must be divisible by 400." He gives examples: 1996 is a leap year because 1996 / 4 = 499. 2019 is not a leap year because 2019 / 4 = 504.75. 1600 is a leap year because 1600 / 400 = 4. 1700 is not a leap year because 1700 / 400 = 4.25. The instructor then moves on to the next topic: finding the day of the week for a future date. He writes a table on the board that assigns a code to each day of the week: Monday = 1, Tuesday = 2, Wednesday = 3, Thursday = 4, Friday = 5, Saturday = 6, Sunday = 7. He then gives an example: "If today is Monday, then what will be the day on 23rd?" He explains that the 23rd is 22 days after the 1st. He calculates 22 / 7 = 3 weeks and 1 odd day. He then adds 1 to the code for Monday (1 + 1 = 2), which corresponds to Tuesday. He then moves on to the next topic: the number of odd days in a century. He writes a table on the board that shows the number of odd days in different centuries: 100 years = 5 odd days, 200 years = 3 odd days, 300 years = 1 odd day, 400 years = 0 odd days. He explains that this is because 400 years have 97 leap years and 303 ordinary years, which gives a total of 365*303 + 366*97 = 146097 days, which is exactly 20871 weeks. The video ends with a thank you message.

The video provides a comprehensive, step-by-step guide to solving calendar problems. It begins with a clear problem statement and systematically breaks down the solution into logical steps. The instructor first establishes the fundamental concepts of days, weeks, and years, then introduces the concept of 'odd days' as the key to solving the problem. The method involves calculating the total number of odd days from a reference year to the target year and using the remainder to determine the day of the week. The video also covers essential prerequisite knowledge, such as the rules for identifying leap years and the number of odd days in a century. The use of a table to assign codes to days of the week provides a practical method for calculating future days. The overall structure is logical and pedagogically sound, making it an effective resource for students preparing for competitive exams.

Loading lesson…