CSci 133: Spring 2023 Syllabus


Instructor details

Instructor Andy Clifton
Email aclifton@fullcoll.edu
Student (office) hours Mon/Wed 4:15 — 5:45 PM
Tues 8:30 — 9:15 AM
Thurs 8:15 — 9:15 AM
Office Room 611-02
Office phone 714-992-7418
Website Instructor website
CSci Lab hours Mon/Wed 9:30 — 11:30 AM

(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++ (21809), 4 units
Room618 (600 building)
PrerequisiteCSci 123 with a grade of ‘C’ or better.
Website Course Website
ScheduleTues/Thurs, 11:45 AM — 1:50 PM
TextData Abstractions and Problem Solving with C++, Frank M. Carrano
(the bookstore has a custom edition, but 7th, 6th, or 5th will work, too)
Last day to drop (without a ‘W’)Sunday, Feb. 5
Last day to withdrawSunday, Apr. 23
Final examThursday, May 18

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.”

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.

It’s possible that we may not have time to cover module 8; in that case, the requirements for an A will be adjusted to 7 modules and 7 assignments.

Module Assignments

All module assignments are graded pass-fail, on a “professional quality” standard. It is not sufficient for your program to merely ‘run’. Your submissions must both work — solve the problem assigned — but also be written in a manner that would not get you fired or yelled at on the job. This means clean, clear code, following the coding standards, good commenting practice, etc. Each module has one assignment.

Generally speaking, when you submit an assignment I’ll either accept it (pass) or not (fail). If I don’t accept it, it’s up to you whether you want to resubmit it with corrections (see above for how you don’t necessarily have to complete all the assignments). Resubmission should also include a change log, listing the changes you’ve made, as described in the coding standard.

All assignments except 5 have test runners, written by me, which will test your code and tell you whether your implementation is correct. To use the test runner, you must use exactly the interfaces described in the assignment (function names, class names, parameter types, etc.) and you must not define a main (the test runner defines it for you). Then, link your assignment source files assign1.cpp, stuff.cpp, etc. with the test runner for that assignment.

Please note: when I test your assignment, I will use the “stock” version of the test runner code. This means that any modifications you have made to the test runner code will be lost when I test it. Sometimes students submit an assignment in which they have simply added their code to the end of the test runner; that won’t work, because the first thing I do when testing is to replace your copy of the test runner with the standard one. Place your code in separate .cpp/.hpp files.

If your submission produces a errors when linked with the test runner, that is an automatic fail. Similarly, if the test runner finds any errors, or crashes at any time, that is a fail.

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. 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.

Calendar

Date Subject Assignment
Week 1
Tue, Jan. 24 Course intro; C++ review
Thu, Jan. 26 C++ review continued
Week 2
Tue, Jan. 31 Basic algorithmic analysis Assignment 1
Due Feb 14
Thu, Feb. 02 Amortized analysis; vectors and push_back
Week 3
Tue, Feb. 07 Doubly- and singly- linked lists; list algorithms and complexity
Thu, Feb. 09 Linked lists continued
Week 4
Tue, Feb. 14 Linked lists continued Assignment 2
Due Feb 28
Thu, Feb. 16 Stacks and queues; deques
Week 5
Tue, Feb. 21 Midterm 1 review Midterm 1 Practice Test
(Solutions)
Thu, Feb. 23 Midterm 1
(Lecture source code to-date)
Week 6
Tue, Feb. 28 Midterm 1 recap (may be postponed)
Thu, Mar. 02 Recursion
Week 7
Tue, Mar. 07 Sorting algorithms: quadratic and subquadratic algo.
Thu, Mar. 09 Subquadratic sorting; Maps: binary search trees
Week 8
Tue, Mar. 14 Balanced trees: AVL and splay trees
Thu, Mar. 16 More balanced trees Assignment 3
Due Mar 30
Week 9
March 20 — 24 Spring Recess
March 20 — 24 Spring Recess
Week 10
Tue, Mar. 28 More balanced trees
Thu, Mar. 30 Midterm 2 review
Week 11
Tue, Apr. 04 Midterm 2 Assignment 4 Due Apr 18
Midterm 2 Practice Test
(Solutions)
Thu, Apr. 06 Midterm 2 recap
Week 12
Tue, Apr. 11 Hashing and hash tables
Thu, Apr. 13 Hashing continued
Week 13
Tue, Apr. 18 Heaps: priority queues and heap sort
Thu, Apr. 20 Disjoint sets Assignment 5
Due May 4
Week 14
Tue, Apr. 25 Midterm 3 review
Thu, Apr. 27 Midterm 3 Assignment 6 Due May 11
Midterm 3 Practice Test (Solutions)
Week 15
Tue, May. 02 Midterm 3 recap
Thu, May. 04 Graphs; graph representations; directed acyclic graphs
Week 16
Tue, May. 09 Graph algorithms: depth-first and breadth-first search
Thu, May. 11 Advanced Topics: Parallelism and Multithreading
Week 17
Tue, May. 16 Midterm 4 Review Assignment 7 Due May 19
Midterm 4 Practice Test (Solutions)
Thu, May. 18 Midterm 4/Final exam


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.