Loading repository data…
Loading repository data…
Shogz-Labs / repository
Recitation Slides & Jupyter Notebooks for LE/EECS 1015 (Fall 2025, Section D). Please note that the repository is actively being maintained by the TA.
A transparent discovery signal based on current public GitHub metadata.
This score does not audit code, security, maintainers, documentation quality, or suitability. Verify the repository and its current documentation before adoption.
Welcome to LE/EECS 1015 (Section D, Fall 2025)!
My name is Shogo and I will be your teaching assistant. I look forward to working and learning with you over the next four months 😊.
The goal of this course shell is to share and disseminate supplementary materials (recitations) that re-inforce important course learning objectives. Furthermore, as the course progresses, commonly asked questions and hints about labs will be released here!
This course is an introduction to the concepts and tools of computer science as students learn a procedural subset of the Python programming language. Python has a variety of libraries in different domains allowing for the solution of interesting problems which has made it a popular language in industry and the academy. Students do hands-on work to design, write, debug and test computer programs that solve problems computationally. Students study variables, assignments, expressions (arithmetic, relational and logical) and sequencing of statements to implement solutions for computational problems, in Python. They document programs with comments and preconditions. They analyze the type correctness of programs via a type checker. They use an Integrated Development Environment (IDE) to develop, unit-test and debug programs given a problem specification. They apply conditionals (including nested conditionals) to implement algorithms to solve computational problems. They code functions to develop modular programming solutions for computational problems. They apply Python loops (including nested loops) to implement algorithms to solve computational problems. They apply data structures, including tuples, sets, lists and dictionaries, to implement algorithms to solve computational problems. They code simple recursive functions to implement algorithms to solve computational problems.
Prerequisites: One of (1)-(3) below must be met: (1) (New high school curriculum): One 4U Math course with a grade of at least 75%. (2) Completion of six credits from York University MATH courses (not including courses with second digit 5) with a GPA of 5.00 or better over these credits; (3) Completion of six credits from York University mathematics courses whose second digit is 5, with an average grade not below 7.00 (B+).
| Deliverable | Total Weight |
|---|---|
| Weekly Pre-Class Activities | 0% (Optional) |
| Weekly Puzzles | 0% (Optional) |
| Weekly Online Quizzes | 8% (Best 8/11 are considered) |
| Labs | 32% (Best 8/10 are considered) |
| Midterm | 25% (Up to Week 7 Material) |
| Final Exam | 35% (Cumulative) |
The Instructor Assistant should be your primary point of contact for all logistical matters related to the course such as missed tests. We ask that you use your York e-mail account (my.yorku.ca) when communicating with the teaching team.
Lab questions should be addressed during the in-person session or TA Office Hours.
If you have missed more than 3 quizzes or 2 labs, you will be required to fill out the Accommodation Request Form (Contact Policy > Who to Contact).