CSC 126: Introduction to Computer Science

Fall 2009

Instructor:
Dr. Yumei Huo

Schedule:
Class hours / Monday / 9:05am - 11:00am / Room: 1N111
Wednesday / 11:15am -12:05pm / Room: 2N103
Monday / 9:05am - 9:55am / Room: 1N111
Wednesday / 10:10am - 12:05pm / Room: 2N103
Office Hours: /
Monday / 2:00pm - 3:30pm
Wednesday / 2:00pm - 3:30pm
or by special appointment
Contents:

Welcome to Introduction to Computer Science! This course will cover an exciting range of topics which constitutes the basis of computer science program , including Computing and information processing; Basic computer structure; Programming methodology: analysis, design, documentation, implementation, and evaluation; Algorithmic approach to problem solving; Computer solutions of several numerical and non-numerical problems.

This course meets for 6 hours per week, two hours of lab and 1 hour recitation. Outside of class hours, you may do your lab work on any IBM compatible computer that has the proper software.

Textbook:

C++ Programming: From Problem Analysis To Program Design by D. S. Malik, Fourth Edition, Course Technologies, ISBN 1-4239-0209-2 (ISBN 978-1-4239-0209-6).

Homeworks:

There are several homework assignments. Homeworks will focus onthe exercises of the textbook.

  • Homework assignments will be assigned during class and also posted on the course Web-page:

Lab Assignments:
  • Lab assignments will be assigned during class and also posted on the course Web-page:

Open lab: lab schedules can be found at:

You can also use computers at the library. The following are your username & password for accessing computers at the library.
Username: your firstname.lastname (e.g.: john.smith).
Password: your date of birth using two digits for month, day, year without periods or spaces (e.g.: 051880) It is not working for you, see Tony in 1L204

Microsoft VC++ 2008 Express is used for lab assignments:

1. Microsoft VC++ 2008 Express can be downloaded from MSDNAA via Quick Link from our departmental homepage

Note that since the downloaded file is an 'iso' file, the iso image must be 'burned onto a CD'; and then the CD should be used for installation of VC++ 2008 express.
Vista (only): in 'My Computer', select the iso file, and then the 'Burn Option'.
WinXP -- Nero is recommended for burning iso images onto CD's.
(Free Trial )

2. You can borrow Microsoft VC++ 2008 CD from CSI Library.

3. You can also install the Express version for free from

If you have any problems with downloading Microsoft VC++ 2008 Express, contact Gruber Orit () and email her with the following info: 1. Course; 2. Prof.; 3. Lastname, Firstname; 4. last four digits of SS#; 5. problem; 6. MSDNAA in subject line of email

Grading and Policies:
  • The exams may test on material covered only in class and on material covered only in the reading assignments.
    Your grade will be based approximately, as follows. These percentages are tentative and subject to change. In addition, you must receive a passing grade on the final in order to pass the course(FINAL EXAM - It is departmental policy that any student who fails the final exam, can get a final course grade, no higher than a D).

10% - Homeworks, Lab Assignments

10% - Quizzes

25% - Midterm Exam #1

25% - Midterm Exam #2

30% - Final

  • There will be approximately 4 - 5 quizzes. Quizzes will follow what was taught during the lecture session. Quizzes will be given during recitation.
  • All students are expected to do the homework .
  • DO NOT USE pencils to write down your solutions for the homework, project or exams; if you decide, however, to use a pencil do not complain about grading.
  • Check the marks in a homework, lab assignment or an exam and report errors promptly. Make sure you report such problems to the instructor within four weeks from receipt but no later than Dec.9, 2009. If you believe a grade you received is not representative of your effort talk to the instructor.
  • Homework assignments and Two weeks lab assignments are due at the start of class on their due date. If you think you won't be present in class on that Monday turn the homework in earlier at instructor's office or by email.
  • No later solutions will be taken into consideration!
  • Because of limited class time only a representative set of homework problems can be assigned. It is highly recommended that you do all the problems in the back of each chapter. Students who have done this in the past, have done well in the course.
  • SCHOOL POLICY on Academic Integrity, Plagiarism, and Cheating - Integrity is fundamental to the academic enterprise. It is violated by such acts as borrowing or purchasing assignments (including but not limited to term papers, essays, and reports) and other written assignments, using concealed notes or crib sheets during examinations, copying the work of others and submitting it as one’s own, and misappropriating the knowledge of others. The sources from which one derives one’s ideas, statements, terms, and data, including Internet sources, must be fully and specifically acknowledged in the appropriate form; failure to do so, intentionally or unintentionally, constitutes plagiarism. Violations of academic integrity may result in a lower grade or failure in a course and in disciplinary actions with penalties such as suspension or dismissal from the College.
  • The work you turn in MUST BE your own personal work, composed and written by you. No plagiarism. MY Academic Integrity Policy –Copying someone else’s computer code, even though you changed the variable names, is called plagiarism and cheating. All cheating is rewarded with a 0 on the assignment whether you are the copyer or the copyee.
  • Collaboration of any kind is NOT allowed in the in-class exams (midterms, and final).
Specific contents (subject to change):

Week 1 Chapter 1 An Overview of Computers and Programming Languages,

Chapter 2 Basic Elements of C++

Week 2 Chapter 2

Week 3 Chapter 3 Input/Output

Week 4 Chapter 4 Selection Structures

Week 5 Chapter 4 Selection Structures

Week 6 Chapter 5 Repetition Structures

Week 7/8 Chapter 5 Repetition Structures

Week 7/8 Exam I

Week 9 Chapter 6 Functions

Week 10 Chapters 7 Functions

Week 11 Strings & Arrays Chapter 8 pgs 399 – 416, Chapter 9

Week 12 Strings and Arrays, Array Applications - Searching

Sorting (Linear and Binary search, Bubble, Selection and Insertion Sort), Chapter 10

Week 13/14 Exam II

Week 14 Finish Searching and Sorting, Pointers, Chapter 14 pgs 792 – 800

Week 15 Final Exam Review, Optional Topics