sjec-labs 0.1.0__tar.gz

sjec_labs-0.1.0/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 SJEC Labs contributors
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

sjec_labs-0.1.0/PKG-INFO

@@ -0,0 +1,60 @@
+Metadata-Version: 2.4
+Name: sjec-labs
+Version: 0.1.0
+Summary: Exam-friendly Python lab programs for SJEC students
+Author: SJEC Labs contributors
+License-Expression: MIT
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3 :: Only
+Classifier: Operating System :: OS Independent
+Requires-Python: >=3.9
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Provides-Extra: notebook
+Requires-Dist: ipython>=8; extra == "notebook"
+Dynamic: license-file
+
+# sjec-labs
+
+An expandable collection of exam-friendly Python lab programs for ML, CM and DV.
+
+## Install
+
+```bash
+pip install sjec-labs
+```
+
+For syntax-highlighted Jupyter output:
+
+```python
+%pip install "sjec-labs[notebook]"
+```
+
+## Use in Jupyter or Python
+
+```python
+from sjec_lab import LabAssistant
+
+lab = LabAssistant()
+lab.list_subjects()
+lab.list_programs("ML")
+lab.get_code("ML", 1)                         # print and return simplified code
+lab.show_code("ML", 1)                       # formatted display in Jupyter
+lab.get_code("ML", 1, version="original")    # supplied original version
+```
+
+Available initial programs:
+
+1. Simple Chatbot
+2. Water Jug Problem using BFS
+3. A* Search Algorithm
+4. N-Queens using Backtracking
+
+CM and DV folders are reserved for future releases. The package will be expanded as more verified programs are added.
+
+## Notes
+
+- `get_code()` returns the source as a string and prints it by default.
+- Use `print_code=False` if you only want the returned string.
+- The core package has no mandatory third-party dependencies.
+- `show_code()` uses IPython when available.

sjec_labs-0.1.0/README.md

@@ -0,0 +1,44 @@
+# sjec-labs
+
+An expandable collection of exam-friendly Python lab programs for ML, CM and DV.
+
+## Install
+
+```bash
+pip install sjec-labs
+```
+
+For syntax-highlighted Jupyter output:
+
+```python
+%pip install "sjec-labs[notebook]"
+```
+
+## Use in Jupyter or Python
+
+```python
+from sjec_lab import LabAssistant
+
+lab = LabAssistant()
+lab.list_subjects()
+lab.list_programs("ML")
+lab.get_code("ML", 1)                         # print and return simplified code
+lab.show_code("ML", 1)                       # formatted display in Jupyter
+lab.get_code("ML", 1, version="original")    # supplied original version
+```
+
+Available initial programs:
+
+1. Simple Chatbot
+2. Water Jug Problem using BFS
+3. A* Search Algorithm
+4. N-Queens using Backtracking
+
+CM and DV folders are reserved for future releases. The package will be expanded as more verified programs are added.
+
+## Notes
+
+- `get_code()` returns the source as a string and prints it by default.
+- Use `print_code=False` if you only want the returned string.
+- The core package has no mandatory third-party dependencies.
+- `show_code()` uses IPython when available.

sjec_labs-0.1.0/pyproject.toml

@@ -0,0 +1,27 @@
+[build-system]
+requires = ["setuptools>=68", "wheel"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "sjec-labs"
+version = "0.1.0"
+description = "Exam-friendly Python lab programs for SJEC students"
+readme = "README.md"
+requires-python = ">=3.9"
+license = "MIT"
+authors = [{name = "SJEC Labs contributors"}]
+classifiers = [
+  "Programming Language :: Python :: 3",
+  "Programming Language :: Python :: 3 :: Only",
+  "Operating System :: OS Independent",
+]
+dependencies = []
+
+[project.optional-dependencies]
+notebook = ["ipython>=8"]
+
+[tool.setuptools.packages.find]
+where = ["src"]
+
+[tool.setuptools.package-data]
+"sjec_lab.programs" = ["**/*.py"]

sjec_labs-0.1.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

sjec_labs-0.1.0/src/sjec_lab/__init__.py

@@ -0,0 +1,6 @@
+"""SJEC Labs: exam-friendly lab programs and Jupyter helpers."""
+from .assistant import LabAssistant
+from .core import get_code, show_code, list_subjects, list_programs
+
+__version__ = "0.1.0"
+__all__ = ["LabAssistant", "get_code", "show_code", "list_subjects", "list_programs"]

sjec_labs-0.1.0/src/sjec_lab/assistant.py

@@ -0,0 +1,15 @@
+from .core import get_code, show_code, list_subjects, list_programs
+
+class LabAssistant:
+    """Convenience interface for retrieving SJEC lab programs."""
+    def list_subjects(self):
+        return list_subjects()
+
+    def list_programs(self, subject):
+        return list_programs(subject)
+
+    def get_code(self, subject, program, version="simple", print_code=True):
+        return get_code(subject, program, version, print_code)
+
+    def show_code(self, subject, program, version="simple"):
+        return show_code(subject, program, version)

sjec_labs-0.1.0/src/sjec_lab/core.py

@@ -0,0 +1,60 @@
+from importlib.resources import files
+
+PROGRAMS = {
+    "ML": {
+        1: "Simple Chatbot",
+        2: "Water Jug Problem using BFS",
+        3: "A* Search Algorithm",
+        4: "N-Queens using Backtracking",
+    },
+    "CM": {},
+    "DV": {},
+}
+
+ALIASES = {"FAIML": "ML", "MACHINE LEARNING": "ML", "COMPUTER GRAPHICS": "CM", "DATA VISUALIZATION": "DV"}
+
+
+def _subject_name(subject):
+    key = str(subject).strip().upper()
+    return ALIASES.get(key, key)
+
+
+def list_subjects():
+    """Return the subjects currently included in the package."""
+    return {name: len(programs) for name, programs in PROGRAMS.items()}
+
+
+def list_programs(subject):
+    """Return program numbers and titles for a subject."""
+    subject = _subject_name(subject)
+    if subject not in PROGRAMS:
+        raise ValueError(f"Unknown subject {subject!r}. Choose ML, CM, or DV.")
+    return PROGRAMS[subject].copy()
+
+
+def get_code(subject, program, version="simple", print_code=True):
+    """Get a program's source code. Prints it by default and always returns a string."""
+    subject = _subject_name(subject)
+    if subject not in PROGRAMS:
+        raise ValueError(f"Unknown subject {subject!r}. Choose ML, CM, or DV.")
+    if program not in PROGRAMS[subject]:
+        raise ValueError(f"Program {program} is not available for {subject}. Available: {list(PROGRAMS[subject])}")
+    version = version.lower()
+    if version not in ("simple", "original"):
+        raise ValueError("version must be 'simple' or 'original'")
+    resource = files(f"sjec_lab.programs.{subject.lower()}.{version}").joinpath(f"program{program}.py")
+    code = resource.read_text(encoding="utf-8")
+    if print_code:
+        print(code)
+    return code
+
+
+def show_code(subject, program, version="simple"):
+    """Display syntax-highlighted code in Jupyter; fall back to printing elsewhere."""
+    code = get_code(subject, program, version=version, print_code=False)
+    try:
+        from IPython.display import display, Code
+        display(Code(code, language="python"))
+    except ImportError:
+        print(code)
+    return code

sjec_labs-0.1.0/src/sjec_lab/programs/__init__.py

@@ -0,0 +1 @@
+"""SJEC Labs program collection."""

sjec_labs-0.1.0/src/sjec_lab/programs/cm/__init__.py

@@ -0,0 +1 @@
+"""SJEC Labs program collection."""

sjec_labs-0.1.0/src/sjec_lab/programs/dv/__init__.py

@@ -0,0 +1 @@
+"""SJEC Labs program collection."""

sjec_labs-0.1.0/src/sjec_lab/programs/ml/__init__.py

@@ -0,0 +1 @@
+"""SJEC Labs program collection."""

sjec_labs-0.1.0/src/sjec_lab/programs/ml/original/__init__.py

@@ -0,0 +1 @@
+"""SJEC Labs program collection."""

sjec_labs-0.1.0/src/sjec_lab/programs/ml/original/program1.py

@@ -0,0 +1,33 @@
+# Original version from FAIML_simplified.ipynb
+def chatbot():
+    responses = {
+        "hi": "Hi there! How are you today?",
+        "hello": "Hello! How can I assist you?",
+        "how are you?": "I'm just a bot, but I'm doing great! How about you?",
+        "what's your name?": "I am your friendly chatbot!",
+        "what can you do?": "I can have simple conversations with you. Ask me anything!",
+        "what is ai?": "AI stands for Artificial Intelligence, which is intelligence demonstrated by machines.",
+        "what is machine learning?": "Machine learning is a subset of AI that allows computers to learn from data.",
+        "what is deep learning?": "Deep learning uses neural networks to model complex patterns.",
+        "tell me a joke": "Why don't scientists trust atoms? Because they make up everything!",
+        "bye": "Goodbye! Have a nice day!"
+    }
+
+    print("Hello! I am a simple chatbot. How can I help you?")
+
+    # Infinite loop for conversation
+    while True:
+        user_input = input("You: ").lower()
+
+        if user_input in responses:
+            print(f"Bot: {responses[user_input]}")
+
+            if user_input == "bye":
+                break
+
+        else:
+            print("Bot: Sorry, I don't understand that. Can you try asking something else?")
+
+
+# Run the chatbot
+chatbot()

sjec_labs-0.1.0/src/sjec_lab/programs/ml/original/program2.py

@@ -0,0 +1,39 @@
+# Original version from FAIML_simplified.ipynb
+from collections import deque
+
+def water_jug(a, b, target):
+    q = deque([((0,0), [(0,0)])])
+    visited = {(0,0)}
+
+    while q:
+        (x,y), path = q.popleft()
+
+        if x == target or y == target:
+            return path
+
+        p = min(x, b-y)
+        r = min(y, a-x)
+
+        states = [(a,y), (x,b), (0,y), (x,0),
+                  (x-p,y+p), (x+r,y-r)]
+
+        for s in states:
+            if s not in visited:
+                visited.add(s)
+                q.append((s, path+[s]))
+
+    return None
+
+
+a = int(input("Enter jug 1 capacity: "))
+b = int(input("Enter jug 2 capacity: "))
+t = int(input("Enter target amount: "))
+
+ans = water_jug(a, b, t)
+
+if ans:
+    print("Solution steps:")
+    for s in ans:
+        print(s)
+else:
+    print("No solution found")

sjec_labs-0.1.0/src/sjec_lab/programs/ml/original/program3.py

@@ -0,0 +1,66 @@
+# Original version from FAIML_simplified.ipynb
+import heapq
+
+def astar(grid, start, goal):
+    R, C = len(grid), len(grid[0])
+
+    h = lambda p: abs(p[0]-goal[0]) + abs(p[1]-goal[1])
+
+    q = [(h(start), 0, start)]
+    cost = {start: 0}
+    parent = {start: None}
+
+    while q:
+        f, g, cur = heapq.heappop(q)
+
+        if g != cost[cur]:
+            continue
+
+        if cur == goal:
+            path = []
+            while cur is not None:
+                path.append(cur)
+                cur = parent[cur]
+            return path[::-1]
+
+        for dx, dy in [(0,1), (0,-1), (1,0), (-1,0)]:
+            x, y = cur[0]+dx, cur[1]+dy
+            nxt = (x, y)
+
+            if 0 <= x < R and 0 <= y < C and grid[x][y] == 0:
+                new = g + 1
+
+                if nxt not in cost or new < cost[nxt]:
+                    cost[nxt] = new
+                    parent[nxt] = cur
+                    heapq.heappush(q, (new+h(nxt), new, nxt))
+
+    return None
+
+
+grid = [
+    [0,1,0,0,0],
+    [0,1,0,1,0],
+    [0,0,0,1,0],
+    [1,1,0,1,0],
+    [0,0,0,1,1]
+]
+
+s = input("Enter source node: ").upper()
+d = input("Enter destination node: ").upper()
+
+nodes = {}
+
+for i in range(len(grid) * len(grid[0])):
+    nodes[chr(65+i)] = (i//len(grid[0]), i%len(grid[0]))
+
+if s in nodes and d in nodes:
+    path = astar(grid, nodes[s], nodes[d])
+
+    if path:
+        print("Path found:", " -> ".join(
+            chr(65+x*len(grid[0])+y) for x,y in path))
+    else:
+        print("No path found")
+else:
+    print("Invalid nodes")

sjec_labs-0.1.0/src/sjec_lab/programs/ml/original/program4.py

@@ -0,0 +1,34 @@
+# Original version from FAIML_simplified.ipynb
+def solve(n):
+    solutions = []
+
+    def safe(q, col):
+        row = len(q)
+        return all(col != c and abs(col-c) != row-r
+                   for r, c in enumerate(q))
+
+    def backtrack(q):
+        if len(q) == n:
+            solutions.append(q[:])
+            return
+
+        for col in range(n):
+            if safe(q, col):
+                backtrack(q + [col])
+
+    backtrack([])
+    return solutions
+
+
+n = int(input("Enter number of queens: "))
+solutions = solve(n)
+
+if solutions:
+    for i, sol in enumerate(solutions, 1):
+        print("\nSolution", i)
+
+        for col in sol:
+            print(" ".join("Q" if j == col else "."
+                           for j in range(n)))
+else:
+    print("No solution found")

sjec_labs-0.1.0/src/sjec_lab/programs/ml/simple/__init__.py

@@ -0,0 +1 @@
+"""SJEC Labs program collection."""

sjec_labs-0.1.0/src/sjec_lab/programs/ml/simple/program1.py

@@ -0,0 +1,20 @@
+# Program 1: Simple Chatbot
+responses = {
+    "hi": "Hi there! How are you today?",
+    "hello": "Hello! How can I assist you?",
+    "how are you?": "I'm just a bot, but I'm doing great! How about you?",
+    "what's your name?": "I am your friendly chatbot!",
+    "what can you do?": "I can have simple conversations with you. Ask me anything!",
+    "what is ai?": "AI stands for Artificial Intelligence, which is intelligence demonstrated by machines.",
+    "what is machine learning?": "Machine learning is a subset of AI that allows computers to learn from data.",
+    "what is deep learning?": "Deep learning uses neural networks to model complex patterns.",
+    "tell me a joke": "Why don't scientists trust atoms? Because they make up everything!",
+    "bye": "Goodbye! Have a nice day!"
+}
+
+print("Hello! I am a simple chatbot. How can I help you?")
+while True:
+    msg = input("You: ").lower()
+    print("Bot:", responses.get(msg, "Sorry, I don't understand that. Can you try asking something else?"))
+    if msg == "bye":
+        break

sjec_labs-0.1.0/src/sjec_lab/programs/ml/simple/program2.py

@@ -0,0 +1,32 @@
+# Program 2: Water Jug Problem using BFS
+from collections import deque
+
+def water_jug(a, b, target):
+    q = deque([((0, 0), [(0, 0)])])
+    seen = {(0, 0)}
+
+    while q:
+        (x, y), path = q.popleft()
+        if x == target or y == target:
+            return path
+
+        p, r = min(x, b-y), min(y, a-x)
+        states = [(a,y), (x,b), (0,y), (x,0), (x-p,y+p), (x+r,y-r)]
+
+        for state in states:
+            if state not in seen:
+                seen.add(state)
+                q.append((state, path + [state]))
+    return None
+
+a = int(input("Enter jug 1 capacity: "))
+b = int(input("Enter jug 2 capacity: "))
+t = int(input("Enter target amount: "))
+ans = water_jug(a, b, t)
+
+if ans:
+    print("Solution steps:")
+    for step in ans:
+        print(step)
+else:
+    print("No solution found")

sjec_labs-0.1.0/src/sjec_lab/programs/ml/simple/program3.py

@@ -0,0 +1,44 @@
+# Program 3: A* Search Algorithm
+import heapq
+
+def astar(grid, start, goal):
+    rows, cols = len(grid), len(grid[0])
+    h = lambda p: abs(p[0]-goal[0]) + abs(p[1]-goal[1])
+    q = [(h(start), 0, start)]
+    cost, parent = {start: 0}, {start: None}
+
+    while q:
+        f, g, cur = heapq.heappop(q)
+        if g != cost[cur]:
+            continue
+        if cur == goal:
+            path = []
+            while cur is not None:
+                path.append(cur)
+                cur = parent[cur]
+            return path[::-1]
+
+        for dx, dy in [(0,1), (0,-1), (1,0), (-1,0)]:
+            x, y = cur[0]+dx, cur[1]+dy
+            nxt = (x, y)
+            if 0 <= x < rows and 0 <= y < cols and grid[x][y] == 0:
+                new = g + 1
+                if nxt not in cost or new < cost[nxt]:
+                    cost[nxt], parent[nxt] = new, cur
+                    heapq.heappush(q, (new+h(nxt), new, nxt))
+    return None
+
+grid = [[0,1,0,0,0], [0,1,0,1,0], [0,0,0,1,0],
+        [1,1,0,1,0], [0,0,0,1,1]]
+nodes = {chr(65+i): (i//5, i%5) for i in range(25)}
+s = input("Enter source node: ").upper()
+d = input("Enter destination node: ").upper()
+
+if s in nodes and d in nodes:
+    path = astar(grid, nodes[s], nodes[d])
+    if path:
+        print("Path found:", " -> ".join(chr(65+x*5+y) for x,y in path))
+    else:
+        print("No path found")
+else:
+    print("Invalid nodes")

sjec_labs-0.1.0/src/sjec_lab/programs/ml/simple/program4.py

@@ -0,0 +1,30 @@
+# Program 4: N-Queens using Backtracking
+
+def solve(n):
+    solutions = []
+
+    def safe(q, col):
+        row = len(q)
+        return all(col != c and abs(col-c) != row-r for r, c in enumerate(q))
+
+    def backtrack(q):
+        if len(q) == n:
+            solutions.append(q)
+            return
+        for col in range(n):
+            if safe(q, col):
+                backtrack(q + [col])
+
+    backtrack([])
+    return solutions
+
+n = int(input("Enter number of queens: "))
+solutions = solve(n)
+
+if solutions:
+    for i, sol in enumerate(solutions, 1):
+        print("\nSolution", i)
+        for col in sol:
+            print(" ".join("Q" if j == col else "." for j in range(n)))
+else:
+    print("No solution found")

sjec_labs-0.1.0/src/sjec_labs.egg-info/PKG-INFO

@@ -0,0 +1,60 @@
+Metadata-Version: 2.4
+Name: sjec-labs
+Version: 0.1.0
+Summary: Exam-friendly Python lab programs for SJEC students
+Author: SJEC Labs contributors
+License-Expression: MIT
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3 :: Only
+Classifier: Operating System :: OS Independent
+Requires-Python: >=3.9
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Provides-Extra: notebook
+Requires-Dist: ipython>=8; extra == "notebook"
+Dynamic: license-file
+
+# sjec-labs
+
+An expandable collection of exam-friendly Python lab programs for ML, CM and DV.
+
+## Install
+
+```bash
+pip install sjec-labs
+```
+
+For syntax-highlighted Jupyter output:
+
+```python
+%pip install "sjec-labs[notebook]"
+```
+
+## Use in Jupyter or Python
+
+```python
+from sjec_lab import LabAssistant
+
+lab = LabAssistant()
+lab.list_subjects()
+lab.list_programs("ML")
+lab.get_code("ML", 1)                         # print and return simplified code
+lab.show_code("ML", 1)                       # formatted display in Jupyter
+lab.get_code("ML", 1, version="original")    # supplied original version
+```
+
+Available initial programs:
+
+1. Simple Chatbot
+2. Water Jug Problem using BFS
+3. A* Search Algorithm
+4. N-Queens using Backtracking
+
+CM and DV folders are reserved for future releases. The package will be expanded as more verified programs are added.
+
+## Notes
+
+- `get_code()` returns the source as a string and prints it by default.
+- Use `print_code=False` if you only want the returned string.
+- The core package has no mandatory third-party dependencies.
+- `show_code()` uses IPython when available.

sjec_labs-0.1.0/src/sjec_labs.egg-info/SOURCES.txt

@@ -0,0 +1,26 @@
+LICENSE
+README.md
+pyproject.toml
+src/sjec_lab/__init__.py
+src/sjec_lab/assistant.py
+src/sjec_lab/core.py
+src/sjec_lab/programs/__init__.py
+src/sjec_lab/programs/cm/__init__.py
+src/sjec_lab/programs/dv/__init__.py
+src/sjec_lab/programs/ml/__init__.py
+src/sjec_lab/programs/ml/original/__init__.py
+src/sjec_lab/programs/ml/original/program1.py
+src/sjec_lab/programs/ml/original/program2.py
+src/sjec_lab/programs/ml/original/program3.py
+src/sjec_lab/programs/ml/original/program4.py
+src/sjec_lab/programs/ml/simple/__init__.py
+src/sjec_lab/programs/ml/simple/program1.py
+src/sjec_lab/programs/ml/simple/program2.py
+src/sjec_lab/programs/ml/simple/program3.py
+src/sjec_lab/programs/ml/simple/program4.py
+src/sjec_labs.egg-info/PKG-INFO
+src/sjec_labs.egg-info/SOURCES.txt
+src/sjec_labs.egg-info/dependency_links.txt
+src/sjec_labs.egg-info/requires.txt
+src/sjec_labs.egg-info/top_level.txt
+tests/test_core.py

sjec_labs-0.1.0/src/sjec_labs.egg-info/dependency_links.txt

@@ -0,0 +1 @@
+

sjec_labs-0.1.0/src/sjec_labs.egg-info/requires.txt

@@ -0,0 +1,3 @@
+
+[notebook]
+ipython>=8

sjec_labs-0.1.0/src/sjec_labs.egg-info/top_level.txt

@@ -0,0 +1 @@
+sjec_lab

sjec_labs-0.1.0/tests/test_core.py

@@ -0,0 +1,12 @@
+from sjec_lab import get_code, list_programs, list_subjects
+
+def test_subjects():
+    assert set(list_subjects()) == {"ML", "CM", "DV"}
+
+def test_ml_programs():
+    assert len(list_programs("ML")) == 4
+    assert "def chatbot" not in get_code("ML", 1, print_code=False)
+    assert "while True" in get_code("ML", 1, print_code=False)
+
+def test_original_available():
+    assert "def chatbot" in get_code("ML", 1, version="original", print_code=False)