1. Computer Engineering Department Islamic University of Gaza
ECOM 3312 Data Structures and Algorithms
Undergraduate Course
Fall
Prof. Dr. Eng. Mohammad A. Mikki
Computer Engineering Department Chair
College of Engineering
Islamic Universoity of Gaza, Gaza, Palestine
Homepage:
Tel.: Ext. 2883
Skype ID: Mohammad.mikki

2. Syllabus & Course Overview
Lecture 1
Syllabus & Course Overview

3. Instructor Prof. Dr. Eng. Mohammad A. Mikki mmikki@iugaza.edu.ps
Computer Engineering Department Chair
College of Engineering
Islamic Universoity of Gaza, Gaza, Palestine
Homepage:
Tel.: Ext. 2883
Skype ID: Mohammad.mikki

4. Where to find me
Admin. Building
Room B323

5. Office Hours
To be announced and
by appointment

6. Teaching Assistants
To be announced

7. Course Information
Course Code: ECOM 3312 Course Name: Data Structures and Algorithms (Undergraduate Course) Number of credits: 3

8. Course Description
The course covers the fundamentals of data structures and object-oriented programming.
They are two sides of the same coin:
As a programmer becomes more proficient, they realize that how well and efficiently a problem can be solved often depends on how the data are stored. Some of the ideas are quite sophisticated and clever, and we'll explore a spectrum of them in this class, ranging from fairly basic to moderately advanced structures.
The other side is that once one realizes the importance of data structures, it is natural to think of programs not as sequences of instructions that pass around some data, but as data packets that come with the code needed to process them. This is at the heart of the object-oriented design paradigm, and often leads to more modular and extensible (and readable) programs.
We will learn about the basics of object-oriented programming, along with many of the interesting things that can be naturally done within the paradigm.
The class will put significant emphasis on a theoretical understanding of data structures, their implementation, and the object-oriented viewpoint.
Assignments will contain significant programming projects along with programming-free questions to explore how data structures work

9. Course Learning Outcomes
After the successful completion of the course, the student will have the:
Ability to choose appropriate and efficient data structures and algorithms to solve a problem.
Ability to compare data structures and algorithms for efficiency using algorithm analysis and experiments.
Ability to apply algorithm analysis and knowledge of discrete mathematics to evaluate algorithms and data structures.
Ability to implement and use linear data structures, including stacks, queues, lists
Ability to implement and use search structures and algorithms including binary search, search trees, and hash tables.
Ability to use and implement search data structures, including search trees and hash tables.
Ability to use and implement priority queues.
Knowledge of and ability to implement sorting algorithms and compare their performance analytically and empirically
Understanding of graphs and their representations; ability to implement graph search using BFS, DFS, and Dijkstra's Algorithm.
Ability to solve problems using pointers and dynamically managed memory.
Ability to write recursive functions and understand when recursion is appropriate to a problem.
Ability to design, document, and implement classes and object hierarchies.
Ability to apply tools and techniques for program correctness, such as unit testing, use of a symbolic debugger, and assert statements.
Ability to write readable and maintainable code.
Ability to explain computational solutions in person and in writing.

10. Prerequisites “Introduction to Programming” course
“Introduction to Computing” course

11. Course Website The common syllabus is posted on the course webpage at
and
My homepage   
Please check this webpage at least once a week for:
lecture notes
Assignments and exams
Assignments and exams solutions
Useful links
Supplementary material, and
Announcements
Your instructor will provide and/or post a revised version of the course syllabus with additional information stating his policies for the course, such as attendance policy, labs and assignments submission policy, quizzes policy, and others. Please check with your instructor.

12. Useful Links
CS104 – Spring 2015: Data Structures and Object Oriented Design, University of Southern California
bits.usc.edu/cs104
CS 302 Data Structures, Department of Computer Science & Engineering, UNR, Spring 2015
CS 32: Introduction to Computer Science II, Computer Science Department, University of California, Los Angeles, Winter 2015

13. Class Information 201 101 Section Sun, Tue Days 14:00-15:30
12:30-14:00
Time
L401
K407
Location

14. Required Textbook and Material
Title:
Data Structures and Algorithms in Java,
Sixth Edition,
Authors:
Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser,
Publisher:
John Wiley & Sons, Inc., 2014
ISBN: (paperback)
The textbook is required. While the class will not always follow the order or presentation style of the textbook, the textbook is an excellent source for much of the material.

15. Additional Material
In addition to the textbook and lecture notes, we strongly recommend that each student has access to a quality book on the Java programming language

16. Class Expectations Class attendance Text reading in advance
Class participation
Working hard

17. Class Schedule Week Topic Assignments 1 Sat. 09.Sep.
(Start day of classes)
Course Syllabus & Overview
Ch. 3: Fundamental Data Structures
Using Arrays (Goodrich_6e_Ch03_Arrays.ppt) 2
Sat. 16.Sep.
Singly Linked Lists (Goodrich_6e_Ch03_LinkedLists.ppt)
Circularly Linked Lists (Dr.Mikki-Ch3-CircularlyLinkedLists.ppt) 3
Sat. 23.Sep.
Doubly Linked Lists (Goodrich_6e_Ch03_DoubleLists.ppt) 4
Sat. 30.Sep.
Ch. 4: Algorithm Analysis (Goodrich_6e_Ch04_Analysis.ppt)
Quiz#1 on Linked Lists

18. Class Schedule Week Topic Assignments 5 Sat. 07.Oct.
Ch. 6: Stacks, Queues, and Deques
Stacks (Goodrich_6e_Ch06_Stacks.ppt)
Quiz#2 on Algorithm Analysis 6
Sat. 14.Oct.
Queues, and Deques (Goodrich_6e_Ch06_Queues.ppt)
Quiz#3 on Stacks 7
Sat. 21.Oct.
Ch.7: List and Iterator ADTs (Goodrich_6e_Ch07_Lists.ppt)
Quiz#4 on Queues and Dequeue 8
Sat. 28.Oct.
Ch. 8: Trees
General Trees (Goodrich_6e_Ch08_Trees.ppt)
Binary Trees (Goodrich_6e_Ch08_Trees.ppt)
Quiz#5 on Lists and Iterator ADTs

19. Class Schedule Week Topic Assignments9
Sat. 04.Nov. –
Thu. 09.Nov.
الامتحانات النصفية للفصل الأول 2017/2018م 10
Sat Nov.
Ch. 8: Trees
Implementing Trees (Goodrich_6e_Ch08_Trees.ppt)
Tree Traversal Algorithms (Goodrich_6e_Ch08_Trees.ppt) 11
Sat. 18.Nov.
Ch. 10: Maps, Hash Tables, and Sip Lists
Maps (Goodrich_6e_Ch10_Maps.ppt)
Quiz#6 on Trees 12
Sat. 25.Nov.
Hash Tables (Goodrich_6e_Ch10_HashTables.ppt)
Quiz#7 on Maps 13
Sat. 02.Dec.

20. Class Schedule Week Topic Assignments14
Sat. 09.Dec.
Ch. 14: Graph Algorithms
Data Structures for Graphs (Goodrich_6e_Ch14_Graph.ppt)
Graph Traversals (Goodrich_6e_Ch14_BFS.ppt, Goodrich_6e_Ch14_DFS.ppt)
Quiz#8 on Hash Tables 15
Sat. 16.Dec.
Transitive Closure
Shortest Paths (Goodrich_6e_Ch14_ShortestPath.ppt)
Quiz#9 on Graph Traversals 16
Sat. 23.Dec.
Minimum Spanning Trees (Goodrich_6e_Ch14_MST.ppt)
Quiz#10 on Shortest Paths
Sat. 30.Dec.
بداية الامتحانات النهائية للفصل الأول 2017/2018

21. Assessment (Grading) Criteria
Attendance and class participation
10%
Quizzes
Midterm Exam
20%
Final exam
40%
Discussion (TA)

22. Attendance
Class attendance is required and very important for successful completion of the course. Students are expected to attend and participate in every class which is interpreted as the entire class period and lab period. Excused absences must be planned for, when possible, and justified with documentation. The student is responsible for making up missed class/lab sessions. Late arrival that causes disruption, early departure that causes disruption, excessive conversation among students, and other actions that disrupt the classroom are unacceptable.

23. Use of Laptops
Use of laptops/PDAs/Tablets and other electronic devices during the class is not allowed.

24. Mobile Phones
In order to minimize the level of distraction, all mobile phones must be on quiet mode during class meeting times.

25. Any Questions ?