0% found this document useful (0 votes)
16 views7 pages

CS143 Programming Fundamentals Outline Fall 2025

The document outlines the course CS143: Programming Fundamentals at the University of Management and Technology for Fall 2025, detailing course objectives, evaluation criteria, and weekly topics. It includes specific learning outcomes related to Python programming, such as understanding algorithms and applying programming constructs. Additionally, it lists recommended textbooks and a calendar of course contents to be covered throughout the semester.

Uploaded by

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

CS143 Programming Fundamentals Outline Fall 2025

The document outlines the course CS143: Programming Fundamentals at the University of Management and Technology for Fall 2025, detailing course objectives, evaluation criteria, and weekly topics. It includes specific learning outcomes related to Python programming, such as understanding algorithms and applying programming constructs. Additionally, it lists recommended textbooks and a calendar of course contents to be covered throughout the semester.

Uploaded by

Haider Shah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

University of Management and Technology

School of Engineering
Department of Electrical Engineering

Course Outline (Fall 2025)


Course code: CS143 Course title: Programming Fundamentals

Program BS RIS

Credit Hours 3

Contact Hours 3

Knowledge Domain Advanced Computer and Information Sciences

M. Asad Ali (A)


Resource Persons

See office window (SEN-502)


Counseling Timing

[email protected] (Ext: 3672)


Contact

Chairman/Director
signature…………………………………………………………..
Course Learning Outcomes (CLOs):
CLO 1: Explain the fundamentals of Python programming, such as algorithm, pseudocode,
variables, arithmetic, strings, and input-output operations. (C2)

CLO 2: Apply the basic programming constructs, such as conditional statements and loops to
solve (computational) problems. (C3)

CLO 3: Construct the small-to-moderate scale computational programs using the functions, lists
and arrays. (C3)

Mapping of CLOs to Program Learning Outcomes (PLOs):

CLO’s/PLO’s CLO 1 CLO 2 CLO 3

1: Engineering Knowledge ✔ ✔ ✔

2: Problem Analysis

3: Design/Development of Solutions

4: Investigation

5: Tool Usage

6: The Engineer and the World

7: Ethics

8: Individual and Collaborative Teamwork

9: Communication

10: Project Management and Finance

11: Lifelong Learning


Grade Evaluation Criteria
Following are the criteria for the distribution of marks to evaluate final grades in the semester.

Marks Evaluation Marks

Quizzes 20

Assignment 5

Mid 25

Final 50

Total: 100

Recommended Textbooks:
1. Python for Everyone, 2nd Edition, Cay Horstmann, Wiley.

Reference Books:
1. Python How to Program, 1st Edition, Paul Deitel & Harvey Deitel, Pearsons.
2. Starting out with Python, 4th Edition, Tony Gaddis.
3. Introduction to Computation and Programming Using Python: With Application to
Understanding Data, 2nd Edition by Guttag, John
Calendar of Course contents to be covered during semester
Course code: CS 143 Course title: Programming Fundamentals

Relevance to
Week Experiment Title CLOs
Theory Topics

Introduction

• Introduction to programming
T.B (1.1 – 1.7) 1
1 • The Python Programming Language
• Analyzing Your First Program
• Pseudocode
Programming with Numbers and Strings

• Variables T.B(2.1) 1
2
• Number types
• Constants
Programming with Numbers and Strings

• Power
• Floor Division and Remainder T.B(2.2) 1
• Calling Functions/Mathematic Functions
• Parentheses
• Spaces
Programming with Numbers and Strings

• Type casting
• Assignment statement
3 • Strings Type T.B(2.4,2.5) 1
• Concatenation and Repetition
• Strings and Characters
• Input and output
• User Input and Numerical Input
DECISIONS

• The if statement T.B(3.1, 3.2,


4 2
• Relational Operators 3.3,3.4, 3.5)
• Nested Branches
Multiple Alternatives

DECISIONS
5 T.B(3.7, 3.8) 2
• Boolean Variables and Operators
• Analyzing Strings
• Practicing Computational problems

LOOPS

⮚ The while loop


⮚ Application Processing: Sentinel Values 4.1,4.3, 4.5,
6 ⮚ For loop 4.6,4.7,4.8, 2
⮚ Nested loops
4.9
⮚ Common Loop Algorithms
⮚ Random Numbers

FUNCTIONS

7 ⮚ Functions 5.1,5.2,5.3 3
⮚ Function implementation
⮚ Parameter passing

8
Midterm Exam

FUNCTIONS

9 ⮚ Return values 5.4,5.5,5.6 3


⮚ Functions without return values
Reusable functions

FUNCTIONS
10 5.8, 5.9 3
⮚ Variable scope
Recursive functions

LISTS
11 ⮚ Basic properties of Lists 6.1, 6.2 3
List operation

LISTS
12 6.3, 6.6 3
⮚ Common List Algorithms
Using List with Functions
NUMPY- ARRAYS

⮚ Arrays Initialization
13 ⮚ Array Attributes 7 3
⮚ Array Indexing and Slicing
⮚ Arrays Arithmetic operations

NUMPY-ARRAYS

14 ⮚ Sorting, Searching and Counting functions 7 3


⮚ Broadcasting

STREAMS
15 ⮚ Reading text files 7.1 3
Writing text files

16
Final Exam
Mapping of CLOs to Direct Assessments

Quiz Quiz Quiz Quiz Midterm


CLOs▼ Final Exam
1 2 3 4 Exam

1 ✔ ✔ ✔

2 ✔ ✔ ✔ ✔

3 ✔ ✔

You might also like