# CSCI 230 Syllabus – Summer 2013

Instructor

Aspen Olmsted
Course website : http://blogs.cofc.edu/olmsteda
Tel: 843.953.6600
Email: Please use aspen.olmsted@cs.cofc.edu with Subject = CSCI230
Office: J. C. Long Building 226
Office hours: By Appointment

Class place and time

Classroom: J.C. Long Building 221
M W 5:30 8:30 PM

Catalog description

CSCI 230 CData Structures and Algorithms
This course reviews and develops the abstract data type as a mathematical model. Data structures and algorithms are developed as concrete realizations of the objects and operations of the abstract data type. Topics include a review of basic data structures, trees and graphs, and analysis of the efficiency of algorithms.
Prerequisite: CSCI 221 and MATH 207.

Course Outcomes

1. Understand the analysis of algorithms using Big-O notation.
2. Understand the Abstract Data Type as a model of data and operations.
3. Understand the definitions of stack, queue and list.
4. Develop insertion, retrieval and deletion algorithms for array and linked implementations of stack, queue and list.
5. Evaluate the algorithms for stack, queue and list for the array and linked implementations using Big-O.
6. Understand the definitions of binary tree, binary search tree and some balanced search tree.
7. Develop insertion, retrieval and deletion algorithms for binary search tree and some balanced search tree.
8. Evaluate the algorithms for unbalanced and balanced search trees using Big-O.
9. Understand the definition of hashing.
10. Develop insertion, retrieval and deletion algorithms for hashing.
11. Evaluate the hashing algorithms using Big-O.
12. Understand the definitions of heap and priority queue.
13. Develop insertion, retrieval and deletion algorithms for heap and priority queue.
14. Evaluate heap and priority queue algorithms using Big-O.
15. Develop selection, insertion, merge, quick and heap sorting algorithms.
16. Evaluate the sorting algorithms using Big-O.
17. Understand the definitions of graph, node, edge and other relevant graph terminology.
18. Develop traversal, shortest path and minimal spanning tree algorithms for graphs.
19. Evaluate the traversal, shortest path and minimal spanning tree algorithms using Big-O.

Professor Assumptions

I am assuming because you are in this class you want to learn about data structures.  Therefore, it is my job to use the 40 hours of class time and the 80 hours of outside work to get you there.

Required text

Introduction to Java Programming Comprehensive Version, 9th Edition, 2012 Retail New Price \$149.00.

100-90 (A); 87-89 (A-); 86-84 (B+); 83-80 (B); 79-77 (C-); 76-74 (C+); 73-70 (C); 69-67 (C-); 66-60 (D); else (F)

Evaluation schedule

40% Final
40% Quizzes
20% Programming

Programming

Each chapter will have several  programming assignments to implement algorithms we discussed in class.  We will have schedule lab days where you will show your solution to the professor  or graduate assistant.

Quizzes

We will have 10 quizzes and the lowest grade will be dropped automatically.  There will be no makeups for any reason.  So if you miss class during quiz time this will become your lowest grade.

Final

We will have one comprehensive final during the last day of class covering the material for the whole course.

Classroom disruption

Please read the College of Charlestons Student Code of Conduct. When you come to class please turn off your cell phones and all other electronic communication devices.  I do encourage discussion so if you have a question o not hold back from interrupting me if you are afraid I have moved on.  If it is something I will talk about a little later I will note it on the board so we do not forget.

Disabilities