HOLY CROSS OF BANSALAN COLLEGE

Bansalan, Davao del Sur

A.Y 2011-2012
Syllabus in IT 124 (Program Logic Formulation)
Curriculum Pacing Guide
COURSE TITLE: IT 124
COURSE DESCRIPTION: PROGRAM LOGIC FORMULATION
COURSE CREDIT: 3 units

INTRODUCTION:
This course provides students the fundamental features and concepts of different programming languages. Topics include overview of programming languages, introduction
to language and translation, type systems, data and execution control, declaration and modularity, and syntax and semantics. This course also discusses topics about the
design and analysis of algorithms, techniques in analyzing algorithms, algorithmic strategies, sorting and searching algorithms.
As an Ignacian Marian school, the students will develop their competence as they engage in different activities that will apply the different algorithms and execution control
by presenting their plan of their program using flowchart and pseudocode. They will strengthen their character through collaboration of ideas and deeper analysis of their
program. With that, they can be globally competent and become responsive to the needs of societal transformation.

GENERAL OBJECTIVES:
At the end of the semester, the students are expected to:
1. Identify features of imperative languages, and their implementation(including the use of static memory, stack and heap for implementing variables
2. Identify various programming paradigms(functional, declarative, imperative, object oriented), and their implementations
3. Describe the different phases in the language transition process.
4. Design effective, elegant, efficient, and readable algorithms for various classes of computing problems.
5. Use various algorithm design techniques.

6. Appreciate Gods creation and apply Christian values.

COURSE OUTLINE
IT 124- PROGRAM LOGIC FORMULATION
I.

II.

III.

IV.

V.

VI.

An Overview of Computers and Logic

a. Understanding computer Components and Operations
b. Understanding the Programming Process
c. Understanding Interactive User Input
d. Managing Large Flowchart
Understanding Structure
a. Understanding the three Basic Structures: Sequence, Selection and Loop
b. Using the Priming Read
c. Three Special Structures (Case, Do-While and Do-Until)
Using Methods
a. Review of Simple Methods
b. Creating Methods that Require a Single Parameter
c. Creating Methods that Require Multiple Parameters
d. Creating Methods that Return Values
e. Passing an Array to a Method
f. Overloading Methods
g. Using Pre-Written Built-In Methods
h. Avoiding Ambiguous Methods
Object-Oriented Programming
a. An Overview of Some Principles of Object-Oriented Programming
b. Defining Classes and Creating Classes Diagrams
c. Understanding Public and Private Access
d. Organizing Classes
e. Understanding Instance Methods
Introduction to Algorithms
a. Algorithm Analysis
b. Algorithm Running Times
c. The Maximum Contiguous Subsequence Sum Problem
Logarithms
a. Static Searching
b. Sequential Search
c. Binary Search
d. Interpolation Search
e. Checking an Algorithm Analysis
f. Limitations of Big-Oh Analysis

VII.

VIII.

IX.

X.

Mathematical Tools in Analysis

a. Proof Techniques
b. Recurrence Relation
c. Generating Functions
d. Basic Algorithm Analysis
e. Time and Memory Complexity
Algorithm Strategies
a. Brute Force Algorithm
b. Greedy Algorithms
c. Divide-and-Conquer Strategies
d. Backtracking
e. Branch-and-Bound
f. Heuristics
Overview of Programming Languages
a. History of Programming Languages
b. Overview of Programming
c. Paradigms(Procedural, Object-Oriented, Functional, Declarative, Scripting Language)
Introduction to Language Translation
a. Comparison of Interpreters and Compilers
b. Language Translation Phase

TIME
FRAME
Week 1

Week 2

Week 3
and

OBJECTIVES

SUBJECT MATTER

STRATEGIES

At the end of the week,

the students are expected
to:
1. Know about the vision,
mission and goals of the
school.
2. Know and understand
the policies and grading
system of the school.
3. Learn about the brief
overview Program Logic
Formulation.

Orientation
-Vision, Mission and Goals of the
School
-Rules and Regulations of the
School
-Program Logic Formulation
Orientation.

Lecture

1. Learn about the steps

involved in the
programming process.
2. Learn about data
hierarchy and file
input.
3. Use flowchart symbols
and pseudocode
statements.

An Overview of Computers and

Logic
Understanding
computer
Components and Operations
Understanding
the
Programming Process
Understanding
Interactive
User Input
Managing Large Flowchart

Demonstration

1. Learn
about
the
features
of
unstructured spaghetti
code.
2. Use a priming read.
3. Appreciate the need
for structure.

Understanding Structure
Understanding the three
Basic
Structures:
Sequence, Selection and
Loop
Using the Priming Read

Research

Discussion

VALUE FOCUS/RELATED
VALUES
Excellence
Integrity

EVALUATION
QUESTIONS
1. What is the mission,
vision and goals of the
school? Explain and
discuss.
2. What is the
importance of studying
Program Logic
Formulation as an IT
student?
3. How will you relate
Program Logic
Formulation in your life
as an IT student? What
are the related values
involved as a Christian?

REQUIREMENTS

Excellence
Discipline

1. What are the steps

involved in the
programming
process?
2. How do you
understand data
hierarchy and file
input?
3. How
to
use
flowchart symbols
and
pseudocode
statements? Give
an example.
1. What
are
the
features
of
unstructured
spaghetti code?
2. How to use priming
read?
3. How do you find

Flowchart

Open Forum

Group activity
Presentation

Discussion
Recitation

Service
Courage

Oral Recitation
Class Card

Presentation of
flowchart using
three basic
structures.
Quiz

Week 4
and
Week 5

Week 6

1. Understand a simple
method.
2. Create a method that
requires
single/mutiple
parameter.
3. Learn how to avoid
ambiguous methods.

Using Methods
Review of Simple Methods
Creating Methods that
Require
a
Single
Parameter
Creating Methods that
Require
Multiple
Parameters
Creating Methods that
Return Values
Passing an Array to a
Method
Overloading Methods
Using Pre-Written Built-In
Methods
Avoiding
Ambiguous
Methods

Group Activity

1. Understand some
basic principles of
object-oriented
programming.
2. Appreciate
different ways to
organize classes.
3. Use Objects.

Object-Oriented Programming
An Overview of Some
Principles
of
ObjectOriented Programming
Defining Classes and
Creating
Classes
Diagrams
Understanding Public and
Private Access
Organizing Classes
Understanding Instance
Methods

Demonstration

Week 7
Week 8

the importance of
structure?

Three Special Structures

(Case, Do-While and DoUntil)

1. Estimate

the

time

Review all related topics

for examination
Introduction to Algorithms

Group
Discussion

Service
Stewardship

Presentation of
Output

Discussion

Faith

1. What have you

understand about
simple method?
2. What
are
the
names
of
the
methods that you
applied in your
program?
3. What
are
the
techniques to avoid
ambiguous
methods?

1.

Understand
some
basic
principles
of
object-oriented
programming.
Appreciate
different ways to
organize classes.
How
objects
function in an
object-oriented
program?

Oral Recitation

1. How to estimate

Oral Recitation

Communion

Group Activity
2.
3.

Excellence

Pseudocode of
methods

Pseudocode and
Class Diagram

Week 9
and
Week
10

Week
11 and
Week
12

Week

required
for
algorithm.
2. Use techniques that
reduce the running
time of an algorithm.
3. Use
mathematical
framework
that
describes
the
running time of an
algorithm.

Algorithm Analysis
Algorithm Running Times
The Maximum Contiguous
Subsequence
Sum
Problem

1. Differentiate the
different
logarithms.
2. Apply
each
algorithm.
3. Recommend
a
best algorithm.

Logarithms
Static Searching
Sequential Search
Binary Search
Interpolation Search
Checking an Algorithm
Analysis
Limitations of Big-Oh
Analysis

1. Perform
mathematical
analysis in different
algorithms.
2. Analyze the pros and
cons of best and
worst
cases
of
algorithms.
3. Appreciate the use
of
mathematical
tools.

Mathematical Tools in Analysis

Proof Techniques
Recurrence Relation
Generating Functions
Basic Algorithm Analysis
Time
and
Memory
Complexity

Illustration
Discussion

Integrity
Discipline

2.

Q&A
3.

REVIEW ALL RELATED

Discussion
Demonstration

Service
Courage

1.
2.

Group Work
3.

Group Work
Discussion

Excellence
Resourcefulness

the time required

for algorithm?
What
are
the
techniques
that
reduce the running
time
of
an
algorithm?
What
mathematical
framework
that
describes
the
running time of an
algorithm?
What
is
the
difference among
logarithms?
When do we
apply
each
algorithm?
What algorithm
you recommend
it best algorithm?

1. How to perform
mathematical
analysis
in
different
algorithms.
2. How to find out
the pros and cons
of best and worst
cases
of
algorithms?
3. What
is
the
importance of the
use
of
mathematical
tools?

Quiz
Research Work

Quiz
Oral Recitation
Research
Work/Assignment

Research
Work/Assignment

13
Week
14 and
Week
15

1. Compare
and
Contrast
various
algorithm strategies
2. Recommend best
algorithm strategies
when
creating
programs.
3. Test various sorting
and
searching
algorithm in real
world data.

Week
16 and
Week
17

1. Familiarize the
history
of
programming
languages.
2. Discuss
programming
paradigms.
3. Give
examples of
programming
languages in
every
programming
paradigm.

Week
18

Final Examination

TOPICS
FOR
EXAMINATION
Algorithm Strategies
Brute Force Algorithm
Greedy Algorithms
Divide-and-Conquer
Strategies
Backtracking
Branch-and-Bound
Heuristics

Illustration
Group
Exercises

Excellence
Competence

1. How
do
you
compare
and
contrast
various
algorithm
strategies?

Presentation
of
Pseudocode and
flowchart applying
the
algorithm
strategy

2. What is the best

algorithm strategy
when
creating
programs?

Oral Recitation
Quiz

3. How to test various

sorting
and
searching
algorithm in real
world data?
Overview of Programming
Languages
History of Programming
Languages
Overview of Programming
Paradigms(Procedural,
Object-Oriented,
Functional,
Declarative,
Scripting Language)
Introduction to Language
Translation
Comparison
of
Interpreters
and
Compilers
Language
Translation
Phase
Review all related topics

Demonstration
Group Activity

Excellence
Integrity

1. How programming
languages start?
2. Differentiate
programming
paradigms.
3. Name
programming
languages
every
programming
paradigm.

Quiz
Project

the
of

Grading System:
QUIZZES
CLASS PARTICIPATION / ASSIGNMENTS/ATTENDANCE ASSIGNMENT
PROJECT
EXAMINATION
TOTAL

20%
-

25%
10%
10%
35%
100%

REFERENCES:
Simple Program Logic Formulation

Herrera dela Rosa

2004

Program Logic Formulation

Joyce Farrell

2008

An Introduction to Programming with C++

Diane Zak

2009

Simple Program and Logic Formulation

Juvy Basbas and Dela Rosa

2004

Prepared by:

Noted By:

Approved by:

MYLEEN C. ROBIOS
IT Instructor

S. MA. VIRGINIA C. OMADLAO, RVM

Dean of College

S. MA. FE D. GERODIAS, RVM

President