dancealgorithm 0.1.1__tar.gz → 0.1.3__tar.gz

{dancealgorithm-0.1.1/src/dancealgorithm.egg-info → dancealgorithm-0.1.3}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: dancealgorithm
-Version: 0.1.1
+Version: 0.1.3
 Summary: DanceAlgorithm: Instant DAA Algorithms, Lab Problem Sheets, Datasets, and Code Vault.
 Author: DanceAlgorithm Maintainer
 License-Expression: MIT
@@ -26,7 +26,7 @@ Dynamic: license-file
 # ⚡ DanceAlgorithm
 
 > **Instant DAA Problem Sheets, Datasets, Solutions & Algorithm Vault**  
-> Download, extract, organize, and directly **import** all 18 Design & Analysis of Algorithms (DAA) lab practical problem sheets, datasets, and Java solutions cleanly onto your PC or Linux machine with a single command or Python import.
+> Download, extract, organize, and directly **import** all 24 Design & Analysis of Algorithms (DAA) lab practical problem sheets, datasets, and Java solutions cleanly onto your PC or Linux machine with a single command or Python import.
 
 [![PyPI Version](https://img.shields.io/pypi/v/dancealgorithm.svg)](https://pypi.org/project/dancealgorithm/)
 [![Python Version](https://img.shields.io/badge/python-3.9%2B-blue.svg)](https://www.python.org/)
@@ -38,7 +38,7 @@ Dynamic: license-file
 
 ## 🌟 The Magic Experience
 
-### Option A: Install & Extract All 18 Problem Sheets
+### Option A: Install & Extract All 24 Problem Sheets
 
 ```powershell
 pip install dancealgorithm; dance
@@ -50,7 +50,7 @@ Or run `dance` (or `dancealgorithm`) anytime in your terminal:
 dance
 ```
 
-Your `C:\DAA_Assignments` folder (or `~/DAA_Assignments` on Linux) is cleanly populated with all 18 problem sheets:
+Your `C:\DAA_Assignments` folder (or `~/DAA_Assignments` on Linux) is cleanly populated with all 24 problem sheets:
 
 ```text
 C:\DAA_Assignments\
@@ -60,9 +60,10 @@ C:\DAA_Assignments\
 ├── MS - Commerce/
 │   ├── dataset.csv
 │   └── Solution.java
-├── MS - Library/
 ├── ...
-└── K - Cloud/
+├── GC - University/
+│   └── Solution.java
+└── LC - Drilling/
     └── Solution.java
 ```
 
@@ -92,9 +93,15 @@ dance K.txt
 
 # Multistage Graph backward DP
 dance MSG.txt
+
+# Graph Coloring backtracking analysis
+dance GC.txt
+
+# TSP - Least Cost Branch & Bound analysis
+dance LC.txt
 ```
 
-*(You can also use `dancealgorithm DA.txt` or `dance DA`)*
+*(You can also use `dancealgorithm DA.txt`, `dance GC.txt`, or `dance DA`)*
 
 ### 2. Extract a Specific Assignment Folder
 
@@ -104,12 +111,14 @@ Extract only that particular folder:
 # Extract unquoted or quoted
 dance MSG - Logistics
 dance "DA - Smart"
-dance "MS - Customer"
+dance "GC - Classroom"
+dance "LC - Delivery"
 
 # Or extract by problem number
 dance 1
-dance 10
 dance 13
+dance 19
+dance 24
 ```
 
 ### 3. List All Available Problem Sheets & Notes
@@ -122,7 +131,7 @@ dance list
 
 ## 🐍 Option B: Direct Python Import
 
-All 18 assignments can be directly inspected or extracted programmatically:
+All 24 assignments can be directly inspected or extracted programmatically:
 
 ```python
 import dancealgorithm
@@ -143,7 +152,7 @@ dancealgorithm.open_folder()
 
 ---
 
-## 📚 Complete Catalogue of All 18 DAA Problem Sheets
+## 📚 Complete Catalogue of All 24 DAA Problem Sheets
 
 | No. | Algorithm | Category | Problem Sheet Title | Time Complexity |
 |---|---|---|---|---|
@@ -165,6 +174,12 @@ dancealgorithm.open_folder()
 | **16** | 0/1 Knapsack | Dynamic Programming | `K - Disaster` | $O(n \cdot W)$ |
 | **17** | 0/1 Knapsack | Dynamic Programming | `K - Hospital` | $O(n \cdot W)$ |
 | **18** | 0/1 Knapsack | Dynamic Programming | `K - Cloud` | $O(n \cdot W)$ |
+| **19** | Graph Coloring | Backtracking | `GC - University` | $O(V \cdot m^V)$ |
+| **20** | Graph Coloring | Backtracking | `GC - Classroom` | $O(V \cdot m^V)$ |
+| **21** | Graph Coloring | Backtracking | `GC - Interference` | $O(V \cdot m^V)$ |
+| **22** | LC Branch and Bound | State Space Search | `LC - Delivery` | $O(n! \cdot n^2)$ |
+| **23** | LC Branch and Bound | State Space Search | `LC - Flight` | $O(n! \cdot n^2)$ |
+| **24** | LC Branch and Bound | State Space Search | `LC - Drilling` | $O(n! \cdot n^2)$ |
 
 ---
 

{dancealgorithm-0.1.1 → dancealgorithm-0.1.3}/README.md

@@ -1,7 +1,7 @@
 # ⚡ DanceAlgorithm
 
 > **Instant DAA Problem Sheets, Datasets, Solutions & Algorithm Vault**  
-> Download, extract, organize, and directly **import** all 18 Design & Analysis of Algorithms (DAA) lab practical problem sheets, datasets, and Java solutions cleanly onto your PC or Linux machine with a single command or Python import.
+> Download, extract, organize, and directly **import** all 24 Design & Analysis of Algorithms (DAA) lab practical problem sheets, datasets, and Java solutions cleanly onto your PC or Linux machine with a single command or Python import.
 
 [![PyPI Version](https://img.shields.io/pypi/v/dancealgorithm.svg)](https://pypi.org/project/dancealgorithm/)
 [![Python Version](https://img.shields.io/badge/python-3.9%2B-blue.svg)](https://www.python.org/)
@@ -13,7 +13,7 @@
 
 ## 🌟 The Magic Experience
 
-### Option A: Install & Extract All 18 Problem Sheets
+### Option A: Install & Extract All 24 Problem Sheets
 
 ```powershell
 pip install dancealgorithm; dance
@@ -25,7 +25,7 @@ Or run `dance` (or `dancealgorithm`) anytime in your terminal:
 dance
 ```
 
-Your `C:\DAA_Assignments` folder (or `~/DAA_Assignments` on Linux) is cleanly populated with all 18 problem sheets:
+Your `C:\DAA_Assignments` folder (or `~/DAA_Assignments` on Linux) is cleanly populated with all 24 problem sheets:
 
 ```text
 C:\DAA_Assignments\
@@ -35,9 +35,10 @@ C:\DAA_Assignments\
 ├── MS - Commerce/
 │   ├── dataset.csv
 │   └── Solution.java
-├── MS - Library/
 ├── ...
-└── K - Cloud/
+├── GC - University/
+│   └── Solution.java
+└── LC - Drilling/
     └── Solution.java
 ```
 
@@ -67,9 +68,15 @@ dance K.txt
 
 # Multistage Graph backward DP
 dance MSG.txt
+
+# Graph Coloring backtracking analysis
+dance GC.txt
+
+# TSP - Least Cost Branch & Bound analysis
+dance LC.txt
 ```
 
-*(You can also use `dancealgorithm DA.txt` or `dance DA`)*
+*(You can also use `dancealgorithm DA.txt`, `dance GC.txt`, or `dance DA`)*
 
 ### 2. Extract a Specific Assignment Folder
 
@@ -79,12 +86,14 @@ Extract only that particular folder:
 # Extract unquoted or quoted
 dance MSG - Logistics
 dance "DA - Smart"
-dance "MS - Customer"
+dance "GC - Classroom"
+dance "LC - Delivery"
 
 # Or extract by problem number
 dance 1
-dance 10
 dance 13
+dance 19
+dance 24
 ```
 
 ### 3. List All Available Problem Sheets & Notes
@@ -97,7 +106,7 @@ dance list
 
 ## 🐍 Option B: Direct Python Import
 
-All 18 assignments can be directly inspected or extracted programmatically:
+All 24 assignments can be directly inspected or extracted programmatically:
 
 ```python
 import dancealgorithm
@@ -118,7 +127,7 @@ dancealgorithm.open_folder()
 
 ---
 
-## 📚 Complete Catalogue of All 18 DAA Problem Sheets
+## 📚 Complete Catalogue of All 24 DAA Problem Sheets
 
 | No. | Algorithm | Category | Problem Sheet Title | Time Complexity |
 |---|---|---|---|---|
@@ -140,6 +149,12 @@ dancealgorithm.open_folder()
 | **16** | 0/1 Knapsack | Dynamic Programming | `K - Disaster` | $O(n \cdot W)$ |
 | **17** | 0/1 Knapsack | Dynamic Programming | `K - Hospital` | $O(n \cdot W)$ |
 | **18** | 0/1 Knapsack | Dynamic Programming | `K - Cloud` | $O(n \cdot W)$ |
+| **19** | Graph Coloring | Backtracking | `GC - University` | $O(V \cdot m^V)$ |
+| **20** | Graph Coloring | Backtracking | `GC - Classroom` | $O(V \cdot m^V)$ |
+| **21** | Graph Coloring | Backtracking | `GC - Interference` | $O(V \cdot m^V)$ |
+| **22** | LC Branch and Bound | State Space Search | `LC - Delivery` | $O(n! \cdot n^2)$ |
+| **23** | LC Branch and Bound | State Space Search | `LC - Flight` | $O(n! \cdot n^2)$ |
+| **24** | LC Branch and Bound | State Space Search | `LC - Drilling` | $O(n! \cdot n^2)$ |
 
 ---
 

{dancealgorithm-0.1.1 → dancealgorithm-0.1.3}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "dancealgorithm"
-version = "0.1.1"
+version = "0.1.3"
 description = "DanceAlgorithm: Instant DAA Algorithms, Lab Problem Sheets, Datasets, and Code Vault."
 readme = "README.md"
 requires-python = ">=3.9"

{dancealgorithm-0.1.1 → dancealgorithm-0.1.3}/src/dancealgorithm/__init__.py

@@ -1,6 +1,6 @@
 """
 DanceAlgorithm - Instant DAA Algorithms, Lab Problem Sheets, Datasets & Code Vault.
-All 18 Practical Exam Problem Sheets & Algorithm Notes Bundled & Instantly Importable.
+All 24 Practical Exam Problem Sheets & Algorithm Notes Bundled & Instantly Importable.
 """
 from __future__ import annotations
 
@@ -9,7 +9,7 @@ import sys
 from pathlib import Path
 from typing import Any, Dict, List, Optional, Union
 
-__version__ = "0.1.1"
+__version__ = "0.1.3"
 
 # Import bundled assignments registry and sheets
 from dancealgorithm.assignments import ASSIGNMENTS_DIR, REGISTRY, SHEETS
@@ -128,4 +128,4 @@ __all__ = [
     "extract",
     "open_folder",
 ]
-
+

dancealgorithm-0.1.3/src/dancealgorithm/assignments/GC - Classroom/Solution.java

@@ -0,0 +1,119 @@
+
+import java.util.*;
+
+public class Solution {
+    // 1. Main Function
+    public static void main(String args[]) {
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter number of lectures: ");
+        int iSize = sc.nextInt();
+
+        String sLectures[] = new String[iSize];
+
+        // 2. Get Lecture Details
+        sc.nextLine();
+
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            System.out.print("Enter lecture " + (iCnt + 1) + ": ");
+            sLectures[iCnt] = sc.nextLine();
+        }
+
+        // 3. Create Conflict Graph
+        int iGraph[][] = new int[iSize][iSize];
+
+        System.out.print("Enter number of conflict pairs: ");
+        int iPairs = sc.nextInt();
+
+        for (int iCnt = 0; iCnt < iPairs; iCnt++) {
+            System.out.println("\nEnter lecture numbers for conflict pair " + (iCnt + 1));
+
+            System.out.print("First lecture: ");
+            int iU = sc.nextInt() - 1;
+
+            System.out.print("Second lecture: ");
+            int iV = sc.nextInt() - 1;
+
+            if (iU >= 0 && iU < iSize && iV >= 0 &&
+                    iV < iSize && iU != iV) {
+                iGraph[iU][iV] = 1;
+                iGraph[iV][iU] = 1;
+            } else {
+                System.out.println("Invalid lecture numbers!");
+                iCnt--;
+            }
+        }
+
+        // 4. Get Available Classrooms
+        System.out.print("\nEnter available classrooms: ");
+        int iRooms = sc.nextInt();
+
+        // 5. Apply Graph Coloring
+        ClassroomScheduler(iGraph, iRooms, sLectures);
+
+        sc.close();
+    }
+
+    // 6. Check Whether Color Is Safe
+    static boolean IsSafe(int iV, int iGraph[][],
+            int iColor[], int iC, int iSize) {
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            if (iGraph[iV][iCnt] == 1 && iColor[iCnt] == iC) {
+                return false;
+            }
+        }
+
+        return true;
+    }
+
+    // 7. Graph Coloring Using Backtracking
+    static boolean GraphColoring(int iGraph[][], int iRooms,
+            int iColor[], int iV, int iSize) {
+        if (iV == iSize) {
+            return true;
+        }
+
+        for (int iC = 1; iC <= iRooms; iC++) {
+            if (IsSafe(iV, iGraph, iColor, iC, iSize)) {
+                iColor[iV] = iC;
+
+                if (GraphColoring(iGraph, iRooms, iColor,
+                        iV + 1, iSize)) {
+                    return true;
+                }
+
+                // Backtrack
+                iColor[iV] = 0;
+            }
+        }
+
+        return false;
+    }
+
+    // 8. Classroom Scheduler
+    static void ClassroomScheduler(int iGraph[][],
+            int iRooms, String sLectures[]) {
+        int iSize = sLectures.length;
+        int iColor[] = new int[iSize];
+
+        System.out.println("\nClassroom Allocation:");
+        System.out.println("------------------------------------------------");
+
+        if (!GraphColoring(iGraph, iRooms, iColor, 0, iSize)) {
+            System.out.println("Cannot schedule all lectures without conflicts!");
+        } else {
+            System.out.printf("%-35s %-20s%n",
+                    "Lecture Session", "Allocated Classroom");
+
+            System.out.println("------------------------------------------------");
+
+            for (int iCnt = 0; iCnt < iSize; iCnt++) {
+                System.out.printf("%-35s Room Hall %d%n",
+                        sLectures[iCnt], iColor[iCnt]);
+            }
+
+            System.out.println("------------------------------------------------");
+            System.out.println("Status: All lectures scheduled without conflicts.");
+        }
+    }
+}

dancealgorithm-0.1.3/src/dancealgorithm/assignments/GC - Classroom/__init__.py

@@ -0,0 +1,38 @@
+from __future__ import annotations
+import sys
+from pathlib import Path
+from typing import Optional
+
+PATH = Path(__file__).resolve().parent
+DIR = PATH
+JAVA_SOLUTION = PATH / "Solution.java"
+DATASET_PATH = PATH / "dataset.csv"
+TITLE = "GC - Classroom"
+
+def get_code() -> str:
+    if JAVA_SOLUTION.exists():
+        return JAVA_SOLUTION.read_text(encoding="utf-8")
+    return ""
+
+def extract(destination: Optional[str | Path] = None, overwrite: bool = True) -> Path:
+    from dancealgorithm.downloader import extract_bundled
+    from dancealgorithm.config import get_destination
+    target = Path(destination) if destination else get_destination()
+    extract_bundled(target, subject_filter=TITLE, overwrite=overwrite)
+    return target / PATH.name
+
+def open_folder() -> None:
+    import os
+    if sys.platform == "win32":
+        os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
+
+def __getattr__(name: str):
+    if name in ("code", "java_code", "solution_code"):
+        return get_code()
+    if name in ("path", "folder", "dir"):
+        return PATH
+    raise AttributeError(f"module {__name__!r} has no attribute {name!r}")

dancealgorithm-0.1.3/src/dancealgorithm/assignments/GC - Interference/Solution.java

@@ -0,0 +1,120 @@
+
+import java.util.*;
+
+public class Solution {
+    // 1. Main Function
+    public static void main(String args[]) {
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter number of towers: ");
+        int iSize = sc.nextInt();
+
+        String sTowers[] = new String[iSize];
+
+        // 2. Get Tower Names
+        sc.nextLine();
+
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            System.out.print("Enter tower " + (iCnt + 1) + ": ");
+            sTowers[iCnt] = sc.nextLine();
+        }
+
+        // 3. Create Interference Graph
+        int iGraph[][] = new int[iSize][iSize];
+
+        System.out.print("Enter number of interference pairs: ");
+        int iPairs = sc.nextInt();
+
+        for (int iCnt = 0; iCnt < iPairs; iCnt++) {
+            System.out.println("\nEnter tower numbers for interference pair " + (iCnt + 1));
+
+            System.out.print("First tower: ");
+            int iU = sc.nextInt() - 1;
+
+            System.out.print("Second tower: ");
+            int iV = sc.nextInt() - 1;
+
+            if (iU >= 0 && iU < iSize && iV >= 0 &&
+                    iV < iSize && iU != iV) {
+                iGraph[iU][iV] = 1;
+                iGraph[iV][iU] = 1;
+            } else {
+                System.out.println("Invalid tower numbers!");
+                iCnt--;
+            }
+        }
+
+        // 4. Get Available Frequency Channels
+        System.out.print("\nEnter available frequency channels: ");
+        int iChannels = sc.nextInt();
+
+        // 5. Apply Graph Coloring
+        FrequencyAllocator(iGraph, iChannels, sTowers);
+
+        sc.close();
+    }
+
+    // 6. Check Whether Color Is Safe
+    static boolean IsSafe(int iV, int iGraph[][],
+            int iColor[], int iC, int iSize) {
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            if (iGraph[iV][iCnt] == 1 && iColor[iCnt] == iC) {
+                return false;
+            }
+        }
+
+        return true;
+    }
+
+    // 7. Graph Coloring Using Backtracking
+    static boolean GraphColoring(int iGraph[][], int iChannels,
+            int iColor[], int iV, int iSize) {
+        if (iV == iSize) {
+            return true;
+        }
+
+        for (int iC = 1; iC <= iChannels; iC++) {
+            if (IsSafe(iV, iGraph, iColor, iC, iSize)) {
+                iColor[iV] = iC;
+
+                if (GraphColoring(iGraph, iChannels, iColor,
+                        iV + 1, iSize)) {
+                    return true;
+                }
+
+                // Backtrack
+                iColor[iV] = 0;
+            }
+        }
+
+        return false;
+    }
+
+    // 8. Frequency Allocator
+    static void FrequencyAllocator(int iGraph[][],
+            int iChannels, String sTowers[]) {
+        int iSize = sTowers.length;
+        int iColor[] = new int[iSize];
+
+        System.out.println("\nCellular Network Frequency Allocation:");
+        System.out.println("---------------------------------------------------------------");
+
+        if (!GraphColoring(iGraph, iChannels, iColor, 0, iSize)) {
+            System.out.println("Cannot allocate frequencies without interference!");
+        } else {
+            System.out.printf("%-28s %-20s%n",
+                    "Cellular Tower", "Frequency Channel");
+
+            System.out.println("---------------------------------------------------------------");
+
+            for (int iCnt = 0; iCnt < iSize; iCnt++) {
+                System.out.printf("%-28s Channel %d (Band %d MHz)%n",
+                        sTowers[iCnt], iColor[iCnt],
+                        800 + iColor[iCnt] * 50);
+            }
+
+            System.out.println("---------------------------------------------------------------");
+            System.out.println("Status: All towers allocated without interference.");
+        }
+    }
+}

dancealgorithm-0.1.3/src/dancealgorithm/assignments/GC - Interference/__init__.py

@@ -0,0 +1,38 @@
+from __future__ import annotations
+import sys
+from pathlib import Path
+from typing import Optional
+
+PATH = Path(__file__).resolve().parent
+DIR = PATH
+JAVA_SOLUTION = PATH / "Solution.java"
+DATASET_PATH = PATH / "dataset.csv"
+TITLE = "GC - Interference"
+
+def get_code() -> str:
+    if JAVA_SOLUTION.exists():
+        return JAVA_SOLUTION.read_text(encoding="utf-8")
+    return ""
+
+def extract(destination: Optional[str | Path] = None, overwrite: bool = True) -> Path:
+    from dancealgorithm.downloader import extract_bundled
+    from dancealgorithm.config import get_destination
+    target = Path(destination) if destination else get_destination()
+    extract_bundled(target, subject_filter=TITLE, overwrite=overwrite)
+    return target / PATH.name
+
+def open_folder() -> None:
+    import os
+    if sys.platform == "win32":
+        os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
+
+def __getattr__(name: str):
+    if name in ("code", "java_code", "solution_code"):
+        return get_code()
+    if name in ("path", "folder", "dir"):
+        return PATH
+    raise AttributeError(f"module {__name__!r} has no attribute {name!r}")

dancealgorithm-0.1.3/src/dancealgorithm/assignments/GC - University/Solution.java

@@ -0,0 +1,119 @@
+
+import java.util.*;
+
+public class Solution {
+    // 1. Main Function
+    public static void main(String args[]) {
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter number of courses: ");
+        int iSize = sc.nextInt();
+
+        String sCourses[] = new String[iSize];
+
+        // 2. Get Course Names
+        sc.nextLine();
+
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            System.out.print("Enter course " + (iCnt + 1) + ": ");
+            sCourses[iCnt] = sc.nextLine();
+        }
+
+        // 3. Create Conflict Graph
+        int iGraph[][] = new int[iSize][iSize];
+
+        System.out.print("Enter number of conflict pairs: ");
+        int iPairs = sc.nextInt();
+
+        for (int iCnt = 0; iCnt < iPairs; iCnt++) {
+            System.out.println("\nEnter course numbers for conflict pair " + (iCnt + 1));
+
+            System.out.print("First course: ");
+            int iU = sc.nextInt() - 1;
+
+            System.out.print("Second course: ");
+            int iV = sc.nextInt() - 1;
+
+            if (iU >= 0 && iU < iSize && iV >= 0 &&
+                    iV < iSize && iU != iV) {
+                iGraph[iU][iV] = 1;
+                iGraph[iV][iU] = 1;
+            } else {
+                System.out.println("Invalid course numbers!");
+                iCnt--;
+            }
+        }
+
+        // 4. Get Available Exam Slots
+        System.out.print("\nEnter available exam slots: ");
+        int iSlots = sc.nextInt();
+
+        // 5. Apply Graph Coloring
+        TimetableScheduler(iGraph, iSlots, sCourses);
+
+        sc.close();
+    }
+
+    // 6. Check Whether Color Is Safe
+    static boolean IsSafe(int iV, int iGraph[][],
+            int iColor[], int iC, int iSize) {
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            if (iGraph[iV][iCnt] == 1 && iColor[iCnt] == iC) {
+                return false;
+            }
+        }
+
+        return true;
+    }
+
+    // 7. Graph Coloring Using Backtracking
+    static boolean GraphColoring(int iGraph[][], int iSlots,
+            int iColor[], int iV, int iSize) {
+        if (iV == iSize) {
+            return true;
+        }
+
+        for (int iC = 1; iC <= iSlots; iC++) {
+            if (IsSafe(iV, iGraph, iColor, iC, iSize)) {
+                iColor[iV] = iC;
+
+                if (GraphColoring(iGraph, iSlots, iColor,
+                        iV + 1, iSize)) {
+                    return true;
+                }
+
+                // Backtrack
+                iColor[iV] = 0;
+            }
+        }
+
+        return false;
+    }
+
+    // 8. Timetable Scheduler
+    static void TimetableScheduler(int iGraph[][],
+            int iSlots, String sCourses[]) {
+        int iSize = sCourses.length;
+        int iColor[] = new int[iSize];
+
+        System.out.println("\nUniversity Exam Timetable:");
+        System.out.println("------------------------------------------------");
+
+        if (!GraphColoring(iGraph, iSlots, iColor, 0, iSize)) {
+            System.out.println("No conflict-free schedule possible!");
+        } else {
+            System.out.printf("%-30s %-15s%n",
+                    "Course Name", "Exam Slot");
+
+            System.out.println("------------------------------------------------");
+
+            for (int iCnt = 0; iCnt < iSize; iCnt++) {
+                System.out.printf("%-30s Slot %d%n",
+                        sCourses[iCnt], iColor[iCnt]);
+            }
+
+            System.out.println("------------------------------------------------");
+            System.out.println("Status: All courses scheduled without clashes.");
+        }
+    }
+}