Select Clause

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/sql-technical/sql/select-where-distinct/asset-select-clause after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  11. Computer Networks (Technical): 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 Security, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video features an instructor, Sanchit Jain Sir, teaching SQL query formulation using a bank database schema. The lecture begins with practical examples where the instructor writes SQL code on a digital whiteboard to answer specific questions about branches, loans, and accounts. The session transitions into a theoretical explanation of the SELECT clause, comparing its function to the projection operator in relational algebra to reinforce the concept of vertical filtering. The video includes visual aids like the "KG" logo and handwritten diagrams.

Chapters

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

    The instructor starts with the question "Write a SQL query to find all the details of bank branches?". He points to the branch table in the diagram, which contains attributes branch_name, branch_city, and assets. He circles these attributes in red to indicate they are the target columns. He then writes the SQL command Select * from Branch in red and blue ink, demonstrating how to retrieve every column from the specified table. The "KG" logo is visible in the top left corner.

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

    The instructor tackles three additional queries. First, for "find each loan number along with loan amount", he circles the loan table and writes Select loan_no, amount from Loan. Second, for "name of all customer without duplication having bank account", he circles the depositor table and writes Select distinct custname from Depositor, emphasizing the use of the distinct keyword to remove duplicates. Third, for "account_no and balance with 6% yearly interest added", he writes Select accountno, balance * 1.06 from Account, showing how to perform arithmetic calculations directly within the SELECT clause. The text is written in blue ink.

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

    The final segment displays a slide titled "Select Clause". The text explains that the SELECT clause is similar to the 'Π' (Pi) projection in relational algebra, used to pick required columns out of all columns in a relation. It highlights "Vertical filtering" and notes that the order of columns in the SELECT clause determines their appearance in the result. It also clarifies that while Relational Algebra projection is optional for all columns, SQL requires the SELECT clause for readability. The slide includes a diagram of a table with columns being selected. At the very end, the slide transitions to "Select Clause with where clause", introducing sigma (σ) notation.

The video provides a comprehensive introduction to the SELECT statement. It moves from concrete examples involving specific tables like branch, loan, and account to abstract theoretical definitions. This progression helps students understand not just the syntax for retrieving data, but also the underlying relational algebra principles that govern database operations. The instructor effectively uses visual cues to link the schema diagram to the written code, ensuring students grasp both the practical application and the theoretical foundation of SQL queries.

Loading lesson…