Practice Question - Corelated Subquery

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-6-database-management-system/sql/nested-correlated-subqueries/asset-practice-question-corelated-subquery after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the course: About the Course
  2. Mathematical Aptitude: Number System, HCF LCM, Divisibility Rules, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Time and Work, Mensuration and Geometry, Simple Interest and Compound Interest, Speed Time and Distance, Age Problems, Mixture and Alligation, Algebra, Powers and Exponents (Surds and Indices), Pipe and Cistern, Trigonometry, Statistics, Data Interpretation, Arithmetic
  3. Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Analogy, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Seating Arrangements, Syllogisms, Venn Diagram, Puzzle Solving (Puzzles), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Analytical Reasoning (Counting Figures Reasoning), Cubes & Dices, Calendar, Clock
  4. General Knowledge: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, GK- Current Affairs, Static General Knowledge
  5. Art of Teaching: Nature, Objectives & Characteristics of Teaching, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Classroom Management & Communication, Teaching-Learning Aids & ICT Integration, Evaluation, Assessment & Measurement, Professional Development & Ethics, Policies, Acts & Contemporary Issues, Curriculum & School Environment, Guidance, Counselling & Mental Health, Inclusive Education & Special Needs, Micro-Teaching & Teaching Skills, Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | 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, Transaction Management, Concurrency Control
  14. Unit 7 | Computer Networks: 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML
  18. Unit 11 | 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
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
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

  1. 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. 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.

  3. 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).

Loading lesson…