General Graph Directory

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/operating-system/file-management/directories-structure/asset-general-graph-directory after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. 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
  3. 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. 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
  6. 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
  7. 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
  8. 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
  9. 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
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. 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
  13. 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
  14. 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
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India 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

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

Loading lesson…