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

CS-1002 PF-Fall-2023

This document provides a course description form with details about a Programming Fundamentals course, including course code, title, credit hours, prerequisites, grading policy, plagiarism policy, assessment instruments, instructors, learning outcomes, topics covered, and mappings to program level outcomes.

Uploaded by

Abdul Rehman
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)
315 views6 pages

CS-1002 PF-Fall-2023

This document provides a course description form with details about a Programming Fundamentals course, including course code, title, credit hours, prerequisites, grading policy, plagiarism policy, assessment instruments, instructors, learning outcomes, topics covered, and mappings to program level outcomes.

Uploaded by

Abdul Rehman
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


INSTITUTION FAST School of Computing, National University of Computer
and Emerging Sciences, Islamabad

PROGRAM(S) TO BS-CS FALL 2023


BE EVALUATED

Course Description
Course Code CS-1002
Course Title Programming Fundamentals
Credit Hours 3+1
Prerequisites by N/A
Course(s) and
Topics
Grading Policy Absolute grading
Policy about Retake of missed assessment items (other than midterm/ final exam) will not be held. For a
missed missed midterm/ final exam, an exam retake/ pretake application along with necessary
assessment items evidence are required to be submitted to the department secretary. The examination
in the course assessment and retake committee decides the exam retake/ pretake cases.
Policy about late Penalties for late submissions of assignment/project:
submission of 1. Up to 30 mins late, loss of 40% of the mark awarded.
assessment item 2. After 30 mins, assignment/project will not be accepted for marking.
Course Plagiarism Plagiarism in project or midterm or final exam may result in F grade in the course.
Policy Plagiarism in an assignment will result in zero marks in the whole assignment category for
both students.
Assessment Assessment items of Theory Part
Instruments with Assessment Item Number Weight (%)
Weights
(homework, Assignments 3 6
quizzes, midterms, Sessional - I 1 10
final, programming
assignments, lab Sessional - II 1 15
work, etc.) Quizzes >= 5 14
Project 1 15
Final Exam 1 40
Course Dr. Arshad Islam (Section A, B), Mr. Shehreyar Rashid (Section E, F, G), Mr. Aqib Rehman
Instructors (Section C, D)
Lab Instructors (if
any)
Course
Dr. Arshad Islam
Coordinator
URL (if any) Class Link: https://classroom.google.com/c/NjE4NTQ5ODc2MTc1?cjc=yt2dhnq

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

NCEAC.FORM.001-D

Class code: yt2dhnq


Current Catalog
Description
The course aims to equip students with the basic computing concepts and to provide
them the ability to analyze the given requirements for solving problems in different
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++" 9th Edition
Laboratory
Manual for
Laboratory
Courses)
Reference Material Paul Deitel, Harvey Deitel "C++ How to Program" 10th Edition
Walter Savitch "Problem Solving with C++" 10th Edition

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

NCEAC.FORM.001-D

Course Learning
A. Course Learning Outcomes (CLOs)
Outcomes
At the end of the course the students will be able to:
1. Demonstrate the basic concepts of programming. (3) (2)
2. Demonstrate the key understanding of different software development
methodologies. (3) (2)
3. Apply algorithmic solutions related to the degree program to recent related problems
(3) (3)
4. Develop projects as per given specifications and requirements. (6) (4).

B. Program Learning Outcomes

For each attribute below, indicate whether this attribute is covered in this
course or not. Leave the cell blank if the enablement is little or non-
existent.

1. Academic Completion of an accredited program of study designed


Education to prepare graduates as computing professionals

2. Knowledge for Apply knowledge of mathematics, natural a


Solving sciences, computing fundamentals, and a
Computing computing specialization to the solution of
Problems complex computing problems
3. Problem Identify, formulate, research literature, and a
Analysis: analyze complex computing problems,
reaching substantiated conclusions using first
principles of mathematics, natural sciences,
and computing sciences.
4 Design solutions for complex computing a
Design/Develop problems and design systems, components,
Solutions: and processes that meet specified needs with
appropriate consideration for public health and
safety, cultural, societal, and environmental
considerations.
5. Modern Tool Create, select, and apply appropriate
Usage: techniques, resources and modern computing
tools, including prediction and modelling for
complex computing problems.
6. Individual Function effectively as an individual and as a
and Team work: member or leader in diverse teams and in
multi-disciplinary settings.
7. Communicate effectively on complex
Communication computing activities with the computing
community and with society at large

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

NCEAC.FORM.001-D

8. Computing Understand and assess societal, health,


Professionalism safety, legal, and cultural issues within local
and Society and global contexts, and the consequential
responsibilities relevant to professional
computing practice.
9. Ethics: Understand and commit to professional
ethics, responsibilities, and norms of
professional computing practice
.
10. Lifelong Recognize the need for, and have the
Learning preparation and ability to engage in
independent and life-long learning in the
broadest context of technological changes.

C. Mapping of CLOs on PLOs


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

1 2 3 4 5 6 7 8 9 10

1 a
CLOs

2 a
3 a
3 a

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

NCEAC.FORM.001-D

No. of Contact
List of Topics
Topics Covered in Weeks Hours
the Course, with - Problem-solving, Basic flowchart, block
Number of Lectures diagram, and programming languages.
on Each Topic - Primitive data types, input/output (hello
1 3
(assume 15-week world).
instruction and one- - Signed and unsigned data types,
hour lectures) constants and variables.
- Arithmetic operators (+, -, *, /, % and
their compound counterparts) with their
2 6
associativity and precedence.
- Bit wise operators
- Conditional/selection structures.
- Comparison and logical operators.
- if, if. . .else and if else if structure. 2 6
- Switch statement, break statement.
- Ternary operator.
1st Sessional Examination
- 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
calling. - Aliases, parameters passing by 1.5 3
value and by reference (passing arrays).
- Introduction to Arrays.
- Array initialization and representation.
- Char arrays. 2.00 7
- Multi-Dimensional Arrays (MDA).
- MDA representation in memory.
2nd Sessional Examination
- Pointers.
- const. vs. non-const. pointers, a pointer
to const. data vs. a pointer to non-
constant data. 1.17 5
- Using pointers.
- Dynamic memory allocation.
- Array of pointers.
- Function calling order and stack
(function within a function). 1.5 6
- Recursion
Total 15 45
Laboratory there are lab tasks with every lab of three hours.
Projects/Experiments
5 NCEAC.FORM.001.D
National Computing Education Accreditation Council
NCEAC

NCEAC.FORM.001-D

Done in the Course


Programming there are six programming assignments and a project.
Assignments Done in
the Course
Social and Ethical
Class Time Spent (in Theory Problem Analysis Solution Design
Issues
hours)
34 5 5 1

Oral and Written Every student is required to submit at least __1___ written reports of typically ___5__
Communications pages and to make __1___ demonstration of typically ____10___ minutes duration.

6 NCEAC.FORM.001.D

You might also like