Course Syllabus - CS 201
Fall 2004

1. Course: CS 201 - Computer Science I

2. Catalog Description: CS 201 Computer Science I (3 credits)
   • Introduction to modern problem solving and programming methods. Emphasis is placed on algorithm development. Introduction to procedural and data abstraction, emphasizing design, testing, and documentation.

3. Course Objectives:
   • The primary objective is to provide students with the skills necessary for "programming" and "problem solving: using a computer. The programming language will be C++. Topics covered include: program organization; fundnamental C++ objects, expressions, and assignment; control constructs: library and programmer-defined functions; advanced parameter passing; and arrays.

4. Course Outcomes:
   • Students demonstrate thay can define and apply the basics of a programming language.
     • Strategies and Actions:
       • Lectures, labs, and projects covering the basic concepts of a programming language, in particular C++.
     • ABET Criteria covered:
       • (a) An ability to apply knowledge of mathematics, science, and engineering.
       • (c) An ability to design a system, component, or process to meet desired needs.
       • (k) An ability to use the techniques, skills, and modern engineering tools necessary for engineering practice.
     • Program Objectives covered:
       • (2) Our graduates will have achieved a solid understanding of concepts fundamental to the discipline of Computer Science.
     • Assesment:
       • Quizzes and exams
       • Weekly labs and projects

   • Students demonstrate they can design small projects. Students also design a multi-part project including topic details of their own choosing.
     • Strategies and Actions:
       • Learning program design through weekly labs and projects. Many of the labs and projects describe the problem but leave the design and implementation details to the students.
       • The final project is comprehensive, implemenation spans several weeks, and is loosely defined.
     • ABET Criteria covered:
       • (b) An ability to design and conduct experiments, as well as to analyze and interpret data.
       • (c) An ability to design a system, component, or process to meet desired needs.
       • (e) An ability to identify, formulate, and solve engineering problems.
       • (h) The broad education necessary to understand the impact of engineering solutions in a global and societal context.
     • Program Objectives:
       • (2) Our graduates will have achieved a solid understanding of concepts fundamental to the discipline of Computer Science.
       • (3) Our graduates will have achieved good analytic, design, and implementation skills required to formulate and solve computing problems.
     • Assesment:
       • Lab assignments pertaining to algorithm development (pseudocode)
       • Project design reports

   • Students demonstrate they can solve problems by finding and then coding solutions.
     • Strategies and Actions:
       • Learning problem solving by analyzing a given problem, finding a soulition, and then coding the solution.
     • ABET Criteria covered:
       • (e) An ability to identify, formulate, and solve engineering problems.
       • (i) A recognition of the need for, and an ability to engage in life-long learning.
     • Program Objectives:
       • (2) Our graduates will have achieved a solid understanding of concepts fundamental to the discipline of Computer Science.
       • (3) Our graduates will have achieved good analytic, design, and implementation skills required to formulate and solve computing problems.
     • Assesment:
       • Quizzes and exams
       • Weekly labs and final project

5. Course Prerequisite:
   • (Math 128) Precalculus and Trigonometry
     

6. Course Arrangement:
   • The course is arranged on a lecture-laboratory basis. The laboratory is a mandatory part of the class. The Teaching Assistants will outline additional lab requirements. All lab assignments, homework, quizzes, and exams are required.

7. Course Outline:
   The following is not necessarily intended as a sequential ordering.

   Topic	Chapters	Lectures
   Introduction	1	1
   Program organization	2	2
   Data types & expressions	2	3
   Selection: if-else, switch	4	3
   Interactive input & output	3	2
   Design	1*-5*, 8*	5
   Loops: for,while & do-while	5	6
   Reading & writing files	3	3
   Functions	6,7	6
   Arrays	9	6
   MidTerms		3
   Final Exam		1

   *material based on Simple Program Design presented in class.

8. Texts:
   
   • Required: C++ Programming: Program Design Including Data Structures (2nd ed.)
     by D.S. Malik -- Thomson Course Technology
   • Recommended: Simple Program Design: A Step-by-Step Approach (4th ed.)
     by Lesley Anne Robertson -- Thomson Course Technology

9. Term Specific Information:
   • Instructor: Alina Vincent
   • Office: SEM 208, 784-7592
   • email: alina@cs.unr.edu To insure prompt responce use internal WebCT email for all 201 related correspondence.
   • Office Hours: Tuesday 3-4; Thursday 2-4; or by appointment

   • Class Hours:
     • Sections 9,10,11 -- 4:00 - 5:15 -- SEM 234
       
   • Lab Hours:
     
     • Sec 009 -- 2:00 - 2:50, Wednesday -- SEM 231B
       
     • Sec 010 -- 3:00 - 3:50, Wednesday -- SEM 231B
       
     • Sec 011 -- 4:00 - 4:50, Wednesday -- SEM 231B
       

   • Teaching Assistant:
     • Jigna Bhatt
       • email: jigna@cs.unr.edu
       • Office: SEM 255a
       • Office Hours: TBA

10. Labs and Assignments:

    • There are two types of assignments: exercises and lab assignments. The exercises consist of practice questions which are intended to assist the student in mastering the course content. Some of these exercises may be collected and graded, but you will be informed in advance when an exercise is to be handed in.

    • The lab assignments require the solutions to problems using the computer. We will be using the Windows boxes in the College of Engineering Computing Center (SEM 231). You will be instructed how to submit your lab assignments for grading.

    • Late Labs will not be accepted.

    • All formal homework assignments (including exercises and projects) and all exams (quizzes, midterms and the final exam) are to be treated as individual and not collective efforts. A severe penalty will be given to any assignment or exam which indicates collusion or cheating. The usual penalty for cheating on lab assignments or an exam is failure in the course.

    • You should carefully read the section on Academic Dishonesty found in the UNR Student Handbook (copies of this section are on-line) Your continued enrollment in this course implies that you have read it, and that you subscribe to the principles stated therein.

    • The lab assignments should be considered as "open-book, take-home tests". If you need assistance with such an assignment, you may consult your professor, a CS TA designated to help CS 201, your textbook, or any other textbook. You may not receive substantive assistance in any form from any other source (i.e., from another student, from computer center personnel, from paid or unpaid tutors, etc.). Any assistance you receive is to be documented in the comment section of your code.

    • The only help you may receive from another student is with syntax errors or with questions regarding the computer system. Do not show, exchange or copy code. Using another person's listing or having another person "ghost write" a lab will be considered cheating.

11. Assessment and Grading Scheme:
    
    • There will be 3 midterm exams and a final exam. All midterm exams will take place in the regular classroom. The final exam will be at the location listed below. Makeup exams will only be allowed for medical emergencies.

    • There may be announced and unannounced quizzes. There will be no makeups for missed quizzes. Your two lowest quiz grades will be dropped in the final grade calculation.

    • Lab assignments will be collected at the start of the lab session in which they are due. No late labs will be accepted.

    • The final grade will be based on:

      
      

      Section
      Quizzes & Exercises	10%
      Weekly labs	30%
      Final Project	15%
      Midterm Exams	30%
      Final Exam	15%

      
      

      Note: Final grades will be A through F, with no plus or minus:

      • A: 90%;    B: 80%;    C: 65%;    D: 55%;    F: below 55%
      
      

      Note: Failure in either the programming (labs/project) component and/or the lecture component (exercises, quizzes, and exams) will result in failure in the course.

12. Disability Statement:
    
    • If you have a disability for which you will need to request accommodations, please contact me or someone at the Disability Resource Center (Thompson Student Services - 107), as soon as possible.

13. Important Dates:
    • Exam I -- Thursday, September 23
    • Exam II -- Thursday, October 21
    • Exam III -- Tuesday, November 23
    • Final Exam -- Saturday, December 11; 9:45 - 11:45 a.m.; Location: WRB 2030

14. Class Policies:
    
    • You are responsible for all material covered in the lectures and in the labs. The scheduled laboratory time is mandatory. There may be announced and unannounced quizzes in the lectures and the labs.