MALLIG PLAINS COLLEGES

Casili, Mallig, Isabela

COLLEGE OF INFORMATION TECHNOLOGY EDUCATION

SYLLABUS
School Year 2013-2014

Course No.: Comp 3 No. of Units: 3 Time: Days:

Course & Year: BSCS 1 Building & Room No.: Consultation Hours:
Descriptive Title:Data Structures
Course Objectives:
 Provide students with a set of procedures implementing the data structures
 Manipulate and solve problems Using a structured Programming Language in C++
 Develop students to create their own algorithm in problem solving involving programming
 Know the role of data structures in programming;
 Know the data type/s to use in a program;
 Understand the structure of a C program;
 Construct a well-organized, informed and error-free C++ programs;
 Solve different kinds of programming problems;
 Know some of the causes of bugs in a program.

Objectives & Learning Strategies and Expected Outcomes

Topics & Time Allotment
Classification Levels Assessment Activities and/or Results
Orientation Internalize the meaning Discussion Sincerity
MPC – Philosophy, Mission, Vision & and the message of the Group Loyalty
Objectives MPC and ICS Dept PVMO Buzzing Obedience
ICS Dept - Mission, Vision &
Objectives
(1hr)
1. Basic Data Structures - Define Data Structure Lecture Clear knowledge in uses
 Arrays - Store values to the multi Recitation and application of basic
 Linked Lists pocketing memories Group Activity data structures
allocation of an array Library Work
  Stacks - Link Multiple Values thru Assignment
 Queues a memory addresses Seatwork/Laboratory
(16hrs) - Work with Dynamic Quiz/Hands-on
arrays
- Manipulate data in a
memory block
- Manipulate values as tail
and head of a queues
Knowledge (C1),
Comprehension (C2),
Application (C3), Analysis
(C4), Organization (A4)
PRELIM EXAMINATION
2. Trees - Work with the roots and Lecture Clear knowledge in basic
 Binary Trees nodes of a tree on a linked Recitation concepts and use of trees
 Binary Search Trees list Group Activity and sets
 AVL - Traverse a tree thru pre Library Work
 RB Trees order, post order, and in Assignment
order Seatwork/Laboratory
3. Sets - Work with the elements Quiz/Hands-on
(16hrs) and Sets
Knowledge (C1),
Comprehension (C2),
Application (C3), Analysis
(C4), Organization (A4)
MIDTERM EXAMINATION
4. Graphs - Present lists on a Lecture Clear knowledge in basic
 Representations colorful graph Recitation concepts and use of
 Search Algorithms (BFS, - Insertion and deletion of Group Activity graphs and hashing
DFS) a value from an array Library Work
 Shortest Path Problems - Learn the different Assignment
 Spanning Trees Sorting Techniques Seatwork/Laboratory
5. Hashing Knowledge (C1), Quiz/Hands-on
(16hrs) Comprehension (C2),
Application (C3), Analysis
(C4), Organization (A4)
 FINAL EXAMINATION

Course Requirements:
1. Major Examinations
2. Attendance
3. Quizzes
4. Projects
5. Laboratory Activities
6. Participation in the class discussion
Grading System:
ClassStanding = 90%(Quiz+Recitation+Assignment+LaboratoryActivities+Project) + 10%(Attendance)
PrelimGrade = 2/3ClassStanding + 1/3PrelimExam
MidTermGrade = 2/3PrelimGrade + 1/3MidTermTentativeGrade
FinalGrade = 2/3PrelimGrade + 1/3FinalTentativeGrade
References:
Books
1. Drozdek, Adam, Java: Data Structure and Algorithms, 2008
2. Drozdek, Adam, Data Structure and Algorithm in C++, 2007
3. Goodrich, Michael, Data Structure and Algorithm in Java, 2004
4. Weiss, Mark Allen, Data Structure and Algorithm Analysis in C++, 2003

Websites
1. http://en.wikipedia.org/wiki/Data_structure
2. http://www.cplusplus.com/doc/tutorial/structures/
3. http://www.cs.sunysb.edu/~skiena/214/lectures/

Online Journals
1. http://quod.lib.umich.edu/cgi/t/text/text-idx?c=jep;view=text;rgn=main;idno=3336451.0003.101
2. http://www.haskell.org/haskellwiki/Research_papers/Data_structures

Prepared by: Noted by:

JERIKO G. PELIMIANO DRYMLAD A. REBAJA GEORGE A. BORROMEO, MIT

Instructor Instructor Dean