0% found this document useful (0 votes)
35 views11 pages

COURSE SYLLABUS CC 104

The document outlines the course syllabus for CC 104: Data Structure and Algorithms at South Central Mindanao College of Science and Technology. It includes the institution's vision and mission, course objectives, program outcomes, competencies, course outline, policies, requirements, and grading system. The course aims to teach students the impact of data structures and algorithms on program performance and includes various programming concepts and techniques.

Uploaded by

Noriel Galoso
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
35 views11 pages

COURSE SYLLABUS CC 104

The document outlines the course syllabus for CC 104: Data Structure and Algorithms at South Central Mindanao College of Science and Technology. It includes the institution's vision and mission, course objectives, program outcomes, competencies, course outline, policies, requirements, and grading system. The course aims to teach students the impact of data structures and algorithms on program performance and includes various programming concepts and techniques.

Uploaded by

Noriel Galoso
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 11

REPUBLIC OF THE PHILIPPINES

SOUTH CENTRAL MINDANAO COLLEGE OF SCIENCE AND TECHNOLOGY INC.


Purok Rosal, Barangay New Isabela
City of Tacurong, Sultan Kudarat

COURSE SYLLABUS

COURSE NO. CC 104 UNITS: 3


COURSE TITLE: DATA STRUCTURE AND ALGORITHMS PRE-REQUISITE: NONE

VISION OF THE INSTITUTION


The academe envisions of providing graduates who are God-fearing patriotic, academically competent and skillful individuals. It is committed to
offer a safety environment with innovative approaches in teaching and learning process and always be of service to it’s community.

MISSION OF THE INSTITUTION


The academe is fully committed to foster and sustain quality education, where students honed their potential in a safe and caring environment.
Teachers passionately foster learning which competence and provide an avenue that may bring out student’s skills in challenging and enjoyable
way.
Administrations endeavor to be of help always to support and impose programs that will promote quality teaching learning. Individuals in the
locality are highly enjoined to share responsibility and be part of implementing programs that will develop quality and skillful individuals.
OBJECTIVES
To introduced students the right choice of data structure and algorithm can lower the costs and increase the benefits by cutting down space and
time complexity. It allows the right access and modifications to data. Data structure defines the relationship between the elements and their
correct role in the problem-solution. Allow to assess how the choice of data structures and algorithm design methods impacts the performance of
programs.

PROGRAM OUTCOME
The purpose of this course is to teach students implement the different data structures and solutions for specific problems.

COURSE OUTCOME
This course provides in depths on how the choice of data structures and algorithm design methods impacts the performance of programs.

Course No.: CC 104 Pre-requisite: None


Subject Description: Data Structure and Algorithms Credit: 3 Units
Semester: 1st Semester No. of Hours: 18 WEEKS
COMPETENCIES
Allocate duties and responsibilities with regard to the skills, knowledge, and aptitude required to properly undertake the assigned task and
prepare tools and instruments used in computer.
Understanding of Algorithm Analysis by describing the role of algorithms in computing.
Demonstrate an understanding of and proficiency in the use of Stacks and Queues.

GENERAL OBJECTIVES
The students must be able to:
 Assess how the choice of data structures and algorithm design methods impacts the performance of programs.
 Choose the appropriate data structure and algorithm design method for a specified application.
 Write programs using object-oriented design principles.
 Solve problems using algorithm design methods such as the greedy method, divide and conquer, dynamic programming, backtracking,
and branch and bound and writing programs for these solutions.

SOUTH CENTRAL MINDANAO COLLEGE OF Bachelor of Science in Information System


SCIENCE AND TECHNOLOGY INC.
COURSE OUTLINE Page No.
Page 2

Chapter 1: Programming Concepts


Lesson 1: Defining the Problem
Lesson 2: Compiling, Debugging and Testing the Program
Lesson 3: Types of Programming Languages
Lesson 4: Interpreters and Compilers
Lesson 5: Programming Diagrams

Chapter 2: Introduction to Java Language


Lesson 1: Introduction
Lesson 2: Java Applications, Characteristics and Benefits
Lesson 3: Analyzing the Programs
Lesson 4: Importance of Comments on Programs
Lesson 5: Data Type
Chapter 3: Conditional Statement
Lesson 1: If Statements
Lesson 2: switch Statements

Chapter 4: Looping Statements


Lesson 1: for loop Statement
Lesson 2: while loop Statement
Lesson 3: do while loop Statement

Chapter 5: Arrays
Lesson 1: Syntax of One-Dimensional Array
Lesson 2: Syntax of Two-Dimensional Array

Desired Learnings Course Content/ Textbook/ Teaching Achievement/ Resource Time


Outcome Subject Matter References Delivery Achieve Learning Materials Table
(DLO) (OBTL) Outcome (ALO)
The students must have: Class Orientation -Students Orientation Class Participation - Books Week 1
a. Understand the -School policies Handbook - Laptop/Computer
total course. -Teacher Policies -Course Syllabus - Online References
b. Review school and -Course Outcome
teachers’ policies. -Course Outline
c. Define the reason -Requirements
for studying -Textbooks
Computer -References
Programming

1. The students must be Chapter 1: (Jake R. -Lecture/Discussion - Class Participation - Handouts Week 2,
able to: Programming Concepts Pomperada, - Answering - Oral Recitation - Online References 3 and 4
MAED-IT, student’s questions - Quizzes - Laptop/Computer
1.1 Assess how the choice 1.1 Defining the Problem Revised Edition) - Exercises - Hands-on - Books
of data structures and 1.2 Compiling, Debugging (Introduction to - Quizzes
algorithm design methods and Testing the Java - Hands-on
impacts the performance Program Programming)
of programs. 1.3 Types of Programming
Languages
1.4 Interpreters and
Compilers
1.5 Programming
Diagrams

(Jake R.
2. The students should: Chapter 2: Introduction Pomperada, -Lecture/Discussion - Class Participation - Handouts Week 5,
to Java Language MAED-IT, - Answering - Oral Recitation - Online References 7, and 8
2.1 Choose the Revised Edition) student’s questions - Quizzes - Laptop/Computer
appropriate data 2.1 Introduction (Introduction to - Exercises - Hands-on - Books
structure and 2.2 Java Applications, Java - Quizzes
algorithm design Characteristics and Programming) - Hands-on
method for a specified Benefits
application. 2.3 Analyzing the
Programs
2.4 Importance of
Comments on
Programs
2.5 Data Type

(Jake R.
3. The students must be Chapter 3: Conditional Pomperada, -Lecture/Discussion - Class Participation - Handouts Week 8,
able to: Statement MAED-IT, - Answering - Oral Recitation - Online References 9, and
Revised Edition) student’s questions - Quizzes - Laptop/Computer 10
3.1 Write programs using 3.1 if Statements (Introduction to - Exercises - Hands-on - Books
object-oriented design 3.2 switch Statement Java - Quizzes
principles Programming) - Hands-on

(Jake R.
4. The students must be Chapter 4: Looping Pomperada, -Lecture/Discussion - Class Participation - Handouts Week
able to: Statements MAED-IT, - Answering - Oral Recitation - Online References 10, 11,
Revised Edition) student’s questions - Quizzes - Laptop/Computer and 12
4.1 Solve problems using 4.1 for loop Statement (Introduction to - Exercises - Hands-on - Books
algorithm design methods 4.2 while loop Statement Java - Quizzes
such as the greedy 4.3 do while loop Programming) - Hands-on
method, divide and Statement
conquer, dynamic
programming,
backtracking, and branch
and bound and writing
programs for these
solutions.

(Jake R.
5. The students must be Chapter 5: Arrays Pomperada, -Lecture/Discussion - Class Participation - Handouts Week
able to: MAED-IT, - Answering - Oral Recitation - Online References 13, 14,
5.1 Syntax of One- Revised Edition) student’s questions - Quizzes - Laptop/Computer 15, 16,
5.1 Understand and use Dimensional Array (Introduction to - Exercises - Hands-on Activity - Books 17, and
the proper return syntax 5.2 Syntax of Two- Java - Quizzes 18
Dimensional Array Programming) - Hands-on Activity
COURSE POLICIES
Be responsible for your own actions.

Class Presence and Participation - Class presence and participation points are given to encourage your active class participation and
discussion. You will be rewarded with a perfect score as long as you frequently come to class and actively contribute to the class discussion
during recitations and lectures.
Use of Mobile Devices - allow you to take notes on your laptop, but you must turn the sound off so that you do not disrupt other students'
learning. If you are doing anything other than taking notes on your laptop, please sit in the back row so that other students are not distracted by
your screen.
Respect due dates – No late projects, papers or quizzes will be accepted unless you have made prior arrangements in writing with the instructor
and have a valid and document reason. All late projects are accepted will receive a 10% points penalty.
Quizzes – Make-up quizzes must be done on or before the next class session. A 10% points penalty will be taken off the total available points on
any make-up quizzes.
Cheating - Anyone caught cheating on a quiz or exam will receive a failing grade and will also be reported to the Office of Student Conduct. In
order to guarantee that you are not suspected of cheating, please keep your eyes on your own materials and do not converse with others during
the quizzes and exams.
Plagiarism - You must be original in composing the writing assignments in this class. To copy text or ideas from another source (including your
own previously, or concurrently, submitted course work) without appropriate reference is plagiarism and will result in a failing grade for your
assignment and usually further disciplinary action.
COURSE REQUIREMENTS:
 Attendance per school policy.
 Active participation in class discussions and laboratories.
 On-time submission of projects and assignments.
 Students are expected to read the text materials in order for them to intelligently participate in classroom discussion.
 Quizzes, periodical examination and board works.

Course Requirements:
 Attendance per school policy. GRADE EQUIVALENT
 Active participation in class discussions and workshops.
PERCENTAGE NUMERICAL GRADE
 On-time submission of projects and assignments. PERCENTAGE DESCRIPTION
 Students are expected to read the text materials in order for
them to Intelligently participate in classroom discussion. 99-100 1.00 Excellent
 Quizzes, periodical examination, & board works. 96-98 1.25
93-95 1.50
90-92 1.75
Grading System: 87-89 2.00 Very Good
A. With Laboratory B. Without Laboratory 84-86 2.25
Examinations 40% Examinations 40% 81-83 2.50
Assignments 10% Assignments 20% 78-80 2.75
Quizzes 20% Quizzes 20%
75-77 3.00
Class Recitation 10% Class Recitation 20%
Laboratory 20% 100% 74 and below FAILED
DRP DROPPED
100%

Consultation Period
9:30-11:30 PM / MWF / BSIS OFFICE

LIST OF TEXTBOOKS

Introduction to JAVA Programming, Revised Edition, Jake R. Pomperada, MAED-IT

Prepared by: Checked by: Approved by:

NORIEL A. GALOSO OWEN LLOYD G. CHIVA, MBA. FILIPINAS C. BATCHAR


Course Facilitator OIC, Office of the College Dean VP of Academic Affairs

You might also like