Scribd
Upload
78 views16 pages

COMP 20063: Data Structures and Algorithms

This document provides a course syllabus for a data structures and algorithms course. It includes information about the course code, title, credit hours, prerequisites, description, objectives, outcomes, content, lessons, materials, requirements, grading system, reading materials, and classroom management policies. The course aims to teach fundamental data structure concepts and common structures like arrays, stacks, queues, linked lists, trees and graphs. Assessments include quizzes, exercises, projects, exams. Classroom rules outline proper conduct, attire, use of technology and respect for others.

Uploaded by

Francheska A. del Rosario
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
78 views16 pages

COMP 20063: Data Structures and Algorithms

This document provides a course syllabus for a data structures and algorithms course. It includes information about the course code, title, credit hours, prerequisites, description, objectives, outcomes, content, lessons, materials, requirements, grading system, reading materials, and classroom management policies. The course aims to teach fundamental data structure concepts and common structures like arrays, stacks, queues, linked lists, trees and graphs. Assessments include quizzes, exercises, projects, exams. Classroom rules outline proper conduct, attire, use of technology and respect for others.

Uploaded by

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

COMP 20063

Data Structures and Algorithms


Course Syllabus

Course Code: COMP 20063

Course Title: DATA STRUCTURES AND ALGORITHMS

Course Credit: 3 UNITS

Hours Equivalent: 5 HOURS

Pre-Requisites: COMP 20043 (DISCRETE MATHEMATICS)


Course Syllabus

Course Description

This course deals with the fundamentals of


organizing and manipulating data efficiently
using clean conceptual models.
Course Syllabus

Course Description

In particular, the emphasis is on the organization


of information, the implementation of common
data structures and techniques of data
abstraction.
Course Syllabus

Course Description

Common data structures are: arrays of one or


more dimensions, stacks, linked lists (singly and
doubly linked), queues, trees (balanced, binary,
and so on), and graphs.
Course Syllabus

Course Objectives

• To understand the basic concepts of data


structures and algorithms
• To understand concepts about searching and
sorting techniques
• To understand basic concepts about stacks,
queues, lists, trees and graphs
• To understanding about writing algorithms and
step by step approach in solving problems with
the help of fundamental data structures
Course Syllabus

Course Outcomes

• Ability to analyze algorithms and an algorithm


correctness.
• Ability to summarize searching and sorting
techniques
• Ability to describe stack, queue and linked list
operation.
• Ability to have knowledge of tree and graphs
concepts.
Course Syllabus

Course Content

• Introduction to data structures and algorithms


• Searching and sorting techniques
• Stack, queue and linked list operation.
• Trees and graphs concepts.
Course Syllabus

Course Lessons and Materials


Lesson-Handouts will be uploaded in your
class FB group.

Teaching Methodologies and


strategies
• Lectures, Interactive Discussion
• Question and Answer
• Demonstration
• Games
Course Syllabus

Course Requirements

1. Quizzes
2. Hands-on Exercises /Machine Exercises
3. [Case Studies / Independent Study]
4. [Seatwork, Assignment, and Oral
Recitations]
5. Major Exams (Mid and Final Terms)
Course Syllabus

Mid Term
Course Grading System: Final Term
Class Participation (2/3) Class Participation (2/3)
• Quizzes (50%) • Quizzes (50%)
• Hands-on Exercises (50%) • Hands-on Exercises (50%)
• Project/Case Studies • Project/Case Studies
• Seatwork • Seatwork
• Assignment • Assignment
• Recitation • Recitation
Major Examination (1/3) Major Examination (1/3)

FINAL SUBJECT GRADE = (MIDTERM + FINALS) / 2


Course Syllabus

Reading Materials

• No prescribed books.
• Any books or references regarding Microsoft
Visual C# Programming
Classroom Management
& Discipline

1. Be on time, be on task, be prepared.


2. Demonstrate respect for yourself,
other students and property.
3. Behave appropriately at all times.
4. Wear proper attire at all times.
5. Bring required materials.
6. Use polite speech and body
language.
Classroom Management
& Discipline

7. Do not cheat.
8. Always follow my directions
immediately.
9. Put your bags in the baggage cabinet.
10. Do not use electronic and non-electronic
gadgets.
11. Wear foot rug.
12. Others as may deemed necessary to
have a better classroom management
and discipline.
Classroom Management
& Discipline

Others

✓ Observe courtesy - greetings to pay


respect to teachers, personnel and
officials
✓ Observe proper decorum in hallways
and classrooms
✓ Observe limit of access inside the
faculty room
✓ Observe honest and proper use of IT
properties
Next…

Review discussion

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy