Information Technology Education Department ITE102-ITE101L/ECOMPRG Syllabus I.

COURSE IDENTIFICATION Course Title Computer Programming Course Credit 2 units Course Prerequisite Course Corequisite ECOMLAB Course Description This serves as an introduction to a computer system particularly the history, basic computer concepts and architecture. This course also gives emphasis on program logic formulation and problem solving techniques using C or C++. Extensive exercises will likewise be given to practice the students skills in programming and also to familiarize them with the language.

II. COURSE OBJECTIVES To provide students with a grasp of understanding on the fundamentals of programming to be able them to General Objective Specific Objectives
develop, analyze, debug and design programs written in C or C++. At the end of the course, the students will be able to: 1. Enumerate, define and understand important computer concepts and terminologies; 2. Define the fundamental methods and steps of programming like algorithm formulation, and flowcharting; 3. Create working C or C++ programs; 4. Test and debug C or C++ programs; and 5. Document C or C++ programs.

III. TEXTBOOK(S) AND REFERENCES Textbook(s) References IV. COURSE OUTLINE

Week 1 Modules Orientation: Review of Course Syllabus Module 1: Introduction What is Computer? History of Computers, Advantages and Disadvantages of Computers Lab: Display/Print text Module 2: Classification of Computers By size, by year Module 3: Components of Computers Functions, Basic Architecture of a Computer System Lab: Display shapes or any design Long Quiz 1 Module 4: Number System Binary Conversion (Binary, Decimal, Octal, Hexadecimal) Lab: Computation Long Quiz 2 Module 5: Flowchart and Algorithm Construction Algorithm, Pseudocode and flowcharting Lab: Flowcharting and algorithm using Microsoft Visio Long Quiz 3 Module 6-8: Program Structure Operators and expressions, Input/Output Operations Lab: Computation of grades/payslip Midterm Examination Module 9: Selection Structure If-else statement Switch-case statement Lab: Zodiac Sign Module 10: Repetition Structures While, do-while and for loop statement Lab: cont: Grades/Payslip/Zodiac Long Quiz 4 Hours 2.67 3 2.67

3 1.20 1.20 3 1.20 1.20 3 1.20 6.80 6 1.20 1.20 3 2.67 6 1.20

3 4

4 5

5 6-8

8 9

9-10

10

11

12 12-13

14

Module 11: Functions Functions and Structured Programming Function Declaration Function Prototype Return Types Parameters and Argument Lab: Creating user-defined functions Long Quiz 5 Module 12: Arrays One-dimesional Arrays Module 13: Strings Strings Array Strings Lab: Searching/Sorting Numbers/Characters/Strings Long Quiz 6 Final Examination Total Number of Hours

2.67

1.20 6.80 6

1.20 1.20 38.04/39

V. COURSE REQUIREMENTS
Lectures and class discussions Quizzes Assignments Machine problems Midterm and Final Examination

VI. GRADING SYSTEM

Lecture: 70%

Lab: 30%

Midterm Grade Midterm Grade Class Standing (60%) Class Standing (60%) 40% Long Quiz (Average of 3 Quizzes) 40% Machine Problems 5% Teachers Evaluation 5% Teachers Evaluation 25% Seatwork, Assignments, Recitations (Class Participation) 30% Project 30% Short Quizzes Midterm Examination (40%) 25% Practical Exam

Midterm Examination (40%)

Final Grade Final Grade Class Standing (60%) Class Standing (60%) 40% Long Quiz (Average of 3 Quizzes) 40% Machine Problems 5% Teachers Evaluation 5% Teachers Evaluation 25% Seatwork, Assignments, Recitations (Class Participation) 30% Project 30% Short Quizzes 25% Practical Exam Midterm Examination (15%) Final Examination (25%) Midterm Examination (15%)

Final Examination (25%)

Passing Mark: 70%

VII. INSTRUCTOR AND SCHEDULE INFORMATION Name: ________________________________ Office: +632 736-0015 to 19 loc. __________ Home: ___________________ (optional) Mobile number: _____________________ (optional) Email: _______________________________ Consultation Hours: ____________________________ Meeting Place and time: SY: _______________ Term: _____

Room: _______ Day and Time: ____________________________

VIII. VERSION Version 1.0 Modified on: June, 2011 By: Prof. Jof Bombasi