General Graph Directory
Duration: 3 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 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation 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 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 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and 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 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: Introduction to TOC Deterministic FA (DFA) Non-Deterministic FA Regular Expressions Grammar Regular Language Properties Moore & Mealy Machines Pushdown Automata & CFG Turing Machines Complexity Theory
- 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 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 | DataBase Management System/DBMS: 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 Database Recovery
- Paper 2 | Computer Networks: Introduction to CN 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video presents a lecture on file system directory structures, focusing on the challenges of implementing shared files and directories using links. It begins by discussing the problem of deletion in a link-based system, where a link can be removed without affecting the original file, and introduces a reference count method to determine when a file should be deleted. The lecture then transitions to the concept of an acyclic graph directory structure, which is more flexible than a simple tree but can lead to cycles. The main topic is the general graph directory, which allows for complex sharing but introduces the problem of cycles that can cause issues during file system traversal. The instructor explains that cycles can be prevented by restricting links to files only, using garbage collection, or by running a cycle detection algorithm every time a new link is added. The video concludes with a diagram illustrating a complex file system with multiple directories and files, and introduces the concept of file system mounting, where one file system is attached to another, creating a unified view.
Chapters
0:00 – 2:00 00:00-02:00
The video starts with a slide titled "Problems to consider with link implementation," focusing on deletion. It explains that deleting a link does not affect the original file, only the link is removed. It also presents an alternative approach using a reference count for each file, where the file is deleted only when the count reaches zero. The slide then introduces the concept of a file reference list. The instructor then transitions to a new slide titled "Acyclic Graph Directory," defining an acyclic graph as a graph with no cycles. It states that an acyclic graph directory structure is used to implement shared files and subdirectories, offering more flexibility than a simple tree structure but being more complex. The first method discussed is "1. Links," where a new directory entry is created as a pointer to another file or subdirectory, implemented as an absolute or relative path name. The deletion of a link does not affect the original file, only the link is removed. The slide also mentions that a general graph can have cycles, which cause problems when searching or traversing the file system.
2:00 – 3:28 02:00-03:28
The video continues with a slide titled "5. General Graph Directory." It explains that when links are added to an existing tree-structured directory, a general graph structure can be created, which can have cycles. The instructor emphasizes that cycles cause problems during searching or traversing the file system. The slide then poses the question, "How do we guarantee no cycles?" and provides three solutions: allow only links to files, not subdirectories; use garbage collection (which is computationally expensive); and use a cycle detection algorithm every time a new link is added. The instructor writes "Loop -> cycle" on the slide to illustrate the concept. The video then transitions to a diagram of a complex file system, showing a root directory with subdirectories like 'avi', 'tc', and 'jim'. The diagram illustrates a complex network of files and directories, with multiple paths and potential cycles. The instructor points out a specific path, writing "mount" to indicate a file system mounting operation. The final slide shown is titled "Path Names," explaining that to access a file, the user should either use an absolute path or a relative path from the current directory. The instructor writes "Access file" and "Name Conflict" on the slide, indicating potential issues with file access and naming.
The lecture systematically builds from the basic concept of file links to the complex challenges of managing a general graph directory structure. It starts by establishing the problem of deletion in a link-based system and introduces the reference count method. It then introduces the acyclic graph as a more flexible structure, which leads to the main topic: the general graph directory. The core of the lesson is the problem of cycles in a general graph, which can disrupt file system operations. The instructor presents three strategies to prevent cycles: restricting link types, using expensive garbage collection, or implementing a cycle detection algorithm. The visual aid of a complex file system diagram effectively illustrates the potential for cycles and the need for these control mechanisms. The lesson concludes by connecting this to the practical concept of file system mounting, showing how different file systems can be integrated into a single, unified structure, which is a key application of these directory management techniques.

