CARTHEL SCIENCE EDUCATIONAL FOUNDATION INC.

San Vicente, San Manuel, Tarlac

College of Information and Computer Studies

A. SUBJECT CODE : ACT 5

B. COURSE TITLE : Data Structure and Algorithm
C. COURSE CREDITS : 3 Units (2units lecture = 36 hrs / 1unit laboratory = 54hrs)
D. COURSE DESCRIPTION : This course aim to provide students an opportunity to further develop and refine their programming skills. In
particular, the emphasis of this course is on the organization of information, the implementation of common data
structures such as lists, stacks, queues, trees, and graphs, and techniques of data abstraction, including
encapsulation and inheritance. We will also explore recursion and the close relationship between data structures and
algorithms. Hands-on programming is a central component of this course. There will not be a weekly laboratory
session, but there will be numerous mini-labs and outside programming assignments. Assignments will focus on the
design, implementation, and testing of object-oriented programs.

E. PREREQUISITE/S : ACT 1and 2

F. COURSE OBJECTIVES :

1] General: At the end of the course, the students should be able to:

1.1] Learn how to program in advance JAVA.

1.2] Gain knowledge in manipulating JAVA functions.
1.3] Be trained in customizing the use of Object Oriented Program using JAVA

2] Specific : At the end of the course, the student should be able to:
2.1] Cognitive
2.1.1] Identify the structures and functions of JAVA.
2.1.2] Develop their programming skill such as lists, stacks, queues, trees, and graphs in JAVA.
2.1.3] Summarize program techniques in data abstraction.
2.1.4] Develop program techniques in data abstraction, including encapsulation and inheritance

2.2] Affective
2.2.1] Explain the importance of Object Oriented Program using JAVA
 2.2.2] Observe the proper procedures of constructing programs using JAVA
2.2.3] understand the structures of JAVA programs such lists, stacks, queues, trees, and graphs, data
abstraction, including encapsulation and inheritance

2.3] Psychomotor
2.3.1] Study the usability enhancements made of Object Oriented Program using JAVA
2.3.2] Follow the techniques in data abstraction and encapsulation.
2.3.3] Conform to the default syntax of each method and function used

G. COURSE CONTENT/OUTLINE :

DURATION TOPIC OUTLINE REFERENCES/MATERIALS SUGGESTED EVALUATION

ACTIVITIES

Week 1 Unit I. Introduction to Data Structure. Internet Research Class discussion Graded Recitations
- What are Data Structures? Assignment
- What are Algorithms?
- Review of Java and OOP

Week 2 Unit II. Language Features, Data Classes Collins, Data Structures and the Class discussion Quiz 1
and Encapsulation Java Collections Framework,
- Language Features McGraw-Hill, 2002.
Classes, Encapsulation,
ADTs
- Inheritance, Polymorphism

Week 3 Unit III. Interfaces, JavaDocs and Pre-Post Collins, Data Structures and the Discussion Quiz 2
Condition Java Collections Framework, Laboratory Exercises Assignment
- Dynamic Binding McGraw-Hill, 2002.
Interfaces
- JavaDocs, Specifications,
Pre-/Post-Conditions

Week 4 Unit IV. Arrays and ArraysList including Collins, Data Structures and the Discussion Graded Recitations
Linear Traversal Java Collections Framework, Programming

2
 - Arrays and ArrayLists McGraw-Hill, 2002. Examples
- Review of linear traversal Laboratory Exercises

Week 5 Unit V. Collection Classes, List Interface, Collins, Data Structures and the Discussion Graded Recitations
Set Interface, ArrayList and Iterators Java Collections Framework, Laboratory Exercises Assignment
- Collection Classess McGraw-Hill, 2002.
- List Interface
- Set Interface and
- Iterations

Week 6 Preliminary Examination

Week 7 Unit VI. Sequential and Binary Search Collins, Data Structures and the Discussion Graded Recitations
- Sequential Java Collections Framework, Programming
- Binary Search McGraw-Hill, 2002. Examples
Laboratory Exercises
Week 8 Unit VII. Linear Lists Collins, Data Structures and the Discussion Quiz 1
- Linear Lists (client view) Java Collections Framework, Assignment
- Doubly-Linked Lists McGraw-Hill, 2002.
- Circular List

Week 9 Unit VIII. Introduction to Queues and Stacks Collins, Data Structures and the Discussion Graded Recitations
- Queues (FIFO,LIPO) Java Collections Framework, Programming Assignment
- Stacks McGraw-Hill, 2002. Examples
Laboratory Exercises

Week 10 Unit IX. Recursion and Introduction to Collins, Data Structures and the Discussion Graded Recitations
Sorting Java Collections Framework, Programming
McGraw-Hill, 2002. Examples
- Bubble sort Laboratory Exercises
- Selection sort
- Insertion sort

Week 11 Unit X. Sorting and Introduction to Tree Collins, Data Structures and the Discussion Quiz 2
- Shell Java Collections Framework, Programming Assignment
- Trees McGraw-Hill, 2002. Examples

3
 Laboratory Exercises

Week 12 Midterm Examination

Week 13 and Unit XI. Continuation of Tree Collins, Data Structures and the Discussion Graded Recitations
Week 14 - Tree Traversal Algorithms Java Collections Framework, Programming
- Binary Search Trees McGraw-Hill, 2002. Examples
Laboratory Exercises

Week 15 Unit XII. Priority Queues, Maps/ Collins, Data Structures and the Discussion Graded Recitations
Dictionaries Java Collections Framework, Programming
McGraw-Hill, 2002. Examples
- Priority Queues Laboratory Exercises
- Maps Dictionaries

Week 16 Unit XIII - Hash and Chaning Collins, Data Structures and the Discussion Graded Recitations
- Hash Tables Java Collections Framework,
- Hash Function McGraw-Hill, 2002.
- Hash Map
- Chaining

Week 17 More laboratory Exercises Programming Assignment

Examples
Laboratory Exercises

Week 18 Final Examination

H. GRADING SYSTEM

The following percentage distribution shall be followed for each periodical grade
Prelims 30% 1) Lecture Units 2) Laboratory units
Midterms 30% a. Class participation 10% Laboratory exercises 100%
Finals 40% b. Exercises n seatwork 20%
100% c. Quizzes 20%
d. periodical exam 50%

4
 I. INSTRUCTIONAL MATERIALS

TEXTBOOK: none

J. REFERENCES:

References/Reading Materials:
 Collins, Data Structures and the Java Collections Framework, McGraw-Hill, 2002.

Prepared by:

Engr. Virgilio A. Zacarias, Jr.

Dean, College of Information and Computer Studies