Credits: 3

Prerequisites: MATH/CS 206

Catalogue description: Design and analysis of data structures for a variety of  applications. Lists, Trees, Heaps, Searching, Sorting, Hashing, Graphs. Extensive programming.

Syllabus: Detailed study of the machine independent techniques for handling and storing: array, lists, trees, and graphs. Independent data structures.

Textbook: Fundamentals of Data Structures in Pascal, Horwitz & Sahni, Prentice Hall

Other References:

1. Data Structures and Algorithms by Alfred V. AHO, John Hopcroft and Jef D. UllmanAddison-Wesley Series, ISBN: 0-201-00023-7
2. Algorithms and Data Structures: Design, Coreetness, Alaysis by Jeffrey H. Kingston, Addison-Wesley, ISBN: 0-201-40374-9
3. Data Structures and Algorithms in Java by Michael T. Goodrich and Roberto Tamassia, John Wily & Sons Inc., ISBN: 0-471-19308-9

Programming Language: Optional between Pascal, C, or Java.

Instructor: Prof. Mohammed Almulla

Email: almulla@mcs.sci.kuniv.edu.kw

Tel: (965) 481-1188 Ext. 5303 (work)

Office: Khaldia\1 Building, Room 3135

Office hours: 24, 9:15am-10:15am or by appointment
 

Teaching assistant: Mrs. Rena Al-Zaid

Email: rena@alzaid.com

Tel: (965) 481-1188 Ext. 7858 (office)

Office: Khal/3, Second floor, TA offices

Office hours: On her door

1. Assignments     %30
2. Midterm I:       %15    25 March, 2001
3. Midterm II:     %15      22 April, 2001
4. Final Exam     %40

1. Introduction 1 Hour

2. Analysis of algorithms 2 Hours

3. Strings, lists, stacks, queues, notion of Abstract Data Types 9 Hours

4. Trees, tree traversals, binary trees, expression trees, binary search trees 6 Hours

5. Heaps, priority queues 3 Hours

6. Sorting algorithms 3 Hours

7. Hashing 3 Hours

8. Graph representations, depth-first search, breadth-first search, minimum spanning trees, shortest paths. 14 Hours

Total number of hours 41

Click here to see the tutorials homepage.