Spelman College

Computer Science

CIS121 – Introduction to Computer Science

Fall 2005

Course Title:            CIS Introduction to Computer Science – Section 01

Credits/Hours:        4.00

Rationale:

Introduction to Computer Science is an introductory course to algorithmic problem solving techniques that can be used for solving problems with computers. The course presents the fundamentals for C++ program design, analysis, implementation, testing and debugging. In addition, the course explores how algorithms solve problems in the various domains of computer science.

Prerequisite: Math 115 Precalculus 1

Course Description:

Goals:

• Introduce problem solving methods and algorithm development.
• Develop solid analytical skills and good programming practices.
• Develop computing techniques for effectively using the computer as a problem-solving tool.
• Introduce concepts of structured and object oriented programming.
• Provide a foundation on which to build modem software engineering principles in later courses.
• Introduce the C++ programming language.
• Develop an appreciation for computing literature.
• Introduce issues in the computing field such as ethics and social implications.
• Provide experience with Internet tools and resources.

Objectives:

Upon completion of this course, the student should be able to:

• Develop algorithms for computer-solutions to problems.
• Code algorithms using the C++ language as a tool.
• Illustrate techniques of object oriented programming practices.

• Analyze, design, code, test, debug, and document C++ programs.
• Exhibit an interest in staying abreast of technology and the computing field by reading computing literature.
• Display an awareness of the ethical and social implications posed by the increasing use of computers.
• Use the Internet to communicate and obtain information.

Textbooks and Supplies:

The student must read each chapter of the book prior to its discussion. Following the class, the student should reread the material and work with the End of Chapter questions in the text.

• Schneider and Gersting. Invitation to Computer Science(C++ Version), 3^rd Ed.
• Deitel and Deitel, C++: How to Program, 4^th Ed.
• For Lab: Schneider and Gersting. Invitation to Computer Science: Laboratory Manual.

Method of Instruction:

Instruction will consist of classroom lectures, discussions, exercises, laboratories, and programming assignments.

• Assigned Readings: The schedule at the end of this syllabus indicates assigned readings. These should be completed prior to class time to aid understanding of the material.
• Homework Problems: You are expected to complete problem sets as given. The problem sets are related to the material of the chapter being covered at the time. These problems may or may not be found within the textbook.
• Lab Assignments: You are expected to complete lab assignments during the allotted laboratory time. These assignments will revolve around a software application that has been specifically designed for this course. You will need to answer the questions during the lab, and submit the answers at the end of the lab period.
• Programming Assignments: It is virtually impossible for you to learn the material in this course without some type of directed hands-on experience. There will be a minimum of ten programming assignments for you to complete independently to reinforce the material covered in class. Much of our classroom discussion will be devoted to the concepts, which these programs will utilize. You will be held responsible on tests for the concepts illustrated. Written descriptions of all programming assignments will be provided as the semester progresses. The due date for each assignment will be announced in class, and the assignments must be submitted by midnight following the class on the announced date in order for the assignment to be considered on time.
• Programming assignments must be submitted with the following:

1. Each program must be formatted according to the handout C++ Program Formatting Standards, which is available on-line (www.spelman.edu/~compsci/cis121).
2. Each programming assignment must be submitted with: requirements specification, program listing, sample of input data when appropriate, and listing of results (output of compilation phase).

Topical Outline:

This is meant to serve as an approximate schedule. There are some topics which may take less time, and other topics which may take more time depending on the class itself. Significant modifications to the schedule will be made as early as possible.

a. Aug. Chapter 1 Introduction to Computer Science (2 days)

b. Aug. Chapter 2 Algorithm Discovery (3 days)

c. Sep. Chapter 3 More Algorithms and Analysis (6 days)

EXAM #1 (target date is Sep 23^rd)

d. Sep. Chapter 4 Binary, Logic, Gates (3 days)

Presentation Topics Due Monday 9/26/04

e. Sep. Chapter 5 Computer System Hardware (3 days)

f. Sep.-Oct Chapter 8 & Deitel Introduction to C++ (6 days)

** Fall Break (10/17 – 10/18) **

EXAM #2 (target date is Oct 21^st)

g. Oct. Chapter 8 & Deitel C++ Data structures intro (3 days)

h. Nov. Chapter 8 & Deitel OOP in C++ (6 days)

EXAM #3 (target date is Nov. 14^th)

i. Nov. Student Presentations (3-4 days)

EXAM #4 (hands-on C++ Prog. Exam is weed of Nov. 16^th and 17^th)

** Thanksgiving (11/23 – 11/25) **

j. Nov.-Dec. Other Topics if time permits (other days)

FINAL EXAM (SECTION #1): Wednesday, December 7^th @ 10:30AM

FINAL EXAM (SECTION #2): Tuesday, December 6^th @ 8:00AM

Academic Honesty:

At Spelman College, academic dishonesty includes but is not limited to submitting work that is not one's own, cheating on quizzes, tests, mid-term and final examinations, and plagiarism. Academic dishonesty will not be tolerated and will be dealt with in accordance with the policy on academic honesty in the Spelman College catalog.

What is cheating?

Cheating can be defined by the following list of actions:

1. Turned in work done by another student
2. If a student copies a programming assignment or written homework assignment that belongs to another student, and turns it in as their own work. Files copied via e-mail, mv, cp, etc are all considered copies.
3. Helping another student cheat
4. If a student allows another student to get access to a copy of a programming or written assignment, then this student is also cheating. (There are ways to protect yourself in this situation that are discussed in a later section)
5. Copying from another students’ exam or helping a student copy your exam
6. Using crib notes on an exam
7. Collaboration (unless otherwise stipulated by your professor, see section on Collaboration)

Collaboration

Collaboration is generally considered cheating, or at the very least puts a student in jeopardy of cheating. If a instructor stipulates that you can collaborate, then this section will define what that means in the CS department at Spelman College. If an instructor stipulates that there is no collaboration, then these definitions do not apply.

Illegal collaboration is when the resulting source code or written answer is very similar to identical:

Scenario #1:

Two students working on the same assignment, and they decide to start writing their ideas and concepts on the board. Next they write pseudocode for the problem on the board which begins to resemble an actual source code solution. They both begin to type in this source code like solution. This is cheating.

Scenario #2:

Student A is having trouble with a concept that is an integral part of the programming assignment. Student A seeks help from Student B. Student B shows Student A the code that is necessary to solve the problem. Student A is able to use this code as their own. This is cheating.

Scenario #3:

Two students are sitting next to each other in the lab working on homework assingments, and they are looking at each others programs to get ideas and better understanding. This is not collaboration; its cheating. This does not apply to lab class.

legal collaboration is when students discuss the concepts & high-level design:

Scenario #4:

Consider Scenario #1 where the students only collaborate on the steps involved in the solution, but do not write source code like pseudocode on the board.

Scenario #5:

Consider Scenario #2 where student A reviews the concepts related to the problem in order to help student B. If student B is still having trouble they should seek the help of the TA or the Instructor.

How to protect yourself from cheaters?

There are many ways that honest students can protect themselves from other students that are dishonest:

1. Creating checkpoints of your progress when writing your programs. This involves periodically making copies of your files naming them in consecutive order. Suppose the assignment is called prog1.cc. After you have worked on the program once make a copy of the file called prog1.cc-1. After the second time, call the program prog1.cc-2. This can be done until the program is completed. This is gives you a log of the progress you have made on the assignment, and shows you have done the work.

2. If you have been collaborating with another student beware of eavesdroppers, and do not leave your ideas, concepts, and pseudocode on the board. This will prevent others from using your ideas without your knowledge. In addition, you want to erase the board so that your work is not very similar to the student(s) you are collaborating with. After erasing the board, allow some time to pass before you implement the ideas in your program. This will help ensure that the code you write only uses the concepts discussed earlier, and keeps your code different from other students.

3. Do not leave your computer monitor unattended. Lock your screen using xlock when you have to leave the monitor unattended for more than a few minutes or so. Do not leave the building with your machine unattended whether the screen is locked or not.
4. Do not allow the same student to look at several portions of your code. This allows someone to slowly obtain all of your code one piece at a time.
5. Make sure your umask is set properly so that your files are only readable and writeable by you. This means use a umask of 077(Just place the command umask 077 in your .cshrc.user file). The umask will only work with files that are created after the time you put this in your .cshrc.user file. To protect current files type the command:

chmod -R 700 ~/ . This changes all of your current files to read/write by you only.

What happens to cheaters?

Spelman College guidelines:

1.         First violation is a 0 for the assignment or exam, and a warning letter is submitted to the Academic Dean. The warming letter is only acted on by the Academic Dean’s office if there is a second violation.

2.         Second violation is handled by the Academic Dean’s office. You may receive an ‘F’ in the course and/ or suspension.

For most college classes, students are expected to work independently on projects and assignments. However, for this class certain assignments will be clearly designated for working in groups. For these assignments, each group will turn in one assignment with all names of the group members on that assignment. For all other assignments, students are expected to work independently.

In addition to the rules explicitly stated in this syllabus, students shall be governed by the rules of Spelman College; therefore it is the student's responsibility to become familiar with the rules and regulations of the College.

Evaluation Policy:

Category	Percentage
Exams (4)	40 %
Final	20 %
Quizzes	10 %
Programs	10 %
Homework	10 %
Labs	05 %
Research Presentation	05 %

Assignment Due Dates:

Ø Program analysis and designs are due the next class date after assignment.

Ø Programs due dates will be specified on each assignment

Ø Labs are due at the end of each lab session (or end of the day the lab is held on in special circumstances)

Late Policy:

Ø Assignments will not be accepted or graded after 5 days past their due date.

Ø No makeup tests will be given except by PRIOR agreement with the professor.

Ø No makeup quizzes will be given.

Ø Any programming assignments turned in late will be counted off 10% per day. A programming assignment becomes late at 8 am the day after the due date.

Ø Homework will not be accepted late, as they will be discussed in class on the day they are due.

Ø Lab assignments will not be accepted late.

Attendance:

Students are required to be present and on time for each class and are responsible for all material covered in class whether they are present or absent. The instructor may withdraw students with excessive unexcused absences.

Class Cancellation Policy:

If for any reason a class is not held at the assigned time, all work scheduled for that day is automatically rescheduled for the next scheduled class period. Any projects, assignments, or homework due on a missed day become due at the next scheduled class period. Similarly, any tests scheduled for a class period which is not held at the assigned time will be given at the next scheduled class period.

Accommodation:

Any student who feels she may need an accommodation based on the impact of a disability should contact the Office of Disability Services privately to discuss her specific needs.

Please contact the Office of Disability Service at (404) 270-5289 in MacVicar Hall to coordinate reasonable accommodations.