Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
19 views12 pages

CourseContentsSchedule Annexure I

The document outlines the syllabus for the course 'Algorithm Design, AI and Programming with Python' (COMP 110) for Fall 2024, detailing course structure, instructor contact information, class schedules, prerequisites, course objectives, and evaluation methods. It emphasizes the importance of attendance, participation, and academic honesty, while also providing resources for course materials and software requirements. The course aims to develop programming skills using Python, focusing on algorithm design and implementation.

Uploaded by

tayyabaslp21
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
19 views12 pages

CourseContentsSchedule Annexure I

The document outlines the syllabus for the course 'Algorithm Design, AI and Programming with Python' (COMP 110) for Fall 2024, detailing course structure, instructor contact information, class schedules, prerequisites, course objectives, and evaluation methods. It emphasizes the importance of attendance, participation, and academic honesty, while also providing resources for course materials and software requirements. The course aims to develop programming skills using Python, focusing on algorithm design and implementation.

Uploaded by

tayyabaslp21
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 12

ANNEXURE-I

Algorithm Design, AI and Programming with Python


Course Code COMP 110
Semester Fall 2024
Cr. Hrs. 3
Section (s) CSIT-A, CSIT-B, CSIT-C, CSIT-D, CSIT-E, CSIT-F

Instructor Contact Information


Instructor Mr/Miss: Dr. XYZ
Email xxxx
Cell No. xxxx
Zoom ID xxxx
Office Room No 302- 2nd Floor EE Building
i) Teacher will be available during the office hours for student consultation as per following schedule:
Mon: 6:00-7:00 PM
Student
Tue & Wed: 2:30-3:30 PM,
Consultation
Thursday: 10:00 am to 12:30 pm
Hours
ii) Moreover student can take online appointment with the teacher via Zoom for consultation.

Class Details (subject to change)


Class Class
Section Class Title Days & Times Class Dates
Type Room Location
Mon, Tue, Wed Sep 23, 2024 -
Section CSIT-A Lecture Programming/Python 502-2nd Floor-EE Building
02:00PM-02:50 PM Jan 10, 2025
Thrs, Fri, Sat, Sep 23, 2024 -
Section CSIT-B Lecture Programming/Python 503-2nd Floor-EE Building
02:00PM-02:50 PM Jan 10, 2025
Thrs, Fri, Sat, Sep 23, 2024 -
Section CSIT-C Lecture Programming/Python 504-2nd Floor-EE Building
10:00PM-10:50 PM Jan 10, 2025
Mon, Tue, Wed Sep 23, 2024 -
Section CSIT-D Lecture Programming/Python 503-2nd Floor-EE Building
08:00PM-08:50 AM Jan 10, 2025
Mon, Tue, Wed Sep 23, 2024 -
Section CSIT-E Lecture Programming/Python 500-2nd Floor-EE Building
10:00PM-10:50 AM Jan 10, 2025
Thrs, Fri, Sat, Sep 23, 2024 -
Section CSIT-F Lecture Programming/Python 507-2nd Floor-EE Building
02:00PM-02:50 PM Jan 10, 2025

i) Please use email rather than telephone voice mail for messages.
ii) Please keep emails short and focused, and use a clear subject line beginning with "COMP 110
Question".
Communication
iii) Instructor will generally respond within 24 hours (during the academic days).
with Instructor
iv) Always include your name, course, and UOL email address in your messages to instructor.
If you send an email from some address other than uol email address like [email protected];
instructor would not be able to recognize that you are a student of University.
PreRequisites (Note: Instructor should define it in coordination with HOD/Faculty Committee)

Prerequisites: Grade of "C" or better in MATH 202, 203, 204, 250A or 355A.
Corequisite COMP 110L. Introduction to algorithms, their representation, design, structuring, analysis, and optimization.
Implementation of algorithms as structured programs in a high-level language. Lab: 3 hours per week.

Medium of Instruction

Instructor will deliver class lectures, conduct discussions and engage in all academic activities exclusively in
Medium of
English. Moreover, the students are required to use English as mode of communication for class room
Instruction
discussions, group discussions, vivas/presentations, group projects etc.

Course Material Availability on SLATE/LMS:


I will use LMS/Slate to keep in touch with my classes. In-class discussion problems, homework solutions
and supplemental materials, and scores for exams, attendance, and assignments will be posted to LMS/SAP.
You should be certain that you are able to log in to LMS/SAP, and that you check the class page on LMS
SLATE/LMS and your University email account regularly.

Course material is available on LMS: https://slate.uol.edu.pk/login/index.php


Grades will be posted on LMS/SAP: https://slate.uol.edu.pk/login/index.php

Required Text

Text Book 1 “Introduction To Python”, By Y. Dianiel Liang, 12th Edition, Wiley,2024, ISBN-13: 9781337384285
“Python for Programmers with AI and Data Structures ”, By Compton Peterson, 10th Edition, McGraw Hill,
Text Book 2
2022, ISBN-13: 9781337384285
Other
XXXX
Material

Software/ Other Tools/Resources


You must install the Phthon Development Kit (IDK) and an editor to write programs for the class.
You can use whatever editor you prefer. If you don't have a preference, then I suggest jGRASP. It is
Python essential that you install the IDK first, then the jGRASP editor.
Development
Kit For the IDK, go to:
http://www.oracle.com/technetwork/phthon/downloads/index.html

Download the Java SE (Standard Edition) JDK, version 8 or higher. Install JDK first before proceeding to
download and install jGRASP.

For jGRASP, go to:


Python Editor http://www.jgrasp.org

Click on the Downloads link and download the installation for your platform (Windows, macOS, or
Linux/Unix).
This software is available in JD1104 and in the open computer science labs.
i) XXXX: http://www.jgrasp.org
Other ii) YYYY: http://www.jgrasp.org
Tools/Software iii) ZZZZ: http://www.jgrasp.org
s
Goals: (Note: Instructor should define it in coordination with HOD/Faculty Committee)

Sr.
Goals
No
It is a programming course designed for students concentrating in Computer Science and related majors and is primarily
1
focused to quickly develop real programming skills.
The course teaches a basic skills in analyzing problems and solving them by finding or creating an appropriate
2
algorithm.
Once an algorithm has been identified, it is translated into an executable application using the Python programming
3
language
4 Python language details will be presented as an essential part of both lecture and lab
5 The lecture component (COMP 110) focuses on concepts and practical examples.
The lab (COMP 110/L) focuses on developing working and correct applications using Python and problem-solving
6
techniques covered in the lecture
7 xxxxx

Course Objectives: (Note: Instructor should define it in coordination with HOD/Faculty Committee)

Sr.
Objectives
No
1 Demonstrate the knowledge of a computer and operating system—the editing and compilation process.
2 Translate human-readable algorithms represented by pseudocode, flowchart, or flow block diagram to Python.
3 Write and test Python programs using the 4 fundamentals of programming: sequence, choice, loop, and methods.
4 Construct programs that require several methods and good knowledge of passing parameters
5 Demonstrate the knowledge of basic steps of software development: problem statement, program development, testing,
and documentation.
6 Solve problems with one- and two-dimensional arrays.
7 Use basic sorting and searching methods.
8 Apply the class String.
9 Read and write text files. Demonstrate practical using of Exception Handling.
10 Recognize the role of Object-Oriented Programming in software development.
11 Run the examples and exercises studied in the course.
12 Understand the ideas of Polymorphism and Inheritance.
COURSE REQUIREMENTS (Subject to Change)
(Note: Instructor should define it in coordination with HOD/Faculty Committee)

A. Class Attendance:
You are expected to attend class and participate by asking questions, answering questions and contributing to topical
discussions. You are expected to arrive prior to the beginning of class. Class members will be randomly selected to answer
questions and/or help with the solution of exercises.
If you do miss a class, it is your responsibility to ensure that you understand the material covered and the announcements made
in the class you missed. You may not use office hours to have the professor explain the material if you missed the class when it
was discussed.
B. Class Participation:
The following factors will be considered in evaluating class participation:
(1) Attend class sessions and contribute to a positive learning environment,
(2) Ask thoughtful questions,
(3) Participate in discussion,
(4) Prepare for reading and assignments conscientiously.

A positive learning environment results when you demonstrate respect for other students and the instructor, are courteous and
attentive, assist others in learning, attend class regularly, and arrive in class on time.

C. Homework/Assignment:
Doing the homework is essential for success in this course. Throughout the semester, at least 4 Homework/Assignments (5
marks/points each) , 2 before Mid-Term and 2 after Mid-Term will be given.
Homework/Assignment assigned will be discussed in class when time permits; but you may not understand it completely unless
you have already attempted the work. Programming is a discipline that cannot be learned merely by watching; it is learned only
by doing. By attempting each homework problem prior to the class discussion, you can maximize your learning experience and
will be in a position to ask appropriate questions and identify areas where you need help. Accordingly, homework should be
done as instructed before coming to each class.
Incomplete work (or cheating on an assignment) cannot be accepted. Late homework cannot be accepted (as the solution
will be posted right after the collection of the assigned homework).
D. Quizzes
Throughout the semester, at least 4 quizzes (5 marks/points each), 2 before Mid-Term and 2 after Mid-Term will be given in
class on material covered in the previous week(s) to ensure that you are keeping current. There are no make-up quizzes. If you
are not in class on the day of a quiz, you will receive a zero.
E. Exams:
There will be two (2) exams for the semester. All exams are “closed book.” Students will not be given any extended time if
arriving late on that day.

Exams will be a combination of objective questions (e.g., multiple choices, short answer) and numerical problems. To receive
credit for numerical answers, adequate supporting computations (and also explanations if necessary) must be provided.
No makeup exam will be given and the exam will not be administered on any other day!
EVALUATION & GRADING :
(Note: Teacher should modify it as per University/Department Policy in Consultation with HOD/Faculty Committee)

The course grades will be determined by the following:

Components Marks Weight


Mid-Term 100 25%
Lab 100 20 %
Final-Exam 100 30 %
Quizzes (4*5 points) 20 10%
Home Work/Assignment (4*5 points) 20 10%
Attendance 10 5%
Total 100%

Your Responsibilities

Sr.
No Major Responsibilities
.
1 Arrive on time and do not leave before the end of the class period.
Refrain from causing other distractions (ringing cell phones, talking while others have the floor, etc.). Disruptive
2
students will be asked to leave the class
3 Treat everyone with respect
Be responsible for all assigned materials plus everything covered in class. If you missed classes, make arrangements
4
with another student to collect handouts and to update you on classes you missed
5 xxxx

ACADEMIC HONESTY STATEMENT

Academic dishonesty, which includes cheating, fabrication, facilitation of academic dishonesty, and plagiarism, is a serious
academic offense. A grade of "F" shall be assigned to any student who engages in academic dishonesty in this class, and formal
disciplinary action shall be taken. (Plagiarism in any assignment or cheating in the examinations will result in a grade of F in the
entire course).

THIS SYLLABUS CONSTITUTES A CONTRACT BETWEEN THE STUDENT AND THE FACULTY OF IT (FIT). THE TERMS
AND CONDITIONS CONTAINED IN THIS CONTRACT ARE DEEMED TO BE ACCEPTED BY EACH STUDENT WHO
REMAINS IN THIS COURSE AFTER THE OFFICIAL DROP DATE.
Home Work/Assignment and Quiz Details (subject to change)

Home Work (HW)/Assignment Quiz

Submission of Solution
Homework/ HW/Assignment Solution Posting of Result Result
Week Quiz Week Quiz by Posting of Quiz
Assignment Submission by HW/Assignment By Submission Submission
No (on LMS) No Student on by Teacher on
(on LMS) Student on LMS Teacher on LMS Date date
LMS LMS
Home Work 1 Quiz 1 Week Within the Immediately Within
Within the Time Immediately after the
Week Within 3-4 Time Line after the quiz 7days
Line Assigned by assignment
2-3 7days Assigned by submission dead
Teacher submission dead line
Teacher line
Home Work 2 Week Within Quiz 2 Week Within
Same as Above Same as Above Same as Above Same as Above
5-6 7days 6-7 7days
Home Work 3 Week Within Quiz 3 Week Within
Same as Above Same as Above Same as Above Same as Above
10-11 7days 11-12 7days
Home Work 4 Week Within Quiz 4 Week Within
Same as Above Same as Above Same as Above Same as Above
12-13 7days 13-14 7days
Reading
Every Week
Assignments

Note : This is the minimum number of Home Work/Assignments and Quizzes . The Instructor should encourage to add more Home Work/Assignments and Quizzes.

Submitting Work:
1. Most assignments will be submitted electronically via Slate/LMS.
2. Please do not email submissions until and unless necessary due some justified reason.

Course Contents and Tentative Class Schedule Table-I (subject to change)

Exam/Quiz/Assignment
Week Chapter
No Dates Topics Book Name Time Line
No Category for Result
Submission
Introduction to Object Oriented “Introduction To
Programming , Machine Languages, Python”, By Y.
1 NA NA
Assembly Languages and High-Level Dianiel Liang, 12th
Languages Edition.
Python Libraries, Python Standard Library,
Same as Above 1 NA NA
Python Data Science Library
Test-Drives: Using IPython and Jupyter
Same as Above 1,2 NA NA
Notebooks
“Python for
Programmers with
16-09-2024 Others Object Oriented Programming AI and Data
1,2 NA NA
1 17-09-2024 Languages Structures ”, By
18-09-2024 Compton Peterson,
10th Edition
Software Technologies Same as Above 1,2,3 NA NA
Intro to Data Science: Artificial Intelligence—
Same as Above 1,2,3 NA NA
at the Intersection of CS and Data Science
Variables and Assignment Statements,
Same as Above
Arithmetic

2 23-09-2024 “Python for


24-09-2024 Programmers with
25-09-2024 Function print and an Intro to Single- and AI and Data
1 NA NA
Double-Quoted Strings, Triple-Quoted Strings Structures ”, By
Compton Peterson,
10th Edition
Getting Input from the User Same as Above 1 NA NA
Decision Making: The if Statement and Python for 5,7 NA NA
Exam/Quiz/Assignment
Week Chapter
Dates Topics Book Name
No Comparison Operators, Objects and Dynamic No
Programmers
Typing
Home Work/
Intro to Data Science: Basic Descriptive Within 7
Same as Above 1,2 Assignment 1
Days
Statistics (Week 2/Week3)
Algorithms, Pseudocode, Control statement Same as Above 2 NA NA

“Introduction To
if Statement, if…else and if…elif…else Python”, By
3 NA NA
Statements, while Statement Y.Dianiel Liang,
12th Edition.
for Statement, Iterables, Lists and Iterators,
Built-In range Function, Augmented Quiz 1 Within 7
Same as Above 2,3 (Week 3/Week4) Days
Assignments, Program Development:
Sequence-Controlled Repetition
Program Development: Sentinel-Controlled
30-09-2024 Repetition, Program Development: Nested Same as Above 3 NA NA
3 01-10-2024 Control Statements
02-10-2024 Built-In Function range: A Deeper Look,
Same as Above 3 NA NA
Using Type Decimal for Monetary Amounts
break and continue Statements Same as Above 3 NA NA
Boolean Operators and, or and not Same as Above 3 NA NA
Intro to Data Science: Measures of Central
Tendency— Mean, Median and Mode

“Python for
Programmers with
Introduction to Functions, Defining Functions, AI and Data
3,4 NA NA
Functions with Multiple Parameters Structures ”, By
Compton Peterson,
10th Edition
Random-Number Generation, Python
Same as Above 4 NA NA
Standard Library, math Module Functions
Using IPython Tab Completion for Discovery,
Default Parameter Values, Keyword Same as Above 4
07-10-2024 Arguments, Arbitrary Argument Lists
4 08-10-2024 Methods: Functions That Belong to Objects,
09-10-2024 Scope Rules, import: A Deeper Look, Passing Same as Above 4 NA NA
Arguments to Functions: A Deeper Look
Function-Call Stack ,Functional-Style
Programming, Intro to Data Science: Same as Above 4,5 NA NA
Measures of Dispersion

5 14-10-2024 Sequences : Lists & Tuples, “Python for 4,5 NA NA


15-10-2024 Programmers with
16-10-2024 AI and Data
Structures ”, By
Compton Peterson,
10th Edition
Week
Dates Topics Book Name Chapter
No Exam/Quiz/Assignment
No
Unpacking Sequences, Sequence Slicing, del
Same as Above 5 NA NA
Statement
Passing Lists to Functions, Sorting Lists,
Same as Above 5 NA NA
Searching Sequences, Other List Methods
Simulating Stacks with Lists, List Home Work/
Within 7
Comprehensions, Generator Expressions, Same as Above 5 Assignment 2
Days
Filter, Map and Reduce (Week 5/Week6)
“Introduction To
Other Sequence Processing Functions, Two-
Python”, By
Dimensional Lists, Intro to Data Science: 5 NA NA
Y.Dianiel Liang,
Simulation and Static Visualizations
12th Edition.
Sample Graphs for 600, 60,000 and 6,000,000
Die Rolls, Visualizing Die-Roll Frequencies Same as Above 5 NA NA
and Percentages

“Python for
Programmers with
Creating a Dictionary, Iterating through a AI and Data
5,6 NA NA
Dictionary, Basic Dictionary Operations Structures ”, By
Compton Peterson,
10th Edition
Dictionary Methods keys and values,
Dictionary Comparisons, Example: Dictionary Same as Above 6 NA NA
of Student Grades
Example: Word Counts, Dictionary Method Quiz 2 Within 7
Same as Above 6 (Week 6/Week7) Days
update, Dictionary Comprehensions Sets
21-10-2024 “Introduction To
Comparing Sets, Mathematical Set
6 22-10-2024 Python”, By
Operations, Mutable Set Operators and 6 NA NA
23-10-2024 Y.Dianiel Liang,
Methods, Set Comprehensions
12th Edition.
Intro to Data Science: Dynamic
Visualizations, How Dynamic Visualization
Same as Above 6 NA NA
Works, Implementing a Dynamic
Visualization

7 28-10-2024 Array-Oriented Programming with NumPy, “Python for


29-10-2024 Creating arrays from Existing Data, array Programmers with
30-10-2024 Attributes, Filling arrays with Specific Values, AI and Data
6,7 NA NA
Structures ”, By
Compton Peterson,
10th Edition
Creating arrays from Ranges, List vs. array
Same as Above 7 NA NA
Performance: Introducing %timeit
array Operators 296 7.8 NumPy Calculation
Same as Above 7 NA NA
Methods, Universal Functions
Indexing and Slicing, Views: Shallow Copies, “Introduction To
Deep Copies Python”, By
7 NA NA
Y.Dianiel Liang,
12th Edition.
Reshaping and Transposing, Intro to Data Same as Above 7 NA NA
Science: pandas Series and DataFrames,
pandas Series, DataFrames
Week
Dates Topics Book Name Chapter
No Exam/Quiz/Assignment
No

Strings: A Deeper Look, Formatting Strings, “Python for


Presentation Types, Field Widths and Programmers with
Alignment, Numeric Formatting, String’s AI and Data
8 NA NA
format Method Structures ”, By
Compton Peterson,
10th Edition
Concatenating and Repeating Strings,
Stripping Whitespace from Strings, Changing
Same as Above 7,8 NA NA
Character Case, Comparison Operators for
Strings
Searching for Substrings, Replacing
Substrings, Splitting and Joining Strings, Same as Above 8 NA NA
04-11-2024 Characters and Character-Testing Methods
8 05-11-2024 Raw Strings, Introduction to Regular
06-11-2024 Expressions, re Module and Function “Introduction To
fullmatch, Replacing Substrings and Splitting Python”, By
8 NA NA
Strings, Other Search Functions; Accessing Y.Dianiel Liang,
Matches ,Intro to Data Science: Pandas, 12th Edition.
Regular Expressions and 8Data Munging

11-11-2024
Within
9 To Mid Term Exam Week Midterm
16-11-2024 5 Days
10 18-11-2024 Files and Exceptions, Introduction, Files, “Python for
19-11-2024 Text-File Processing, Writing to a Text File: Programmers with
20-11-2024 Introducing the with Statement, Reading Data AI and Data
9 NA NA
from a Text File Structures ”, By
Compton Peterson,
10th Edition
Updating Text Files, Serialization with JSON,
Focus on Security: pickle Serialization and Home Work/
Within 7
Same as Above 9 Assignment 3
Days
Deserialization, Additional Notes Regarding (Week10/Week11)
Files
Handling Exceptions, Division by Zero and
Invalid Input, try Statements, Catching
Multiple Exceptions in One except Clause,
Same as Above 9 NA NA
What Exceptions Does a Function or Method
Raise? What Code Should Be Placed in a try
Suite?
finally Clause, Explicitly Raising an “Introduction To
Exception, (Optional) Stack Unwinding and Python”, By
9 NA NA
Tracebacks Y.Dianiel Liang,
12th Edition.
Week
Dates Topics Book Name Chapter
No Exam/Quiz/Assignment
No

Custom Class Account, Test-Driving Class “Python for


Account, Account Class Definition, Programmers with
Composition: Object References as Members AI and Data
9,10 NA NA
of Classes, Controlling Access to Attributes, Structures ”, By
Properties for Data Access Compton Peterson,
10th Edition
Test-Driving Class Time, Class Time
Definition, Class Time Definition Design Same as Above 10 NA NA
Notes
Simulating “Private” Attributes, Inheritance:
Base Classes and Subclasses, Building an
Inheritance Hierarchy; Introducing
Polymorphism, Base Class Commission
Quiz 3
Employee, Subclass Salaried Commission Within 7
Same as Above 10 (Week 11/
25-11-2024 Employee, Processing Commission Week12)
Days
11 26-11-2024 Employees and Salaried Commission
27-11-2024 Employees Polymorphically, A Note About
Object-Based and Object-Oriented
Programming
Duck Typing and Polymorphism, Operator “Introduction To
Overloading, Exception Class Hierarchy and Python”, By
10 NA NA
Custom Exceptions Y.Dianiel Liang,
12th Edition.

Recursion, Searching, Sorting and Big O, “Python for


Programmers with
AI and Data
10,11 NA NA
Structures ”, By
Compton Peterson,
10th Edition
Factorials, Recursive Factorial Example, Same as Above 11 NA NA
Same as Above 11 NA NA
02-12-2024 “Introduction To
Python”, By Home Work/
12 03-12-2024 Within 7
11 Assignment 4
Days
04-12-2024 Y.Dianiel Liang, (Week12/Week13)
12th Edition.

13 09-12-2024 Recursive Fibonacci Series Example, “Python for 12


10-12-2024 Programmers with
11-12-2024 AI and Data
NA NA
Structures ”, By
Compton Peterson,
10th Edition
Recursion vs. Iteration, Searching and Sorting Same as Above 12 NA NA
Same as Above 12 Quiz 4 Within 7
(Week Days
13/Week14)
Week
Dates Topics Book Name Chapter
No Exam/Quiz/Assignment
No
“Introduction To 12
Python”, By
NA NA
Y.Dianiel Liang,
12th Edition.

16-12-2024
14 17-12-2024
18-12-2024

23-12-2024
15 24-12-2024
26-12-2024

Deep Learning, Deep Learning “Python for


Applications,Deep Learning Demos, Keras Programmers with
Resources AI and Data
15 NA NA
Structures ”, By
Compton Peterson,
10th Edition
Keras Built-In Datasets, Custom Anaconda
Same as Above 15 NA NA
Environments, Neural Networks Tensors
Same as Above 15 NA NA
Convolutional Neural Networks for Vision;
Multi-Classification with the MNIST Dataset, “Introduction To
Loading the MNIST Dataset , Data Python”, By
30-12-2024 15 NA NA
Exploration, Data Preparation, Creating the Y.Dianiel Liang,
16 31-12-2024 Neural Network, Training and Evaluating the 12th Edition.
01-01-2025 Modec, Saving and Loading a Model
Visualizing Neural Network Training with
TensorBoard, ConvnetJS: Browser-Based
Deep-Learning Training and Visualization,
Recurrent Neural Networks for Sequences;
Sentiment Analysis with the IMDb Dataset
Exam/Quiz/Assignment
Week Chapter
No
06-01-2025
Dates Topics Book Name
No
17 To Final Exam Week
11-01-2025 Within
Final Term
13-2025 3 Days
18 To Final Exam Week
18-01-2025

You might also like