Directory structure (single-level, two-level, tree, acyclic graph) in Operating Systems - Mini Project: Build & Apply

Understanding Directory Structures

📖 Scenario: You are learning about how files and folders are organized in computer systems. Different directory structures help organize files in various ways, such as single-level, two-level, tree, and acyclic graph structures.Imagine you are setting up a simple file system to understand these structures better.

🎯 Goal: Build a simple representation of different directory structures using dictionaries and lists to visualize how files and folders are organized.

📋 What You'll Learn

Create a dictionary representing a single-level directory with three files

Add a two-level directory structure with users and their files

Build a tree directory structure with folders and subfolders

Represent an acyclic graph directory structure with shared files

💡 Why This Matters

🌍 Real World

Understanding directory structures helps in managing files efficiently on computers and designing file systems.

💼 Career

Knowledge of directory structures is important for system administrators, software developers, and anyone working with operating systems or file management.

1

Create a Single-Level Directory

Create a dictionary called single_level_dir with these exact entries: 'file1.txt': 100, 'file2.txt': 200, and 'file3.txt': 300. The numbers represent file sizes in KB.

Operating Systems

# Create the single-level directory dictionary
# Your code here

Hint

Use a dictionary with file names as keys and sizes as values.

2

Add a Two-Level Directory Structure

Create a dictionary called two_level_dir where keys are user names 'Alice' and 'Bob'. Each user has a list of their files: 'Alice' has 'doc1.txt' and 'doc2.txt', 'Bob' has 'image1.png'. Use lists to hold the file names.

Operating Systems

single_level_dir = {'file1.txt': 100, 'file2.txt': 200, 'file3.txt': 300}
# Create the two-level directory dictionary
# Your code here

Hint

Use a dictionary with user names as keys and lists of file names as values.

3

Build a Tree Directory Structure

Create a dictionary called tree_dir representing folders and subfolders. The root folder 'root' contains 'folder1' and 'folder2'. 'folder1' contains files 'a.txt' and 'b.txt'. 'folder2' contains a subfolder 'subfolder1' with file 'c.txt'. Use nested dictionaries and lists to represent this structure.

Operating Systems

single_level_dir = {'file1.txt': 100, 'file2.txt': 200, 'file3.txt': 300}
two_level_dir = {'Alice': ['doc1.txt', 'doc2.txt'], 'Bob': ['image1.png']}
# Create the tree directory dictionary
# Your code here

Hint

Use nested dictionaries for folders and lists for files inside folders.

4

Represent an Acyclic Graph Directory Structure

Create a dictionary called acyclic_graph_dir where 'folderA' contains 'fileX.txt' and a link to 'folderB'. 'folderB' contains 'fileY.txt'. Represent the link by including 'folderB' as a key inside 'folderA' pointing to the same dictionary as 'folderB'. Use nested dictionaries and ensure no cycles are created.

Operating Systems

single_level_dir = {'file1.txt': 100, 'file2.txt': 200, 'file3.txt': 300}
two_level_dir = {'Alice': ['doc1.txt', 'doc2.txt'], 'Bob': ['image1.png']}
tree_dir = {'root': {'folder1': ['a.txt', 'b.txt'], 'folder2': {'subfolder1': ['c.txt']}}}
# Create the acyclic graph directory dictionary
# Your code here

Hint

Use a shared dictionary object for folderB and reference it inside folderA to represent the link.

Practice

1. Which directory structure allows all files to be stored in a single folder without any subfolders?

easy

A. Acyclic graph directory

B. Two-level directory structure

C. Tree-structured directory

D. Single-level directory structure

Solution

1. Step 1: Understand single-level directory

   In a single-level directory, all files are stored in one folder without any subfolders or hierarchy.

2. Step 2: Compare with other structures

   Two-level and tree structures have multiple folders or subfolders, and acyclic graph allows shared folders, so they are not single-level.

3. Final Answer:

   Single-level directory structure -> Option D

4. Quick Check:

   Single-level = all files in one folder [OK]

Hint: Single-level means one folder only, no subfolders [OK]

Common Mistakes:

• Confusing single-level with two-level structure
• Thinking tree structure is single-level
• Assuming acyclic graph is single-level

2. Which of the following correctly describes a two-level directory structure?

easy

A. All files are stored in one directory without subdirectories

B. Directories form a hierarchy with multiple levels

C. Each user has a separate directory under the root directory

D. Directories can share subdirectories forming cycles

Solution

1. Step 1: Recall two-level directory structure

   In two-level structure, each user has their own directory under a common root directory.

2. Step 2: Eliminate incorrect options

   All files are stored in one directory without subdirectories describes single-level, B describes tree structure, and D describes cyclic graphs which are not allowed.

3. Final Answer:

   Each user has a separate directory under the root directory -> Option C

4. Quick Check:

   Two-level = user directories under root [OK]

Hint: Two-level means root plus user folders only [OK]

Common Mistakes:

• Mixing two-level with single-level structure
• Thinking two-level allows deep folder trees
• Confusing acyclic graph with two-level

3. Consider a tree-structured directory where the root has two subdirectories: Docs and Images. Docs contains files a.txt and b.txt. Images contains pic1.jpg. How many total files are in the directory tree?

medium

A. 3

B. 2

C. 4

D. 1

Solution

1. Step 1: Count files in Docs directory

   Docs contains two files: a.txt and b.txt, so count is 2.

2. Step 2: Count files in Images directory

   Images contains one file: pic1.jpg, so count is 1.

3. Step 3: Add all files

   Total files = 2 (Docs) + 1 (Images) = 3 files.

4. Final Answer:

   3 -> Option A

5. Quick Check:

   2 + 1 = 3 files [OK]

Hint: Add files in all subdirectories for total count [OK]

Common Mistakes:

• Counting directories as files
• Forgetting to add files from all subdirectories
• Miscounting number of files in Docs

4. A directory structure is supposed to be a tree, but a user accidentally creates a cycle by linking a subdirectory back to its ancestor. What problem does this cause?

medium

A. The directory structure is no longer acyclic, causing infinite loops

B. Files become inaccessible due to missing links

C. The directory becomes single-level

D. The directory structure automatically corrects itself

Solution

1. Step 1: Understand tree and cycle concepts

   A tree directory must not have cycles; linking back creates a cycle.

2. Step 2: Identify consequences of cycle

   Cycle causes infinite loops when traversing directories, breaking acyclic property.

3. Final Answer:

   The directory structure is no longer acyclic, causing infinite loops -> Option A

4. Quick Check:

   Cycle breaks acyclic tree causing infinite loops [OK]

Hint: Cycles cause infinite loops in directory traversal [OK]

Common Mistakes:

• Thinking files become inaccessible immediately
• Assuming directory fixes cycle automatically
• Confusing cycle with single-level structure

5. In an acyclic graph directory structure, a file can appear in multiple directories by sharing links. Which advantage does this provide compared to a tree structure?

hard

A. It prevents any file from being deleted accidentally

B. It reduces disk space by storing one copy with multiple references

C. It forces all files to be stored in a single directory

D. It creates cycles to speed up file access

Solution

1. Step 1: Understand acyclic graph directory

   Acyclic graph allows multiple directories to share the same file via links, avoiding duplicates.

2. Step 2: Identify advantage over tree structure

   This sharing reduces disk space since only one copy of the file is stored with multiple references.

3. Step 3: Eliminate incorrect options

   Files can still be deleted, it does not force single directory storage, and cycles are not allowed.

4. Final Answer:

   It reduces disk space by storing one copy with multiple references -> Option B

5. Quick Check:

   Shared links save space in acyclic graph [OK]

Hint: Shared links save space by avoiding duplicate files [OK]

Common Mistakes:

• Thinking acyclic graph creates cycles
• Assuming files cannot be deleted
• Confusing with single-level directory