Introduction to Computer Science
Course description
Introduces problem solving and computers for prospective computer science majors or minors, or other students wishing to take CSC 203. Includes these topics: computer system orientation; data representation; algorithms and their properties, representations, and structure; designing and testing algorithms; assembly language concepts; syntax notation; elementary Java programming; history, uses, and social effects of computers. Requires extensive programming. Preparation for CSC 203. (Closed to students who have successfully completed CSC 203.) 3 Cr.
Logistics
- Instructor
- Dmitri A. Gusev
- Office
- 295 Brown Bldg
- Phone
- (585) 395-5188
- Fax
- (585) 395-2304
- dgusev@brockport.edu
- Office hours
- Tue and Thu, 6-7 p.m.
- Class meetings
- Tue and Thu, 7:15-8:45 p.m., 106A Allen Bldg
Textbook
-
Nell Dale, John Lewis, Computer Science Illuminated, 3rd Edition, Jones and Bartlett, Sudbury, MA
Course objectives
The main objective of this course is to give students essential background information on computing systems and provide them with basic programming and algorithm development skills needed for subsequent taking of CSC 203. (In CSC 203, students will learn fundamental computer science concepts and further develop their Java programming skills.) For students, this course is a step on the path toward being more in control of the computing systems and somewhat less at their mercy.
-
In particular, computer hardware, software and networking fundamentals will be taught, along with a generic process of developing well-structured solutions to computational problems in conjunction with the basics of object-oriented programming in Java using BlueJ. (BlueJ is an interactive development environment specially designed to be used by students learning how to program. Yet, BlueJ is a full Java environment, not a simplified version of the language.)
Tentative schedule
Reference: DL - Nell Dale, John Lewis, Computer Science Illuminated, 3rd Edition, Jones and Bartlett, Sudbury, MA
Week 1:
- 01/23 Lecture 1: Computing Systems and Number Systems
Reading: DL 1 - 01/25 Lecture 2: Number Systems and Data Representation
Reading: DL 2
Week 2:
- 01/30 Assignment 1 due; Lecture 3:
Data Representation and Networking
Reading: DL 3 - 02/01 Lecture 4: Networks and The World Wide Web
Reading: DL 15 and 16
Week 3:
- 02/06 Lecture 5: Problem Solving and Top-Down Design
Reading: DL 6 - 02/08 Assignment 2 due; Lecture 6: Object-Oriented Design
Reading: DL 6 (cont'd)
Week 4:
- 02/13 Lecture 7: Gates
Reading: DL 4 - 02/15 Assignment 3 due; Lecture 8: Circuits and Computing Components
Reading: DL 4 (cont'd) and 5
Week 5:
- 02/20 Lecture 9: Machine Language; Review
Reading: DL 7 - 02/22 Mid-term Exam #1
Week 6:
- 02/27 Lecture 10: Assembly Language
Reading: DL 7 (cont'd) - 03/01 Lab 1: Machine Language
Week 7:
- 03/06 Lecture 11: High-Level Programming Languages
Reading: DL 8 - 03/08 Assignment 4 due; Lecture 12: Algorithms: Searching and Sorting
Reading: DL 9
Week 8: Spring Break
Week 9:
- 03/20 Lab 2: Java
- 03/22 Lab 3: Java (cont'd)
Week 10:
- 03/27 Assignment 5 due; Lecture 13: Algorithms: Linked Lists, Stacks, Queues and Trees
Reading: DL 9 (cont'd) - 03/29 Lecture 14: File Systems and Directories; Review
Reading: DL 11
Week 11:
Week 12:
- 04/10 Lab 4: Java (cont'd)
- 04/12 Lab 5: Java (cont'd)
Week 13:
- 04/17 Assignment 6 due; Lecture 16: Operating Systems
Reading: DL 10 - 04/19 Lecture 17: Spreadsheets and Databases
Reading: DL 12
Week 14:
- 04/24 Lab 6: Java (cont'd)
- 04/26 Lab 7: Java (cont'd)
Week 15:
- 05/01 Assignment 7 due; Lecture 18: Limitations of Computing
Reading: DL 17 - 05/03 Lecture 19: Ethical Issues in Computing; Review
Week 16:
- 05/10 Final exam: 7:30 - 9:30 pm
Midterms
Midterms are designed as elemental evaluation devices and to prompt the student to stay abreast of assigned topics. Each test will take 90 minutes.
Questions on a test may include:
- True/false questions,
- Multiple choice questions,
- Short answer questions,
- Problem questions.
Final exam
Final exam is a cumulative objective test of representative content of the entire semester's course offerings.
Lab assignments
During most of the lab sessions (except the first one) students will work on Java programming assignments focusing on the material covered in class lectures and reading assignments.
Honesty policy
All assignments are to be completed on an individual basis. Group efforts are not acceptable. Copying of programs, cheating on exams and other acts of academic dishonesty are considered grounds for failure and other disciplinary actions specified by the College Policy On Academic Dishonesty in the Brockport Student Handbook.
Attendance
Students are responsible for attending all scheduled classes and labs. According to the Senate policy, students whose unexcused absences exceed 15% of the scheduled classes and laboratories may receive a lower grade or failure at the instructor’s discretion. Students who are unable to attend class/laboratory, or meet deadlines for assignments due to religious beliefs or other valid excuses, must contact the instructor ahead of time so that we might work out arrangements. No make-up exam will be given unless the student's absence is approved by the instructor BEFORE the exam is given. All students are responsible for material covered during their absence regardless of the reason.
Students with disabilities
Students with documented disabilities may be entitled to specific accommodations. SUNY Brockport's Office for Student with Disabilities makes this determination. Please contact the Office for Students with Disabilities at (585)395-5409 or osdoffic@brockport.edu to inquire about obtaining an official letter to the course instructor detailing any approved accommodations. The student is responsible for providing the course instructor with an official letter. Faculty work as a team with the Office for Students with Disabilities to meet the needs of students with disabilities.
Grades and evaluation
Students will be evaluated regularly during the semester and should be aware of their progress continuously during the semester. The mid-term and final course grades will be reported according to the University policy.
The final course grade will be calculated according to the following table:
Attendance and In-Class Participation (4 points) | 1% |
7 Assignments (20 points each) | 35% |
2 Mid-term exams (68 points each) | 34% |
Comprehensive Final exam (120 minutes, 120 points) | 30% |
Total (400 points) | 100% |
Course letter grade will be determined as follows:
A | A- | B+ | B | B- | C+ | C | C- | D+ | D | D- | E |
90-100 | 86-89 | 82-85 | 78-81 | 74-77 | 70-73 | 66-69 | 62-65 | 59-61 | 54-57 | 50-53 | 0-49 |