Practice Question - Corelated Subquery
Duration: 7 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-2 | Programming & 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 | Databases / DBMS & SQL: 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
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Paper-2 | Computer Networks & Security: Introduction to CN, Data Communication, 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, Network Access Technologies, Network Security
- Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, 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, Waveform Generators and Timer 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 | 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 | 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
- Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- 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-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
- Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
- Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
- Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
- Coal India Previous Year Paper:
- Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
- Coal India Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video analyzes a SQL practice problem centered on correlated subqueries and ranking logic. The core task involves determining which books are selected by a query that filters based on the count of other books with higher prices. The instructor systematically breaks down the problem statement, which defines a relation 'book' containing titles and prices. The primary SQL query selects the title from table B where a subquery counts rows in table T such that T.price is greater than B.price, with the condition that this count must be less than 5. The video emphasizes interpreting this logic as a ranking mechanism, effectively identifying books that are among the top five most expensive. Through manual tracing using sample data, the instructor demonstrates how correlated subqueries execute row-by-row, comparing each book's price against all others to calculate the count of more expensive items.
Chapters
0:00 – 2:00 00:00-02:00
The video begins by presenting the SQL problem statement on screen, defining a relation 'book (title, price)' and asking what specific query lists. The instructor displays the SQL code: 'select title from book as B where (select count(*) from book as T where T.price > B.price) < 5'. Key visible events include the display of multiple-choice options A through D, with Option A suggesting 'Titles of the four most expensive books'. The instructor highlights the critical components of the query, specifically focusing on the inner subquery condition 'T.price > B.price' and the outer threshold '< 5'. This section establishes the foundational concept of using a correlated subquery to perform ranking without explicit ORDER BY clauses, setting the stage for logical analysis.
2:00 – 5:00 02:00-05:00
The instructor transitions to manual verification by drawing a sample table with eight books labeled A through H and assigning specific prices (e.g., A=100, B=200, C=180). He traces the execution logic for each row in table B against all rows in table T. For a specific book like A with price 100, he counts how many other books have a higher price. The visual evidence shows handwritten tables labeled 'B' and 'T', where the instructor compares values to demonstrate that a book with price 100 has seven other books more expensive, failing the '< 5' condition. This step-by-step evaluation clarifies how the subquery correlates with the outer query's current row, ensuring students understand that 'count(*)' reflects the number of strictly more expensive items relative to the current book being evaluated.
5:00 – 6:48 05:00-06:48
In the final segment, the instructor synthesizes the manual tracing results to identify the correct answer. He determines that only books with fewer than five other books more expensive satisfy the condition, which corresponds to the top five most expensive items. The on-screen text confirms the query structure 'where T.price > B.price' and the threshold '< 5'. By sorting the sample data (G=250, E=210, B=200, F=195, C=180), he shows that the fifth most expensive book (C) has exactly four books more expensive than it, satisfying 'count < 5'. Conversely, the sixth most expensive book (H=170) has five books more expensive, failing the condition. The video concludes by reinforcing that this logic selects the titles of the five most expensive books, distinguishing it from options suggesting 'four' or 'fifth most inexpensive'.
The video effectively teaches the mechanics of correlated subqueries by moving from abstract syntax to concrete execution. The key takeaway is that 'count(*) < 5' in a subquery comparing prices acts as a ranking filter, selecting items where fewer than five others exceed the current value. This logic inherently captures the top N most expensive records without sorting. The instructor's use of sample data with explicit price values (100, 200, etc.) provides a verifiable method for students to trace query behavior manually. This approach demystifies the 'correlated' nature of the subquery, showing that it re-evaluates for every row in the outer table. The distinction between 'four most expensive' and 'five most expensive' is clarified through the strict inequality '< 5', which includes exactly five items (those with counts 0, 1, 2, 3, and 4).

