Download office experience practicum

CMPS 221-2M Data Structures
Fall 2013
Instructor name: Dr. Cong-Cong Xing, Associate Professor
Office location:
Peltier 108-D
Phone number: x4406
Email: [email protected]
Website: http://math.nicholls.edu/xing
Office hours: MWF: 9:35am-10:35am, 11:45am-12:15pm; T: 11:00am – 1:00pm (online); F: 1:40pm-4:30pm
Catalog Description: Data structure and algorithm design, correctness, and analysis. Emphasis on data abstraction, elementary data
structures, recursion and iteration, and reasoning about algorithms.
Prerequisites: C or better in CMPS 135.
Required Text and Other Materials:


Data Structures, 2nd ed., by E. Koffman and P. Wolfgang, John Wiley & Sons, 2010.
Java programming IDE (Dr. Java, free downloading: www.drjava.org)
Student Outcome Objectives: Upon completion of this course, students are expected to be able to: (1) have a basic grasp on the
idea of object-oriented programming (OOP); (2) practice OOP using Java; (3) use UML and Structure Chart to assist the design of
programs; (4) understand the mechanisms of elementary data structures; (5) use these data structures to code Java programs to solve
problems.
Course Contents (tentative):

Review of Java basics (if necessary)

OOP and class hierarchies
o ADTs, interfaces, and Java API
o Introduction to OOP
o Method overriding, method overloading, and polymorphism
o Abstract classes
o Class Object and casting
o Packages and visibility
o A shape class hierarchy

Lists and collections framework
o The list Interface and ArrayList class
o Applications of ArrayList
o Implementation of ArrayList class
o Single-linked lists
o Double-linked lists
o The LinkedList class and the Iterator, ListIterator, and Iterable Interfaces
o Implementation of a Double-linked list class
o The collections framework design
o Applications of the LinkedList class

Stacks
o Stack ADT
o Stack applications
o Implementing a stack
o More stack applications

Queues
o Queue ADT
o Maintaining a queue of customers
o Implementing the Queue interface
o The Deque interface
o Simulating waiting lines using queues

Recursion
o Recursive thinking
o Recursive definitions and math formulas
o Recursive array search
o Recursive data structures
o Problem solving with recursion
Method of Instruction: Lecture, homework, discussion in class, reading, labs, assignments, tests, and exams.
Course Requirements: Towards a successful completion of this course, students are required to accomplish the following: (as many
as needed) homework, (as many as needed) labs and assignments, 2 or 3 tests, and 1 final (comprehensive) exam.
Methods of Evaluation: The following will be used to compute your overall average and letter grades:





90—100 A
80—89 B
70—79 C
60—69 D
0—49 F
with the distribution
10% -- labs
10% -- Homework
30% -- Assignments (projects)
30% -- Tests
20% -- Final Exam (comprehensive)
Make-up Procedure: Make-up tests are allowed only in cases, and only with a legitimate excuse. Please contact your instructor in a
timely manner.
Academic Honesty Policy: As specified in the students conduct code handbook. (
Section Five of the Code of Student Conduct, ‘Academic Dishonesty and Disruptive Behavior,’ includes a requirement that
faculty file a charge complaint statement with their respective dean whenever a student is confronted or disciplined for
cheating. The Office of Academic Affairs will maintain these records, and any student confronted and/or disciplined for multiple
offenses of academic dishonesty will be brought before the Academic Affairs Integrity Committee for further review and
potential sanctions. Please read the Code of Student Conduct for further details regarding this policy.")
Attendance Policy: Attendance is extremely important for a successful completion of this course.
DROP DATE: The last day to drop the course with a “W” is: Nov. 5, 2013.
Americans With Disabilities Act (ADA):
Students with a documented disability are entitled to classroom accommodations under the ADA. To receive
accommodations, contact the Office of Disability Services at (985) 448-4430 or 158-A Shaver Gym. Additional
information can be found at www.nicholls.edu/disability
Academic Grievances:
The proper procedure for filing grade appeals or grievances related to academic matters is listed in Section 5 of the Code of
Student Conduct and at the following link: http://www.nicholls.edu/documents/student_life/code_of_conduct.pdf.
Continued Learning following an Extreme Emergency:
In order to make continued learning possible following an extreme emergency,
Students are responsible for:

reading regular emergency notifications on the NSU website;

knowing how to use and access Blackboard (or university designated electronic delivery system);

being familiar with emergency guidelines;

evacuating textbooks and other course materials;

knowing their Blackboard (or designated system) student login and password;

contacting faculty regarding their intentions for completing the course.
Faculty is responsible for:

their development in the use of the Blackboard (or designated) software;

having a plan for continuing their courses using only Blackboard and email;

continuing their course in whatever way suits the completion of the course best, and being creative in the continuation of
these courses;

making adjustments or compensations to a student’s progress in special programs with labs, clinical sequences or the like
only in the immediate semester following the emergency.
Final Note:

The instructor remains the right to make any changes to this syllabus.