COMPUTER SCIENCE 1320

COURSE SYLLABUS

Fall 1999

Dr. Maury Eggen

COURSE: Problem Solving and Algorithm Design I

INSTRUCTOR: Dr. Maurice L. Eggen

OFFICE: Halsell 201L

OFFICE HOURS:
Others by appointment

MEETING HOURS AND ROOM:
1320-1: 8:30-9:20 MWF, Halsell 228,
2322-1: 10:30-11:20 MWF, Halsell 329,
3366-1: 2:30-3:45 MW, Halsell 329,

TEXT MATERIALS: Problem Solving with C++, The Object of Programming by Walter Savitch, Addison Wesley Publishers, Second Edition, 1999

COURSE: This course is the first course for computer science majors, following the guidelines established by the Association for Computing Machinery. This course also partially satisfies the requirements for Understanding the World Through Science of the common curriculum. The course content will include learning about block structured strongly typed programming languages as well as conceptual information including beginning data structures, computer arithmetic, computer organization, operating systems, programming languages, sorting and searching. Our study will include data types, arrays, strings, structures, files, recursion, decisions and loops.

PREREQUISITE: none

COURSE GOALS AND OBJECTIVES: The objectives of this course include, but are not limited to, the following:

1. Learning fundamental problem solving methodology
2. Applying problem solving techniques to algorithm design
3. Implementing algorithms in a suitable programming language
4. Development and analysis of algorithms
5. Introduction to the basic topics in data structures
6. Introduction to sorting and searching algorithms

LABORATORY PROBLEMS: Several homework laboratory problems will be required for successful completion of this class. Problems will be coded in a suitable programming language on the departmental UNIX network. These problems are to be completed on an individual basis. Solutions turned in for grading must represent your own individual effort. Each problem submission must include a printed listing of the programs as well as documentation for the programs submitted. Detailed requirements for problem submission will be given in class. Each laboratory problem will have a due date. Homework is due at the beginning of the period on the day assigned. Late work will not be accepted for full credit.

GRADES: The grades in this class will be determined by the results of three major examinations, given at approximately equal intervals in the semester, by the results of several laboratory assignments, and by the results of periodic quizzes. Each of the three examinations will be approximately equally weighted, including the final, which will be given during the final examination week, and will serve as the third examination. Each examination is comprehensive, but will emphasize the most recent material. Each of the laboratory assignments will be worth a variable number of points, depending on difficulty. Averages will be calculated as a simple percentage, points earned divided by points possible. Letter grades will be assigned according to the following scale:
90-100 A
80-89 B
70-79 C
60-69 D
with plus and minus grades assigned in marginal cases. I advise you to keep track of your scores so you know where you stand in the class at any time.

EXAMINATION DATES:
Examination 1: October 1, 1999
Examination 2: November 5, 1999
Reading Days: December 9,10, 1999
Final Examination: As scheduled, final examination week:

NOTES:

1. Regular class attendance is required. Each unexcused absence deducts one percentage point from your final average. Excessive absences will be reported to appropriate university officials and may cause you to be (involuntarily) withdrawn from the class. Homework assignments are expected complete and on time. If you keep up you will have a better chance to be successful in this class, but if you fall behind you will have difficulty catching up. Make sure to contact your instructor if you are having difficulty.

2. Programs that are identical beyond coincidence are in violation of the Academic Integrity policy of the university and will result in disciplinary action, including, but not limited to a failing grade on that assignment for all parties involved. You are responsible for the security of your work, both electronic and hard copy.

3. Discussion of the homework assignments between students is encouraged, but when it comes time for the final submission, make sure it is your own work. You are cheating yourself if you get the program from some source other than creating your own.

4. Expect a quiz once per week. Quizzes will usually be given on Mondays and will cover the previous week's work. Quizzes will be taken when scheduled and will not be made up. Examinations will be taken when scheduled and will not be made up.

5. Homework will be due at the beginning of the class period on the day assigned. LATE WORK WILL NOT BE ACCEPTED. Make sure you resolve problems with printing, workstations, communication, etc. IN ADVANCE so your work may be submitted in a timely manner. Homework will NOT BE ACCEPTED FOR CREDIT if summitted late. Those of you who submit work late penalize the conscientious students who turn in their work on time.

6. The only exceptions to these policies are for University sanctioned activities or illness and require a note from your supervising professor (coach) or doctor. If you have unusual circumstances (as we all sometimes do) please discuss these with your instructor in advance.

ADDITIONAL REFERENCES:

Eggen and Eggen, Introduction to Computer Science using C, PWS publishers, 1996.

Cormen, Lieserson and Rivest, Introduction to Algorithms, McGraw Hill, 1990

Kelley and Pohl, C by Disection, The Essentials of C Programming, Benjamin Cummings, 1992, Second Edition

Schildt, C The Complete Reference, McGraw Hill, 1990, Second Edition

Kernighan and Ritchie, The C Programming Language, Prentice Hall, 1988, Second Edition

Hanly, Koffman and Friedman, Problem Solving and Program Design in C, Addison Wesley, 1993

Sobell, A practical Guide to the Unix System, Benjamin Cummings, Third Edition, 1995

King, C Programming, A Modern Approach, Norton Publishers, 1996

Return to Dr. Eggen's Home Page