dancealgorithm 0.1.1__py3-none-any.whl → 0.1.2__py3-none-any.whl

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.2"
 
 # Import bundled assignments registry and sheets
 from dancealgorithm.assignments import ASSIGNMENTS_DIR, REGISTRY, SHEETS
@@ -128,4 +128,4 @@ __all__ = [
     "extract",
     "open_folder",
 ]
-
+

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/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/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/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/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.");
+        }
+    }
+}

dancealgorithm/assignments/GC - University/__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 - University"
+
+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/assignments/GC.txt

@@ -0,0 +1,25 @@
+==================================================
+7. GRAPH COLORING (BACKTRACKING)
+==================================================
+
+ALGORITHM:
+1. Represent the graph using an adjacency matrix.
+2. Initialize all vertex colors to zero.
+3. Start coloring from vertex 0.
+4. Try every available color from 1 to m.
+5. Check whether the color is safe.
+6. If safe, assign the color and recursively color the next vertex.
+7. If unsuccessful, reset color to zero (backtracking).
+8. Continue until all vertices are colored or no solution exists.
+
+RECURRENCE RELATION:
+T(V) = mT(V-1) + O(V)
+
+TIME COMPLEXITY:
+Best Case    : Depends on early solution.
+Average Case : Input-dependent.
+Worst Case   : O(V * m^V)
+Space        : O(V) auxiliary space
+
+IMPORTANT:
+1. Graph Coloring uses Backtracking.