Important Practice Questions & Short Tricks

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/reasoning/calendar/formulas-and-high-yield-questions/asset-important-practice-questions-short-tricks-9409 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. 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
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. 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
  4. 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
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. 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
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. 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
  16. 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
  17. 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
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This video is a lecture on solving calendar-based aptitude questions, presented by an instructor from Knowledge Gate. The session begins with a question asking for the date 89 days from January 20, 2017, a Sunday. The instructor breaks down the calculation by first determining the number of weeks and remaining days, using the formula 89 = 12*7 + 5, which results in 12 weeks and 5 days. He then calculates the day of the week by adding 5 days to Sunday, concluding it is a Friday, and identifies the date as April 19, 2017. The second problem involves a 30-day month starting on a Saturday, with specific holidays on every second and fourth Saturday and all Sundays. The instructor calculates the total number of holidays (7) and subtracts this from the total days to find 23 working days. The final problem states that the second day of a month is a Sunday and asks for the last day of the next month, which has 31 days. The instructor deduces that the first day of the month is a Saturday, and by counting forward, determines the last day of the 31-day month is a Friday. The video uses a digital blackboard for calculations and includes on-screen text with questions and options.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a title card for a calendar problem. The first question displayed is "What is 89 days from today?" with the hint that today is January 20, 2017, a Sunday. The instructor, Yash Jain, begins to solve the problem by stating the total number of days is 89. He starts the calculation by writing "89" on the digital blackboard and begins to divide it by 7 to find the number of weeks and remaining days. The on-screen text clearly shows the question and the hint, providing the necessary information for the calculation.

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

    The instructor continues solving the first problem. He completes the division, writing "89 = 12*7 + 5" on the blackboard, indicating 12 weeks and 5 extra days. He then explains that adding 5 days to a Sunday results in a Friday. He calculates the date by adding 5 days to January 20, which is January 25, and then adds the remaining 12 weeks (84 days) to reach April 19, 2017. The on-screen text shows the options, and the instructor's final answer is option (a) 19th April, Friday. The video then transitions to the next problem, which is about a 30-day month starting on a Saturday with specific holidays.

  3. 5:00 – 6:02 05:00-06:02

    The video presents the third problem: "The second day of a month is Sunday. What will be the last day of the next month which has 31 days?" The instructor explains that if the second day is Sunday, the first day must be Saturday. He then calculates the last day of the 31-day month by counting forward from the first day. He writes "31" on the board and calculates 31 = 4*7 + 3, meaning 4 weeks and 3 extra days. Starting from Saturday, he adds 3 days to get Friday. The on-screen text shows the options, and the instructor concludes the answer is Friday, which is option (a). The video ends with a "THANKS FOR WATCHING" screen.

The video provides a structured, step-by-step approach to solving three distinct calendar-based aptitude problems. It begins with a straightforward date calculation, where the instructor uses division to find the number of weeks and extra days, then applies this to determine the day of the week and the final date. The second problem introduces the concept of counting working days by first identifying all holidays (Sundays and specific Saturdays) and subtracting them from the total days in the month. The final problem requires logical deduction to find the starting day of a month based on a given day, followed by a similar calculation to find the last day of a subsequent month. The consistent use of a digital blackboard for calculations and clear on-screen text for questions and options makes the teaching method effective and easy to follow.

Loading lesson…