COMPUTER SCIENCE 1320

COURSE SYLLABUS

Fall 2008

Dr. Maury Eggen

Course:

Problem Solving and Algorithm Design I

Instructor:

Dr. Maurice L. Eggen

Office:

Halsell 339A

Fall 2008 Office Hours:

Meeting Hours and Room:

1320-3: 1:30-2:20 MWF, Halsell 340
1320-4: 9:30-10:20 MWF, Halsell 340
3394-2: 10:30-11:20 MWF, Halsell 340

Text Materials:

Forouzan and Gilberg, Computer Science: A Structured Programming Approach Using C, Latest Edition, Thomson Course Technology, 2008

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 the Common Curriculum. The course content includes learning about block structured strongly typed procedural 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, functions, 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 including a significant final project, which will be discussed and assigned in class. Problems will be coded in a suitable programming language (C) on the departmental UNIX(LINUX) 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 documented (electronic) source code 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.

Grades:

The grades in this class will be determined by the results of three major examinations, given at approximately equal intervals in the semester, (see exam schedule below) 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:
September 29, 2008
Examination 2:
November 3, 2008

Reading Days:

December 10,11, 2008

Final Examination

CSCI 1320-3: Wednesday, December 17, 2008, 2:00pm
CSCI 1320-4: Thursday, December 18, 2008, 8:30am
CSCI 3394-2: Friday, December 12, 2008, 2:00pm

Important Dates:

Click Here for Important Dates

Fall Schedule Narrative from the Office of the Registrar

Fall Schedule Narrative including Final Exam Schedule

Fall 2008 Schedule of Events

Fall 2008 Schedule of Events

Academic Honor Code

All students are covered by a policy that prohibits dishonesty in academic work. The Academic Integrity Policy (AIP) covers all students who entered Trinity before the fall of 2004. The Academic Honor Code covers all those who entered the fall of 2004 or later.

The Integrity Policy and the Code share many features: each asserts that the academic community is based on honesty and trust; each contains the same violations; each provides for a procedure to determine if a violation has occurred and what the punishment will be; each provides for an appeal process.

The main difference is that the faculty implements the AIP while the Code is implemented by the Academic Honor Council. Under the Integrity Policy, the faculty member determines whether a violation has occurred as well as the punishment for the violation (if any) within certain guidelines. Under the Code, a faculty member will (or a student may) report an alleged violation to the Academic Honor Council. It is the task of the Council to investigate, adjudicate, and assign a punishment within certain guidelines if a violation has been verified.

Students who are under the Honor Code are required to pledge all written work that is submitted for a grade: "On my honor, I have neither given nor received any unauthorized assistance on this work" and their signature. The pledge may be abbreviated "pledged" with a signature.

Notes:

1. Regular class attendance is required. Role will be taken and attendance is considered mandatory. Excessive absences will be reported to you and to appropriate university officials and may cause you to be withdrawn from the class. Each student is allowed two absences without penalty. Beyond that, each unexcused absence will result in a penalty of one percentage point from your final average. Excused absences require a note from the appropriate university offical or from appropriate medical personnel.

2. 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.

3. 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 submitted late. Those of you who submit work late penalize the conscientious students who turn in their work on time.

4. 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:

K. N. King, C Programming: A Modern Approach

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

Return to Dr. Eggen's Home Page