Sei sulla pagina 1di 10

QUEZON CITY POLYTECHNIC UNIVERSITY

673 Quirino Highway San Bartolome Novaliches , Quezon City


BACHELOR OF SCIENCE IN INFORMATION TECHNOLOGY DEPARTMENT

SUBJECT DESIGN

COURSE TITLE : DATA STRUCTURE AND ALGORITHM

COURSE CODE : CC104

COURSE UNITS : 3 Units

TOTAL NO. OF WEEKS/HOURS : 18 weeks / 54 hours

PRE-REQUISITE : CC103-Intermediate Programming

COURSE DESCRIPTION:

The course covers the standard data representation and algorithms to solve computing problems efficiently (with respect to space
requirements and time complexity of algorithms). This covers the following: Stacks, Queues, Tress, Graphs, Maps, and Sets. Thorough discussion of
sorting and searching algorithms and hashing is covered.

COURSEOBJECTIVES:

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

1. Understand the data structures and algorithms.


2. Identify and use major techniques in implementing fundamental data types.
QUEZON CITY POLYTECHNIC UNIVERSITY
673 Quirino Highway San Bartolome Novaliches , Quezon City
BACHELOR OF SCIENCE IN INFORMATION TECHNOLOGY DEPARTMENT

3. Learn how recursion works and how to write recursive algorithms.


4. Implement data structures using various common data representation such as arrays linked lists, trees.
5. Differentiate singly-linked list from doubly-linked lists.
6. Perform operations linked lists.
7. Identify common data structures such as stacks and queues.
8. Analyze sorting and searching algorithm.
QUEZON CITY POLYTECHNIC UNIVERSITY
673 Quirino Highway San Bartolome Novaliches , Quezon City
BACHELOR OF SCIENCE IN INFORMATION TECHNOLOGY DEPARTMENT

COURSE OUTLINE AND TIMEFRAME:

WEEK TOPIC
1 Class Orientation and Course Introduction
2 Introduction to Data Structure and Algorithm
3 Recursion
4-5 Arrays: One Dimensional and Two-Dimensional
6 Linked Lists: Singly-Linked List
7 Linked Lists: Doubly-Linked List
8 Stacks
9 MID TERM EXAMINATION
10 Queues
11 Trees
12 Searching
13 Sorting
14 Graphs
15 Maps
16 Sets
17 Project Presentation
18 FINAL EXAMINATION

SUGGESTED READINGS AND REFERENCES:

BOOKS
QUEZON CITY POLYTECHNIC UNIVERSITY
673 Quirino Highway San Bartolome Novaliches , Quezon City
BACHELOR OF SCIENCE IN INFORMATION TECHNOLOGY DEPARTMENT

a. Karumanchi, N. (2017) Data Structures And Algorithms Made Easy,


b. Bullinaria, J (2019) Data Structures and Algorithms,
c. Thareja, R (2014) Data Structures Using C, Oxford University Press

GRADING SYSTEM:

CLASS STANDING (60%)


 Quizzes 15%
 Activities/Seatwork 10%
 Recitation/Report/Play/Presentation 10%
 Project/Case Study/Term Paper/Reaction Paper 20%
 Assignment/Attendance 5%

MAJOR EXAM (40%)


 Practical Exam 20%
 Written Exam 20%

FINAL GRADE = (MTG + FTG) /2

CLASSROOM POLICIES:

1. Students should attend their classes regularly, including make-up classes. The student will be held liable for all topics covered and
assignments made during his/her absence in class. The university guidelines on attendance and tardiness will be enforced.
2. Withdrawal and dropping from the subject should be done in accordance with existing policies and guidelines of the university.
3. The course is expected to have minimum of three (3) quizzes per term.
4. Assignments, exercises, research and report works will be given throughout the semester. Such requirements shall be due upon the
deadline set as announced in the class. Late submission shall be penalized with grade deductions (5% per day) or shall no longer be
accepted, depending on the discretion of the subject instructor. These are designed to assist the students in understanding the
materials presented in class, and to prepare them for the examination.
QUEZON CITY POLYTECHNIC UNIVERSITY
673 Quirino Highway San Bartolome Novaliches , Quezon City
BACHELOR OF SCIENCE IN INFORMATION TECHNOLOGY DEPARTMENT

5. Any evidence of copying or cheating during any examinations may result in a failing grade from the examination for all parties involved.
University policies and guidelines pertinent to these shall be strictly enforced.
6. Students are advised to keep graded work until the semester has ended.
7. Contents of the syllabus are subject to modification with notification.
8. Mobile phones, radios or other listening devices are not allowed to be used inside the lecture and laboratory rooms to prevent any
distractive interruption of the class activity unless it is deemed necessary in the topic. This will be on the full discretion of the instructor.
9. No food, drinks, cigarettes, nor children are allowed inside the lecture and laboratory rooms.
QUEZON CITY POLYTECHNIC UNIVERSITY
673 Quirino Highway San BartolomeNovaliches , Quezon City
BACHELOR OF SCIENCE IN INFORMATION TECHNOLOGY DEPARTMENT

SUBJECT DESIGN

Learning Outcomes Activities / Time Evaluation of Product /


Meeting At the end of session the Topics Resources
Procedures Learning Output
students will be able to:
Understand classroom Orientation and Course Lecture Lecture DLP-based  Develop a well-
policies. Introduction Demonstration (2hours) projector organized
Recitation __________ Paper and pen relationship
Familiarize with the course  QCPU Mission Laboratory Personal between the
syllabus and course  QCPU Vision (3hours) computer / lecturer and the
1 requirements  Course Overview Laptop computer students.
 Grading System
 Class Rules and
Regulations

Analyze the choice of data Introduction Lecture Lecture DLP-based  Can present a Presentation of a
structures and algorithms  Algorithms Demonstration (2hours) projector simple program program based on
design methods impact the  Criteria for Algorithms Audio Visual ___________ Paper and pen that has an a given algorithm
performance of programs  Representing Algorithms Presentation Laboratory Personal algorithm.
2  Data Structures Critiquing (3hours) computer /
Use major techniques in  Data Types and Data Quiz Laptop computer  Can analyze a
implementing fundamental Structures Hands-on Sound system coding program
data Exercises Audiovisual aids based on a set of
types algorithm
Recognize how recursion Recursion Demonstration Lecture DLP-based  Can present a Presentation of
works and how to write  Example: Reversing a Lecture (2hours) projector simple program the program and
recursive algorithms String Audio Visual ___________ Paper and pen using the the algorithm.
 Example: Factorial Presentation Laboratory Personal recursion.
 Example: Permutation Assignment to (3hours) computer /
3  Base Value the topic Laptop computer  Can analyze a
 Depth of Recursion Recitation Sound system coding program
Hands-on Audiovisual aids based on a set of
Exercises Computer algorithm
Laboratory
Learning Outcomes Activities / Time Evaluation of Product /
Meeting At the end of session the Topics Resources
Procedures Learning Output
students will be able to:
Implement data Arrays Lecture Lecture DLP-based  Can integrate the Program with
structuresusing various  Linear List Operations Demonstration (2hours) projector concept of array in proper variable
common data  Dimensionality of an Array Audio Visual ___________ Paper and pen a program. declaration
representation such as arrays, o One-Dimensional Presentation Laboratory Personal
4-5
linked lists, trees o Array Case analysis (3hours) computer /  Can analyze a
o Two-Dimensional Hands-on Laptop computer coding program
Arrays Exercises Sound system based on a set of
Audiovisual aids algorithms
Differentiate singly-linked lists LINKED LISTS : Singly Demonstration Lecture DLP-based  Can create a List of sample
from doubly-linked lists Linked-Lists Lecture (2hours) projector program using programs applying
 Singly Linked-Lists Audio Visual ___________ Paper and pen linked-list linked-list.
 Finding the length of the Presentation Laboratory Personal
List/Reading the List from Hands-on (3hours) computer /  Get at least 75 At least 75
6 Left to Right Exercises Laptop computer percent correct percent correct
 Retrieving the ith Node Quiz Sound system answer in a quiz. answer in a quiz
 Insertion using the "Tail" Audiovisual aids
 Releasing the Node from Computer
Memory Laboratory

Perform operations in linked Doubly-Linked List Demonstration Lecture DLP-based  Can create a
lists  Basic Format Lecture (2hours) projector program using
 Finding the Length of the Audio Visual ___________ Paper and pen doubly-linked list
List/Reading the List from Presentation Laboratory Personal
Left to Right Recitation (3hours) computer /  Get at least 75
 Reading the List from Left Hands-on Laptop percent correct
7 to Right and Right to Left Exercises computer answer in a quiz.
 Reading the List from Sound system
Retrieving a Node from Audiovisual aids
the List Computer
Laboratory

Identify the common  STACKS Demonstration Lecture DLP-based  Can create a List of sample
datastructures such as stacks  Stack Representation and Lecture (2hours) projector program using programs applying
8 andqueues Operations Audio Visual ___________ Paper and pen stacks stacks.
 PUSHing and POPing Presentation Laboratory Personal
Learning Outcomes Activities / Time Evaluation of Product /
Meeting At the end of session the Topics Resources
Procedures Learning Output
students will be able to:
Element Case analysis (3hours) computer /  Get at least 75
 PostFix Notation Hands-on Laptop computer percent correct
Exercises answer in a quiz.

Assess the learning during the MIDTERM EXAMINATION Paper and pencil Examination Midterm examination At least 75
midterm period test paper percent score in
9 2hours
Paper and pen the midterm
examination
Use operations available for  QUEUES Demonstration Lecture DLP-based  Can create a List of sample
Queues  Representation of Queues Lecture (2hours) projector program using programs applying
 One-Dimensional Array Audio Visual ___________ Paper and pen queues queues.
Representation Presentation Laboratory Internet
10  Singly-Linked List Case analysis (3hours) connection  Get at least 75
Representation Hands-on Personal percent correct
 Queue Operations Exercises computer / answer in a quiz.
Laptop computer
Sound system
Audiovisual aids
Define terms used in TREES Demonstration Lecture DLP-based  Can create a List of sample
determining trees  Binary Trees Lecture (2hours) projector program using programs applying
 Expression Trees Audio Visual ___________ Paper and pen trees trees.
 Tree Representation, Presentation Laboratory Personal
11 Expression and its Case analysis (3hours computer /  Get at least 75
Algorithms Hands-on Laptop computer percent correct
 Creating Trees Exercises Sound system answer in a quiz.
 Preorder and Postorder
Traversal
Analyze searching SEARCHING Demonstration Lecture DLP-based  Can provide Created forms
algorithms  Sequential Search Brainstorming (2hours) projector simple .Net
12  Binary Search Quiz ___________ Personal programs
Case Analysis Laboratory computer /
Hands-on (3hours) Laptop computer
Exercises
Learning Outcomes Activities / Time Evaluation of Product /
Meeting At the end of session the Topics Resources
Procedures Learning Output
students will be able to:
Analyze sorting algorithms SORTING Lecture Lecture DLP-based  Can create a List of sample
 Bubble Sort Demonstration (2hours) projector program using programs applying
 Insertion Sort Problem solving ___________ Personal sort sorting.
 Selection Sort Reading Laboratory computer /
13  Shell Sort assignments in (3hours) Laptop computer  Get at least 75
supplementary Paper and pen percent correct
books answer in a quiz.
Hands-on
Exercises
GRAPHS Demonstration Lecture DLP-based  Can create a List of sample
Identify the terminologies and  Graph Terminology Brainstorming (2hours) projector program using programs applying
the use of graphs.  Paths and Cycles Recitation ___________ Personal graphs graphs.
 Isomorphic Graphs Quiz Laboratory computer /
 The Adjacency and Hands-on (3hours) Laptop computer  Get at least 75
Incidence Matrix for a Exercises Paper and pen percent correct
14 Graph answer in a quiz.
 Digraphs
 Euler Paths and
Hamiltonian Cycles
 Dijkstra’s AlgorithmS
 Graph Traversal
Algorithms
Analyze maps algorithm and  MAPS Demonstration Lecture Internet  Can create a List of sample
 The Map Abstract Data Lecture (4hours) connection program using programs applying
Type (ADT) Prototyping Personal maps maps algorithm.
 Maps in the java.util Website Laboratory computer /
14-15 Package Development (6hours) Laptop computer  Get at least 75
 A Simple List-Based Map Prototype Sound system percent correct
Implementation evaluation Computer answer in a quiz.
Mock defense/ Laboratory
Critiquing
Identify how set works on the  SETS Group project Lecture DLP- based  Can create a Final Project
program.  The Set ADT and presentation/ (4hours) projector program using
16-17 Union/Find Structures Defense Personal sets.
 Fundamental Methods of Laboratory computer /
the Set ADT (6hours) Laptop computer  Get at least 75
Learning Outcomes Activities / Time Evaluation of Product /
Meeting At the end of session the Topics Resources
Procedures Learning Output
students will be able to:
 A Simple Set Sound system percent correct
Implementation answer in a quiz.
Assess and evaluate the FINAL EXAMINATION Paper and pencil Examination Final Examination At least 75
learning during the final period test room percent score in
18 2hours
Examination the midterm
paper examination

Prepared by: Conforme:

MR. CHRISTIAN B. ESCOTO PROF. MARY JOY D. VIÑAS


Faculty OIC-Director

Potrebbero piacerti anche