0% found this document useful (0 votes)
15 views

comp prog II (1)

The document outlines the course 'Computer Programming II' at Admas University, detailing its objectives, content, and assessment methods. It covers advanced programming topics such as pointers, modular programming, structures, and file management. The course includes lectures, practical classes, and requires students to actively participate and complete assignments to succeed.

Uploaded by

estifanos haile
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)
15 views

comp prog II (1)

The document outlines the course 'Computer Programming II' at Admas University, detailing its objectives, content, and assessment methods. It covers advanced programming topics such as pointers, modular programming, structures, and file management. The course includes lectures, practical classes, and requires students to actively participate and complete assignments to succeed.

Uploaded by

estifanos haile
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/ 4

ADMAS UNIVERSITY

FACULTY OF INFORMATICS
DEPARTMENT OF COMPUTER SCIENCE
COURSE OUTLINE
Course Title Computer Programming II
Course Code CoSc2011
Credit Hours 3
Lecture Hours 2
Laboratory Hours 2
Prerequisites CoSc1012
Program BSc Degree in Computer Science
Academic Year
Instructors’ Name Agmas G..
Course Coordinator
Department Head
Course Description This course is a continuation of the course “Computer Programming I”.
It is designed to extend Basic programming skills of the students by
covering topics such as Pointer, structures; modular programming
(functions, arguments, passing arguments by value and by reference, life
time of variables), recursion, file management (text and binary files, file
manipulation, file accessing modes).

Course Objective On completion of the course successfully, students will be able:


 Explain concepts of modular programming,
 Design and write modular programs,
 Describe and implement advanced data structure elements that
serve as holding homogenous data primitives
 Learn file manipulation, i.e., I/O operations of files.

Course Contents
Chapte TOPIC Time
r Allotte
1 Pointers d 6 hrs.
.
1.1 Definition of Pointers; Pointer and address of operator
1.2 Pointer operators, expression, arithmetic
1.3 Strings and pointers
1.4 Relationship between pointers and arrays
2 Functions 10 hrs.
. 2.1 Introduction to Modular Programming (Functions); Declaration of
functions; Definition of functions
2.2 Calling a function
2.3 Scope of Variables
2.4 Function Arguments; Return Values
2.5 Default Parameters; Parameters passing; Call by value; Call by
reference
2.6 Recursive functions
3 Structures 8 hrs.
.
3.1 Overview of Structure; declaring structures
3.2 Defining structure in structure
3.3 Initializing structure; manipulating structure
3.4 Array of structure
3.5 Nested structure
3.6 Structure, Reference and Pointer
3.7 Passing structure to function
3.8 Passing value of structure to a function
3.9 Passing address of a structure to a function
4 File Management 8 hrs.
.
4.1 Streams and Files
4.2 Text and Binary Files
4.3 Text File processing
4.4 Binary File processing
4.5 Random Access Files

Roles of the He/she will come to the class regularly on time and deliver the lecture and/or laboratory
Instructor class in a well-organized manner. Besides, at the end of each class he/she gives reading
assignment for the next class. He/she will make sure that a proper assessment is given.
He/she is also responsible to give feedback for each assessment
The success of this course depends on the students` individual and collective
Roles of the contribution to the class discussions. Students are expected to participate voluntarily, or
students will be called upon, to contribute to set exercises and problems. Students are also
expected to read the assigned readings and prepare the cases before each class so that
they could contribute effectively to class discussions. Students must attempt
assignments by their own. Proficiency in this course comes from individual knowledge
and understanding. Copying the works of others is considered as serious offence and
leads to disciplinary actions
Instructional Methods

 Lectures
 Practical classes (Lab sessions)
 Interactive platforms
 Problem Based Learning
 Individual/Group project works
 Presentation & Demonstration
Attendance Policy: students should attend a minimum of 80% of the total hours given to the
courses to get the grade they achieved. Otherwise, No Grade (NG).

Assessment Methods:
Assessment Methods Chapters (Topics) to Points
be covered
Assessment 1 (Test 1) Chapter 1 10
Assessment 2(Test 2/Practical Test) Chapter 2 10
Assessment 3(Individual Assignment) Chapter 3 and 4 10
Assessment 4 Group Assignment/Project Project work 10
Presentation of Group 10
Assignment/Project
Final Exam All Chapters 50%
Grand total 100%
Textbook
 Walter Savitch, Problem Solving with C++, 10th Edition, 2018
References
 Richard L. Halterman: “Fundamentals of Computing with C++”, 2019.
 Richard L. Halterman, “Fundamentals of C++ Programming”, School of
Computing Southern Adventist University, 2019
 Ulla Kirch-Prin Peter Prinz , A Complete Guide to Programming in C++
 William Knottenbelt, An Introduction to the Imperative Part of C++, 2020
 Programming and Problem Solving with C++: Comprehensive Sixth Edition, 2014

You might also like