TECHNOLOGICAL UNIVERSITY OF THE PHILIPPINES – Taguig

Vision : Be a center of excellence for technology and engineering education in the country.
Mission : Provide continues training, development & advancement of highly qualified & competent technical manpower for national & global socio-economic & industrial growth, progress & prosperity.
To pursue this mission, TUPT shall:
1. develop globally competitive technicians, engineers, and technology-oriented managers; 3. provide quality extension services for the community and industry;
2. conduct researches to support technology & engineering education & existing technical knowledge 4. and implement realistic resource generations

_______________________________________________________________________________________________________________________________________________________________________________________________________
COURSE SYLLABUS
1. Department: Electrical and Allied Department(Computer Engineering Technology/BTIT)
6. Unit Credit/Time: Lecture, 2 unit Lecture
2. Course Code: Comp 213
(__2.5____ hrs/wk; 14 wks/ term)
3. Course Title: Logic Formulation 7. Semester/Term Offered: ___1st____ Term, __2nd____ Year

4. Course Description: 8. Pre-requisite Subject/s: EDP / Comp131

This subject deals with the design of a program using algorithm, pseudocodes and flowcharting. 9. Co-requisite Subject/s: None
Representation of algorithms by flowcharts, representation of algorithms by pseudocodes are discussed.
Discussion on variables, subscripted variables, procedures, functions and introduction to data structure 10. Clientele: Computer Engineering Technology
such stacks, queue , link list are also included.
11. Requirements:
5. Course Objectives:
The requirements of this course and the corresponding
At the end of the of the course, the students shall be able to: inputs into the final grade are as follows:

a. Present the concept of formulating a logic by using algorithm, pseudocodes, and flowcharting. a. Quizzes, seatwork, homework,
Recitation, attendance …………………………….. 30%
b. Formulate their own algorithm, pseudocodes, flowcharting based on a given problem. b. Unit test ………………………………………………… 40%
c. Term test ……………………………………………….. 30%
c. Analyze data structure principle.
TOTAL ………………………………………………………… 100%
d. Simulate program.
12. Grading System: 13. Textbooks/s: None in particular

Ratings in the quizzes/exercises, homework, seatwork, unit tests, term test and other
requirements may be in the 0 – 100% or the 0 – 10 scale, wherein 10 is the highest, 0 is the
lowest and 5 is the minimum passing.

Whatever scale used, all final grades are transmuted to the 1 – 5 scale using the
following conversion, with 1.00 as EXCELLENT and 5.00 as FAILED.

14. References:

Albacea, Eliezer A; Fundamentals of Programming,

3rd edition
Raw Grade Final Grade

0 – 100% Grade 0 – 10 Grade 1 – 5 Equivalent Albacea, Eliezer A; Introduction to Data Structure,

98 – 100 9.8 – 10 1.00 3rd edition
91 – 97 9.1 – 9.7 1.25
85 – 90 8.5 – 9.0 1.5
79 – 84 7.9 – 8.4 1.75
73 – 78 7.3 – 7.8 2.00 15. Date Prepared: October 2009
67 – 72 6.7 – 7.2 2.25
61 – 66 6.1 – 6.6 2.50
55 – 60 5.5 – 6.0 2.75
50 - 54 5.0 – 5.4 3.00
Below 50 Below 5.0 5.00
16. Course Outline:

Week Major Topics/Subtopics Specific Learning Activities/Strategies Materials Evaluation

Objectives Needed Scheme

I. Algorithm Identify different methods to Lecture/Discussion, Computer Quiz

1 represent algorithms. Individual Machine Work Multi-media
1.1 Algorithm Design Recitation Boardmarker
Formulate algorithms for certain Board work
1.2 Specification of Algorithm problems. Seatwrok
Question and Answer
1.3 Example Problems
 II. Flowcharting Quiz
2,3,4,5 2.1 Flowchart Symbols and Understand the concept of Lecture/Discussion, Computer
their meaning flowchart symbols, variables, Individual Machine Work Multi-media
2.2 Variables and Constant constants, accumulator, decision Recitation Boardmarker
2.3 Accumulator making, switches, looping Board work
2.4 Decision making procedures and functions . Seatwork
2.5 Switches Question and Answer
2.6 Looping
2.7 Procedures Apply those concepts in writing a
2.8 Functions flowchart program.
2.9 Representation of
algorithms by flowchart Formulate algorithms in
2.9 Examples of problems and flowcharting.
their flowchart
Implement programs using
flowcharting.

UNIT EXAM UNIT EXAM UNIT EXAM UNIT EXAM UNIT EXAM
 III. Pseudocodes Quiz
6,7,8
3.1 Variables and Understand the concept of Lecture/Discussion, Computer
Constants variables, constants , input and Individual Machine Work Multi-media
3.2 Input/Output output, assignment statement Recitation Boardmarker
Statement and different constructs such as Board work
3.3 Assignment logical, decision and repetitive. Seatwork
Stmt. Question and Answer
3.4 Logical Construct
3.5 Decison Construct Formulate pseudocode programs
3.6 Repetitive Construct based from those concepts.
3.7 Representation of
algorithms by Translate algorithm and flowchart
pseudocode. to pseudocode statement.
3.8 Representation of
flowchart by Use pseudocode program as an
pseudocode alternative to algorithm and
3.9 Examples of flowchart.
problems and their
pseudocodes

UNIT EXAM UNIT EXAM UNIT EXAM UNIT EXAM UNIT EXAM
 IV. Subscripted
9 Variables(Array)
Define subscripted variables in a Lecture/Discussion, Computer
4.1 Single Subscripted program. Individual Machine Work Multi-media
Variables Recitation Boardmarker
Create pseudocode solution Board work
using subscripted variables . Seatwork
Question and Answer

V. Procedures and Functions Quiz

10,11 5.1 Representation of Define procedures and functions. Lecture/Discussion, Computer
procedures by problem an Multi-media
pseudocode. Differentiate procedures and Lecture/Discussion, Boardmarker
5.2 Representation of functions. Individual Machine Work
functions by pseudocode Recitation
5.3 Representation of Implement pseudocodes Board work
subscripted variables by program using procedure, Seatwork
procedures and functions functions and subscripted Question and Answer
5.4 Examples of problems variables.
and their equivalent
pseudocode.

UNIT EXAM UNIT EXAM UNIT EXAM UNIT EXAM UNIT EXAM
 12,13,14 VI. Introduction to Data Quiz
Structure
Identify data structure Lecture/Discussion, Computer
5.1 Stack category such as stack, problem an Multi-media
5.2 Queue queue, and link list. Lecture/Discussion, Boardmarker
5.3 Link list Individual Machine Work
5.4 Examples of problems and Apply those concepts in Recitation
their equivalent stack, formulating pseudocodes Board work
queue, program in a certain Seatwork
link list pseudocode problems. Question and Answer

FINAL EXAM FINAL EXAM FINAL EXAM FINAL EXAM FINAL EXAM

17. Submitted by:

Josephine B. Andong Maracris M. Lappay Mary Jane B. Burce

Faculty / Trainor Faculty / Trainor Faculty / Trainor
18. Noted by:

Dr. Selfa Briones

Department Head

19. Approved by:

Prof. Juan M. Dulaca

Assistant Director for Academic Affairs