CPCS204
|
Course Name
|
Course Code
|
Data Structures I
|
CPCS 204
|
Prerequisite
|
Credit Units
|
CPCS 203
|
Theory
|
Practice
|
Training
|
Credit
|
|
3
|
1
|
0
|
3
|
|
Course Description
|
The course aims to enable the student to understand in-depth data structures and to know how to apply them to resolve practical issues. It also aims at teaching students how to analyze algorithms performance.
|
|
|
Course Contents
|
$ Introduction to the principles of programming and object-oriented approach and abstraction of data types.
$ Arrays and linked lists.
$ Stacks and queues.
$ Trees.
$ Tables.
$ Topographic forms.
$ Methods to resolve the issues, sort and search.
$ Analysis of algorithms difficulty.
|
|
|
Course Outcomes
|
Upon finishing this course, the student should:
$ Knowledge of the basics of data structures and their different kinds.
$ How to select appropriate types of data structures to suit the desired application.
$ The use of data structures with appropriate algorithms in software development.
|
|
|
References
|
- M. T. Goodrich and R. Tamassia, "Data Structures and Algorithms in Java," 4th Edition, 2005, Wiley, ISBN: 978-0471738848.
- Simon Gray, "Data Structures in Java: From Abstract Data Types to the Java Collections Framework," 2006, Addison Wesley, ISBN: 978-0321392794.
|
Back To Study Plan
|
Last Update
6/6/2010 2:44:49 PM
|
|
|