Scribd
Upload
62 views

Agoo Computer College: Course Syllabus

COURSE NUMBER: CS201 DEPARTMENT / PROGRAM: BSCS course DESCRIPTION: Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays, strings, and hash tables. Teaching student how to develop the data structure around the concept of an abstract data type (ADT) 1. Students will be knowledgeable of fundamentals of Data Structures and methods of implementation. 2. Students will manage and analyze of a complex problem by designing a proper

Uploaded by

Renee Blas Valdez
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
62 views

Agoo Computer College: Course Syllabus

COURSE NUMBER: CS201 DEPARTMENT / PROGRAM: BSCS course DESCRIPTION: Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays, strings, and hash tables. Teaching student how to develop the data structure around the concept of an abstract data type (ADT) 1. Students will be knowledgeable of fundamentals of Data Structures and methods of implementation. 2. Students will manage and analyze of a complex problem by designing a proper

Uploaded by

Renee Blas Valdez
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

AGOO COMPUTER COLLEGE

www.13HQ.com
Agoo, La Union

COURSE SYLLABUS
2nd Semester, AY 2010-2011

COURSE NUMBER: CS201 TITLE: Data Structures


DEPARTMENT / PROGRAM: BSCS INSTRUCTOR: Mr. Renee Blas R. Valdez

• COURSE DESCRIPTION

Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures;
arrays, strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract
data types. Algorithms for sorting and searching. Introduction to the Java programming language.

• COURSE OBJECTIVES

The main task about this course is about all kinds of data structure, memory structure and some operation.
Teaching student how to develop the data structure around the concept of an abstract data type (ADT).

1. Students will be knowledgeable of fundamentals of data structures and methods of implementation.

2. Students will manage and analyze of a complex problem by designing a proper solution method and coding it
in a programming language such as Java.

CS105 Page 1
3. Students will develop object-oriented codes and perform software life cycle.

4. Students will work with various sorting and searching techniques

5. Students will perform basic operations on files, strings, queues, stacks, linked lists, tables, and trees.

• COURSE OUTLINE

TOPICS AND READINGS


I. Introduction to Data Structures
a. Information and Meaning
b. Arrays, Strings, and Vectors in Java
c. Classes and Objects in Java
II. The Stack
a. Definition and Examples
b. Representing Stacks in Java
c. Example: Infix, Postfix and Prefix
d. Stacks of Objects of Varying Types
III. Recursion
a. Recursive Definition and Processes
b. Recursion in Java
c. Writing Recursive Programs
d. Simulating Recursion
e. Efficiency of Recursion
IV. Queues and Lists
a. The Queue and Its Sequential Representation
b. Linked Lists
c. Lists in Java
d. An Example: Simulation Using Linked Lists
e. Other List Structures

CS105 Page 2
V. Trees
a. Binary Trees
b. Binary Tree Representations
c. An Example: The Huffman Algorithm
d. Representing Lists as Binary Trees
e. Trees and their Applications
f. Example: Game Trees
VI. Sorting
a. General Background
b. Exchange Sorts
c. Selecting Tree Sorting
d. Insertion Sorts
e. Merge and Radix Sorts
VII. Searching
a. Basic Search Techniques
b. Tree Searching
c. General Tree Search Trees
d. Hashing
VIII. Graphs and their Applications
a. Graphs
b. Flow Problem
c. Linked Representation of Graphs
d. Graph Traversal and Spanning Forests

• REQUIRED and SUGGESTED READINGS

Books:
Data Structures using Java by Yedidyah Langsam, et al
Java 2 Complete by Sybex
How to Program Java 4th edition by Deitel

CS105 Page 3
• COURSE REQUIREMENTS

1. USB flash disk


2. Class Attendance
3. Written and Lab Quizzes / Exams
4. Projects
5. Major Exams

CS105 Page 4

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