Data Structure and Algorithms Syllabus Draf

Republic of the Philippines
CAMIGUIN POLYTECHNIC STATE COLLEGE

Balbagon 9100, Mambajao, Camiguin
Tel(088)8890183
www.cpsc.edu.ph|camiguinpolytechnic@yahoo.com
INSTITUTE OF ENGINEERING AND

COMPUTER STUDIES
COURSE SYLLABUS
1ST SEMESTER AY 2020-2021
COURSE CODE
VISION
CC 104
COURSE TITLE
Camiguin Polytechnic State College DATA STRUCTURE & ALGORITHM
is a dynamic institution of higher
learning which is accessible, COURSE CREDIT
3 UNITS
globally competitive, culturally and
morally sensitive towards CONTACT HOURS/WEEK
sustainable ecotourism and natural 4.25 HOURS/WEEK
resource development. PRE-REQUISITE(S)
CC102 Computer Programming 2
MISSION
CO-REQUISITE(S)
Camiguin Polytechnic State College
exists to provide higher COURSE DESCRIPTION The course covers the standard data representation
professional, technical and special
instructions for special purposes and algorithms to solve computing problems
and to promote research and efficiently (with respect to space requirements and
extension services, advanced time complexity of algorithm). This covers the
studies and progressive leadership following; Stacks, Queues, Trees, Graphs, Maps, and
in agriculture, forestry, engineering,
arts and other relevant studies.
Sets. Through discussion of sorting and searching
algorithms ang hashing is covered.
PROGRAM OUTCOMES: COURSE OUTCOMES AND RELATIONSHIP TO PROGRAM OUTCOMES
A graduate of Bachelor of Science COURSE OUTCOMES PROGRAM OUTCOMES

degree in Information Technology
should be able to:
After completing this course, the students a b c d e f g h i j k l m n
a) Apply appropriate should be able to:
COURSE SYLLABUS
Document Title:
Document Code: CPSC-ACA-F006 Rev. No.: 01 Effective Date: August 24, 2020 Page 1 of 9
tudy source was downloaded by 100000832136263 from CourseHero.com on 01-18-2 022 01:22:41 GMT -06:00
This s
knowledge of computing 1. Analyze step by step and develop
science and mathematics in algorithms to solve real world problems. / / / / / / / / / / /
solving computing
problems
2.Implementing various data structures
b) Understand best practices viz. Stacks, Queues, Linked Lists, Trees / / / / / / / / / / /
and standards and their and Graphs.
applications
3.Understanding various searching &
c) Analyze a problem, and sorting techniques / / / / / / / / / / /
identify and define the
computing requirements
appropriate to its
solution
d) Identify and analyze user
needs and take them into
account in the selection,
creation, evaluation and
administration of computer
base systems
e) Design, implement, and
evaluate and administration
of computer-based
systems, processes,
components, or program to
meet desired needs and
requirements under various
constraints
f) Apply appropriate
techniques, resources, and
modern computing
activities for IT profession
g) Function effectively as an
individual and as a member
or leader in diverse teams
and multi-disciplinary
settings
h) Assist in the creation of an
effective IT project plan;
and
i) Communicate proficiently
in computing community
and with the society at
large about complex
computing
Document Title: COURSE SYLLABUS
Document Code: CPSC-ACA-F006 Rev. No.: 01 Effective Date: August 24, 2020 Page 2 of 9
tudy source was downloaded by 100000832136263 from CourseHero.com on 01-18-2 022 01:22:41 GMT -06:00
activities both in oral and
written across various
context: Sociocultural,
organizational and
interpersonal levels
j)
k)
information technology
COURSE OUTLINE/PLAN
TIME
LEARNING OUTCOMES TOPICS METHODOLOGY ASSESSMENT
FRAME
At the end of the unit, the Preliminaries Week 1 Creating and connecting in to Checking the student’s
student must have: the google/FB classroom of participation in an online
1. Joined google Familiarizing Google and the course classroom through the use
classroom, FB classroom FB Classrooms of google online platform
& chat group that were Orientation Exploring the features, tools portal for attendance,
purposely created for the used in google/FB classroom discussions, and homework.
course Dissemination of CPSC
2. Familiarized the VMGO and Quality Policy Posting and viewing Observation of individual
features of google and of Course Syllabus in responses during one on
FB classrooms Orientation of Course Google/FB Classroom or in one conversation in fb
3. Demonstrate Syllabus messenger chat group messenger or through
understanding of CPSC’s Sending it likewise to students SMS/phone call
Vision and Mission; Value Focus: who opt to have offline
Quality Policy; Goals and Patriotism, Orderliness delivery mode
Objectives of the
Institute. Online discussion in google/
4. Been oriented with FB classroom/Zoom regarding
the classroom
policies,
tuDdyocsouumrcee 3C62P6S3 Cfro-AmCCAou- 0R2e2 GMT0- Effective Date: August 24, 2020 Page 3 of 9
nwtasCdoodwen:loaded by 1000008321 Frs0eH0e6ro.com on 01-18-2 v0.1N:2o2:. 016:00
4: 1
requirements and grading the course
system to be imposed on Phone call/SMS
the taken course. conversation to those
students who do not have
internet access
Basics Week 2
5. Be able to check the Algorithm Specifications: At the start of course, the Checking their individual
correctness of algorithms Performance Analysis and course delivery pattern, answers of the assignment
using inductive proofs Measurement (Time and prerequisite of the subject will and recording it.
and loop invariants. space analysis of be discussed. Posting
algorithms-Average, best assignments in google/FB
and worst case analysis). classroom will also be given.
Introduction To Data Week 3
Structure
Lectures will be conducted Assignment, chapter test
6. Be able to compare  Data Management with the aid of sending videos, and hands-on activity
functions using concepts, links and etc. related to the
 Data types –
asymptotic analysis and primitive and non- topics and giving them a Roll call through video
describe the relative primitive, number of exercises or conferencing.
merits of worst-,  Types of Data quizzes prior to a given
average-, and best-case Structures- Linear instructions on answering it to Observation and answering
analysis. & evaluate their understanding. of individual inquires,
Non Linear Data concerns and follow-up
Structures. questions. Checking their
individual answers of
exercises and recording it.
Linear Data Structure Week 4
-Week 6
7. Be able to solve  Array: One internal exam will be Observation and answering
recurrences using the Representation of conducted as a part of internal of individual inquires,
master, the iteration, and the arrays, Applications theory evaluation concerns and follow-up
substitution method. of arrays, sparse questions related to the
matrix and its Surprise tests/Quizzes will be topics. Checking their
representation., conducted having a share of individual answers of
• Stack: Stack- five marks in the overall exercises, assignments,
Definitions & internal evaluation. quizzes and recording it.
4: 1
Concepts,
Operations On
Stacks, Applications
of Stacks, Polish
Expression, Reverse
Polish Expression
And Their
Compilation,
Recursion, Tower of
Hanoi,
• Queue:
Representation Of
Queue, Operations
On Queue, Circular
Queue, Priority
Queue, Array
representation of
Priority Queue,
Double Ended
Queue, Applications
of Queue,
• Linked List: Singly
Linked List, Doubly
Linked list, Circular
linked list ,Linked
implementation of
Stack, Linked
implementation of
Queue,
Applications of
linked list.
Nonlinear Data Structure Week 7
8. Become familiar with a  Tree-Definitions -Week 9 Assignments and Quizzes Assignment, chapter test
variety of sorting algorithms and Concepts, based on the course content and hands-on activity
Representation of
and their performance will be given to the students
characteristics (eg, running binary tree, Binary for each unit and will be Roll call through video
time, stability, space usage) tree traversal evaluated at regular interval conferencing
4: 1
and be able to choose the (Inorder, postorder, evaluation
best one under a variety of preorder),
requirements.  Threaded binary tree,
Explain the major graph  Binary search trees,
algorithms and their  Conversion of
analyses. Employ graphs to General Trees to
Binary Trees,
model engineering problems,
 Applications Of
when appropriate. Trees- Some
Synthesize new graph balanced tree
algorithms and algorithms mechanism, eg. AVL
that employ graph trees, 2-3 trees,
computations as key Height Balanced,
components, and analyze Weight Balance ,
them.  Graph-Matrix
Representation Of
Graphs, Elementary
Graph operations,
(Breadth First
Search, Depth First
Search, Spanning
Trees, Shortest path,
Minimal spanning
tree).
SORTING and SEARCHING Week 10

-Week 12
9. Be able to understand  Insertion Sort The course includes a Assignment, chapter test
and identify the  Quick Sort laboratory using free online and hands-on activity
performance characteristics  Merge Sort tools, where students have an
of fundamental algorithms  Heap Sort opportunity to build an Roll call through video
and data structures and be  Sorting On Several appreciation for the concepts conferencing
able to trace their Keys being taught in lectures.
operations for problems  List and Table Sort
such as sorting, searching,  Linear Search
selection, operations on  Binary Search
numbers, polynomials and
matrices,
4: 1
and graphs.
Hashing And File Structures Week 13
-Week 15
10. Become familiar with the  Hashing: The symbol Experiments shall be Assignment, chapter test
table,
major graph algorithms and performed in the laboratory and hands-on activity
 Hashing Functions,
their analyses. Employ related to course contents
 Collision-Resolution
graphs to model engineering Techniques, Roll call through video
problems, when appropriate.  File Structure: conferencing
Concepts of fields,
records and files,
 Sequential, Indexed
and
Relative/Random File
Organization,
 Indexing structure for
index files,
 hashing for direct
files,
 Multi-Key file
organization and
access methods.
COURSE REQUIREMENTS This course is to be conducted both in online and offline mode combined with limited or scheduled face to
face classes.
For online mode, students will participate in the course using Google's learning management system
called GOOGLE CLASSROOM (www.classroom.google.com) coupled with social media platform namely
FB classroom/group and messenger.
Technology requirements for online mode:

1. A smart gadget like a computer/laptop or a smart phone with an internet browser
2. A media player
3. Headset with microphone
4. Internet connection (capable of watching videos)
5. Active Google Mail Account
6. Active FB/FB messenger Account
4: 1
For offline mode, printed learning materials will be given at the agreed designated places. Students shall
pick them up and bring them at home for them to study and work. Instructor will do follow up call to
discuss, ask and guide the students in their learning process. Required outputs shall be submitted through
pick up mode in the same agreed designated places.
Technology requirement for offline mode:
1. A cellular phone that can be used for receiving phone calls/SMS’s
Limited face to face classes by batch is to be scheduled following strict health protocols to facilitate
laboratory activities that require physical set-ups.
Whether in online or offline mode of delivery each student is expected to:
1. Participate on-line in google classroom or Fb group discussions/interactions or in virtual

discussions via zoom/google met or through phone calls
2. Submit outputs of Learning Exercises, Wet/ dry Laboratory works, Quizzes and
Term Examinations (Midterm & Final) via online or offline through pick up mode
Mid-Term
1. Written exam - 40%
2. Actual Exam - 30%
3. Quizzes/Assignment - 20%
4. GMRC/Attendance/Class Participation - 10%
Final-Term
GRADING SYSTEM 1. Project - 40%
2. Written exam - 30%
3. Assignment/Quizzes - 20%
4. GMRC/Attendance/Class Participation - 10%
Final Grade = 1/3 Midterm Grade + 2/3 Final Term Grade
4: 1
REFERENCES:
Books
On-line resources:
Data Structures & Algorithms in Java (2nd Edition) -Robert Lafore
Fundamentals of Computer Algorithms by Horowitz, Sahni
Fundamentals of Data Structures by Horowitz, Sahni
Prepared by: Reviewed by: Verified by: Approved:
JEFFERS B. ORANZA GENALYN B. BAAL

JOSELITO O. DAROY, MOE AIDA S. ONG, DM
Name & Signature Name & Signature
Name & Signature Name & Signature
FACULTY MEMBER PROGRAM HEAD
INSTITUTE DEAN Vice President for Academic Affairs
Date: Date: Date: Date:
4: 1

Data Structure and Algorithms Syllabus Draf

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Data Structure and Algorithms Syllabus Draf

Uploaded by

Copyright:

Available Formats

Republic of the Philippines

CAMIGUIN POLYTECHNIC STATE COLLEGE

INSTITUTE OF ENGINEERING AND

A graduate of Bachelor of Science COURSE OUTCOMES PROGRAM OUTCOMES

SORTING and SEARCHING Week 10

Technology requirements for online mode:

Document Title: COURSE SYLLABUS

Technology requirement for offline mode:

1. A cellular phone that can be used for receiving phone calls/SMS’s

Whether in online or offline mode of delivery each student is expected to:

1. Participate on-line in google classroom or Fb group discussions/interactions or in virtual

Final Grade = 1/3 Midterm Grade + 2/3 Final Term Grade

Document Title: COURSE SYLLABUS

Prepared by: Reviewed by: Verified by: Approved:

JEFFERS B. ORANZA GENALYN B. BAAL

Date: Date: Date: Date:

Document Title: COURSE SYLLABUS

You might also like