Rename Operations
Duration: 8 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.
The video lecture provides a comprehensive overview of SQL aliases and their practical application in database queries. It begins with a theoretical explanation of what aliases are, emphasizing that they create temporary names for tables or columns without modifying the underlying database. The instructor then transitions to practical examples, starting with a query that calculates a balance with 8% interest and assigns it a new alias. This is followed by a more complex query involving a join between the `account` and `branch` tables to retrieve specific details. Finally, the lecture concludes with a challenging problem: finding the loan number with the maximum loan amount, for which the instructor demonstrates a self-join technique using set difference logic.
Chapters
0:00 – 2:00 00:00-02:00
The session opens with a slide titled "Alias Operation/rename". The instructor details four key points about SQL aliases. First, they are temporary names for tables or columns, creating a "new copy" view without changing the database. Second, they improve readability. Third, they utilize the `as` clause in the form `old-name as new-name` within `select` and `from` clauses. Fourth, their scope is limited to the query duration. The instructor physically underlines these concepts on the slide to highlight their importance for students, specifically emphasizing that aliases do not alter the actual data structure and exist only for the query duration.
2:00 – 5:00 02:00-05:00
The instructor presents a specific problem: "Write a SQL query to find the account_no along and balance with 8% interest, as Account, total_balance?". He constructs the query by selecting `account_no` and calculating `balance * 1.08`. He explicitly adds the alias `as total_balance` to the calculated column. He explains that this allows the result to be displayed with a more descriptive name. He draws a small table on the right side of the screen to visualize the output, labeling the columns `A_no` and `T_B` to represent the account number and total balance respectively.
5:00 – 8:14 05:00-08:14
The lecture moves to a query asking for account numbers along with branch names and cities. The instructor writes a query joining the `branch` and `account` tables using aliases `B` and `A` and a `where` clause to match branch names. He then introduces a final, more complex question: "Write a SQL query to find the loan_no with maximum loan amount?". He explains a method using the `minus` operator. He writes a query that selects amounts from the loan table and subtracts amounts that are less than any other amount in a self-join (`Select A.amount from loan as A, loan as B where A.amount < B.amount`). He draws a diagram with numbers 10, 20, and 30 to illustrate how the logic filters out non-maximum values, leaving only the maximum amount. He circles the pairs to show the comparison process. The background shows a hand-drawn ER diagram with tables like `branch`, `account`, `deposit`, `customer`, `loan`, and `borrower`, which provides context for the table names used in the queries.
The video effectively bridges the gap between SQL theory and practice. It starts by establishing the fundamental concept of aliases as temporary, non-destructive naming tools. The progression then moves to applying these tools in arithmetic expressions to create readable output columns. The complexity increases with the introduction of table joins to combine data from multiple sources. Finally, the lesson culminates in a set-theoretic approach to finding maximum values, demonstrating how SQL can handle complex logic through self-joins and set operations. This structured approach helps students understand not just syntax, but the logical reasoning behind query construction, preparing them for more advanced database management tasks. The use of a consistent ER diagram in the background helps students visualize the relationships between tables like `account`, `branch`, and `loan`.

