python-lab-toolkit 1.0.0__py3-none-any.whl

pylab/templates/q52/apriori_groceries.py

@@ -0,0 +1,88 @@
+import os
+import sys
+
+def run_apriori():
+    try:
+        import pandas as pd
+        from mlxtend.preprocessing import TransactionEncoder
+        from mlxtend.frequent_patterns import apriori, association_rules
+    except ImportError:
+        print("Error: pandas and mlxtend are required for Q52.")
+        print("Install with: pip install pandas mlxtend")
+        return
+
+    csv_path = "groceries.csv"
+    if not os.path.exists(csv_path):
+        print(f"Error: {csv_path} not found.")
+        return
+
+    print("=== Groceries Market Basket Apriori Association Rules ===")
+    os.makedirs("results", exist_ok=True)
+
+    transactions = []
+    with open(csv_path, "r", encoding="utf-8") as f:
+        for line in f:
+            line_str = line.strip()
+            if line_str:
+                items = [item.strip() for item in line_str.split(",") if item.strip()]
+                if items:
+                    transactions.append(items)
+
+    print(f"1. Total Market Basket Transactions Loaded: {len(transactions)}")
+
+    all_items = [item for txn in transactions for item in txn]
+    item_series = pd.Series(all_items)
+    print("\n2. Top 10 Most Frequent Individual Items:")
+    top_items = item_series.value_counts().head(10)
+    for it, cnt in top_items.items():
+        support = cnt / len(transactions)
+        print(f"  {it:<22} : {cnt} times (Support: {support:.3f})")
+
+    te = TransactionEncoder()
+    te_ary = te.fit(transactions).transform(transactions)
+    df_encoded = pd.DataFrame(te_ary, columns=te.columns_)
+
+    min_support = 0.02
+    print(f"\n3. Generating Frequent Itemsets with min_support >= {min_support}...")
+    frequent_itemsets = apriori(df_encoded, min_support=min_support, use_colnames=True)
+    frequent_itemsets["length"] = frequent_itemsets["itemsets"].apply(lambda s: len(s))
+    print(f"   Found {len(frequent_itemsets)} frequent itemsets.")
+
+    if frequent_itemsets.empty:
+        print("No itemsets met the support threshold. Adjust min_support.")
+        return
+
+    min_threshold = 0.10
+    print(f"\n4. Generating Association Rules (metric='confidence', min_threshold={min_threshold})...")
+    rules = association_rules(frequent_itemsets, metric="confidence", min_threshold=min_threshold)
+    print(f"   Generated {len(rules)} total association rules.")
+
+    if rules.empty:
+        print("No association rules found meeting the threshold criteria.")
+        return
+
+    rules_sorted_lift = rules.sort_values(by="lift", ascending=False)
+    print("\n5. Top 5 Rules Ranked by Lift:")
+    print(f"{'Antecedents':<28} -> {'Consequents':<24} | {'Support':<8} | {'Conf':<8} | {'Lift':<8}")
+    print("-" * 84)
+
+    for _, row in rules_sorted_lift.head(5).iterrows():
+        ant = ", ".join(list(row["antecedents"]))
+        con = ", ".join(list(row["consequents"]))
+        sup = row["support"]
+        cnf = row["confidence"]
+        lft = row["lift"]
+        print(f"{ant:<28} -> {con:<24} | {sup:<8.4f} | {cnf:<8.4f} | {lft:<8.4f}")
+
+    rules_out = os.path.join("results", "groceries_association_rules.csv")
+    rules_export = rules.copy()
+    rules_export["antecedents"] = rules_export["antecedents"].apply(lambda s: ", ".join(list(s)))
+    rules_export["consequents"] = rules_export["consequents"].apply(lambda s: ", ".join(list(s)))
+    rules_export.to_csv(rules_out, index=False)
+    print(f"\nComplete association rules exported to: {rules_out}")
+
+def main():
+    run_apriori()
+
+if __name__ == "__main__":
+    main()

pylab/templates/q6/calculator.py

@@ -0,0 +1,67 @@
+import sys
+
+def add(a, b):
+    return a + b
+
+def subtract(a, b):
+    return a - b
+
+def multiply(a, b):
+    return a * b
+
+def divide(a, b):
+    if b == 0:
+        raise ZeroDivisionError("Division by zero is not permitted.")
+    return a / b
+
+def floor_divide(a, b):
+    if b == 0:
+        raise ZeroDivisionError("Floor division by zero is not permitted.")
+    return a // b
+
+def modulus(a, b):
+    if b == 0:
+        raise ZeroDivisionError("Modulo by zero is not permitted.")
+    return a % b
+
+def power(a, b):
+    return a ** b
+
+def calculate(op, a, b):
+    operations = {
+        "+": add,
+        "-": subtract,
+        "*": multiply,
+        "/": divide,
+        "//": floor_divide,
+        "%": modulus,
+        "**": power,
+    }
+    if op not in operations:
+        raise ValueError(f"Unsupported operator '{op}'. Supported: +, -, *, /, //, %, **")
+    return operations[op](a, b)
+
+def main():
+    print("=== Simple Arithmetic Calculator ===")
+    demo_ops = [
+        (15, "+", 7),
+        (25, "-", 9),
+        (8, "*", 6),
+        (100, "/", 8),
+        (100, "//", 8),
+        (17, "%", 5),
+        (2, "**", 8),
+    ]
+    print("Demonstration Computations:")
+    for a, op, b in demo_ops:
+        res = calculate(op, a, b)
+        print(f"  {a} {op} {b} = {res}")
+    
+    if len(sys.argv) == 4:
+        first = float(sys.argv[1])
+        oper = sys.argv[2]
+        second = float(sys.argv[3])
+        print(f"\nCLI Execution: {first} {oper} {second} = {calculate(oper, first, second)}")
+
+if __name__ == "__main__":
+    main()

pylab/templates/q7/session_attendees.py

@@ -0,0 +1,37 @@
+import sys
+
+def analyze_attendees(ai_session, cyber_session):
+    all_attendees = ai_session.union(cyber_session)
+    both_sessions = ai_session.intersection(cyber_session)
+    ai_only = ai_session.difference(cyber_session)
+    cyber_only = cyber_session.difference(ai_session)
+    return {
+        "all_attendees": sorted(all_attendees),
+        "both_sessions": sorted(both_sessions),
+        "ai_only": sorted(ai_only),
+        "cyber_only": sorted(cyber_only),
+    }
+
+def display_results(results):
+    print("=== Conference Session Attendee Analysis ===")
+    print(f"Total Unique Attendees ({len(results['all_attendees'])}):")
+    print(f"  {', '.join(results['all_attendees'])}")
+    print(f"\nAttendees in Both Sessions ({len(results['both_sessions'])}):")
+    print(f"  {', '.join(results['both_sessions']) if results['both_sessions'] else 'None'}")
+    print(f"\nAI-Only Attendees ({len(results['ai_only'])}):")
+    print(f"  {', '.join(results['ai_only']) if results['ai_only'] else 'None'}")
+    print(f"\nCybersecurity-Only Attendees ({len(results['cyber_only'])}):")
+    print(f"  {', '.join(results['cyber_only']) if results['cyber_only'] else 'None'}")
+
+def main():
+    ai_attendees = {"Alice", "Bob", "Charlie", "David", "Emma", "Frank"}
+    cyber_attendees = {"Charlie", "David", "Grace", "Heidi", "Ivan", "Frank"}
+    
+    print(f"AI Session List: {sorted(ai_attendees)}")
+    print(f"Cybersecurity Session List: {sorted(cyber_attendees)}\n")
+    
+    analysis = analyze_attendees(ai_attendees, cyber_attendees)
+    display_results(analysis)
+
+if __name__ == "__main__":
+    main()

pylab/templates/q8/number_properties.py

@@ -0,0 +1,68 @@
+import sys
+
+def is_even(n):
+    return n % 2 == 0
+
+def is_palindrome(n):
+    s = str(abs(n))
+    return s == s[::-1]
+
+def is_armstrong(n):
+    if n < 0:
+        return False
+    digits = [int(d) for d in str(n)]
+    power = len(digits)
+    return sum(d ** power for d in digits) == n
+
+def is_prime(n):
+    if n <= 1:
+        return False
+    if n <= 3:
+        return True
+    if n % 2 == 0 or n % 3 == 0:
+        return False
+    i = 5
+    while i * i <= n:
+        if n % i == 0 or n % (i + 2) == 0:
+            return False
+        i += 6
+    return True
+
+def is_perfect(n):
+    if n <= 1:
+        return False
+    divisors_sum = 1
+    for i in range(2, int(n ** 0.5) + 1):
+        if n % i == 0:
+            divisors_sum += i
+            pair = n // i
+            if pair != i:
+                divisors_sum += pair
+    return divisors_sum == n
+
+def check_all_properties(n):
+    return {
+        "number": n,
+        "even": is_even(n),
+        "palindrome": is_palindrome(n),
+        "armstrong": is_armstrong(n),
+        "prime": is_prime(n),
+        "perfect": is_perfect(n),
+    }
+
+def main():
+    print("=== Number Properties Suite ===")
+    test_numbers = [6, 7, 28, 121, 153, 370, 496, 13, 20]
+    for num in test_numbers:
+        props = check_all_properties(num)
+        desc = []
+        if props["even"]: desc.append("Even")
+        else: desc.append("Odd")
+        if props["prime"]: desc.append("Prime")
+        if props["palindrome"]: desc.append("Palindrome")
+        if props["armstrong"]: desc.append("Armstrong")
+        if props["perfect"]: desc.append("Perfect")
+        print(f"Number {num:<4} -> {', '.join(desc)}")
+
+if __name__ == "__main__":
+    main()

pylab/templates/q9/greet_people.py

@@ -0,0 +1,26 @@
+import sys
+
+def greet_people(*names):
+    if not names:
+        return "Hello, Guest! Welcome!"
+    elif len(names) == 1:
+        return f"Hello, {names[0]}! Welcome to Python Lab!"
+    elif len(names) == 2:
+        return f"Hello, {names[0]} and {names[1]}! Welcome to Python Lab!"
+    else:
+        joined_names = ", ".join(names[:-1]) + f", and {names[-1]}"
+        return f"Hello, {joined_names}! Welcome to Python Lab!"
+
+def main():
+    print("=== Variable-Argument Greeting Function ===")
+    print("Zero arguments:")
+    print("  " + greet_people())
+    print("\nSingle argument:")
+    print("  " + greet_people("Alice"))
+    print("\nTwo arguments:")
+    print("  " + greet_people("Alice", "Bob"))
+    print("\nMultiple arguments:")
+    print("  " + greet_people("Alice", "Bob", "Charlie", "Diana", "Evan"))
+
+if __name__ == "__main__":
+    main()

python_lab_toolkit-1.0.0.dist-info/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Python Lab Toolkit Developers
+
+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.