Note:
This repository is an unofficial Python repo for NIELIT Imphal MCA 1st Semester 2025.
It is student-maintained and not endorsed by the institute.
───────────────────────────────────────────────────────────────────────────────
- 🎯 Clean & modular Python scripts
- 📚 Coverage of operators, algorithms, recursion, OOP, pattern printing, regex
- 🧠 Strong focus on conceptual clarity + practical demonstration
- 🗂️ Well-organized directory structure
- ✔️ Beginner-friendly but academically rigorous
──────────────────────────────────────────────
| Category | Highlights |
|---|---|
| 🔢 Operators | Precedence, associativity, bitwise operations |
| 🔐 Logic & Control Flow | Short-circuit logic, grading system |
| 📊 Statistics | Mean, median, mode, variance, SD |
| 🏛️ Classics | Roman numerals, Fibonacci, Collatz |
| 🧮 Algorithms | Sorting check, primality test, twin primes |
| 🗼 Recursion | Towers of Hanoi, recursive Fibonacci |
| 🔤 String Tasks | Palindrome, vowel count, regex email validation |
| 🕒 Time & Date | Countdown timer, clock angles, Doomsday algorithm |
| 👥 OOP | Person–Student classes, roll generator, CSV export |
This repository contains solutions to 29 Python programming exercises covering operators, data handling, algorithms, recursion, OOP, file processing, regex, date–time operations, and pattern generation.
Each task is implemented in a clean, modular way for easy evaluation.
Tests how Python evaluates arithmetic expressions using precedence rules and left/right associativity.
Demonstrates bitwise operations (& | ^ ~ << >>) and verifies results using the bin() function for clarity.
Tests simple comparisons and chained comparisons such as a < b < c.
Uses functions as operands to show how Python avoids unnecessary evaluations.
Converts KB, MB, GB, TB into KiB, MiB, GiB, TiB using 1024-based conversions.
Prints grade for a student based on numerical score.
Computes mean, median, mode, variance, and standard deviation for a list of scores.
Uses additive/subtractive rules of I, V, X, L, C, D, M to print values in Roman numeral format.
Generates patterns using repetition like "*" * n to avoid nested loops.
Prints pyramids, diamonds, and general patterns using nested loops.
Compares characters from both ends without using string slicing or reverse functions.
Demonstrates positional, default, and keyword arguments.
Validates whether an indexed collection is sorted in ascending or descending order.
Implements prime checking and prints the first n twin-prime pairs.
Generates the Collatz (3n + 1) sequence until reaching 1.
Generates Fibonacci numbers using both iterative loops and classical recursion.
Prints the optimal sequence of moves for the puzzle for any number of disks.
Finds all possible combinations to make a payment amount from limited coin denominations.
Checks whether a letter is a vowel by:
- Method 1:
if-elif-else - Method 2: using
inlookup
Counts vowels using a lookup table for faster, cleaner checks.
Uses a regular expression to confirm whether a string is a valid email ID.
Checks if two emails are effectively the same regardless of:
- Case differences
- Dot placement in the username part
Displays a live countdown timer using carriage return \r for dynamic output.
Uses the system time to calculate angles of:
- Hour hand
- Minute hand
- Second hand
Finds the weekday for any given Gregorian calendar date.
Implements:
- Unary
+ - Unary
- +-*==
Includes dimension validation and clean matrix representation.
Defines Person in one module and extends it with Student in another module.
Generates roll numbers incrementally using a static class counter in the Student class constructor.
Populates a list of Student objects and writes their attributes into a CSV file.
- This is an unofficial NIELIT Imphal MCA 1st Semester 2025 Python repository.
- Each script is self-contained and ready for evaluation.
- Outputs are formatted clearly for checking.
- Code follows modular and readable practices.