0% found this document useful (0 votes)
31 views6 pages

PF Outline

Uploaded by

yjadaraha
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)
31 views6 pages

PF Outline

Uploaded by

yjadaraha
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
You are on page 1/ 6

National Computing Education Accreditation Council

NCEAC

NCEAC.FORM.001-D

COURSE DESCRIPTION FORM: CS-111: Programming Fundamentals

INSTITUTION International Islamic University, Islamabad

PROGRAM TO BE BSSE: Spring 2024


EVALUATED

Course Description
Course Code CS-111
Course Title Programming Fundamentals
Credit Hours 3+1
Course Shakeel Ahmad
Instructors
Grading Absolute Grading
Policy
Policy about Retake of missed assessment items (other than midterm/ final exam) will not be held.
missed For a missed midterm/ final exam, an exam retake/ pre-take application and necessary
assessment evidence must be submitted to the department secretary The examination assessment
items in the and retake committee decides the exam retake/ pre-take cases.
course
Course Plagiarism in project or midterm/ final exam may result in an F grade in the course.
Plagiarism Plagiarism in an assignment will result in zero marks in the whole assignments category.
Policy
Prerequisite N/A
s by
Course(s) or
Topics

1 NCEAC.FORM. 001.D
National Computing Education Accreditation Council
NCEAC

NCEAC.FORM.001-D

Assessment Assessment items of Theory Part


Instruments Assessment Item Number Weight (%)
with Weights
(Homework, Assignments >= 4 10
quizzes, Midterm 1 20
sessional Quizzes >= 4 10
exams, final
exam, Final Exam 1 60
assignments,
etc.) Assessment items of Lab Part
Assessment Item Number Weight (%)
Lab Tasks 15 25
Assignments >= 4 5
Sessional 1 15
Lab Quiz 5 10
Project 1 10
Final Exam 1 35
Course
Coordinator
Lab
Instructors
(if any)
URL (if any)
Current The course aims to equip students with the basic computing concepts and to provide
Catalog them the ability to analyze the given requirements for solving problems in different
Description domains while implementing the solutions on a computer system. It emphasizes on
developing an algorithm and applying the basic programming constructs like control
structures, arrays, functions, pointers, dynamic memory allocation, etc. for its
development. The students will learn the syntax of the C++ programming language for
the implementation.
Textbook (or Tony Gaddis "STARTING OUT WITH C++" 8th Edition
Laboratory
Manual for
Laboratory
Courses)
Reference Paul Deitel, Harvey Deitel "C++ How to Program" 10th Edition
Material Walter Savitch "Problem Solving with C++" 10th Edition

2 NCEAC.FORM. 001.D
National Computing Education Accreditation Council
NCEAC

NCEAC.FORM.001-D

Course
Goals
A. Course Learning Outcomes (CLOs)

After completion of the course, the students shall be able to:


1. Understand basic problem-solving steps and logic constructs.
2. Apply basic programming concepts.
3. Design and implement algorithms to solve real-world problems.

B. Program Learning Outcomes (PLOs)

PLO 1 Computing and Apply knowledge of mathematics, statistics, natural


Data Science sciences, computing fundamentals, and a data
Knowledge specialization to the solution of complex data science
problems.
PLO 2 Problem Analysis Identify, formulate, research literature, and analyze
complex data problems, reaching substantiated
conclusions using first principles of mathematics,
statistics, natural sciences, computing, and data
sciences.
PLO 3 Design/Develop Design solutions for complex data science problems
Solutions and design systems, components, and processes
that meet specified needs with appropriate
consideration for public health and safety, cultural,
societal, and environmental considerations.
PLO 4 Investigation & Conduct investigation of complex data science
Experimentation problems using research-based knowledge and
research-based methods.
PLO 5 Modern Tool Usage Create, select, and apply appropriate techniques,
resources, and modern data science tools, including
prediction and modeling for complex data science
problems.
PLO 6 Society Apply to reason informed by the contextual
Responsibility knowledge to assess societal, health, safety, legal,
and cultural issues relevant to the context of complex
data science problems.
PLO 7 Environment and Understand and evaluate the sustainability and
Sustainability impact of data professional work in solving complex
data science problems.
PLO 8 Ethics Apply ethical principles and commit to professional
ethics and responsibilities and norms of computing
practice.
PLO 9 Individual and Function effectively as an individual, and as a
Team Work member or leader in diverse teams and in multi-
disciplinary settings.

3 NCEAC.FORM. 001.D
National Computing Education Accreditation Council
NCEAC

NCEAC.FORM.001-D

PLO 10 Communication Communicate effectively on complex data science


activities with the data professionals’ community and
with society at large.
PLO 11 Project Demonstrate knowledge and understanding of
Management and management principles and economic decision-
Finance making and apply these to one's work as a member
or team member.
PLO 12 Life Long Learning Recognize the need for, and have the preparation
and ability to engage in independent and lifelong
learning in the broadest context of technological
changes.

C. Mapping of CLOs to PLOs


(CLO: Course Learning Outcome, PLOs: Program Learning Outcomes)

PLOs

1 2 3 4 5 6 7 8 9 10 11 12

1  
CLOs 2  
3  

4 NCEAC.FORM. 001.D
National Computing Education Accreditation Council
NCEAC

NCEAC.FORM.001-D

No. of
List of Topics Contact Hours
Topics Covered in Weeks
the Course - Problem-solving, Basic flowchart, block
diagram, and programming languages.
(Assume 15-week
- Primitive data types, input/output (hello
instruction and 3 1 3
world).
contact hours per
week) - Signed and unsigned data types,
constants, and variables.
- Arithmetic operators (+, -, *, /, % and
their compound counterparts) with their
2 6
associativity and precedence.
- Bitwise operators
- Conditional/selection structures.
- Comparison and logical operators.
- if, if. . .else and if else if structure. 2 6
- Switch statement, break statement.
- Ternary operator.
- Repetition structures.
- Pre/post increment/decrement
operators.
- while loop (sentinels + condition).
3 9
- Loop with for.
- Loop with do-while.
- Nesting of while, for loop, and continue
statement.
- Function prototypes, definition, and
1 3
calling.
- Introduction to Arrays.
- Array initialization and representation. 1.33 4
- Char arrays.
Midterm
- Multi-Dimensional Arrays (MDA).
MDA representation in memory.
- parameters passing by value and by 1.66 5
reference (passing arrays).
- Function calling order
- Pointers.
- const. vs. non-const. pointers, a pointer
to const. data vs. a pointer to non-
constant data. 2 6
- Using pointers.
- Dynamic memory allocation.
- Array of pointers.
- Header files (creating own file).
- Files handling 1 3
- Opening flags (app mode).
Total 15 45
Laboratory Yes, there are lab tasks with every lab of three hours.
Projects/Experiments
Done in the Course
5 NCEAC.FORM. 001.D
National Computing Education Accreditation Council
NCEAC

NCEAC.FORM.001-D

Programming Yes, there are four programming assignments and a project.


Assignments Done in
the Course

Problem Solution Social and Ethical


Class Time Spent Theory
Analysis Design Issues
(In percentage)
40 40 15 5

Every student is required to submit at least __1___ written reports of typically


Oral and Written
___5__ pages and to make __1___ demonstration of typically ____10___
Communications
minutes duration.

6 NCEAC.FORM. 001.D

You might also like