Gate 2005
Duration: 5 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: 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
- Paper 2 | 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
- Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | 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
- Paper 2 | 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
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 2 | 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 Database Recovery
- Paper 2 | 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 Hardware Basics
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video presents a detailed analysis of a SQL query problem from the GATE 2005 exam. The problem involves a relation named `book` with attributes `title` and `price`. The core of the lesson is interpreting a nested SQL query that selects titles based on a condition involving a subquery. The instructor explains that the subquery counts the number of books in the relation that have a price strictly greater than the price of the book currently being processed in the outer query. To make this concept clear, he draws two tables representing the outer alias `B` and the inner alias `T`. He populates these tables with a sequence of prices (10, 20, 30, 40, 50, 60, 70) to simulate the database state. This visual aid helps in tracing the execution of the query for each row.
Chapters
0:00 – 2:00 00:00-02:00
The instructor begins by displaying the problem statement and the SQL code on the screen. He reads the query aloud, highlighting the outer query `select title from book as B` and the correlated subquery. He explains that for every row in the outer table `B`, the subquery runs to count rows in table `T` where `T.price > B.price`. To illustrate this, he draws two vertical tables on the whiteboard. He labels them `B` and `T` and starts writing down sample price values like 10, 20, 30, 40, 50, 60, and 70 in both tables. This setup is intended to create a concrete scenario to test the logic of the query.
2:00 – 4:38 02:00-04:38
With the tables drawn, the instructor proceeds to calculate the count for each price in the outer table. He explains that for the book with price 70, there are zero books with a higher price, so the count is 0. For price 60, the count is 1 (only 70 is higher). He continues this pattern, showing that for prices 50, 40, and 30, the counts are 2, 3, and 4 respectively. Since the condition is `count < 5`, all these books satisfy the condition. He notes that for price 20, the count is 5, which fails the condition. Thus, the query returns the titles of the books with prices 70, 60, 50, 40, and 30. He identifies this set as the five most expensive books and selects option (D) as the correct answer, eliminating options suggesting four books or the fifth most inexpensive book.
The lecture demonstrates a powerful technique for understanding correlated subqueries: using a small, ordered dataset to trace execution. By manually calculating the count of more expensive books for each price point, the instructor proves that the query filters for the top 5 most expensive items. This step-by-step breakdown transforms an abstract SQL statement into a logical ranking problem, making it easier for students to grasp how the `count(*)` function interacts with the `where` clause in a nested context.

