COLEGIO DE STA.

TERESA DE AVILA
Document No. SIT-SYL-002
Issue No. 01
6 Kingfisher and Skylark Streets, Zabarte Subdivision, Novaliches, Quezon City
Revision No. 00

SCHOOL OF INFORMATION TECHNOLOGY Date of Affectivity June 2018

Outcomes-Based Teaching And Learning Plan Page |1

CSTA commits itself towards the attainment of true education geared towards the
formation of the human person who is guided in his pursuit of his ultimate end for
CSTA MISSION
the good of the society of which, as man, he is a member, and in whose obligation as
an adult, he will share.
CSTA envisions citizenry whose physical, moral and intellectual endowments have
been harmoniously developed so that they may gradually acquire a mature sense of
CSTA VISION
responsibility while striving to form their own lives and pursuing true freedom as
they face the vicissitudes of life with courage and constancy.
Program Learning Outcomes  Apply knowledge of computing fundamentals, knowledge of a computing
specialization, and mathematics, science and domain knowledge appropriate for
the computing specialization to the abstraction and conceptualization of
computing models from defined problems and requirements
 Identify, analyze, formulate, research literature and solve complex computing
problems and requirements reaching substantiated conclusions using
fundamental principles of mathematics, computing sciences, and relevant
domain disciplines
 An ability to apply mathematical foundations, algorithmic principles and
computer science theory in the modeling and design of computer-based systems
in a way that demonstrates comprehension of the tradeoffs involved in design
choices
 Knowledge and understanding of information security issues in relation to the
design, development and use of information systems
 Design and evaluate solutions for complex computing problems and design and
evaluate systems, components, or processes that meet specified needs with
appropriate consideration for public health and safety, cultural, societal, and
environmental considerations
 Create, select, adapt and apply appropriate techniques, resources, an modern
computing activities, with an understanding of the limitations to accomplish a
common goal
 Function effectively as an individual and as a member or leader in diverse teams
and in multidisciplinary settings
 Communicate effectively with the computing community and with society at
large about complex computing activities by being able to comprehend and write
effective reports, design documentation, make effective presentations, and give
and understand clear instructions
 The ability to recognize the legal, social, ethical and professional issues involved
in the utilization of computer technology and be guided by the adoption of
appropriate professional, ethical and legal practices
 Recognize the need, and have the ability, to engage in independent learning for
continual development as a computing professional
Course Code DASTRUCT
Descriptive Title Data Structure and Algorithms
Description The course covers the standard data representation and algorithms to solve
computing problems efficiently (with respect to space requirements and time
complexity of algorithm). This covers the following: stacks, queues, trees, graphs,
maps and sets. Thorough discussion of sorting and searching algorithms and hashing
is covered.
 COLEGIO DE STA. TERESA DE AVILA
Document No. SIT-SYL-002
Issue No. 01
6 Kingfisher and Skylark Streets, Zabarte Subdivision, Novaliches, Quezon City
Revision No. 00

SCHOOL OF INFORMATION TECHNOLOGY Date of Affectivity June 2018

Outcomes-Based Teaching And Learning Plan Page |2

Program to which it contributes Bachelor of Science in Information Technology

Credit units 3 Units (2units lecture, 1 unit laboratory)
Hours per Week Lecture : 2 hours Laboratory : 3 hours
Course Intended Outcome By the end of the course, students should be able to:

LO1.Design, implement, test and debug a program, based on a given specification,

that uses and implements abstract data types (stacks, queues, priority queues, sets,
maps)
LO2.Argue strengths and weaknesses among multiple implementations for a
problem (i.e., on the aspects of iterative vs. recursive solutions and on the aspects of
abstraction, encapsulation, and information hiding)
COURSE OUTLINE AND TIMEFRAME
Week Topic
Weeks 1 - 2 Understand what sequential, parallel, and distributed algorithms are

Weeks 3 - 4 Explain what greedy algorithms, dynamic programming and divide and conquer
algorithms are

Week 5 PRELIMINARY EXAMINATION

Weeks 6 - 7 Determine the best, average and worst case behaviors of an algorithm

Week 8 Compare and contrast multiple algorithms to solve the same problem

Week 9 MIDTERM EXAMINATION

Weeks 10 - 11 Select the most efficient data structure and algorithm for performing a task such as
sorting

Week 12 Implement various algorithms and data structures

Week 13 Apply the knowledge of graphs in network modelling and simulation

Week 14 PRE-FINALS
Weeks 15 - 17 Understand the NP-complete problem

Week 18 FINAL EXAM

TEXTBOOKS AND REFERENCES
References Michael T. Goodrich and Roberto Tamassia Wiley (2014). Data Structures and
Algorithms in Java
Michael T. Goodrich, Roberto Tamassia and David Mount (2014). Wiley. Data
Structures and Algorithms in C++
Drozdek, Adam. (2007). Data Structures and Algorithm in Java, 2nd ed. Course
Technology
Other Suggested Reading
Course Requirements As evidence of attaining the above learning outcomes, students are required to do
and submit the following during the indicated dates of the term. The rubrics for these
outputs are provided.
 COLEGIO DE STA. TERESA DE AVILA
Document No. SIT-SYL-002
Issue No. 01
6 Kingfisher and Skylark Streets, Zabarte Subdivision, Novaliches, Quezon City
Revision No. 00

SCHOOL OF INFORMATION TECHNOLOGY Date of Affectivity June 2018

Outcomes-Based Teaching And Learning Plan Page |3

Major Course Output

As evidence of attaining the above learning outcomes, students are required to do and submit the following during
the indicated dates of the term. The rubrics for these outputs are provided.

Learning
Required Output Due Date
Outcome
LO 1 MC01: Documented programming activities measuring the ability of the Before Midterm Exam
LO 2 students in designing, implementing, testing and debugging a program
based on a given specification that uses and implements abstract data
types
LO 3 MC02:Documented programming activities applying analysis of Before Final Exam
programming using iterative and recursive solutions and on the aspects of
abstractions, encapsulation and information hiding

OUTCOMES-BASED TEACHING-LEARNING PLAN

Class Schedule Teaching and Learning
LO Topics and Readings
(Weeks) Activities
LO 1 Understand what sequential, parallel, and distributed Weeks 1-2 Lecture and Classroom
algorithms are Discussions
Programming
Demonstrations
Guided Hands-on
Programming Sessions
Guided Design and
Development of Project
Specifications
Independent Programming
Assignments such as
Machine Problems
LO 1 Explain what greedy algorithms, dynamic Weeks 3-4 Lecture and Classroom
programming and divide and conquer algorithms are Discussions
Programming
Demonstrations
Guided Hands-on
Programming Sessions
Guided Design and
Development of Project
Specifications
Independent
Programming
Assignments such as
Machine Problems
PRELIM EXAMINATION Week 5
 COLEGIO DE STA. TERESA DE AVILA
Document No. SIT-SYL-002
Issue No. 01
6 Kingfisher and Skylark Streets, Zabarte Subdivision, Novaliches, Quezon City
Revision No. 00

SCHOOL OF INFORMATION TECHNOLOGY Date of Affectivity June 2018

Outcomes-Based Teaching And Learning Plan Page |4

LO 1 Determine the best, average and worst case behaviors Weeks 6-7 Lecture and Classroom
of an algorithm Discussions
Programming
Demonstrations
Guided Hands-on
Programming Sessions
Guided Design and
Development of Project
Specifications
Independent Programming
Assignments such as
Machine Problems
LO 1 Compare and contrast multiple algorithms to solve Week 8 Lecture and Classroom
LO 2 the same problem Discussions
Programming
Demonstrations
Guided Hands-on
Programming Sessions
Guided Design and
Development of Project
Specifications
Independent Programming
Assignments such as
Machine Problems
MIDTERM EXAMINATION Weeks 9
LO 1 Select the most efficient data structure and algorithm Weeks 10-11 Lecture and Classroom
LO 2 for performing a task such as sorting Discussions
Programming
Demonstrations
Guided Hands-on
Programming Sessions
Guided Design and
Development of Project
Specifications
Independent Programming
Assignments such as
Machine Problems
LO 1 Implement various algorithms and data structures Week 12 Lecture and Classroom
LO 2 Discussions
Programming
Demonstrations
Guided Hands-on
Programming Sessions
Guided Design and
Development of Project
Specifications
Independent Programming
Assignments such as
Machine Problems
 COLEGIO DE STA. TERESA DE AVILA
Document No. SIT-SYL-002
Issue No. 01
6 Kingfisher and Skylark Streets, Zabarte Subdivision, Novaliches, Quezon City
Revision No. 00

SCHOOL OF INFORMATION TECHNOLOGY Date of Affectivity June 2018

Outcomes-Based Teaching And Learning Plan Page |5

LO 1 Apply the knowledge of graphs in network modelling Week 13 Lecture and Classroom
LO 2 and simulation Discussions
LO 3 Programming
Demonstrations
Guided Hands-on
Programming Sessions
Guided Design and
Development of Project
Specifications
Independent Programming
Assignments such as
Machine Problems
PRE-FINAL EXAMINATION Week 14
LO 2 Understand the NP-complete problem Weeks 15-17 Lecture and Classroom
LO 3 Discussions
Programming
Demonstrations
Guided Hands-on
Programming Sessions
Guided Design and
Development of Project
Specifications
Independent Programming
Assignments such as
Machine Problems
FINAL EXAMINATION Week 18

OTHER REQUIREMENTS AND ASSESSMENTS:

Aside from the major course outputs above, this course has four other summative assessment, preliminary, midterm,
semi-final and final examinations. Graded class activities include recitation, seatwork, assignments and reports.

GRADING SYSTEM
To pass this course, one must accumulate 75% of the total course requirements below.

Performance 30%
(Quizzes, Board Work, Recitation)
Output 30%
Assignments, Projects, Research, Reports, Experiment, Simulation, Hands-on Activities
Major Exam (Prelim, Midterm, Semi-Final, Finals) 30%
Attendance 10%
Total 100%
 COLEGIO DE STA. TERESA DE AVILA
Document No. SIT-SYL-002
Issue No. 01
6 Kingfisher and Skylark Streets, Zabarte Subdivision, Novaliches, Quezon City
Revision No. 00

SCHOOL OF INFORMATION TECHNOLOGY Date of Affectivity June 2018

Outcomes-Based Teaching And Learning Plan Page |6

PERFORMANCE INDICATOR
Rubrics for Case Report

4 – Excellent 3 – Very Satisfactory 2 – Satisfactory 1 – Poor 0 - No

Criteria output

Clearly and Clearly states the paper’s States the paper’s Incomplete and/or No
concisely states the purpose. The purpose. The unfocused. There is output
paper’s purpose. introduction states the introduction states the no clear
The introduction is main topic and previews main topic but does not introduction or main
Introduction engaging, states the the structure of the paper. adequately preview the topic and the
main topic and structure of the paper. structure of the
previews the paper is missing.
structure of the
paper.
Each paragraph has Each paragraph has Each paragraph lacks Each paragraph fails No
thoughtful sufficient supporting supporting detail to develop the main output
supporting detail detail sentences that sentences. Logical idea. No evidence
sentences that develop the main idea. organization; of structure or
develop the main Paragraph development organization of ideas organization.
idea. Writer present but not perfected. not fully developed.
Body and
demonstrates
Content
logical sequencing
of ideas through
well-developed
paragraphs;
transitions are used
to enhance
organization.
The conclusion is The conclusion restates The conclusion does Incomplete and/or No
engaging and the thesis. Conclusions not adequately restate unfocused. Little output
restates the thesis. are supported by the the thesis. Some indication of
Conclusion Conclusions are paper. conclusions are not synthesis or
strongly supported supported by the paper. drawing of
by the paper. conclusions.
 COLEGIO DE STA. TERESA DE AVILA
Document No. SIT-SYL-002
Issue No. 01
6 Kingfisher and Skylark Streets, Zabarte Subdivision, Novaliches, Quezon City
Revision No. 00

SCHOOL OF INFORMATION TECHNOLOGY Date of Affectivity June 2018

Outcomes-Based Teaching And Learning Plan Page |7

No errors in Almost no errors in Many errors in Numerous errors in No

punctuation, punctuation, punctuation, punctuation, output
capitalization and capitalization and capitalization and capitalization and
Mechanics spelling. No errors spelling. Almost no spelling. Many errors spelling. Numerous
and in sentence errors in sentence in sentence structure errors in sentence
Usage structure and word structure and word usage and word usage. structure and word
usage. usage.

All cited works are Some cited works are Few cited works are Absent. Includes No
noted in the correct noted in the correct presented in the correct few proper output
format with no format. Inconsistencies format. The paper references, such as
Citation and errors. The paper evident. The paper includes, if applicable, journal articles
Bibliography includes, if includes, if applicable, less than the minimum and/or books.
applicable, more the minimum specified specified number of
than the specified number of proper proper references, such
number of proper references, such as as journal articles
references, such as journal articles and/or and/or books.
journal articles books.
and/or books.

COURSE POLICIES AND STANDARDS

Expectations from Student:

The student’s responsibility is to come to each class prepared. S/he is also expected to take all examinations on the
date scheduled. S/he should read the assigned problems prior to class. S/he is expected to attend each class and participate
actively in the discussions.

Academic Dishonesty

All students are expected to be academically honest. Cheating, lying and other of unethical behaviour will not be
tolerated. Any student found guilty in examinations or plagiarism in submitted course requirements will receive an F or
failure in the course requirement or in the course. Plagiarism refers to the use of books, notes or other intellectual property
without giving proper attribution to its author, or representing the work of another person as one’s own. Cheating refers to
securing help in a test; copying tests, assignments, reports or term papers; collaborating with other students during an
examination or in preparing academic work; signing other student’s name on an attendance sheet; or otherwise practicing
scholastic dishonesty.

Policy on Absences

The allowed number of absences for students enrolled in a 1 ½ hours class is 7. Request for excused absences or
waiver of absences must be presented upon reporting back to class. Special examinations will be allowed only in special
cases, such as prolonged illness. It is the responsibility of the student to monitor his/her own tardy incidents and absences that
 COLEGIO DE STA. TERESA DE AVILA
Document No. SIT-SYL-002
Issue No. 01
6 Kingfisher and Skylark Streets, Zabarte Subdivision, Novaliches, Quezon City
Revision No. 00

SCHOOL OF INFORMATION TECHNOLOGY Date of Affectivity June 2018

Outcomes-Based Teaching And Learning Plan Page |8

might accumulate leading to a grade of Drop without Permission or has a numeric equivalent of 5.0. It is her/his
responsibility to consult with the teacher, chair or dean should his/her case be of special nature.

EFFECTIVITY AND REVISION INFORMATION

Date Revised: March 1, 2017 Date Implemented: June 2018

Prepared by: Reviewed by:

______________________________ HAROLD R. LUCERO, MIT

Instructor Dean, School of Information Technology