Basic Concepts & Short Tricks
Duration: 9 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- 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
- 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
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- 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
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- 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
- 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
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- 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
- 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
- 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
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
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
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: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.
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.

