Directory structure (single-level, two-level, tree, acyclic graph) in Operating Systems - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a single-level directory structure?

A single-level directory structure has all files stored in one directory. It is simple but can cause name conflicts because all files share the same directory.

beginner

How does a two-level directory structure organize files?

A two-level directory structure has a separate directory for each user. Each user's files are stored in their own directory, avoiding name conflicts between users.

intermediate

Describe the tree directory structure.

A tree directory structure organizes files in a hierarchy like a tree. It has a root directory and subdirectories, allowing files to be grouped logically and avoiding name conflicts.

advanced

What is an acyclic graph directory structure?

An acyclic graph directory structure allows directories to share subdirectories or files using links, but it does not allow cycles (loops). This helps save space and organize files flexibly.

intermediate

Why are tree and acyclic graph directory structures preferred over single-level structures?

Tree and acyclic graph structures help organize files better, avoid name conflicts, and allow sharing of files or directories. Single-level structures are simple but limited and can cause problems as the number of files grows.

Which directory structure stores all files in one directory?

A Tree

B Two-level

C Single-level

D Acyclic graph

In a single-level directory structure, all files are stored in one directory.

What is the main advantage of a two-level directory structure?

A Avoids file name conflicts between users

B Supports cycles in directory links

C Allows sharing files between users

D Stores all files in one directory

Two-level directories separate files by user, avoiding name conflicts.

Which directory structure resembles a tree with a root and branches?

A Single-level

B Tree

C Two-level

D Acyclic graph

The tree directory structure organizes files hierarchically like a tree.

What does 'acyclic' mean in an acyclic graph directory structure?

A It does not allow cycles or loops

B It has only two levels

C It stores files in one directory

D It allows cycles or loops

Acyclic means no cycles or loops are allowed in the directory links.

Which directory structure allows sharing of subdirectories without creating loops?

A Single-level

B Two-level

C Tree

D Acyclic graph

Acyclic graph structures allow sharing without cycles.

Explain the differences between single-level, two-level, tree, and acyclic graph directory structures.

Think about how files are organized and how name conflicts are avoided.

Why might an operating system choose a tree or acyclic graph directory structure over simpler ones?

Consider the benefits of hierarchy and sharing.

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