Dr. Anwar Mamat
E-Mail: anwar@temple.edu
Office Location: Room 414 of Wachman Hall
Phone: 215-204-4207
Office hours: Monday 2:00-3:00pm
Wednesday 11:00am-12:00pm
or by appointment
Time/Place
Lectures: Tuesday 5:30 PM – 8:00 PM, Tuttleman Learning Center 302
Lab: Thursday 5:30 PM – 7:30 PM, Wachman Hall 207
Prerequisites
At least a C- in CIS 1068.
Course Description
The course introduces basic data structures, like linked lists, stacks, queues, trees and sets. Applications given as JAVA programming assignments will motivate the need for these abstract data types to implement algorithms efficiently. The second part of will introduce important algorithms, which build the basis of many applications. Among these concepts will be recursion, sorting algorithms (insertion sort, mergesort, heapsort, quicksort), and algorithms to traverse or organize data structures (balancing trees). Although the course is not an introduction to JAVA programming, JAVA will be used as an example for a modern, object oriented language. The course will closely follow the structure of the textbook.
Textbook
Data Structures: Abstraction and Design Using Java, Second Edition
Elliot B. Koffman, Paul A. T. Wolfgang
Wiley 2010, ISBN: 978-0-470-12870-1
Grading
Quizzes |
25% |
You should expect a short quiz each week. |
Midterm |
20% |
10/16/2012 |
Final |
30% |
12/13, 3:30 -5:30 PM Gladfelter Hall room 24 |
Lab |
25% |
Every Thursday |
Lab Assignments
There will be a series of programming assignments (6-8). You must write each program yourself but are encouraged to obtain help - from fellow students, the laboratory instructor or the instructor - to get to the point that you can do so. The assignments are to be handed in on time or credit may be lost. You may develop the programs on any system but the program must end up on our system so it can be accessed, edited, and run in the laboratory.
Policies and Rules