Vous êtes sur la page 1sur 2

LYCEUM OF ALABANG

88 GNT Bldg., National Road, Muntinlupa City

DEPARTMENT OF COMPUTER STUDIES

COE 223 Syllabus

I. COURSE IDENTIFICATION
Course Title Structured Programming 1
Course Credit 3
Course Prerequisite Computer Fundamentals and Intro to Programming
Course Corequisite Structured Programming 2, Data Structure and Analysis of Algorithm
Course Description This course introduces the students to the fundamentals of logic formulation together with
their implementation in the C programming language. This course should serve as a
foundation for students in the Computer Science and Information Technology program.

II. COURSE OBJECTIVES


General Objective At the end of this course, the student should be able to:
Specific Objectives
1 ) Learn the components in problem solving

2 ) Explore the strategies in problem solving in relation to procedural programming

3 ) Analyze problems

4 ) Design algorithms to solve problems

5 ) Implement algorithms in a programming language

6 ) Test programming solutions to problems

7 ) Apply recursion as a programming solution

III. TEXTBOOK(S) AND REFERENCES


Textbook(s) WorkBook in C++, compiled by Engr. Danny G. Umoso
C++ by Bxample
Drozdek, Adam. (2005), Data Structures and Algorithms in C++. Thomson Asia Edition
References Bronson, Gary. (2006).C++ for Engineers and Scienctists; Thomson Asia Edition
Hyhoff, Larry (2005). Abstarct Data Types, Data Structures and Problem Solving 2nd Ed.; Pearson,
Prentice Hall

IV. COURSE OUTLINE


Week Modules/Topics Hours
1. Steps in Program Planning and Development
1-4
2. History/Principles of the C++

3. Expressions
5 PRELIM EXAMINATION
6-9 4. Basic Program Structure
Variable Declaration
Assignment Statement
Input/Output Statements

5. Using Conditional Constructs


Single Selection Construct
Multiple Selection Construct
10 MIDTERM EXAMINATION

6. Using Looping Constructs


11 - 13 Event-Controlled Loop Construct
Count-Controlled Loop Construct

14 PRE-FINAL EXAMINATION
15 -17 7. Using Functions
Concepts and Rules

1
Functions and Parameter Passing

8. Recursion
9. Arrays
18 FINAL EXAMINATION
Total Number of Hours 90

V. COURSE REQUIREMENTS
Reseach Papers/ Projects
Compilation of Laborabory Exercises (soft and hard copy)
Presentation of Case Study
Quizzes
Recitation
Periodical Examination

VI. GRADING SYSTEM

CRITERIA PERCENTAGE
CLASS STANDING 60%
Attendance 10%
Recitation 10%
Assignment/SW 10%
Quiz (es) 20%
Laboratory Exercises 20%
Case Study 30%
MAJOR EXAMINATION 40%
TOTAL 100%

COMPUTATION
Prelim Grade (PG) = (60% Class Standing + 40% Major Exam)
Midterm Grade (MG) = (60% Class Standing + 40% Major Exam) * 70% + PG * 30%
Pre-Final Grade (PFG) = (60% Class Standing + 40% Major Exam) * 70% + MG * 30%
Final Grade (MG) = (60% Class Standing + 40% Major Exam) * 70% + PFG * 30%
SUBJECT GRADE = Final Grade

Passing Grade : 75%

VII. INSTRUCTOR AND SCHEDULE INFORMATION

Name: RODRIGO P. CALAPAN Meeting Place and Time:

Office: +632 8615100 loc. 108 SY: 2009-2010 Term: 1st Semester
Home: +632 _________ (optional)
Mobile number: +63 __________ (optional)
Email: rodrigocalapan@lyceumalabang.edu.ph

Consultation Hours: ____________________________ Room: _______


Day and Time: ____________________________

VIII. VERSION
Version 2
Modified on: June 8, 2009
By: RODRIGO P. CALAPAN

Vous aimerez peut-être aussi