Instructor: Dr. James Glenn
Office: DS 125d
Work Phone: (410)617-5394
Office Hours: M 12-1, W 2-4, R 1:30-3, F 10-11
e-mail: jglenn@cs.loyola.edu

Course Home Page: http://www.cs.loyola.edu/~jglenn/301/F2002/index.html

Class Meeting: MWF 9:00-9:50 in KH 006

Prerequisites CS 202
Corequisite: CS/MA 295

Required Text: C++ plus Data Structures (2nd ed.) by Dale and Teague

Course Description:
Elementary data structures are designed and built using an object oriented approach and language. Associated algorithms are analyzed for efficiency. Introduces a UNIX-based platform for programming.

Specific Educational Objectives of the Course:
At the completion of the course, the student will be able to:

• use UNIX tools to aid program development;
• analyze the efficiency of algorithms;
• write recursive procedures;
• use static and dynamically allocated objects in C++ programs;
• implement basic data structures including lists, stacks, queues, and trees;
• design object-oriented programs that use those data structures efficiently;
• implement those designs; and
• implement basic sorting algorithms.

Conduct of the Course:
Lectures will be used to introduce and explain new features of C++ and new data structures and algorithms. Readings from the required textbook will enhance students' understanding of those lectures. Weekly homework assignments (not necessarily done at a computer) will reinforce the concepts discussed in lecture. Those concepts will be put into use in programming projects. Two midterm exams and a final exam will also be used to evaluate students' progress.

Academic Integrity:
Loyola College Honor Code Statement:

"The Honor Code states that all students of the Loyola Community have been equally entrusted by their peers to conduct themselves honestly on all academic assignments.

The students of this College understand that having collective and individual responsibility for the ethical welfare of their peers exemplifies a commitment to the community. Students who submit materials that are the products of their own minds demonstrate respect for themselves and the community in which they study.

All outside resources or information should be clearly acknowledged. If there is any doubt or question regarding the use and documentation of outside sources for academic assignments, your instructor should be consulted. Any violations of the Honor Code will be handled by the Honor Council"

The Honor Code as is pertains to this class:All designs and code used for programming projects should be the work of only the student submitting the project. Work on exams should be solely the work of the student whose name appears at the top of the exam.

Student Athletes:
If you are a student athlete, please provide me with your travel and game schedule indicating when you will need to miss class to participate in athletic events. While travel for athletics is an excused absence, you will need to make up any missed work.

Learning Disabilities:
To request academic accommodations due to a disability, please contact the Disability Support Services Office at (410)617-2062. If you have a letter from their office indicating that you have a disability which requires academic accommodations, please present the letter to me so we can discuss the accommodations that you might need in this class.

Grading:

• Homework: 10%
• Programming Projects: 40%
• Midterm Exams: 15% each
• Final Exam: 20%

Final Grade Distribution:

A	A-	B+	B	B-	C+	C	C-	D+	D
93%	90%	87%	83%	80%	77%	73%	70%	67%	60%

Topics:

• introduction to UNIX
• comparison of Java and C++
• arrays and lists
• pointers and dynamic allocation
• linked structures
• design, analysis, and implementation of recursive algorithms
• searching and sorting
• tree structures and algorithms
• files
• software engineering and tools

Midterm Exams: Friday, October 11 and Friday November 15.

FINAL EXAM: Wednesday, December 18 at 9am.