Scribd
Upload
27 views2 pages

CS201-Data Structures

This document provides a sample syllabus template for a "Data Structures" course with the course number CS201. The syllabus outlines the course description, objectives, topics to be covered including basic and advanced data structures, and a timeframe. It also lists required readings and course requirements. The course aims to teach students to choose, implement, and evaluate appropriate data structures for programming problems and effectively manage memory in data presentation.

Uploaded by

sunil2468
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
27 views2 pages

CS201-Data Structures

This document provides a sample syllabus template for a "Data Structures" course with the course number CS201. The syllabus outlines the course description, objectives, topics to be covered including basic and advanced data structures, and a timeframe. It also lists required readings and course requirements. The course aims to teach students to choose, implement, and evaluate appropriate data structures for programming problems and effectively manage memory in data presentation.

Uploaded by

sunil2468
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

COMMISSION ON HIGHER EDUCATION

SAMPLE SYLLABUS TEMPLATE

COURSE NUMBER: CS201

TITLE: Data Structures

DEPARTMENT / PROGRAM: BSCS

SCHOOL:

SEMESTER AND SCHOOL YEAR:

INSTRUCTOR:

• COURSE DESCRIPTION

This course introduces the students to the design and implementation


of basic and advanced data structures. Topics include basic data
structures, trees, graphs and hashing.

• COURSE OBJECTIVES (DESIRABLE OBJECTIVES)

At the end of this course, the student should be able to:

1. Choose, implement and evaluate the appropriate data structures


for specific programming problems and

2. Use and manage memory effectively in data presentation.

• COURSE OUTLINE AND TIMEFRAME

TOPICS AND READINGS DATE


1. Basic Data Structures
• Arrays
• Linked Lists
• Stacks
• Queues

2. Trees
• Binary Trees
• Binary Search Trees
• AVL
• RB Trees

3. Graphs

CS201 Page 1
• Representations
• Search Algorithms (BFS, DFS)
• Shortest Path Problems
• Spanning Trees

4. Sets

5. Hashing

• REQUIRED READINGS

• SUGGESTED READINGS

• COURSE REQUIREMENTS

• CONSULTATION HOURS

CS201 Page 2

You might also like