ECLARO ACADEMY

Paragon Place, 17 Commonwealth Ave, Quezon City, 1126 Metro Manila

COLLEGE DEPARTMENT
BACHELOR OF SCIENCE IN COMPUTER SCIENCE
COURSE SYLLABUS IN DATA STRUCTURES AND ALGORITHMS

COURSE TITLE :DATA STRUCTURES AND ALGORITHMS

COURSE CODE : CS 212

COURSE CREDIT : 3 units
PRE-REQUISITES : CS 121 INTERMEDIATE PROGRAMMING
PLACEMENT : Third Year, Second Semester
COURSE DESCRIPTION :
This 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, Tree, Graphs, Maps and Sets. Thorough
discussions of sorting and searching algorithms and hashing is covered.
SCHOOL VISION :
To be among Asia’s top academic institutions committed to nurture innovative learners and develop excellent leaders through
technology-oriented, environmentally-sound, and globally-competitive education

SCHOOL MISSION :
To transform the knowledge, skills and attitudes of learners in order for them to become holistic, individuals and useful members of a
fast-changing global community

ECLARO ACADEMY GRADUATE ATTRIBUTE INTENDED LEARNING OUTCOMES:

Integrity The learners should be able to:
Service 1. Analyze the choice of data structures and algorithms design methods impact the
Excellence performance of programs,
Empathy
2. Use major techniques in implementing fundamental data types,
3. Recognize how recursion works and how to write recursive algorithms,
4. Implement data structures using various common data representation such as arrays ,
linked list ,and trees,
5. Identify common data structures such as stacks and queues, and
 6. Analyze sorting and searching algorithms.

PROGRAM OUTCOMES : At the end of the program, the students will:

1. Be IT professionals and researchers, and to be proficient in designing and developing computing solutions.
2. Qualify for but not limited to the following entry level positions: applications developer, computer science instructor, database
programmer/designer, information security engineer, quality assurance engineer, researcher, systems developer and systems
analyst.

COURSE OUTCOMES : Upon completion of the course, the students will be able to:
1. Analyze the choice of data structures and algorithms design methods impact the performance of programs,\
2. Use major techniques in implementing fundamental data types,
3. Recognize how recursion works and how to write recursive algorithms,
4. Implement data structures using various common data representation such as arrays , linked list ,and trees,
5. Identify common data structures such as stacks and queues, and
6. Analyze sorting and searching algorithms.

BASIC TEXTBOOK : Goodrich , M., & Tamassia, R. ( 2010 ). Data Structures and Algorithms in Java ( 5th Edition ). Hoboken, NJ : Wiley
REFERENCES :
1. Cormen , T., Leiserson, C., Rivest , R., & Stein, C. ( 2009 ). Introduction to Algorithms ( 3rd Edition ). Cambridge, MA: MIT Press
2. Goodrich , M., & Tamassia, R. ( 2010 ). Data Structures and Algorithms in Java ( 5th Edition ). Hoboken, NJ : Wiley
3. Drozdek, A. ( 2008 ). Java : Data Stucture and Algorithms . SG: Cengage Learning Asia

COURSE OUTLINE
LEARNING OUTCOMES TOPIC TIME STRATEGIES/ RESOURCES ASSESSMENT
FRAME ACTIVITIES
1. Discuss the vision and mission of School Vision and Mission 1 hr Collaborative One paragraph
Eclaro Academy. discussion and Eclaro Academy summary of Eclaro
sharing Student Academy Vision and
2. Analyze the choice of data COURSE INTRODUCTION Handbook Mission Statement
structures and algorithms design
methods impacts the performance of Introduction to Data Structures and Algorithms Textbook Performance Task
programs Multimedia - Written Task
Data Structure 1 hr Worksheets Essay, Individual
Learning Tasks assignments
Algorithm
 1hr - Oral Task
Recitation
- Hands – on

Written Work
- Long Test
- Quizzes
- Major Exam

3. Implemented data structures using Arrays 1 hr Lecture Textbook Performance Task

various common data representation Operation on Arrays Sharing Multimedia - Written Task
such as arrays Arrays in Java 1 hr Brainstorming Worksheets Essay, Individual
Dimensionality of Arrays Learning Tasks assignments
Linear Search - Oral Task
Binary Search Recitation
- Hands – on

Written Work
- Long Test
- Quizzes
- Major Exam

4. Apply simple sorting Simple Sorting 1 hr Lecture Textbook Performance Task

Bubble Sort Sharing Multimedia - Written Task
Selection Sort 1 hr Brainstorming Worksheets Essay, Individual
Insertion Sort Learning Tasks assignments
- Oral Task
Recitation
- Hands – on

3 hrs
 Laboratory Exercise Written Work
- Long Test
- Quizzes
- Major Exam

5. Introduce the concept of recursion Recursion 1 hr Lecture Textbook Performance Task

 What is Recursion Sharing Multimedia - Written Task
Recursions in Applications 1hr Brainstorming Worksheets Essay, Individual
6. Recognize how recursion works and Triangular Numbers Learning Tasks assignments
how to write recursive algorithms Factorials - Oral Task
Anagrams 1 hr Recitation
Recursive Binary Search - Hands – on
Towers of Hanoi
Mergesort 1 hr
Types of Recursion Written Work
- Long Test
- Quizzes
- Major Exam

Stacks 1 hr Lecture Textbook Performance Task

7. Identify the common data structures Operation on Stacks Sharing Multimedia - Written Task
such as stacks and queues Representation of Stacks Brainstorming Worksheets Essay, Individual
Evaluation of Expressions Learning Tasks assignments
Postfix Notation 1 hr - Oral Task
Eliminating Recursion Recitation
3 hrs - Hands – on
 Laboratory Exercise

Written Work
- Long Test
- Quizzes
- Major Exam

PRELIMINARY EXAMINATION 2 hrs.

8. Perform operations in linked lists Linked Lists Lecture Textbook Performance Task
. Singly Linked List 1 hr Sharing Multimedia - Written Task
Doubly Linked Lists Brainstorming Worksheets Essay, Individual
Learning Tasks assignments
- Oral Task
Recitation
- Hands – on
 Laboratory Exercise 3 hrs

Written Work
- Long Test
 - Quizzes
- Major Exam

9. Use operations on queues Queues Lecture Textbook Performance Task

Representation of Queues 1 hr Sharing Multimedia - Written Task
Operation on Queues Brainstorming Worksheets Essay, Individual
Circular Queues 1hr Learning Tasks assignments
10. Use priority queue to place events in Methods on Queues - Oral Task
order Priority Queues 1hr Recitation
Operations on Priority Queues - Hands – on
Types of Priority Queues
3 hrs Written Work
 Laboratory Exercise - Long Test
- Quizzes
- Major Exam

11. Define terms used in determining Trees Lecture Textbook Performance Task
trees Binary Trees 1 hr Sharing Multimedia - Written Task
Application of Binary Trees 1 hr Brainstorming Worksheets Essay, Individual
Learning Tasks assignments
- Oral Task
 Laboratory Exercise Recitation
- Hands – on

Written Work
- Long Test
- Quizzes
- Major Exam

12. Differentiate the types of trees Types of Binary Search Tree Lecture Textbook Performance Task
AVL Trees 1 hr Sharing Multimedia - Written Task
Red – Black Trees Brainstorming Worksheets Essay, Individual
Splay Trees 1 hr Learning Tasks assignments
B- Trees - Oral Task
Heaps 1 hr Recitation
2 – 3 – 4 Trees - Hands – on

 Laboratory Exercise 3 hrs Written Work

- Long Test
 - Quizzes
- Major Exam

MIDTERM EXAMINATIONS
13. Sort data in more advanced ways Advanced Sorting Lecture Textbook Performance Task
using shellsort and quick sort Shellsort 1 hr Sharing Multimedia - Written Task
Partitioning 1 hr Brainstorming Worksheets Essay, Individual
Quicksort 1 hr Learning Tasks assignments
- Oral Task
 Laboratory Exercise 3 hrs Recitation
- Hands – on

Written Work
- Long Test
- Quizzes
- Major Exam

14. Implement a dictionary using hash Hash Tables 1 hrs Lecture Textbook Performance Task
tables Hashing Sharing Multimedia - Written Task
Brainstorming Worksheets Essay, Individual
Open Addressing 1 hr Learning Tasks assignments
Double Hashing 1 hr - Oral Task
Recitation
- Hands – on

 Laboratory Exercise 3 hrs Written Work

- Long Test
- Quizzes
- Major Exam

15. Represent a graph in a computer Graphs 1 hrs Lecture Textbook Performance Task
Searchers Sharing Multimedia - Written Task
Brainstorming Worksheets Essay, Individual
Learning Tasks assignments
 Laboratory Exercise 3 hrs - Oral Task
( Continuation ) Recitation
- Hands – on
 Written Work
- Long Test
- Quizzes
- Major Exam

FINAL EXAMINATION 2 hrs.

COURSE REQUIREMENTS :
Attendance
Active Classroom Participation
Individual Assignments
Group Discussion/Presentation
Computer Laboratory activities
Term Examinations
GRADING SYSTEM :
Percentage General
Class Standing and Attendance - 40% % Equivalent Classification
Other Outputs - 30%
Term Examinations - 30%____ 98 – 100 1.00 Excellent
TOTAL 100% 95 – 97 1.25 Superior
92 – 94 1.50 Very Good
89 – 91 1.75 Good
86 – 88 2.00 Good
83 – 85 2.25 Satisfactory
80 – 82 2.50 Satisfactory
77 – 79 2.75 Fair
75 – 76 3.00 Passing
70 – 74 5.00 Failed
AW Authorized
Withdrawal
UW Unauthorized
Withdrawal