Republic of the Philippines

City of Tagaytay
CITY COLLEGE OF TAGAYTAY
Akle St., Kaybagal South, Tagaytay City 4120
Tel. Nos. (046) 483-0470 / (046) 483 -0672

CCT VISION SCHOOL OF COMPUTER STUDIES CCT MISSION

Globally competitive university, upholding the COURSE SYLLABUS Committed to provide relevant and responsive
character formation, effecting social change. Second Semester, AY 2024-2025 academic programs in the arts, sciences, technology,
business management that will produce graduates
equipped with knowledge and skills possessing high
ethical standards prepared to complete in the global
environment.

CORE VALUES Knowledge and Character

INSTRUCTOR NAME ALDWIN KARLO M. ANGCAYA
CONSULTATION SCHEDULE
CONTACT NUMBER 09365907593

COURSE TITLE Programming Language CLASS SCHEDULE

COURSE CODE CSPC45 PLACEMENT
CREDIT UNITS 3 PRE-REQUISITE 3rd year standing

COURSE DESCRIPTION An introduction to the broad field of programming languages. It combines a general presentation of principles with considerable detail about
many modern languages. It contains significant material on implementation issues and the theoretical foundations of programming
languages.

COURSE LEARNING OBJECTIVES The aim of this course is to help the student understand programming languages by analyzing and contrasting language constructs:
1. What alternatives are available to the language designer?
2. How are language constructs implemented?
3. How should they be used?
The goal is to learn to analyze languages and not to study the peculiarities of any language in depth, and is to supply the student with the
conceptual tools needed to make such a decision.
LEARNING PLAN:
SUBJECT MATTER WEEK NO. LEARNING OUTCOMES TEACHING LEARNING VALUES INTEGRATION ASSESSMENT STRATEGY STUDENT OUTPUT
ACTIVITY
I. What are programming 1 -2 Learn more about Lecture/Discussion Patience Quizzes The student should
languages? programming language, have be able to classify
1.1 Imperative languages an overview of its different Class activity Seatwork the language type
1.2 Data-oriented types of the different
languages programming
1.3 Object-oriented languages that will
languages be cited in this
1.4 Non-imperative lesson.
languages
1.5 Standardization
1.6 Computer architecture
II. Programming Environments
2.1 Editor
2.2 Compiler
2.3 Librarian
2.4 Linker
2.5 Loader

III. Introduction of ASP 3 Understand the different Lecture/Discussion Accurate Quizzes Students should be
3.1 Environment elements of a source code of able to translate a
a programming language and Class Activity Seatwork source code of a
3.2 Life Cycle learn how a statement is certain
constructed. Laboratory Activity Laboratory activities programming
3.3 Event Handling language to a
different language,
3.4 Server Side and see if it will
create the same
3.5 Server Control output.

3.6 HTML Server

 3.7 Client Side

3.8 Basic Control

3.9 Directives

3.10 Validators

3.11 Database Acess

4.1 ASP RAZOR & LAYOUT 4- Learn more about the Lecture/Discussion Sensitivity Quizzes Students should be
different elementary data able to write
types that are commonly Laboratory Activities Seatwork programs that
4.2 ASP FOLDER & GLOBAL require different
used in most of the
Laboratory Activity elementary data
programing languages. types to be used.
4.3 ASP HTML FORMS & They should be
OBJECTS sensitive in
choosing the
correct data type
for a specific
program.
V. Composite Data Types 5 Learn more about the Lecture/Discussion Sensitivity Quizzes Students should be
5.1 Records different composite data able to write
5.2 Arrays types that are commonly Laboratory Activities Seatwork programs that
5.3 Reference semantics in require different
used in most of the
Java Laboratory Activity composite data
5.4 Arrays and type- programing languages types to be used.
checking They should be
 5.5 Array subtypes in ASP sensitive in
5.6 String type choosing the
5.7 Multi-dimensional correct data type
arrays for a specific
5.8 Array implementation program.
PRELIM EXAMINATION
I. Control Structures 1 Refresh the students with Lecture/Discussion Hardworking Quizzes Students should be
1.1 Switch-/case- the different control able to use the
statements structures of a program Laboratory Activities Patience Seatwork decision making
1.2 If-statements and repetition in a
1.3 Loop statements Laboratory Activity program. They
1.4 For-statements should write a
1.5 Sentinels program that will
1.6 Invariants ask for a number
1.7 Goto statements and then decide if
the number is odd
or even, and then
computes and
displays its factorial
by using loop
statements.

II. Introduction of PHP 2 Understand the introduction Lecture/Discussion Creativity Quizzes Students should be
2.1 Common use of PHP of PHP and white spacing of able to write a
2.2 Characteristic of PHP PHP. Laboratory Activities Patience Seatwork program with four
2.3 Script in PHP functions that
2.4 Environment Setup Class Activities Laboratory Activity computes and
2.4.1 PHP Parser displays the answer
Installation for the four basic
2.4.2 Apache arithmetic
Installation operations.
2.4.3 PHP.INI
Configuration
2.4.4 Windows IIS
 Configuration
2.5 Syntax Overview
2.5.1 Escaping PHP
2.5.2 Canonical PHP
2.5.3 Short-open
(SGML - style) tags
2.5.4 ASP – style tags One function
2.5.5 HTML Scripts should only contain
tags one operation.
2.6 Commenting PHP Code
2.6.1 Single line
comment
2.6.2 Multi line
comment
2.6.3 Multi line
printing
2.7 PHP whitespace
sensitive
2.8 PHP case sensitive
2.9 Braces make blocks

III. PHP Variables 3 -4 Learn how to user pointer Lecture/Discussion Perseverance Quizzes Students should be
3.1 Integers types, and its role in a data able to create a
3.2 Double structure and memory Laboratory Activities Patience Seatwork program that will
3.3 Booleans allocation of a data. display the
3.4 NULL Class Activities Laboratory Activity memory address of
3.5 Strings a variable by using
3.6 Arrays Assignment pointer variables.
3.7 Objects
3.8 Resources
3.9 Variable Scope
3.10 Variable Naming

IV. PHP Constant Type Learn how to user Constant Lecture/Discussion Perseverance Quizzes
 4.0 Constant () function types, and its role in a data
4.1 Difference between structure and memory Laboratory Activities Patience Seatwork
variable and constants allocation of a data.
4.2 Valid and Invalid Class Activities Laboratory Activity
constant names
4.3 PHP Magic constants Assignment
4.3.1 _LINE_
4.3.2 _FILE_
4.3.3 _FUNCTION_
4.3.4 _CLASS_
4.3.5 _METHOD_

V. Operator Types 4-5 Learn the concept of Lecture/Discussion Perseverance Quizzes Students should be
5.1 Arithmetic Operators different operators in PHP. able to answer the
5.1.1 Addition Class Activities Creativity Seatwork questions :
5.1.2 Subtraction
5.1.3 Multiply Assignment - What are
5.1.4 Division different operator
5.1.5 Modulus in PHP?
5.1.6 Increment
5.1.7 Decrement - Why doesn’t PHP
5.2 Comparison Operators use the result type
5.2.1 Equal to distinguish
5.2.2 Not Equal overloaded
5.2.3 Greater Than functions?
5.2.4 Less Than
5.2.5 Greater than or
Equal
5.2.6 Less than or Equal
5.3 Logical Operator
5.3.1 and
5.3.2 or
5.3.3 && AND
5.3.4 || OR
 5.3.5 ! NOT
5.4 Assignment Operators
5.4.1 Simple
Assignment
5.4.2 Add AND
5.4.3 Subtract AND
5.4.4 Multiply AND
5.4.5 Divide AND
5.4.6 Modulus AND
5.5 Conditional Operator
5.5.1 Conditional
Expression
5.6 Precedence PHP
Operator
5.6.1 Unary
5.6.2 Multiplicative
5.6.3 Additive
5.6.4 Relational
5.6.5 Equality
5.6.6 Logical AND
5.6.7 Logical OR
5.6.8 Conditional
5.6.9 Assignment

MIDTERM EXAMINATION
I. Exceptions 1 Understand the different Lecture/Discussion Creativity Quizzes Students should be
1.1 Exception handling exception-handling in three able to
requirements different programming Laboratory Activities Perseverance Seatwork differentiate the
1.2 Exceptions in PL/I languages. behavior of
1.3 Exceptions in Ada Class Activities Keen-observation exception-handling
1.4 Exceptions in C++ of three different
1.5 Error handling in Eiffel languages, and
analyze how those
languages handled
 errors in a
program.
II. Concurrency 2 Learn the advantages and Lecture/Discussion Creativity Quizzes Student should be
2.1 What is Concurrency? problems in using able to answer the
2.2 Shared memory concurrency in a program. Class Activities Seatwork questions :
2.3 The mutual exclusion - What happens in
problem Assignment the solution to the
2.4 Monitors and protected mutual exclusion
objects problem if the
2.5 Concurrency in C# semaphore is given
2.6 Message passing an initial value
2.7 Ada rendezvous greater than 1?
2.8 Linda - Try to precisely
define fairness.
What is the
connection
between fairness
and priority?

III. Program Decomposition 3 Understand the elementary Lecture/Discussion Creativity Quizzes Students should be
3.1 Separate compilation “mechanical” methods for able to Write a
3.2 Why are modules decomposing a program, Laboratory Activities Seatwork main program in C
needed? that calls an
3.3 Packages in Ada Laboratory Activity external function f
3.4 How to write modules with an int
in C# Assignment parameter.
IV. Object-Oriented 4 Language support for object- Lecture/Discussion Patience Quizzes Students should be
Programming oriented programming as able to compare
4.1 Object-oriented design one method of Laboratory Activities Initiative Seatwork top-down
4.2 Object-oriented decomposition programming with
programming in C# Class Activities Laboratory Activity object-oriented
4.3 Inheritance programming
4.4 Dynamic polymorphism Assignment when it comes to
in C# software
 4.5 Object-oriented development.
programming in Ada 95
4.6 Structuring classes Students should be
4.7 Encapsulation in Java able to write a
4.8 Access to private heterogeneous
components queue in C++.
4.9 Class data
4.10 The Eiffel
programming language
4.11 Design considerations
4.12 Methods of dynamic
polymorphism

V. Non-imperative 5 Learn the concepts of non- Lecture/Discussion Creativity Quizzes Students should be
Programming Languages imperative programming: able to write a
5.1 Functional functional programming and Laboratory Activities Seatwork function that takes
programming logic programming. a list of trees and
5.1.1 Why functional Class Activities Laboratory Activity returns a list of the
programming minimum values in
5.1.2 Functions each tree.
5.1.3 Compound types
5.1.4 Higher-order Students should be
functions able to compute
5.1.5 Lazy and eager 3+4 using the
evaluation logical definition of
5.1.6 Exceptions addition.
5.1.7 Environments
5.2 Logic Programming
5.2.1 Pure logic
programming
5.2.2 Unification
5.2.3 Prolog
5.2.4 Advanced logic
programming concepts
 FINAL EXAMINATION
TOTAL : 90 Hours Lecture : 36 hours
Laboratory : 54 hours

Instructional Materials:
Board/chalk, LED projector, TV monitor, laptop computer

Textbooks/References/Supplementary Readings:
 “Understanding Programming Languages” – M. Ben-Ari(Weizmann Institute of Science)
- Originally published by John Wiley & Sons, Chichester, 1996. Copyright © 2006 by M. Ben-Ari
 https://www.tutorialspoint.com/php/php_operator_types.htm

Course Requirements:
Written Examination
Seatwork
Quizzes
Activities/Laboratory Exercises

Evaluation of Student Performance /Grading System

Lecture: Laboratory
Quizzes 30% Laboratory Exercises 50%
Attendance 10% Practical Examination 50%
Class Participation 20% 100%
Major Examination 40%
100%
FG=(Lecture Grade *3(units))/2 + (Laboratory Grade *3 (units))/1

Classroom policies:
1. All College rules and regulations specified in the student handbook shall apply in the class.
 2. Student with no identification card and not wearing prescribed uniforms will not be accepted in the class. A grace period of 15 minutes will be given as consideration.
Late comers are responsible to catch lesson missed.
3. Wearing of proper uniforms and ID will be strictly implemented in the class.
4. Silence must be observed at all times. Use of cellular phones, Multi-player or any gadgets that may cause interference or disturbance is prohibited during the class
hours.
5. Excused absences will only be honored upon presentation of excuse slip duly signed by the Student Affairs and Services (SAS).
6. For other matters regarding in the class, the instructor will have the final decision. However, the students are encouraged to voice their views and opinions to
whatever matters that concern them inside the class.

Examination and Requirement Policies

1. Quizzes will be given unannounced while long exams will always be announced.
2. No special examination is to be given unless there is valid reason why the student was not able to take long examination on the schedule dated. A medical certificates
should be secured and an excuse slip duly signed by the registration adviser and representative from Student Affairs and Services.
3. During examinations, students are required to put their things at the back of the room. Only pen and questionnaires are to be seen on their desks.
4. The students need to pass their duty form to the assigned examiner to check if they have performed the required duty hours.
5. Cheating is strictly prohibited. Once caught cheating, the student will automatically fail or a grade of 5.00 on the given exam for the first offense and for the second
offense he/she will automatically fail the subject or a grade of 5.00on their class cards.
6. Late projects and reports will not be accepted. Failure to submit on time will have a grade of zero

CCL Policies:
1. Always log BEFORE and AFTER using the laboratory room. A logbook is provided at the laboratory room.
2. Any defects/malfunctions which are observed while using any of the computer units should be reported.
3. Eating is prohibited inside the laboratory room. Computer games are absolutely not allowed.
4. Students are prohibited to connect flash drives or external disks to avoid threats of viruses. No personal files or data shall be stored in the hard disk.
5. Any user caught vandalizing the facilities and equipment will be dealt with accordingly.

Prepared by: Endorsed by: Approved by:

MR. ALDWIN KARLO M. ANGCAYA Mr. NOEL JR. G. GARCIA MS. JEFERLYN ANONUEVO
College Instructor Department Head, Department of Information Technology Dean, School of Computer Studies