BINANGONAN CATHOLIC COLLEGE

Information Technology Department

COURSE SYLLABUS

Course Title: Data Structures & Algorithms

Course Code: IT113C

Credit Units: 3 units

Contact Hours: 5 hours per week (2 hours’ lecture, 3 hours’ laboratory)

Course 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. A thorough discussion of sorting and searching algorithms and hashing is covered.
Prerequisite: NONE

Placement: First Year

Program Educational Objectives (PEO):

Three to five years after completing the Information Technology program, the graduates will:

1. Excel in their profession/career utilizing the knowledge acquired in the Information Technology courses;
2. Become effective collaborators and innovators in information technology, applying professional/technical skills and competencies to
make a positive impact on society; and
3. Be engaged in life-long learning and professional development through self-study, continuing education, or graduate and professional
studies.

Student Outcomes (SO):

After the completion of the program, the graduates of the program shall be able to:
a . Apply knowledge of mathematics, sciences, and engineering sciences to the practice of electronics engineering;

b . Understand best practices and standards and their applications;

c . Analyze complex problems and identify and define the computing requirements appropriate to their solution;
d . Identify and analyze user needs and take them into account in the selection, creation, evaluation and administration of
computer-based systems;
e Design, implement and evaluate computer-based systems, processes, components or programs to meet desired needs and
requirements under various constraints;
 f Integrate it-based solutions into the outer environment effectively;
g Apply knowledge through the use of current techniques, skills, tools and practices necessary for the it position;
h Function effectively as a member or leader of a development team recognizing the different roles within a team to accomplish
a common goal;
i Assist in the creation of effective it project plans;
j Communicate effectively with the computing community and with society at large about complex computing activities through
logical writing, presentations, and clear instructions;
k Describe relationships between system services and application software
Compare and contrast different design considerations for major OS components
l Analyze the local and global impact of computing information technology on individuals, organizations, and society;
m Understand professional, ethical, legal, security and social issues and responsibilities in the utilization of information
technology; and
n Recognize the need for engaging in self-learning and improving performance as a foundation for continuing professional
development.

Course Learning Outcomes (CLO):

At the end of this course, the students shall be able to:

CLO 1 - Achieve an understanding of fundamental data structures and algorithms and the tradeoffs between different implementations of
these abstractions
CLO 2 - Work with procedural and object-oriented aspects of the Java language.
CLO 3 - Develop sound techniques on designing, developing, and documenting well-structured programs using proper software
engineering principles.
- Describe and implement common data structures--lists, stacks, queues, graphs, and trees--for solving complex programming
problems.

CLO Grid: Each CLO vis-à-vis SO and PEO

CLO SO PEO
CLO1 a, 1
CLO2 a, b, c 1, 2
CLO3 a, b, c, d, e 1,2,3

Course Outline:

Time Topic/Content Course Teaching /Learning Assessment Evaluation

 Learning
Frame Activity
Outcome

Week 1 Orientation of the OBE syllabus CLO1, Faculty-facilitated discussion Assignment 1 100% participation in
5 hr of the course (WW 1.1) the discussion
Assignment (Real-life
1.0 Introduction CLO2 application of Algorithms) Lab Exercise
1.1 Data Types (PT1.1)
1.2 Data Structures
1.3 Algorithms
1.4 Program Development
Life Cycle

Week 2 1.5 Time Complexity CLO2 Faculty-facilitated discussion Lab Exercise

5 hr 1.6 Operation Count (PT1.2)

CLO1 Seat work on recursion Seatwork At least 60% of the

(WW1.2) students got a rating of
> 3.0 on seatwork

Quiz 1 Score of 10/20 quiz ≥

(WW1.3) 75% in quiz 1

Week 3 2.0 Arrays CLO1 Visual activity Assignment 100% participation in

5 hr 2.1 Data Types (ppt. presentation) (WW 2.1) the discussion
2.2 Array Terminologies At least 60% of the
2.3 Array Addressing Assignment (Real-life Seatwork students got a rating of
CLO2 application of Arrays) (WW 2.2) > 3.0 on seatwork

Lab
Teacher follow-up activity Exercise
(answer guide questions) (PT2.1)

Week 4-5 3.0 Stacks CLO1 Visual activity Assignment Rating ≥ 3/5-point scale
10 hr 3.1 The Stack ADT (ppt. presentation) (WW 2.3) on the answers to the
3.2 Application of Stacks guide questions
3.3 Array-based Assignment (Real-life
Implementation application of Stacks) Seatwork At least 60% of the
3.4 Evaluation of (WW 2.4) students got a rating of
Expression Teacher follow-up activity > 3.0 on seatwork
CLO2 (answer guide questions) Lab
 Seat work solving problems) Exercise
(PT2.2)

Quiz 2 Score of 10/20 quiz≥ 75%

(WW 2.5) in quiz 2

CLO3 Problem Set

(P1)
At least 50% of the
Week 6 PRELIMINARY EXAMINATION students got a rating of
5 hr > 3.5

Week 7 4.0 Queues CLO1, CLO2 Visual activity Assignment Rating ≥ 3/5-point scale
5 hr 4.1 The Queue ADT (ppt. presentation) (WW 3.1) on the answers to the
4.2 Application of Queues guide questions
4.3 Array-based Assignment (Real-life
Implementation application of Queues) Seatwork At least 60% of the
4.4 The Queue Interface (WW 3.2) students got a rating of
Teacher follow-up activity > 3.0 on seatwork
(answer guide questions) Lab
Seat work solving problems) Exercise
(PT3.1)

Score of 10/20 quiz≥ 75%

Week 8 Visual activity Quiz 2 in quiz 1
5 hr 4.5 Heaps / Priority Queues CLO1, CLO2 (ppt. presentation) (WW 3.3)

Teacher follow-up activity Lab

(answer guide questions) Exercise
Seat work solving problems) (PT3.2)

Visual activity Assignment Rating ≥ 3/5-point scale

Week 9 5.0 Trees CLO1, CLO2 (ppt. presentation) (WW 4.1) on the answers to the
5 hr 5.1 Trees guide questions
5.2 Binary Trees Assignment (Real-life
application of Trees) Seatwork At least 60% of the
(WW 4.2) students got a rating of
Teacher follow-up activity > 3.0 on seatwork
(answer guide questions) Lab
Seat work solving problems) Exercise
 (PT4.1)

Week 5.3 Binary Search Trees CLO1, CLO2, Visual activity Assignment Rating ≥ 3/5-point scale
10-11 5.4 AVL Trees CLO3 (ppt. presentation) (WW 4.3) on the answers to the
5.5 M-Way Search Trees guide questions
Assignment (Real-life
application of BT) Seatwork At least 60% of the
(WW 4.4) students got a rating of
Teacher follow-up activity > 3.0 on seatwork
(answer guide questions) Lab
Seat work solving problems) Exercise
(PT4.2)

Quiz Score of 10/20 quiz≥ 75%

(WW 4.5) in quiz 2

Problem Set
(P3)
At least 50% of the
Week 12 Midterm Examination students got a rating of
5 hr > 3.5

Week 13 6.0 Graphs CLO1, CLO2 Visual activity Assignment Rating ≥ 3/5-point scale
5 hr 6.1 Terminologies (ppt. presentation) (WW 5.1) on the answers to the
6.2 Graph Representation guide questions
Assignment (Real-life
application of Graphs) Seatwork At least 60% of the
(WW 5.2) students got a rating of
Teacher follow-up activity > 3.0 on seatwork
(answer guide questions) Lab
Seat work solving problems) Exercise
(PT5.3)

Week 14 6.3 Graph Traversals CLO1, CLO2 Visual activity Seatwork At least 60% of the
5 hr 6.4 Spanning Trees (ppt. presentation) (WW 5.4) students got a rating of
> 3.0 on seatwork
Assignment (Real-life Lab
application of Hashing) Exercise
(PT5.2)
Teacher follow-up activity
(answer guide questions) Quiz Score of 10/20 quiz≥ 75%
Seat work solving problems) (WW 5.5) in quiz 2
Week15 7.0 Sorting CLO1, CLO2 Visual activity Assignment Rating ≥ 3/5-point scale
5 hr 7.1 Fundamentals of (ppt. presentation) (WW 6.1) on the answers to the
Sorting guide questions
7.2 Sorting Algorithms Assignment (Real-life
application of Sorting) Seatwork At least 60% of the
(WW 6.2) students got a rating of
Teacher follow-up activity > 3.0 on seatwork
(answer guide questions) Lab
Seat work solving problems) Exercise
(PT6.1)

Week 16- 8.0 File Organization CLO1, CLO2, Visual activity Assignment 100% participation in
17 8.1 Introduction to Files CLO3 (ppt. presentation) (WW 6.3) the discussion
8.2 File Processing
10 hr 8.3 Sequential File Assignment (Real-life At least 60% of the
Organization application of Graphs) Seatwork students got a rating of
8.4 Random File (WW 6.4) > 3.0 on seatwork
Organization Teacher follow-up activity
(answer guide questions) Lab
Seat work solving problems) Exercise
(PT6.2)
Score of 10/20 quiz≥ 75%
Quiz in quiz 2
(WW 6.5)

Problem Set
(P3)
At least 60% of the
Week 18 Final Examination students got a rating of
> 3.5

Course Requirements:
Attendance
Passing scores in quizzes and term exams
Participation in teaching/learning activities
Completion of Laboratory Exercises
Grading System:
Prelim Term Grade 30%
Class Standing
WW 20%
PT 25%
P 25%

First Prelim Exam 30%

Mid Term Grade 30%

Class Standing
WW 20%
PT 25%
P 25%

Midterm Exam 30%

Final Term Grade 40%

Class Standing
WW 20%
PT 25%
P 25%

Final Exam 30%

Final Grade 100%

Textbook Adopted:
Fox, C., Java Data Structures and Algorithm, Bookboon.com, 2018

References:
Malik, D. S., C ++ programming : program design including data structures /, Cengage Learning Asia Pte Ltd., 2014
Mueller, John Paul , Algorithms for dummies /, Wiley, 2017
Louridas, Paros, Real-world algorithms : a beginner's guide /, MIT Press, 2017
Drozdek, Adam, Data structures and algorithms in C++ /, Cengage Learning, 2013
(Online) Python Data Structures and Algorithms, tutorialspoint.com

Prepared by: Recommending Approval: Approved by:

MR. RAYMOND A. RAMIREZ Engr. HERBERT SEMANA MR. LUISITO L. SUINAN, Lpt. MaEd
Faculty Member Chairperson, BSIT ACT Dean