Dr. Mohammad Ali H. Eljinini

Course Name: Data Structures & Algorithms

Course Number: 605223

COURSE DESCRIPTION:

(3 credit hours, Prerequisite: 605213)

Representation of fundamental data types, data structures such as, arrays, stacks, queues, linked lists, trees, heaps, hash tables, string process, data abstraction, dynamic storage allocation, sorting, searching and merging of information files, external storage management, analysis of algorithms (analyzing the time and space requirements of algorithm)

CONTENTS OUTLINE:

1 - Introduction to Data Structure

2 - Stacks and Queues

3 - Lists and Linked Lists 

4 - Searching

5 - Sorting 

6 - Recursion and Recursive Functions 

7 - Graphs and Trees 

 LAB ASSIGNMENTS:

In each major section the students will be given assignments for practicing and developing a good concept of the topic.

The Students will be required to attend the Lab hours as set in their schedules.

TEXTBOOK:

Data Structures And Program Design in C++, Kruse and Ryba,

Prentice Hall, 1/e, 1999

REFERENCES:

  1.  C++: An Introduction to Data Structures, Larry Nyhoff, Macmillan Publishing co., 1989

  2. Data Structures using C and C++ , Langsam, Augenstein, Tenenbaum

 EXAMS & GRADES:

First Exam: 25%  (20 + 5)

Second Exam: 25% (20 + 5)

Final Exam: 40%

Class Activities: 10%