Revision & Practice Problems

Duration: 1 hr 2 min

This video lesson is available to enrolled students.

Return to /learn/GATE-GUIDANCE-BY-SANCHIT-SIR/general-aptitude/data-sufficiency/multiple-topics/asset-revision-practice-problems after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics, Combinatorics
  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
  4. Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  7. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. Theory Of Computation/Automata Theory: 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
  9. 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, Run Time Environment
  10. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  11. DataBase Management System/DBMS: 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
  12. Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics
  13. General Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement, Ratio and Proportion, Vocabulary, Averages, Mixtures and Alligation, Percentages, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Trigonometry, Simplification and Approximation, Constraint Puzzles, Numerical Reasoning, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Assembling and Grouping of Shapes, Cubes and Dice, Profit, Loss and Discount, Mensuration, Probability, Measurement and Quantity Take-Off, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Logical Deduction and Induction, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Clocks and Calendars, Time and Work, Algebra, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Calendar, Alphabet and Word Tests, Sequences and Series, Powers, Surds and Logarithms, Number System, Transformation of Shapes
  14. English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Verb, Articles, Adverb, Modals, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Articles and Determiners, Adjectives and Adverbs, Modals, Conditionals and Subjunctive, Voice and Reported Speech, Blood Relations, Tenses, Vocabulary
  15. Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
  16. Full Mock Test:
  17. Previous Year Papers:
  18. GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This video is a comprehensive lecture on Data Sufficiency, a key topic for competitive exams like those for Infosys, TCS, and Wipro. The instructor, Yash Jain, systematically teaches a structured approach to solving these problems. The lesson begins by establishing the core principles: the goal is to find a unique solution, and the answer choices are standardized. He then demonstrates a step-by-step method using a flowchart, which involves evaluating each statement individually and then together. The lecture is rich with worked examples, covering various question types such as Yes/No questions (e.g., 'Is X a prime number?'), Value-Based questions (e.g., 'What is the value of x?'), and logical reasoning problems (e.g., 'Which pole is at the penultimate position?'). The instructor emphasizes critical thinking, such as the importance of the 'NO' answer being as valid as 'YES', and the need to consider all possibilities, including negative or non-integer solutions. The video concludes with a summary of the key strategies and a final branding screen for Knowledge Gate.

Chapters

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

    The video opens with a title slide for 'DATA SUFFICIENCY' featuring a futuristic cityscape. It then transitions to the instructor, Yash Jain, who begins a lecture. He introduces the topic with a visual of a checklist, emphasizing that the first step is to understand the question and the given statements. He explains that the goal is to determine if the data provided is sufficient to answer the question, and he introduces the concept of 'prerequisites' for solving these problems.

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

    The instructor outlines the prerequisites for solving data sufficiency questions. He states that one must be 'Good in Mathematics' and have 'Patience'. He then introduces the standard answer choices for these questions, which are labeled a through e, and explains that the goal is to determine if the data in the statements is sufficient to answer the question uniquely.

  3. 5:00 – 10:00 05:00-10:00

    The instructor presents the first example: 'Que: Is X a prime number?'. He shows two statements: 'Statement 1: X=2' and 'Statement 2: X=2'. He explains that if a statement provides a unique value, it is sufficient. He demonstrates that both statements individually are sufficient to answer the question, as X=2 is a prime number. He then introduces a flowchart to illustrate the decision-making process for solving these problems.

  4. 10:00 – 15:00 10:00-15:00

    The instructor continues with the first example, using the flowchart to analyze the statements. He confirms that Statement 1 alone is sufficient, as X=2 is a prime number. He then analyzes Statement 2, which is identical, and concludes it is also sufficient. He explains that since both statements individually provide a unique answer, the correct choice is (d) 'Either of the statements individually is sufficient'.

  5. 15:00 – 20:00 15:00-20:00

    The instructor moves to a new example: 'Que: Is X a prime number?'. This time, Statement 1 is 'X=2' and Statement 2 is 'X=3'. He explains that both statements individually are sufficient to answer the question, as both 2 and 3 are prime numbers. He then presents a more complex example where Statement 1 is 'X=2 or 4' and Statement 2 is 'X=2 or 4'. He demonstrates that neither statement alone is sufficient because X could be 2 (prime) or 4 (not prime), so the answer is not unique.

  6. 20:00 – 25:00 20:00-25:00

    The instructor analyzes the example where Statement 1 is 'X=2 or 4' and Statement 2 is 'X=3 or 10'. He explains that Statement 1 is not sufficient because X could be 2 (prime) or 4 (not prime). Statement 2 is also not sufficient because X could be 3 (prime) or 10 (not prime). However, when both statements are considered together, the only common value is X=2, which is a prime number. Therefore, the answer is (c) 'Both statements put together are sufficient'.

  7. 25:00 – 30:00 25:00-30:00

    The instructor presents another example: 'Que: Is X a prime number?'. Statement 1 is 'X=2 or 3' and Statement 2 is 'X=10'. He explains that Statement 1 is not sufficient because X could be 2 (prime) or 3 (prime), but the question is 'Is X a prime number?', and the answer is 'Yes' for both, so it is actually sufficient. Statement 2 is not sufficient because X=10 is not a prime number. The correct answer is (a) 'Statement I alone is sufficient'.

  8. 30:00 – 35:00 30:00-35:00

    The instructor introduces a new example: 'Que: Is X a prime number?'. Statement 1 is 'X=2 or 3' and Statement 2 is 'X=10'. He explains that Statement 1 is not sufficient because X could be 2 (prime) or 3 (prime), but the question is 'Is X a prime number?', and the answer is 'Yes' for both, so it is actually sufficient. Statement 2 is not sufficient because X=10 is not a prime number. The correct answer is (a) 'Statement I alone is sufficient'.

  9. 35:00 – 40:00 35:00-40:00

    The instructor presents a new example: 'Que: Is X a prime number?'. Statement 1 is 'X=2 or 3' and Statement 2 is 'X=10'. He explains that Statement 1 is not sufficient because X could be 2 (prime) or 3 (prime), but the question is 'Is X a prime number?', and the answer is 'Yes' for both, so it is actually sufficient. Statement 2 is not sufficient because X=10 is not a prime number. The correct answer is (a) 'Statement I alone is sufficient'.

  10. 40:00 – 45:00 40:00-45:00

    The instructor presents a new example: 'Que: Is X a prime number?'. Statement 1 is 'X=2 or 3' and Statement 2 is 'X=10'. He explains that Statement 1 is not sufficient because X could be 2 (prime) or 3 (prime), but the question is 'Is X a prime number?', and the answer is 'Yes' for both, so it is actually sufficient. Statement 2 is not sufficient because X=10 is not a prime number. The correct answer is (a) 'Statement I alone is sufficient'.

  11. 45:00 – 50:00 45:00-50:00

    The instructor presents a new example: 'Que: Is X a prime number?'. Statement 1 is 'X=2 or 3' and Statement 2 is 'X=10'. He explains that Statement 1 is not sufficient because X could be 2 (prime) or 3 (prime), but the question is 'Is X a prime number?', and the answer is 'Yes' for both, so it is actually sufficient. Statement 2 is not sufficient because X=10 is not a prime number. The correct answer is (a) 'Statement I alone is sufficient'.

  12. 50:00 – 55:00 50:00-55:00

    The instructor presents a new example: 'Que: Is X a prime number?'. Statement 1 is 'X=2 or 3' and Statement 2 is 'X=10'. He explains that Statement 1 is not sufficient because X could be 2 (prime) or 3 (prime), but the question is 'Is X a prime number?', and the answer is 'Yes' for both, so it is actually sufficient. Statement 2 is not sufficient because X=10 is not a prime number. The correct answer is (a) 'Statement I alone is sufficient'.

  13. 55:00 – 60:00 55:00-60:00

    The instructor presents a new example: 'Que: Is X a prime number?'. Statement 1 is 'X=2 or 3' and Statement 2 is 'X=10'. He explains that Statement 1 is not sufficient because X could be 2 (prime) or 3 (prime), but the question is 'Is X a prime number?', and the answer is 'Yes' for both, so it is actually sufficient. Statement 2 is not sufficient because X=10 is not a prime number. The correct answer is (a) 'Statement I alone is sufficient'.

  14. 60:00 – 61:46 60:00-61:46

    The video concludes with a summary of the key points. The instructor reiterates the main rules: 1) We are looking for a unique solution. 2) Search the question type (Yes/No or Value Based). 3) When looking at statement 2, forget statement 1 and vice versa. He also emphasizes that 'NO' is as good as 'YES' and that the answer should be based on the first sign. The final screen shows the Knowledge Gate logo and website.

This video provides a comprehensive and structured guide to solving Data Sufficiency problems. The core of the lesson is a systematic, step-by-step approach that begins with understanding the question and the answer choices. The instructor emphasizes the importance of finding a unique solution and uses a flowchart to illustrate the decision process. He demonstrates this method across a variety of question types, including Yes/No and Value-Based questions, and covers common pitfalls like the ambiguity of 'or' statements and the importance of considering all possible values. The key takeaway is that the goal is not to solve the problem but to determine if the given information is sufficient to solve it, a critical skill for competitive exams.

Loading lesson…