COMSC 2413 Data Structures
Fall of 2009, Section 1420
Course Title: Data Structures
Prerequisite: Introductory course in Java
This course introduces the techniques needed to manipulate the commonly occurring data structures. It begins with Java approach for data abstractions and continues with how to create and maintain various data structures; arrays, linear and linked lists, stacks, queues, binary search tree, hashing and binary heaps. Algorithms and their complexities also will be covered in this course.
Upon successful completion of the course students should learn:
The instructor’s goal is to maximize the educational experience of those students who bring an appropriate and sincere effort and interest to learn.
Carrano and Savitch, Data Structures and Abstractions with Java, 2nd edition, 2007, Pearson Prentice Hall
Term exams (2) 30%
Final examination 30%
Laboratory Assignments, and final Project 40%
Grades will be calculated in the following manner:
Programmer Name: Your name
Course: COMSC 2413
Assignment: Lab number or homework number
All work on the assignment must be individual. Any code that you submit for programming assignment must be entirely your own, and must not be derived from the work of other people in your class or from any publicly-available sources. You may discuss possible solution strategies with your classmates and others, but you may not share codes. You are expected to abide by the University’s Rule of Academic Responsibility. Misrepresenting other people’s programs as your own is plagiarism, and will be cause for those students, both copier, and supplier, to receive F for the semester grade. It is your responsibility to protect your work from being copied by others.
In compliance with the American with Disabilities Act, all qualified students enrolled in this course are entitled to reasonable accommodations. It is the student’s responsibility to inform the instructor of any special needs before the end of the second week of classes.