COMPUTER SCIENCE 1320
COURSE SYLLABUS
Spring 2010
Dr. Maury Eggen
Course:
Principles of Algorithm Design I
Instructor:
Dr. Maurice L. Eggen
Office:
Halsell 339A
Spring 2010 Office Hours:
- MWF 8:30am-9:30am
- MWF 10:30am-12:30pm
- MWF 2:30-3:30pm
- Others by appointment
Spring Meeting Hours and Room:
- 1323-1: 12:30-1:20 MWF, Halsell 340,
- 2321-1: 9:30-10:20 MWF, Halsell 340,
- 1320-2: 1:30-2: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:
- 1. The results of three major examinations, given at approximately
equal intervals in the semester. (see exam schedule below)
- 2. By the results of several laboratory assignments.
- 3. By the results of periodic quizzes.
- 4. By class attendance. (See below).
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:
February 15, 2010
Examination 2:
March 29, 2010
Reading Days:
May 3, May 4, 2010
Final Examinations
- CSCI 1320-2: Tuesday, May 11, 2010, 3:30-6:30pm
- CSCI 2321-1: Monday, May 10, 2010, 12:00-3:00pm
- CSCI 1323-1: Wednesday, May 5, 2010, 12:00-3:00pm
Important Dates:
Click Here for Important Dates
Spring Schedule Narrative from the Office of the Registrar
Spring Schedule Narrative including Final Exam Schedule
Spring 2010 Schedule of Events
Spring 2010 Schedule of Events
Final Exam Schedule
Final Exam Schedule
All students are covered by the Trinity University Honor Code that prohibits
dishonesty in academic work.
The Code asserts that the academic community is based on honesty and trust,
and defines specific violations as well as the procedure to determine if a
violation has occurred. The Code also covers the process of hearings for
alleged violations and the various sanctions applied for specific violations.
The Code also provides for an appeal process.
The Code is implemented by the Academic Honor Council. 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 collect the pertinent evidence, adjudicate,
and assign a sanction 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.
The specifics of the Honor Code, its underlying philosophy, and the norms for
sanctioning can all be found on the Academic Honor Council website, accessed
through the Trinity Homepage.
Notes:
- 1. Regular class attendance is required. Role will be taken and attendance is
considered mandatory.
One point will be awarded for each class attendance and one point will be deducted
for each unexcused absence. These points will be included in the calculation of
your final averages as described above in the section on "grading."
Excessive absences will be reported to you and to appropriate university
officials and may cause you to be withdrawn from the class. 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. Homework assignments
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. 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