Tomas Del Rosario College

Capitol Drive, San Jose, City of Balanga

Telefax: (047) 791-6152; Tel No: (047) 791-6082

COMPUTER SCIENCE DEPARTMENT

COURSE TITLE : DATA STRUCTURES AND ALGORITHM ANALYSIS

COURSE CODE : CS212

CREDIT UNITS : 3 UNITS

COURSE PREREQUISITE/CO-REQUISITE: COMPUTER PROGRAMMING 2

COURSE DESCRIPTION:

The course deals with the Hierarchy of Operations in programming and algorithms. Linear data structures such as arrays, queries, linked lists, and nonlinear data
structure such as generalized list, trees and graphs, and operations on these structures using algorithm. Analysis and design of nonnumeric algorithms
acting on data structures. Sorting, searching, merging, complexity, hashing, dynamic storage allocation, garbage collection and compaction.

COURSE INTENDED OUTCOMES (CILOs)

After completing this course, students should be able to:
1. Demonstrate an understanding of basic data structures and algorithms.
2. Apply algorithms for searching and sorting.
3. Write recursive algorithms.
4. Demonstrate understanding on efficiency of data structures and algorithm and apply analysis to select best tools for solving problems.
 Tomas Del Rosario College
Capitol Drive, San Jose, City of Balanga
Telefax: (047) 791-6152; Tel No: (047) 791-6082

PRELIMINARY PERIOD
TIME
INTENTED LEARNING TEACHING/LEARNING ASSESSMENT TASKS
ALLOTMENT CONTENT STANDARDS CONTENT/TOPIC
OUTCOMES (ILOs) ACTIVITIES (TLAs) (ATs)
(Week)
WEEK 1 Data Structures and Algorithm Describe time-complexity Teacher: Written Short Quiz
(Aug. 22 - 28) Complexity issues among algorithms. Instruction Leading (Essay)
 Data Structure Overview Discussion
 Algorithm Basic
 Asymptotic Analysis Learner:
Recitation

WEEK 2  Pointer Use and implement Array. Instructor: Written Short Quiz
(Aug. 29 –  Array Provide lesson exercise with (Essay)
Sep.04) sample solution discussion.
Analyze algorithms to determine
Graded Laboratory
running time and order.
Learner: Exercise (Solving
Laboratory Exercises Machine Problem)

WEEK 3  Linked List Describe algorithms for Teacher: Written Short Quiz
(Sept. 05 – manipulating singly, Instruction Leading (Essay)
Sep. 12) doubly and circular linked Discussion
list.
Learner:
Answer Worksheet

WEEK 4 Demonstrate manipulating stacks Stacks and Queues Use and implement stacks Written Short Quiz
(Sep 13- 20) and queues using algorithm.  Stacks and queues. (Essay)
 Queues
 Array and Linked List Graded Laboratory
implementation. Exercise (Solving
 Tomas Del Rosario College
Capitol Drive, San Jose, City of Balanga
Telefax: (047) 791-6152; Tel No: (047) 791-6082

WEEK 5 Machine Problem)

(Sept. 21 -
27)
WEEK 6
PRELIMINARY EXAMINATION
(Sep 28 - 30)

MIDTERM PERIOD
WEEK 7 Unfold the recursive program by Recursion Create the stack frames Teacher: Written Short Quiz
(Oct. 1 - 7) coding it non-recursively  Analysis of Recursion for a recursive program Instruction Leading (Essay)
-  Tower of Hanoi Discussion
WEEK 8  Fibonacci Series Graded Laboratory
(Oct. 8 - 14) Learner: Exercise (Solving
Answer Worksheet Machine Problem)

Instructor:
Provide lesson exercise with
sample solution discussion.

Learner:
Laboratory Exercises

WEEK 9 Describe the algorithms for tree Tree Define the algorithm use Teacher: Written Short Quiz
(Oct 15 - 21) traversal.  Tree Structure for tree traversal, Instruction Leading (Essay)
 Tree Traversal insertions and deletions. Discussion

Learner:
Answer Worksheet

WEEK 10 Demonstrate the use tree  Binary Search Tree Use and implement tree Teacher: Written Short Quiz
 Tomas Del Rosario College
Capitol Drive, San Jose, City of Balanga
Telefax: (047) 791-6152; Tel No: (047) 791-6082

(Oct 21 - 27) traversal, Binary Search Tree and  AVL Tree traversal, Binary Search Instruction Leading (Algorithm Writing)
- Heap or Priority Queues  Spanning Tree Tree and Heap or Priority Discussion
WEEK 11  Heap Queues Graded Laboratory
(Oct 28 – Learner: Exercise (Solving
Nov 3) Answer Worksheet Machine Problem)

- Instructor:
WEEK 12 Provide lesson exercise with
(Nov 4-09) sample solution discussion.

Learner:
Laboratory Exercises
WEEK 13
(Nov. 10 - MIDTERM EXAMINATION
11)

FINALS PERIOD
WEEK 14 Describe the algorithms for Searching Techniques Implement and use Teacher: Written Short Quiz
(Nov. 12 - searching and hash.  Linear Search different searching Instruction Leading (Algorithm Simulation)
17)  Binary Search techniques Discussion
-  Interpolation Search Graded Laboratory
 Hash Table Learner: Exercise (Solving
WEEK 15 Answer Worksheet Machine Problem)
(Nov. 17 -
23)
Instructor:
Provide lesson exercise with
sample solution discussion.

Learner:
Guided Laboratory Exercises
 Tomas Del Rosario College
Capitol Drive, San Jose, City of Balanga
Telefax: (047) 791-6152; Tel No: (047) 791-6082

WEEK 16 Analyze sorting algorithms to Sorting Techniques Implement and compare Teacher: Written Short Quiz
(Nov. 24 - determine their running time.  Bubble Sort different sorting Instruction Leading (Algorithm Simulation)
30)  Heap Sort algorithms. Discussion
-  Insertion Sort Graded Laboratory
WEEK 17  Selection Sort Learner: Exercise (Solving
(Nov 31 -  Merge Sort Answer Worksheet Machine Problem)
Dec 06)  Radix Sort
-  Shell Sort Instructor:
WEEK 18  Quick Sort Provide lesson exercise with
( Dec 07-13) sample solution discussion.

- Learner:
WEEK 19 Laboratory Exercises
( Dec 14-21)
WEEK 19
(Jan. 12 - FINALS EXAMINATION
13)
 Tomas Del Rosario College
Capitol Drive, San Jose, City of Balanga
Telefax: (047) 791-6152; Tel No: (047) 791-6082

TOMAS DEL ROSARIO COLLEGE

Vision : Truth and Goodness in Man and for all others through Education

Mission : Produce through responsive curriculum, morally upright, committed and competent graduates capable of meeting the growing human resources needs in
the profession, government, business, industry and home.

Core Values : To realize the vision and mission of the College, the administrative staff, faculty members, support personnel, students and stakeholders commit to live by
the following core: Love of God, Altruism, Integrity, Self – Reliance, Hard Work, Social Concern, Competence and Committed

COMPUTER SCIENCE DEPARTMENT

Vision : Truth and Goodness in Man and for all others through Education

Mission : Produce through responsive curriculum, morally upright, committed and competent graduates capable of meeting the growing human resources needs in
the profession, government, business, industry and home.

Objectives : The goal of the Computer Science department is to develop experts in information technology and information management, the department aims to
prepare students for their career as I.T. professionals and become tomorrow’s leaders and achievers in the industry, the academe and the government. It
also aims to consistently provide the students with the most progressive, updated, relevant and well-rounded academic programs, supporting their
learning through the availability of advanced and extensive resources.

BACHELOR OF SCIENCE IN COMPUTER SCIENCE

Program Outcomes:  To produce graduates suited to the manpower requirements of present day society.
 To foster students’ competence and adaptability in managing information resources and in utilizing technology.
 Tomas Del Rosario College
Capitol Drive, San Jose, City of Balanga
Telefax: (047) 791-6152; Tel No: (047) 791-6082

 To equip the students with core computer and technological competencies and skills, allowing them to pursue careers in any area in the field of
computing and information technologies.
 To effectively provide students with the knowledge on computer based solutions to problems encountered in business, school, government and other
institution’s operations.
 To provide students with a curriculum that would equip them with the life long skills and enrich their creativity and intelligence.
 To provide quality instruction in the field of information technology and management.
 To help students develop professional attitudes and work ethics.
 To provide students with faculty members who possess the proficiency, competence and values to fulfill the roles of teachers and professionals.
 To prepare the students for subsequent graduate level studies.
 To provide a cultural foundation which will enable the students to translate their awareness of economic and social problems into a dynamic
participation in their local community and to professional groups as mature, thinking and responsible individuals.

REFERENCES:
 Downey, Allen B., Think Data Structures: Algorithms and Information Retrieval in Java, e-book retrieved from http://greenteapress.com/thinkdast/thinkdast.pdf
 Goodrich, Michael T. and Tamassia, Roberto, Data Structures & Algorithms in Java 4th Edition, e-book retrieved from
https://enos.itcollege.ee/~jpoial/algorithms/GT/Data%20Structures%20and%20Algorithms%20in%20Java%20Fourth%20Edition.pdf
 Lafore, Robert, Data Structures & Algorithms in Java 2 nd Edition, e-book retrieved from https://everythingcomputerscience.com/books/schoolboek-
data_structures_and_algorithms_in_java.pdf
 https://www.javatpoint.com/data-structure-tutorial
 https://www.tutorialspoint.com/data_structures_algorithms

COURSE ASSESSMENT:

(Prelim and Midterm)

Quizzes (30%)
Graded Laboratory Works (45%)
Seat-works/Assignments (25%)
 Tomas Del Rosario College
Capitol Drive, San Jose, City of Balanga
Telefax: (047) 791-6152; Tel No: (047) 791-6082

Class Standing (70%)

Major Examination (30%)
Term Grade (100%)

(Finals)
Graded Laboratory Works (50%)
Group Case Study (50%)
Class Standing (70%)
Major Examination (30%)
Term Grade (100%)

Subject Grade
(Prelim * 1/3) + (Midterm * 1/3) + (Finals * 1/3)

COURSE POLICIES:
 Regular class attendance.
 Complete seat works, quizzes and assignments.
 Active participation for recitation.
 Complete project: Program Output

COURSE TITLE SY/TERM OF EFFECTIVITY PREPARED BY APPROVED BY

CS212 SY 2022-2023
Data Structure and Algorithm Analysis 1st Semester
MERCEDES G. SANCHEZ, Ed. D.
Vice President for Academics, Students
CECILLE Q. NACPIL
Affairs and Extension Services
Instructor