DAG Practice Question 3
Duration: 6 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 lecture segment focuses on constructing a Directed Acyclic Graph (DAG) from a complex arithmetic expression to optimize storage by identifying and sharing common sub-expressions. The instructor presents the problem: (a+b+c)*(a+b)+(a+b+c)*(a+b)+(a+b+c), asking students to determine the total number of nodes and edges in the resulting DAG. The teaching flow moves from analyzing the expression to breaking it down into components, identifying repeated terms like (a+b+c) and (a+b), and then systematically drawing the graph structure. The process emphasizes merging identical subtrees to minimize redundancy, contrasting with a standard expression tree where such terms would be duplicated. The session concludes by counting the final graph elements, establishing 8 nodes and 10 edges as the solution.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the problem by writing the arithmetic expression (a+b+c)*(a+b)+(a+b+c)*(a+b)+(a+b+c) on the board. He underlines the repeated sub-expression (a+b+c) to highlight optimization opportunities, explicitly stating that a DAG will be constructed for this expression. The visible text on screen asks for the total number of nodes and edges in the DAG, setting the objective for the lesson. The instructor begins breaking down the expression into manageable parts, focusing on operator precedence and grouping to prepare for graph construction.
2:00 – 5:00 02:00-05:00
The instructor proceeds to draw the DAG structure, starting with leaf nodes for variables a, b, and c. He connects these to addition operator nodes, demonstrating how the sub-expression (a+b+c) is formed. He then highlights the term (a+b) as another common sub-expression that can be shared within the graph. The instructor draws green arrows to trace connections, showing how nodes for (a+b+c) and (a+b) are reused rather than duplicated across the three main terms of the original expression. This visual mapping correlates specific parts of the formula with their corresponding nodes in the diagram.
5:00 – 5:37 05:00-05:37
The instructor finalizes the graph construction and performs a count of the total elements. He points to shared sub-expressions in the completed graph to verify that no nodes were unnecessarily duplicated. The final solution is written on the board as 8 nodes and 10 edges, concluding the problem-solving process. This count represents the optimized structure where common terms like (a+b+c) and (a+b) are represented by single nodes with multiple incoming edges from different operators, demonstrating the efficiency of DAGs over standard expression trees.
The core educational value of this session lies in understanding how Directed Acyclic Graphs optimize arithmetic expression representation. Unlike a binary tree where every operation creates new nodes, a DAG allows multiple parents to point to the same child node. In this specific example, the term (a+b+c) appears three times in the expression but is represented by a single node structure in the DAG. Similarly, (a+b) appears twice and shares a node. The instructor's method of underlining repeated terms before drawing the graph serves as a heuristic for students to identify optimization candidates. The final count of 8 nodes and 10 edges is derived by summing the unique variable nodes (a, b, c), the unique operator nodes for additions and multiplications, and accounting for the shared edges that connect these components without duplication. This technique is fundamental in compiler design for intermediate code generation and optimization.

