Form No.

:
BOHOL ISLAND STATE UNIVERSITY Revision No.:
Candijay Campus Effective Date:
Cogtong, Candijay, Bohol
Related Process:
COURSE SYLLABUS

Course Code : CS 311 Course Credits (Units) : Total :3 Lecture :2 Lab :1

Course Name : Algorithms and Complexity Contact Hours/week : Total :3 Lecture :2 Lab :3
Co/Prerequisite : Data Structures and Algorithms College : College of Technology and Allied Sciences
Component : Professional Courses Department : Department of Computer Science

Course : BSCS 3 Semester, Academic Year : First Semester AY 2021-2022

VISION: A premier Science and Technology university for the formation of a world class and virtuous human resource for sustainable
development in Bohol and the country.

MISSION: BISU is committed to provide quality higher education in the arts and sciences, as well as in the professional and technological fields;
undertake research and development, and extension services for sustainable development of Bohol and the country.

GOALS: 1. Pursue faculty and education excellence and strengthen the current viable curricular programs and develop curricular programs that
are responsive to the demands of the times both in the industry and the environment.
2. Promote quality research outputs that respond to the needs of the local and national communities.
3. Develop communities through responsive extension programs.
4. Adopt efficient and profitable income generating projects/enterprise for self-sustainability.
5. Provide adequate, state-of-the-art and accessible infrastructure support facilities for quality equation.
6. Promote efficient and effective good governance supportive of high quality education.
CORE VALUES: 1. Search for Excellence
2. Responsiveness to Challenges
3. Student Access
4. Public Engagement
5. Good Governance

INSTITUTIONAL GRADUATE ATTRIBUTES:

Innovative and virtuous professionals.
PROGRAM EDUCATIONAL OBJECTIVE (PEO):

PROGRAM OUTCOMES: Per CMO #25, series of 2015

Program Outcomes (PO)

PO1. Articulate and discuss the latest developments in the specific field of practice (PQF level 6 descriptor).

PO2. Effectively communicate orally and in writing using both English and Filipino.

PO3. Work effectively and independently in multi-disciplinary and multi-cultural teams (PQF level 6 descriptor).

PO4. Act in recognition of professional, social, and ethical responsibility.

PO5. Preserve and promote “Filipino historical and cultural heritage” (based on RA 7722).

PO6. Participate in the generation of new knowledge or in research and development projects.

PO7. Apply the competencies to support national, regional, and local development plans (RA 7722).

PO8. Analyze complex problems, and identify and define the computing requirements needed to design an appropriate solution

PO9. Apply computing and other knowledge domains to address real-world problems.

PO10. Design and develop computing solutions using a system-level perspective.

PO11. Utilize modern computing tools.

PO12. 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.

PO13. 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.

PO14. 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.

PO15. Create, select, adapt and apply appropriate techniques, resources and modern computing tools to complex computing activities, with an
understanding of the limitations to accomplish a common goal.

PO16. Function effectively as an individual and as a member or leader in diverse teams and in multidisciplinary settings

PO17. 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.

PO18. 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.

PO19. Recognize the need, and have the ability, to engage in independent learning for continual development as a computing professional.
COURSE OUTCOMES IN RELATION TO PROGRAM OUTCOMES:

Program Outcomes
Course Outcomes (CO) (Legend: I – Introduced, E – Enabled, D – Demonstrated)
At the end of the course, the learners should be able to:
PO10 PO12 PO13 PO17
CO1. Use big O notation formally to give asymptotic upper bounds on time and E
I D E
space complexity of Algorithms.
CO2. Choose and apply the most appropriate algorithm design technique E
(divide and conquer, backtracking, greedy, dynamic programming) for solving D E E
problems
E
CO3. Implement searching, sorting, and graph algorithms. D E E
Legend:
I – Introduced – An introductory course to an outcome; E – Enabled - A course that strengthens the outcome; D – Demonstrated – A course demonstrating
an outcome

This course allows the student to apply advanced techniques in procedural programming to solve computational problems adhering
Course
to the standards and guidelines of documentation. It covers the creation, manipulation and application of user-defined data structures,
Description:
recursion, and file-handling techniques.

Course Learning Objectives Time Teaching and Learning Assessment

Content/Subject Matter Remarks
Outcome (LOs) Frame Activities Task
• Familiarize course learning • Orientation (Course Week 1 • Module reading • Oral
outcomes and classroom Syllabus, VMGO, • Web-based Instruction Participation/
policies Classroom Policies) • Feedbacking/ Forum
Discussion of Content- Discussion
related • Quiz (non-
Issues/Concerns graded)
CO1
• Identify steps in designing and Review of Algorithms Week 2-3 • Module reading/ • Formative
analyzing an algorithm; • Algorithm Design Web-based Instruction Assessments
• Differentiate pseudocode from • Characteristics of • Feedbacking/ • Laboratory
algorithms; Algorithms Discussion of Content- Activity
• Design and specify algorithms • Problem Types related • Summative
for a specific problem; and Issues/Concerns Assessments
 • Determine properties some
specific algorithms have.
Deadline of All Assessments of Pre-lim term and Pre-lim Week 4
Exam Week
CO1 Fundamentals of the Week 5-8 • Module reading/ • Formative
Analysis of Algorithm Web-based Instruction Assessments
• Explain the need for computing Efficiency • Video Demonstration • Laboratory
running time for an algorithm • Analysis Framework • Feedbacking/ Activity
• Describe the steps of analyzing • Asymptomatic Notations Discussion of Content- • Summative
algorithms. and Basic Efficiency related Assessments
• Analyze algorithms using Classes Issues/Concerns • Pre-lim Exam
asymptomatic notations • Mathematical Analysis
of Non-recursive
Algorithms

Deadline of All Assessments of Midterm and Midterm Exam Week Week 9

CO2 & CO3 • Perform brute force and Brute Force and Week 10- • Module reading/ Web- • Formative
exhaustive search techniques in Exhaustive Search 13 based Instruction Assessments
searching and sorting problems • Selection Sort and • Video Demonstration • Summative
• Identify scenarios when brute Bubble Sort Discussion of Content- Assessments
force and exhaustive search are • Exhaustive Search related
appropriate • Depth-First Search and Issues/Concerns
Breadth-First Search

Deadline of All Assessments of Pre-final term and Pre-final Week 14

Exam Week
CO3 Greedy Method Week 15- • Module reading/ Web- • Formative
• Perform greedy techniques in • Basic Terminologies 17 based Instruction Assessments
solving problems. • Tree Traversals • Video Demonstration • Summative
• Identify scenarios when greedy • Binary Search Tree • Discussion of Content- Assessments
algorithms are appropriate related
Issues/Concerns
Deadline of All Assessments of Final Term and Final Exam Week Week 18
Learning Resources: Official textbook:
Levitin, A. (2012). Introduction to the Design & Analysis of Algorithms. Pearson Education, Inc.

Reference textbook and other Resources:

Rosen, K. (2012). Discrete Mathematics and Its Applications. The McGraw-Hill Companies, Inc.
Tutorials Point. Retrieved from https://www.tutorialspoint.com/design_and_analysis_of_algorithms/index.htm

Integration of Values: Patience & Diligence, Responsibility & Commitment, Interpersonal Relation, Effectiveness in doing the task, Self-worth,
Honesty, Honesty, Precision and Accuracy, Time management, Neatness and Orderliness.
Grading System: Components in the midterm and final grade computation include:

50% passing mark/transmutation of raw scores or cumulative related scores

1. Major Examinations - 30%
2. Major Outcome-Based Projects
(product or performance-based outputs) - 30%
3. Class Standing
(formative assessment, laboratory activities, summative assessment & other outputs) - 40%
100%

Final rating is the average of the Midterm & Final Ratings.

(Note: other rubrics/ assessment tools attach in another page)
Classroom Policies ● Academic Integrity
Agreed with students: Cheating is ZERO tolerance. Any cheating evidence will result in a 0 grade for the assignment/exam, and the
incident will be submitted to the department for further review. In the blended learning mode, you may be more
tempted to cheat on our graded assessments to get higher grades in this class. Be reminded that you are studying
in this university and subsidized by the government because the government and your parents hope you will
become relevant in the society by contributing the knowledge and skills you have gained after you graduate.
Cheating in graded activities and pass the course without learning something would only defeat this purpose.

● Work hard
Foremost, students are urged to work hard! This class covers much material in a short amount of time – do not
let yourself get behind. Work hard, and keep up the pace! As a corollary to working hard, please feel free to ask
the instructor questions. With hard work, perseverance and resourcefulness, I believe you will be able to finish
this course with flying colors. I know that this course is going to be challenging, but never give up! Persevere!
 ● Work hard
Foremost, students are urged to work hard! This class covers much material in a short amount of time – do not
let yourself get behind. Work hard, and keep up the pace! As a corollary to working hard, please feel free to ask
the instructor questions. With hard work, perseverance and resourcefulness, I believe you will be able to finish
this course with flying colors. I know that this course is going to be challenging, but never give up! Persevere!

● Ask Questions and do exercises.

It is the students' responsibility to make sure to ask questions if they do not understand all the modules and other
materials. I will answer your queries as much as I can to help you know, especially during feedbacking sessions.
o Read your module
o Answer your formative and summative assessments independently.

● Communication
Feel free to contact me through FB page (m.me/MamAlmaMae) or email (almamae.bernales@bisu.edu.ph) if
you have questions regarding our lessons and our requirements. If you have not internet connection at home,
you may contact me through SMS (0977 473 9197). I will also use these communication lines when there are
changes to our learning schedule.

Designed by: Reviewed by: Approved by:

ALMA MAE B. AUXTERO EVANGELINE N. OLANDRIA ARLINDA N. RAMASOLA, Ph.D.

Faculty Chairperson, BSCS Dean, CTAS
Rubrics for Assessing Formative Assessments (per unit)

Indicators
Criteria
Very Satisfactory Satisfactory Fair Needs Improvement
Submits on or before due
1. Promptness 1 – 2 days late (3-4) 3 – 5 days late (1-2) More than 5 days late (0)
date (5)
2. Content Completeness Complete but with minor Complete but with major Incomplete with major
Complete and accurate (8-10)
and Accuracy errors (5-7) errors (2-4) errors (0-1)

Rubrics for Programming Activity

Easy - Highest score is 20 (20*1).

Moderate - Highest score is 40 (20*2).
Difficult - Highest score is 60 (20*3).
Very Difficult - Highest score is 80 (20*4).

Program (20 (Excellent) (Good) (Fair) (Poor)

pts)
Program Program executes correctly Program executes with a Program executes with many runtime Program does
execution with no syntax or runtime minor (easily fixed error) (3-4) errors (2) not execute (0-
5 errors (5) 1)
Correct Program displays correct Output has minor errors (3-4) Output has multiple errors (2) Output is
output output with no errors (5) incorrect (0-1)
5
Design of Program is logically well Program has slight logic errors that Program has significant logic errors Program is
logic designed (5) do not significantly affect the results (2) incorrect (0-1)
5 (3-4)
Standards Program is stylistically well Few inappropriate design choices Several inappropriate design choices Program is
5 designed (5) (i.e. poor variable names, improper (i.e. poor variable names, improper poorly written
indentation) (3-4) indentation) (2) (0-1)
Reference: http://csc.columbusstate.edu/summers/NOTES/1301/Grading-Rubric-Programs.htm