Office: STF 252

Telephone: (580) 774-3116

Email: mehdi.raoufi@swosu.edu

Course Description:

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.

Student Objectives:

Upon successful completion of the course students should learn:

Defining and implementing Java Classes
Creating Classes from other classes, overriding and overloading
Defining and implementing interfaces
Derived classes, inheritance and polymorphism
ADT Lists, Stacks, Queues and their implementation
Searching and Sorting algorithms and their analyses; complexities and Big O notation
Binary Search tree, hashing, binary heaps and other advanced topics as time permits

Instructor Objectives:

The instructor’s goal is to maximize the educational experience of those students who bring an appropriate and sincere effort and interest to learn.

Required Textbook:

Carrano and Savitch, Data Structures and Abstractions with Java, 2^nd edition, 2007, Pearson Prentice Hall

Course grade:

Term exams (2) 30%

Final examination 30%

Laboratory Assignments, and final Project 40%

GRADES:

Grades will be calculated in the following manner:

90-100 A

80-89 B

70-79 C

60-69 D

0-59 F

Assignments:

This course involves extensive programming.
All assignments are due at the beginning of the class on the due date.
I will collect hard copy of assignments including input and output produced by testing the programs.
Java will be used to write programming assignments.
All programs must contain input/output and the following information:

Programmer Name: Your name

Course: COMSC 2413

Assignment: Lab number or homework number

Due Date:

File name:

Attendance:

It is your responsibility to attend all classes, labs as well as exams.
Put aside at least two hours of study for each hour of class.
Your success in the course will heavily depend on your attendance, participation in the classroom, time spent on lab and homework assignments, and time spent for study.
There will be no make-up exams or incomplete given except in extreme circumstances.

Cheating:

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.

Disabled Students:

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.