Skip to content
This organization was marked as archived by an administrator on Apr 17, 2024. It is no longer maintained.
@CS-162-nilsstreedain

CS 162

Introduction to Computer Science II

Course Syllabus

Overview & Contact Information

CS162 provides an overview of the fundamental concepts of computer science. You will study basic data structures, computer programming techniques and application of software engineering principles. The course will also provide an introduction to analysis of programs.

Instructor - Brandilyn Coker ([email protected])

  • All emails must include "[CS162]" in the subject of your message.
  • You can also message me on Teams
  • Do not message via Canvas

Instructor Office Hours - MF 2:00-3:30PM KEC3119 (Zoom Link)

TAs - See TA information and lab schedules on "TAs" page

Lectures - MWF 10AM-10:50AM

Prerequisites - CS161, EECS161, or ENGR103

Course Content

  • File input/output
  • Object-oriented programming principles
  • Program design, debugging and testing
  • Algorithm analysis
  • Recursion
  • Sorting and searching
  • Linear data structures
  • Debugging and testing

Course Learning Objectives (CLOs)

  • Design and implement programs that require:
    • multiple classes and structures
    • hierarchies of classes that use inheritance and polymorphism
    • an understanding of abstraction, modularity and separation of concerns
  • Construct and use basic linear structures (arrays, stacks, queues, and various linked lists) in programs, and be able to describe instances appropriate for their use.
  • Classify moderately complicated algorithms in these complexity classes: O(1), O(log n), O(n), O(n log n), and O(n2).
  • Develop test-data sets and testing plans for programming projects.
  • Produce recursive algorithms, and choose appropriately between iterative and recursive algorithms.

Learning Resources

There is no formal textbook for this course. There are required articles and other material from the internet posted on the course Canvas page as the course progresses. You are required to have a laptop and internet access to receive the required materials and complete assignments.

Evaluation of Student Performance

Final grades are directly based on points earned in the class on a 1000 point scale, using the standard ranges. Final grades will not be curved.

Weighting

  • 200 points - Labs
  • 80 points - Software designs
  • 400 points - Programming assignments
  • 100 points - Quizzes
  • 220 points - Exams

Scale

  • ≥925 points = A
  • 900-924 points = A-
  • 875-899 points = B+
  • 825-874 points = B
  • 800-824 points = B-
  • etc.

Course Policies

Attendance

  • Lecture - Attendance is not required, but encouraged. There is a strong positive correlation between attendance and grades.
  • Labs - Attendance is required, and you must attend your registered lab section. You must remain in the lab until your work has been viewed and graded by a lab TA.
    • Missed labs - A lab may be excused with 24 hour notice to your lab TAs prior to a planned absence. For unplanned absences due to extenuating circumstances, you must petition the instructor by the end of the day of the absence with documentation of a valid medical or family emergency. It is your responsibility to make up any work missed for an excused absence. You will receive a zero for any unexcused absences from lab.
  • Exams - Attendance is required.
    • Missed exams - You must notify the instructor at least 7 calendar days in advance of an exam you will miss due to a planned absence in order to make alternative arrangements. Exams missed without a 7 day notification or documentation of a valid medical or family emergency will receive a grade of zero.

Late Work

  • Labs - You may finish or redo up to 1/2 of the points for a week's lab work after your lab meeting for that week. To earn these points, you must show your update to one of your lab TAs at the beginning of the following week's lab meeting. If you do not, your update will not be accepted.
  • Programming Assignments - You have a total of 4 "late days" that can be used towards the programming assignments in this class. They can be spread out across multiple assignments, or used all on one. One late day counts as anywhere between 1 minute to 23 hours and 59 minutes after an assignment is due, as determined by Canvas. An assignment will be accepted without penalty if it is submitted prior to the number of late days you have remaining. Once the late days are used up, no late work will be accepted and will receive a zero. It is your responsibility to keep track of the number of days you have left.
  • Everything else - No late work is accepted.

Contesting Grades

  • If you have a problem with a lab, design, or programming assignment grade, you must contact your TA via email within 7 calendar days of receiving your grade. If you have a problem with a quiz or exam grade, you must contact your instructor via email within 7 calendar days of receiving your grade. After one week, you may not dispute your grade.

Grading Demos for Programming Assignments

In this course, programming assignments will be graded by demonstrating your work to a TA. Each grading demo will be 10 minutes and will involve compiling and running your submitted code for the TA to show them how your program works. You will also be required to walk through your source code to explain to the TA how the key parts work. At the end of the demo, your TA will assign you a grade for the assignment based on a grading rubric. Grading demos are the only way to have your assignments graded in this course.

It is your responsibility to sign up for a grading demo for each assignment. Links to sign up for grading demos can be found on the "TAs" Canvas page. Grading demos must be completed within 2 weeks of the assignment due date. If you fail to complete a grading demo for an assignment within the 2 week timeframe, you will receive a grade of zero for that assignment. Late assignments must still be demoed within the original 2 week timeframe. If you fail to show up for a demo appointment slot that you have signed up for, you may receive a 10% penalty on the assignment at the TA's discretion.

##Expectations for Student Conduct Students are encouraged to discuss high-level approaches and concepts and learn from one another on labs and assignments. However, you are expected to do your own work for every assignment. Assignments are not paired-programming and you should expect all assignments to be checked for similarities with others in the class, prior class assignments, and work published online. You should never be copying someone else's work and changing a small amount of that work, such as variable names, comments, spacing, etc. Working together is not allowed on exams and on the final. At no point should you copy work from the internet. You are expected to be familiar with section 4.2 of the Oregon State University Code of Conduct.

Paying someone to complete your work is unacceptable and will result in immediate referral to the Office of Student Conduct! Cheating and plagiarism are not taken lightly!

At the instructor's discretion, any student whose work is deemed too similar to another person's work will receive a zero on the assignment. In the case of shared work, the student sharing the work and the student copying the work will both receive zeros. In addition, the academic dishonesty charge will be documented and sent to your school's dean and the Office of Student Conduct.

A second violation of these rules will result in the student receiving an F for the course and additional communication with the Office of Student Conduct.

Students with Disabilities

Accommodations for students with disabilities are determined and approved by Disability Access Services (DAS). If you, as a student, believe you are eligible for accommodations but have not obtained approval please contact DAS immediately at 541-737-4098 or at http://ds.oregonstate.edu (Links to an external site.). DAS notifies students and faculty members of approved academic accommodations and coordinates implementation of those accommodations. While not required, students and faculty members are encouraged to discuss details of the implementation of individual accommodations.

Students with documented disabilities who may need accommodations, who have any emergency medical information the instructor should be aware of, or who need special arrangements in the event of evacuation, should make an appointment with the instructor as early as possible, and no later than the first week of the term. Class materials will be made available in an accessible format upon request.

Religious Holidays

Oregon State University recognizes a diverse group of students and the university accommodates diverse religious holidays. Please see the OSU Equal Opportunity and Access website for additional information on the religious accommodation process. `

Pinned Loading

  1. program4 program4 Public archive

    Program 4 - C++ Linked List Implementation

    C++

  2. program3 program3 Public archive

    Program 3 - Implementing Hunt the Wumpus

    C++

Repositories

Showing 10 of 15 repositories
  • .github Public archive
    CS-162-nilsstreedain/.github’s past year of commit activity
    0 0 0 0 Updated Mar 13, 2022
  • program4 Public archive

    Program 4 - C++ Linked List Implementation

    CS-162-nilsstreedain/program4’s past year of commit activity
    C++ 0 0 0 0 Updated Mar 13, 2022
  • lab10 Public archive

    Lab 10 - Timed Coding Challenge

    CS-162-nilsstreedain/lab10’s past year of commit activity
    C++ 0 0 0 0 Updated Mar 13, 2022
  • lab9 Public archive

    Lab 9 - Implementing a Linked List

    CS-162-nilsstreedain/lab9’s past year of commit activity
    C++ 0 0 0 0 Updated Mar 13, 2022
  • lab8 Public archive

    Lab 8 - Sorting

    CS-162-nilsstreedain/lab8’s past year of commit activity
    C++ 0 0 0 0 Updated Mar 13, 2022
  • lab7 Public archive

    Lab 7 - STL & Program 3

    CS-162-nilsstreedain/lab7’s past year of commit activity
    0 0 0 0 Updated Mar 13, 2022
  • program3 Public archive

    Program 3 - Implementing Hunt the Wumpus

    CS-162-nilsstreedain/program3’s past year of commit activity
    C++ 0 0 0 0 Updated Mar 13, 2022
  • lab6 Public archive

    Lab 6 - Templates and STL

    CS-162-nilsstreedain/lab6’s past year of commit activity
    C++ 0 0 0 0 Updated Mar 13, 2022
  • lab5 Public archive

    Lab 5 - Operator Overloading & Polymorphism

    CS-162-nilsstreedain/lab5’s past year of commit activity
    C++ 0 0 0 0 Updated Mar 13, 2022
  • program2 Public archive

    Program 2 - Battle Arena

    CS-162-nilsstreedain/program2’s past year of commit activity
    C++ 0 0 0 0 Updated Mar 13, 2022

Top languages

Loading…

Most used topics

Loading…