CSci 133: Summer 2022 Syllabus

Instructor details

Instructor Andy Clifton
Email aclifton@fullcoll.edu
Office Room 611-02
Office phone 714-992-7418
Website Instructor website

(If you contact me by email I will try to reply the same day, but it may be up to a few days, depending on circumstances.)

Course details

CourseCSci 133, Data Structures in C++ (30728), 4 units
PrerequisiteCSci 123 with a grade of ‘C’ or better.
Website Course Website
ScheduleJune 6 — July 11, Monday — Thursday, 10:40 AM – 2:00 PM
Room616
TextData Abstractions and Problem Solving with C++, Frank M. Carrano
(the bookstore has a custom edition, but 7th, 6th, or 5th will work, too)
Final examMonday, July 11
Last day to addJune 8
Last day to drop without a W gradeJune 8
Last day to drop with a W gradeJune 29

Student Learning Outcomes: Design and implement Abstract Data Types in C++ to write computer programs that use classic data structures and algorithms.

Course Description

“This is a course in algorithm design and data structures implemented using C++. Data structures examined are arrays, linked lists, stacks, queues, trees, tables, and graphs. Algorithm topics include hashing, sorting, heaps, searches and algorithm efficiency using Big-O notation. Students will create and modify class libraries to implement these structures.”

Student responsibilities

As this course is taught online, the expectations are different from an in-person course.

  1. Attendance will be taken at the beginning of each class meeting, by passing around a sign-in sheet; students who arrive after the sheet has been collected are responsible for signing in at the end of class.

  2. If the instructor is more than fifteen minutes late for class, the entire class is excused for that day.

  3. Any student who misses the first class meeting with out making prior arrangements may be dropped. (But note that, if you wish to drop the class, the responsibility is on you to make sure you are officially dropped. Don’t just stop showing up and expect me to do it for you.) An unexcused absence may be expunged by using one token (see below).

Grading

This course will use a system known as specifications grading. The content of the course will consists of eight “modules”. Modules are roughly independent of each other, but we’ll cover them in the order presented below. Each module will have a few assignments pertaining to it.

To earn a grade of ‘C’ in this course you must:

A note about midterms: midterm exams are cumulative, in the sense that each midterm includes problems pertaining to all the modules which have been covered so far. However, once you pass a module on a midterm, you do not need to pass it again on any later midterms. You can safely ignore problems for that module on all subsequent midterms. (On the other hand, if you fail a module on a midterm, there is no penalty as long as you pass it on some later midterm.) In other words, to truly fail a module on the midterms, you must fail it on every midterm. The final exam is just the final midterm, including all the topics covered.

To earn a grade of ‘B’ you must complete all the requirements for a ‘C’, and also

To earn a grade of ‘A’ you must complete all the requirements for a ‘B’, and also

You don’t need to “match up” the assignments and modules you pass; i.e., any 6 assignments and 6 modules will earn you an B.

Module Assignments

All module assignments are graded pass-fail, on a “professional quality” standard. Each assignment has a “test-runner” provided which will test your code for correctness (i.e., adherence to the requirements of the assignment). If the test runner ends with “All tests passed!” then your assignment is correct and that is a pass. If your assignment fails to compile, or fails one or more tests, that is a fail. All assignments have “soft” deadlines, and you may “resubmit” assignments as many times as you want.

Extra credit: two assigmments have extra credit options. On assignment 4, you can implement the remove method, and on assignment 5 you can print the output as a histogram (bar chart). In both cases, the extra credit counts as one extra “assignment point”, allowing you to skip any other assignment.

Modules

  1. C++/CSci 123 review. How to write code in C++, how to use classes, how to use the standard library.

  2. The vector data structure and asymptotic analysis. Other fundamental data structures: lists, stacks, queues.

  3. Sorting and searching.

  4. Binary search trees, maps, balanced trees.

  5. Hashing and hash tables. Hash functions and applications.

  6. Other trees: binary heaps and disjoint sets.

  7. Graphs, directed-acyclic graphs, graph algorithms

  8. Advanced topics: multithreading, parallelism, networking, or whatever else we want to talk about.

A note on collaboration and cheating

Computer science is a fundamentally collaborative subject, thus it’s not surprising that you will want to work together and help each other. While this is expected and allowed, the grade you are assigned at the end of the semester is intended to reflect your individual knowledge, not the gestalt knowledge that is formed when you and some friends get together. Consequently, I ask that you respect the “principle of the erased whiteboard”. The idea is to imagine, whenever you are working together, that you are writing things together on a whiteboard. When you are done, the imaginary whiteboard must be erased, without copying anything down or taking pictures of it. The only thing you are allowed to take away is the understanding you have gained.

Calendar

Date Subject Assignment
Week 1
Mon, Jun. 06 Course Intro
(In-class notes)
Tue, Jun. 07 Asymptotic and Amortized analysis; vectors
(In-class notes)
Assignment 1: Ordered arrays
Wed, Jun. 08 Linked lists
(In-class notes)
Thu, Jun. 09 Class canceled
Week 2
Mon, Jun. 13 Doubly-linked lists; Stacks and Queues; Assignment 2: Doubly-linked lists
Tue, Jun. 14 Recursion
Midterm 1 Review
Midterm 1 Practice
(Solutions)
Wed, Jun. 15 Midterm 1
Thu, Jun. 16 Quadratic sorting
Week 3
Mon, Jun. 20 Sub-quadratic sorting
Tue, Jun. 21 Binary search trees Assignment 3: Bitonic Mergesort
Wed, Jun. 22 More search trees
Thu, Jun. 23 Splay trees Assignment 4: Splay Trees
Midterm 2 Practice
(Solutions)
Week 4
Mon, Jun. 27 Midterm 2
Tue, Jun. 28 Hashing and hash tables Assignment 5: Testing Hash Functions
Wed, Jun. 29 More trees: binary heaps and disjoint sets Assignment 6: Disjoint Sets
Midterm 3 Practice
(Solutions)
Thu, Jun. 30 Midterm 3 review
Week 5
Mon, Jul. 04 Independence Day Holiday
Tue, Jul. 05 Midterm 3
Wed, Jul. 06 Graphs
Thu, Jul. 07 Weighted graph algorithms
Midterm 4 review
Assignment 7: Graphs
Midterm 4 Practice
(Solutions)
Week 6
Mon, Jul. 11 Midterm 4


Collaboration and cheating

Computer science is a fundamentally collaborative subject, thus it’s not surprising that you will want to work together and help each other. While this is expected and allowed, the grade you are assigned at the end of the semester is intended to reflect your individual knowledge, not the gestalt knowledge that is formed when you and some friends get together. Consequently, I ask that you respect the “principle of the erased whiteboard”. The idea is to imagine, whenever you are working together, that you are writing things together on a whiteboard. When you are done, the imaginary whiteboard must be erased, without copying anything down or taking pictures of it. The only thing you are allowed to take away is the understanding you have gained.

Cheating is defined as submitting anything that is not fully original work. Examples include:

This does not mean you cannot work together! It just means that the result of your collaboration must still be original for each student.

Cheating on any test/assignment will result in a grade of 0 for that test/assignment. For tests, you may attempt to make up the missing modules on a later exam; for assignments, no makeup is allowed. Note that this means cheating on an assignment will effectively reduce your grade by one letter.

The college’s official policy on cheating and student behavior is as follows:

Academic Honesty Policy

Students are expected to abide by ethical standards in preparing and presenting material which demonstrates their level of knowledge and which is used to determine grades. Such standards are founded on basic concepts of integrity and honesty. These include, but are not limited to, the following areas:

Instructors may deal with academic dishonesty in one or more of the following ways:

  1. Assign an appropriate academic penalty such as an oral reprimand or point reduction.
  2. Assign an “F” on all or part of a particular paper, project, or exam.
  3. Report to the appropriate administrators, with notification of same to the student(s), for disciplinary action by the College. Such a report will be accompanied by supporting evidence and documentation.

Repeated violations may result in students receiving an “F” in the course, suspension or dismissal from the College.

Standards of Student Conduct and Discipline Policy

The standards of student conduct and disciplinary action for violation of Board Policy 5500 were approved by the NOCCCD Board on January 28, 2003, and were drawn in compliance with Sections 66300, 76030, 76033, 76034, 76036 of the State Education Code. Students are expected to respect and obey civil and criminal law and shall be subject to the legal penalties for violation of the city, county, state, and national law(s). Student conduct must conform to Board Policy and college regulations and procedures. As cited in BP5500, “A student who violates the standards of student conduct shall be subject to disciplinary action including, but not limited to, the removal, suspension or expulsion of the student.”

Students have an obligation to familiarize themselves with the College’s policies, rules and regulations and to conduct themselves in a reasonable, respectful manner, which is conducive toward attaining their educational goal. Upon registration, each student should obtain a copy of the College Policies and Regulations: Standards of Student Conduct and Discipline Policy. Contained therein are the policies approved by the Board of Trustees governing student behavior and the applicable penalties for violations of these policies. Copies are available in the Student Affairs Office, the Office of Equity and Diversity, all division offices, and the Student Services office.

Student Complaints

Students should attempt to resolve issues directly with the faculty or staff member involved in the complaint. For serious or ongoing complaints, students may file a formal Student Complaint. The process for doing so is described in the Catalog.

Other college policies

Various other college policies, which I am required to present to you, are as follows:

I am committed to creating a course that is inclusive in its design. If you encounter barriers, please let me know as soon as possible so that we can determine if there is a design adjustment that can be made or if a disability accommodation might be needed to overcome the limitations of the design. I am always happy to consider creative solutions as long as they do not compromise the intent of the assessment or learning activity. You are welcome to contact the Disability Support Services (DSS) Office to begin this conversation or to establish disability accommodations for this or other courses. DSS can be contacted at 714.992.7099 or dsp@fullcoll.edu. I welcome feedback that will assist me in improving the usability and experience for all students.

Americans with Disabilities Act (ADA) Statement

Fullerton College is committed to providing educational accommodations for students with disabilities upon the timely request by the student to the instructor. Verification of the disability must also be provided. The Disability Support Services office functions as a resource for students and faculty in the determination and provision of educational accommodations.

Fullerton College Catalog and Class Schedule

The Fullerton College Catalog and the Class Schedule contain a number of policies relating to students that are important to you. Please be sure that you have read these publications thoroughly. You may purchase copies of these publications at the campus bookstore, or you may read them online at the Fullerton College website, www.fullcoll.edu.

Grade Appeals

While the instructor is the final authority in determining grades that are assigned to students and that appear in their permanent record, students have a right to inquire how their grade was determined, and a Grade Appeal Procedure is described in the Catalog.

Wait Time for Late Instructors

If, due to unforeseen emergencies, the instructor does not arrive at the scheduled start time for class, students are to wait for fifteen minutes (unless otherwise notified by the division). If they do not receive notification to wait for their instructor to arrive, after 15 minutes the students may leave with no penalty for absence or assigned work due for that class meeting.