Semester: Fall 1998 Room: 2145 NH Time: 2:00 - 3:15 PM, T/TH
This is the foundation course in data structures and computer
software for those who are majoring in computer science and
computer information systems.
Arrays, stacks, and queues; linked lists; trees and graphs.
Prerequisites: CS 140 and either MAT 290 or MAT 107.
C or C++
Turbo Pascal
E-mail
Netscape/Explorer
Textbook: Data Structures, Algorithms, and Software Principles, by
Thomas A. Standish.
Addison-Wesley Publishing Company.
1. Introduction to Data Structures
2. Static Memory Allocation Vs. Dynamic Memory Allocation
3. Information Retrieval
4. Sorting
5. Trees
6. Algorithm Analysis
7. Graphs
The grades for the course will be assigned based on the following
percentages:
. Tests (3-4): 70 - 80 %
. Assignments (4-6): 20 - 30 %
. No late assignments
. No makeup tests. If you miss a test, the final score will
be assigned for that test.
Said C. Fares
Office: 2132 Nevins Hall
Traditional Office Hours: 9:15 - 11:00 AM T/TH or by
appointment
Electronic Office Hours: Any day, any time
E-mail: sfares@valdosta.edu
Phone: (912) 333-5780
August 19: First Class September 7: Labor Day October 9: Midterm Nov. 23-27: Thanksgiving Dec. 9: Last Class Dec. 10: Exam-Prep Dec.(Fri.) 11: Final (3:15-5:15PM) Dec. 17: Graduation
Last update August 20, 1998