Important Practice Questions & Short Tricks
Duration: 6 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 presents a series of logical reasoning problems related to calendar calculations, typical of competitive exams. The lecture begins with a question about determining the day of the week for June 11th, 2013, given that August 15th, 2012, was a Thursday. The instructor uses a step-by-step method, calculating the number of days between the two dates and then finding the remainder when divided by 7 to determine the day of the week. The process involves identifying the number of days in each month and accounting for leap years. The video then transitions to a second problem, asking for the day of the week for January 7th, 2013, given that July 9th, 2012, was a Sunday. The final segment presents a multiple-choice question about which year among the options (2004, 2005, 2008) has 365 days, which is a test of understanding leap years. The video concludes with a 'Thanks for Watching' screen.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a title card for a calendar problem. The first question is displayed: 'If Aug 15th, 2012 falls on Thursday then June 11th, 2013 falls on which day?'. The instructor, Yash Jain Sir, begins the solution by writing '15th Aug 2012 -> Thursday' on the blackboard. He then calculates the number of days from August 15, 2012, to August 15, 2013, which is 366 days because 2012 is a leap year. He notes that 366 mod 7 equals 2, meaning the day of the week advances by 2 days. He then calculates the number of days from June 11, 2013, to August 15, 2013, which is 65 days. He writes '65 days' and calculates 65 mod 7, which is 2. He then subtracts this from the total advance, resulting in a net advance of 0 days, concluding that June 11, 2013, is a Thursday.
2:00 – 5:00 02:00-05:00
The instructor continues the solution for the first problem. He writes '15th Aug 2013 -> Friday' on the board, indicating the day of the week for August 15, 2013. He then calculates the number of days from June 11, 2013, to August 15, 2013, which is 65 days. He writes '65 days' and calculates 65 mod 7, which is 2. He then subtracts this from the total advance, resulting in a net advance of 0 days, concluding that June 11, 2013, is a Thursday. He then moves to the second problem: 'If July 9th, 2012 falls on Sunday then Jan 7th, 2013 falls on which day?'. He writes '9th July 2012 -> Sunday' on the board. He calculates the number of days from July 9, 2012, to July 9, 2013, which is 366 days. He notes that 366 mod 7 equals 2, meaning the day of the week advances by 2 days. He then calculates the number of days from January 7, 2013, to July 9, 2013, which is 183 days. He writes '183 days' and calculates 183 mod 7, which is 5. He then subtracts this from the total advance, resulting in a net advance of 0 days, concluding that January 7, 2013, is a Sunday.
5:00 – 5:58 05:00-05:58
The video transitions to a new question: 'Which of the following year has 365 days?'. The options are a) 2004, b) 2005, c) 2008, d) All of the above. The instructor explains that a year with 365 days is a common year, not a leap year. He explains the rule for leap years: a year is a leap year if it is divisible by 4, but not by 100, unless it is also divisible by 400. He checks the options: 2004 is divisible by 4 and not by 100, so it is a leap year (366 days). 2005 is not divisible by 4, so it is a common year (365 days). 2008 is divisible by 4 and not by 100, so it is a leap year (366 days). Therefore, only 2005 has 365 days. The video ends with a 'Thanks for Watching' screen.
The video provides a comprehensive tutorial on solving calendar-based logical reasoning problems. It demonstrates a systematic approach: first, calculate the total number of days between two dates, then find the remainder when divided by 7 to determine the day of the week shift. The key concept is that a common year advances the day of the week by 1, while a leap year advances it by 2. The video also reinforces the rule for identifying leap years, which is essential for accurate calculations. The progression from one problem to the next builds a clear understanding of the underlying principles, making it a valuable resource for students preparing for competitive exams.

