Polytechnic University of the Philippines

COLLEGE OF ENGINEERING
DEPARTMENT COMPUTER ENGINEERING

COURSE TITLE DATA STRUCTURES AND ALGORITHM

COURSE CODE CMPE 30052
CREDIT UNITS 3 UNITS
COURSE PREREQUISITE CMPE 30032 (OBJECT-ORIENTED PROGRAMMING)
COURSE DESCRIPTION Solving computational problems that involve manipulating collections of data, study a core set of data abstractions, data structures, and algorithms
that provide a foundation for writing efficient programs.

Institutional Learning Outcomes Program Outcomes Course Outcomes

1. Creative and Critical Thinking By the time of graduation, the students of the program shall After completing the course, the student must be able to:
Graduates use their imaginative as well as a rational thinking have the ability to:
abilities to life situations in order push boundaries, realize  Recognize the different linear and non-linear data
possibilities, and deepen their interdisciplinary and general a) Apply knowledge of mathematics and science to solve structures.
understanding of the world.
2. Effective Communication
complex engineering problems;
Graduates are proficient in the four macro skills in communication b) Design and conduct experiments, as well as to analyze  Graphically represent any data structures.
(reading, writing, listening, and speaking) and are able to use these and interpret data;
skills in solving problems. Making decisions, and articulating c) Design a system, component, or process to meet desired  Have a clear understanding of the algorithms for
thoughts when engaging with people in various circumstances. needs within realistic constraints such as economic, creating, accessing, and destroying structural
3. Strong Service Orientation environmental, social, political, ethical, information.
Graduates exemplify the potentialities of an efficient, well-rounded health and safety, manufacturability, and sustainability, in
and responsible professional deeply committed to service accordance with standards;  Write C++ programs using the different data structures.
excellence. d) Function on multidisciplinary teams;
4. Community Engagement
Graduates take an active role in the promotion and fulfillment of
e) Identify, formulate, and solve complex engineering  Apply programming techniques like searching and
various advocacies (educational, social and environmental) for the problems; sorting in solving problems.
advancement of community welfare. f) Understanding of professional and ethical responsibility;
5. Adeptness in the Responsible Use of Technology g) Communicate effectively;
Graduates demonstrate optimized use of digital learning abilities, h) Broad education necessary to understand the impact of
including technical and numerical skills. engineering solutions in a global, economic, environmental,
6. Passion to Lifelong Learning and societal context;
Graduates are enabled to perform and function in the society by i) Recognition of the need for, and an ability to engage in life-
taking responsibility in their quest to know more about the world long learning;
through lifelong learning.
7. High Level of Leadership and Organizational Skills
j) Knowledge of contemporary issues;
Graduates are developed to become the best professionals in their k)Use techniques, skills, and modern engineering tools
respective disciplines by manifesting the appropriate skills and necessary for engineering practice and
leaderships qualities. l) Knowledge and understanding of engineering and
8. Sense of Personal and Professional Ethics management principles as a member and leader in a team,
Graduates show desirable attitudes and behavior either in their to manage projects and in multidisciplinary environments.
personal and professional circumstances.
9. Sense of National and Global Responsiveness
Graduates’ deep sense of national compliments the need to live in a
global village where one’s culture and other people culture are
respected.
Course Plan
Week Topic Learning Outcomes Methodology Resources Assessment
Orientation
Class orientation with Vision, Mission, Familiarize student on Outcome-
Goal and Objective Based Education Course Syllabus None
Review of the syllabus,
learning activities and
Discussion of course goals, expected Orient the student on the course assessment
outcomes, course policies and syllabus, grading system and
grading system classroom rules Getting to know activity
Assigning of Groups and Officers Ice breaker activity
1 INTRODUCTION TO DATA Learn what are data structures Lecture/Discussion Goodrich, Michael and
STRUCTURES Tamassia, Roberto Data Quiz
Identify the different types of Program Demonstration Structure and Algorithms
 What are data structures? Data Structures Machine Problem
 Types of data structures http://courses.cs.vt.edu/~cso
Know the importance and Recitation/Board work n Program Tracing
 Importance of data structures
 Application of data structures applications of data structures line/DataStructures/Lessons/I
ntroduction/index.html Lab Activity

2 ARRAYS and REVIEW on

FUNCTIONS Learn how to declare arrays in Quiz
programs Lecture/Discussion Zak, Diane
 One-dimensional and two- An Introduction to
dimensional arrays Machine Problem
Differentiate one-dimensional Program Demonstration Programming with C++.
 Review of Programmer-defined and from two-dimensional arrays Program Tracing
predefined functions Recitation/Board work
Review of Functions, Lab Activity

Functions calling and returning

arrays
3 STRUCTURES
Understand the structure
 Ways declaring a structure values and member values
Lecture/Discussion D. S. Malik Quiz
C++ programming
 Accessing structure members Demonstrate how to declare a
structure
Machine Problem
 Declaring nested structures Program Demonstration
Understand the differences
between a structure and
 Accessing members in a nested Zak, Diane
function.
structure An Introduction to Programming Program Tracing
Recitation/Board work with C++.
Understand the differences
between a structures and
Lab Activity
pointers.

Explore the use of structures in

C++ program

4 POINTERS Learn about the pointers and its

syntax definition
D. S. Malik
 Declaration, assignment and C++ programming Quiz
dereferencing Demonstrate how to declare a
pointer just like declaring an Lecture/Discussion
 Relationship between array and ordinary variable of a certain Machine Problem
pointers type
Program Demonstration Zak, Diane
 Structure and Pointers Use of assignment operator
An Introduction to Programming
with pointer variables Program Tracing
with C++.
 Pointers Arithmetic
Learn about the Type
Definitions Recitation/Board work
Lab Activity
Gaddis, Tony
Explore the use of pointers as
Starting out with C++.
Call-by-Value

Explore in creating a program

in C++ implementing dynamic
arrays and pointer arithmetic
 LINKED LIST
5-6 Learn the concept of Linked list Lecture/Discussion Shaffer, C. A.
 Concept of Linked List Data structures and algorithm
Quiz
Identify the basic analysis in C++
 Adding, deleting, inserting, and characteristics of linked list and
searching in a link list the different types of linked list Program Demonstration
Machine Problem
Implement linked list using C++ http://courses.cs.vt.edu/~csonline
 Types of Linked List
programs /DataStructures/Lessons/Introdu
Recitation/Board work c tion/index.html
 Applications of Linked List Program Tracing
Explore the adding, deleting,
inserting and searching of
nodes in a linked list
Lab Activity

STACKS Learn the concept of Stacks

 Push and Pop and queues Shaffer, C. A.
7-8 Lecture/Discussion Data structures and algorithm
Quiz
 Stacks used in arithmetic operation Identify the basic analysis in C++
characteristics of Stacks
 Infix, Postfix and Prefix notation Program Demonstration Machine Problem
Explore in creating programs
http://courses.cs.vt.edu/~csonline
 Conversion between Infix, Postfix that implement Stacks using C+
+ /DataStructures/Lessons/Introdu
and Prefix
c tion/index.html
Recitation/Board work Program Tracing
 Applications of Stacks Understand the importance and
application of Stacks and
Queues Lab Activity

Learn how to convert infix,

postfix and prefix expressions

9 M I D T E R M E X A M I N A T I O N
QUEUES and DEQUEUES Learn the concept of queues
10 - 11 Differences between Stacks and and Dequeues Mark Allen Weiss Data
Lecture/Discussion Structures and Algorithm Quiz
Queues
Identify the basic Analysis in C++
Differences between Queues and characteristics of Queues
Machine Problem
Dequeues
Program Demonstration http://courses.cs.vt.edu/~csonlin
Explore in creating programs
e
Types of Queues that implement Queues and
/DataStructures/Lessons/Introdu
Dequeues using C++
c tion/index.html Program Tracing
Applications of Queues and Dequeues
Recitation/Board work
 Understand the importance and
application of Queues and Lab Activity
Dequeues
BINARY TREE
12 – 13  Binary tree concepts and Familiarize binary tree and Mark Allen Weiss Data
detailed terminologies needed Lecture/Discussion Structures and Algorithm Quiz
terminologies
for comprehensive Analysis in C++
 Adding, deleting, and searching in a understanding of tree. Machine Problem
tree Program Demonstration http://courses.cs.vt.edu/~csonlin
Learn how to organize data in a
binary search tree and perform e
 Traversing a binary tree /DataStructures/Lessons/Introdu
insertion and deletion of items
in a binary search tree c tion/index.html Program Tracing
 Binary Search Tree Recitation/Board work
Learn the structure of binary
 Arithmetic Expression Tree trees and how to perform Lab Activity
various binary tree traversal
 Applications of Binary Tree algorithms
SORTING AND SEARCHING Lecture/Discussion Mark Allen Weiss Data Quiz
14 ALGORITHM Learn the different sorting Structures and Algorithm
 Selection Sort techniques Analysis in C++
Machine Problem
 Bubble Sort Apply programming techniques Program Demonstration
like searching and sorting in http://courses.cs.vt.edu/~csonlin
solving problems e
 Insertion Sort
/DataStructures/Lessons/Introdu Program Tracing
Recitation/Board work c tion/index.html
 Merge Sort

 Quick Sort Lab Activity

GRAPH Give the formal definition of a Lecture/Discussion Quiz

15  Graph definition directed graph and of an Mark Allen Weiss Data
undirected graph Structures and Algorithm Machine Problem
 Representation of graphs Analysis in C++
Differentiate directed and Program Demonstration
 Topological sort undirected graphs
http://courses.cs.vt.edu/~csonlin
Program Tracing
e
 Shortest path algorithm Define path in a graph, a cycle
/DataStructures/Lessons/Introdu
in a graph Recitation/Board work
c tion/index.html
 Network flow problem Lab Activity
Define the conditions when two
Minimum spanning tree vertices in a graph connected
 Define the conditions when
would a path in a graph be
known as a simple path

16 APPLICATION PROJECT Culminating activity given to the Project Presentation Application Project
PRESENTATION grouped students to test their Documentation Project Deliberation
mastery of the course by System Walk-through
developing application
programs utilizing all the Simulation Developed System
theories and concepts acquired

17 APPLICATION PROJECT Culminating activity given to the

PRESENTATION grouped students to test their Project Presentation Application Project Project Deliberation
mastery of the course by Documentation
developing application System Walk-through
programs utilizing all the
theories and concepts acquired Simulation Developed System

18 F I N A L E X A M I N A T I O N

Course Requirement
Besides the Quizzes, Assignments, Recitation, Major Examinations and Lab Activities, Before the end of the semester, the students are required to present an application project
in groups of four to five members dealing with the application of Data Structure and algorithm in the field of Computer Engineering such the development of Information System
that will utilized arrays, linked list, stacks and queues, trees and graph.
Reading and References

Gaddis, Tony, Starting out with C++, Prentice Hall,

Goodrich, Michael and Tamassia, Roberto Data Structure and Algorithms
Malik, D. S. C++ programming
Shaffer, C. A., Data structures and algorithm analysis in C++
Weiss, Mark Allen, Data Structures and Algorithm Analysis in C++
Zak, Diane, An Introduction to Programming with C++.

Online References:
http://courses.cs.vt.edu/~csonline /DataStructures/Lessons/Introduction/index.html
Course Grading System
To pass this course, one must accumulate at least 75% through the course requirements. The maximum points that a student can obtain through each requirement are shown below.

Requirement/Assessment Task Maximum Percentage

Quizzes/Assignment/Recitation 20%
Midterm/Final Exam 40%
Laboratory Exercises and Machine Problems/Application Project Presentation 40%
100%

Classroom Policy
1. Written tests during the semester.
2. Three scheduled major written tests. Make up tests will only be given with prior permission of the instructor. Make up tests must be taken within a week of the original scheduled test date
unless there is an inevitable reason.
3. Participation in class discussions and group exercises is a must; thus attendance and being prepared to contribute to the discussion is also expected.
4. Upon entrance to the classroom, submission of assignments is expected; and working on the challenge of the day is also to be observed.
5. Punctuality is to be observed. If students come in late for three consecutive occurrences would be equivalent to one absent. Students should also be responsible for missed materials.
6. Always follow the 5 S’s and CLAYGO (Clean As You GO)

Written tests – It will be administered periodically in order to assess the students’ knowledge of topics within the Syllabus. Use of cellphone during examinations IS prohibited.

Class Work/Activities – Students are expected to participate in all activities and assignments.

Oral Presentations – Students will be expected to present topics that will demonstrate their understanding of the specific subjects. Included in oral presentations are role playing, simulations,
topic or research presentations or focused group discussions.

Strict implementation of deadlines - No late projects, papers, researches or quizzes will be accepted unless you have made prior arrangements in writing with the instructor and have a valid and
documented reason. All late projects that are accepted will have appropriate deductions.

Quizzes - Make-up quizzes must be done only at the available schedule of the instructor. Unjustified absence resulting to missed quizzes shall be awarded with an equivalent grade of 20.

Special Arrangements and considerations – no special arrangements and considerations will be given after the final term. The students’ grades shall stand as they are except when errors in
the checking of requirements and/or inputting of grades by the instructor were found. Change of grade procedure will be then followed for the necessary changes to take effect.

Cheating - All graded requirements must be a students’ own work only. Cheating or plagiarism is a serious breach of academic ethics and policy (refer to students manual) and could lead to
appropriate sanctions. When taking tests, answer must not be seen by others. If cheating is discovered, all participants will be penalized with a grade of zero for the particular test.

Student contributions – In cases wherein students are grouped to complete a specific task, members must actively participate or risk being eliminated from the groupings.
Etiquette: Courtesy in class from every student is expected especially during classroom experience. Mobile phones must always be kept silent and are not allowed to be used for texting or
browsing inside the room at any time. Personal/portable media players must be put away and should not be used at any time inside the classroom. The instructor has the right to ask a student
who has a disruptive behavior to leave the class. All students are expected to be familiar with and to follow the guidelines set in the University student manual.

Attendance – Students who reach the maximum allowable absences will no longer be allowed to continue the course as stated in the University student manual and will receive a grade of
DROPPED.

Incomplete Grades – Students who got an INC – Incomplete Grade at the end of the semester must complete his/her requirements within one year. Failure to do so, the SIS will automatically
replace the INC rating into a grade of 5.0.

Consultation Time
As indicated on the approved Teaching Assignment of the concern faculty and posted on the Department’s Bulletin Board
Revision History
Revision Number Date of Revision Date of Implementation Highlights of Revision
2.0 April 18, 2019 June 17, 2019 OBE Syllabus Format and Contents

Prepared by: Date: Reviewed by: Date:

Engr. Julius S. Cansino

Permanent Faculty Engr. Julius S. Cansino
Chairperson, CpE Department

Engr. Pedrito M. Tenerife, Jr.

Permanent Faculty

Engr. Julian L. Lorico, Jr.

Part-time Faculty

Engr. Blanca I. Bucao

Part-time Faculty

Noted by: Date:

DR. REMEDIOS G. ADO

Dean, College of Engineering
Approved by: Date:

DR. MANUEL M. MUHI

Vice-President, Academic Affairs