1. Course Details

Level: Juniors
Prerequisites: CSIS 130 Computer Programming II
Lecture Times: UMTWR 12:00 p.m. – 01:45 p.m. (Section 1), UMTWR 02:00 p.m. – 03:45 p.m. (Section 2)
Classroom: A208
AY / Semester: 2013 / Summer
Professor: Dr. I. Damaj
Contact Details: idamaj@auk.edu.kw
Course Detailed Site: http://lms.auk.edu.kw
Professor's Website: http://www.idamaj.net
Summary of Assessment Method: Pop Quizzes, midterm, assignments, project, and a final exam
Textbook:Object-Oriented Data Structures Using Java, Third Edition. Dale, Joyce, Weems. Published by JB Learning 2012
Software Tools: Java IDE
References: Data Structures and Other Objects Using Java (Fourth Edition) by Michael Main, 2012

2. Catalog Description

The Study of fundamental data structures, algorithms and their applications. Topics include lists and trees; queues and stacks; sort and search techniques; analysis and design of efficient algorithms; recursion. Prerequisite: CSIS 130

3. Student Learning Outcomes

At the end of this course the students will be able to:

Analyze the efficiency and the complexity of algorithms using basic methods
Understand the use of fundamental data structures, such as, lists, stacks, queues, trees, heaps, and graphs.
Implement data structures under Java.
Select the proper data structure and representation for a given problem
Understand different search and sort algorithms.
Implement search and sort algorithms under Java.
Use data structures and advanced efficient algorithms to implement a project under Java with a GUI interface.

Details	Topic	Chapter No.	Assessment
Weeks 1	Introduction	1
Weeks 1 - 2	Abstract Data Types and Collection Classes	2
Week 2	The Stack ADT	3	Assignment I
Week 3	Recursion	4	Midterm
Week 4	Trees and Heaps	5	Assignment II
Weeks 4 - 5	Search and Sort Algorithms	6
Week 5	Term Project Presentations