DEPARTMENT OF COMPUTER SCIENCE

College of Engineering
University of the Philippines Diliman

COURSE NO : CS 11
COURSE TITLE : Computer Programming 1
COURSE CREDIT : 3u ( 2u lec, 1u lab)
SEMESTER : First Semester, 2014 - 2015
SCHEDULE : Lec: T 8:00 AM 10:00 AM (AIER), Lab: 7:00 AM
10:00 AM (TL2)
INSTRUCTORS : Philip Christian Zuniga (LEC) and Rafael Lino
Mantaring (Lab)
CONSULTATION : ZUNIGA (RM 316, MWF 1:00 PM 4:00 PM PM)
: MANTARING
EMAIL ADDRESS : philip.zuniga@gmail.com
UVLE KEY :




COURSE DESCRIPTION
Introduction to Computer Science. Problem Solving Strategies. Algorithm Development.
Coding Convention. Debugging. Programming constructs, types, control structures,
functions, I/O. Basic Data Structures. Application to Different fields in Computer
Science.

COURSE OUTINE

LECTURE LABORATORY
1) Introduction to Computer Science
and History of Computer Science
Activity: Watch biography of Alan
Turing
2) Representing Data in a Computer
- Number Systems
1) Basic Laboratory set up.
Discussion of Lab Rules.
Command Line Scripting
2) First Hello World Program.
Variables, Data Types and simple
I/O
- Number System Conversions
3) Different Primitive Expressions.
Boolean Expressions and Terms
4) Algorithm Development
- Flowcharts
- Pseudocode
5) Lists and other data structures
6) Functions and Parameter Passing
WRITTEN EXAM 1

7) Basic Data Structures
Activities:
Using graphs in Computer
Networks
Discussing Information Security
with Graph Algorithms
Discussion of Search Algorithms
8) Randomization in Computer
Programs
Developing a Basic Computer
Game
Using Artificial Intelligence in
Heuristic Searching
9) Software Development Process
WRITTEN EXAM 2
3) Creating complicated
mathematical formulas.
4) Programming Constructs (
Conditional Statements and
Iterative Operators
5) Using Arrays in Computer
Programs
6) Implementing Functions and
Parameter Passing

HANDS ON EXAM 1

7) Implementation of Linked Lists
Implementation of Graphs
Basic Graph Algorithms
Implement Search Algorithms
8) Implementation of Programs with
Randomized components
Developing a basic Computer
Game
Implementation of Heuristic
Search Algorithms
9) Discussion of File I/O
Development of a basic software
with a textfile database.
HANDS ON EXAM 2

COURSE REQUIREMENTS

Lecture Component

Written Exam 1: 150 points
Written Exam 2: 100 points
Machine Problem 1: 100 points
Machine Problem 2: 100 points
Assignments/Recitations/Quizzes 50 points

Laboratory Component

Hands on Exam 1: 150 points
Hands on Exam 2: 150 points
Machine Exercises: 150 points
Assignment/Recitations/Quizzes: 50 points

Total: 1000 points

Students are required to attend classes. Maximum number of absences is 6
absences, after which, the student will receive a grade of 5.0
In order to pass the course, the student must get a passing total (300 points) in
both the lectur e part and laboratory part of the class.
In case a student fails to take the practical exams or the written exams, they will
need to provide a valid reason before being allowed to take a make up exam.
There will be no makeup/replacement for missed quizzes or machine exercises.

Grading System:

1000 930 pts: 1.0
929 890 pts: 1.25
889 860 pts: 1.5
859 830 pts: 1.75
829 800 pts: 2.0
799 750 pts: 2.25
749 700 pts: 2.5
699 650 pts: 2.75
649 600 pts: 3.0
599 and below 5.0



COURSE POLICIES
WRITTEN EXAMS: There will be two written exams. Written exams will be given outside
of class hours (usually Saturdays). You are not required to bring anything except for a
pen (answer sheet and scratch papers will be provided). Complaints regarding the
exam will only be entertained within a week after the results of the exam is released.
Students who will come in late will not be given make up exams.
HANDS ON EXAM: There will be two hands on exam. They are scheduled during class
hours, usually at the same week as of the written exams.
MACHINE PROBLEMS: Machine problems are take home programming problems that
will be given by the lecture instructors. Students would be given 2 weeks 1 month to
work on their machine problems. Except if the machine problem is a group activity, it
is assumed that it will be done individually.
MACHINE EXERCISES: Machine exercises are programming exercises that will be given
during lab hours. Unless the lab instructors allowed the students to work on their MEs
at home, it is expected that the students would work on their MEs during class.
POLICIES ON USE OF PERSONAL MACHINES: Students are not required to have their own
machines. If they have no machine, the student can talk to their respective instructors
so that they can be scheduled to use the computer laboratories outside of class hours.
Students with their own personal computers are not allowed to use them during class
hours. They are discouraged to bring their own personal machines in class, and the
Department is not liable with whatever will happen to their personal machines.
POLICIES ON ACADEMIC DISHONESTY: Academic dishonesty will be subjected to proper
disciplinary procedure, and will students involved will automatically be failed in class.
REMEDIAL CLASSES: CS 11 remedial classes are scheduled on Mondays, 1 4 PM.
Students are not required to attend the remedial classes. These classes are for those
who are struggling during the regular lecture classes. In order to attend the remedial
class, a student must sign up for the upcoming remedial class on or before the latest
THURSDAY before the remedial class.

REFERENCES
1) C How to Program, Third Ed. Deitel, HM and Deitel, PJ 2002
2)