CSCI 104 Syllabus

The course covers the fundamentals of data structures. As a programmer becomes more proficient, they realize that how well and efficiently a problem can be solved often depends on how the data are stored. Some of the ideas are quite sophisticated and clever, and we will explore a spectrum of them in this class, ranging from fairly basic to moderately advanced structures.

The other side is that once one realizes the importance of data structures, it is natural to think of programs not as sequences of instructions that pass around some data, but as data packets that come with the code needed to process them. This is at the heart of the object-oriented design paradigm, and often leads to more modular and extensible (and readable) programs.

The class will put significant emphasis on a theoretical understanding of data structures, their implementation, and the object-oriented viewpoint. Assignments will contain significant programming projects along with programming-free questions to explore how data structures work.

Learning Objectives

  1. Ability to choose appropriate and efficient data structures and algorithms to solve a problem.
  2. Ability to compare data structures and algorithms for efficiency using algorithm analysis and experiments.
  3. Ability to apply algorithm analysis and knowledge of discrete mathematics to evaluate algorithms and data structures.
  4. Ability to implement and use linear data structures, including stacks, queues, lists.
  5. Ability to implement and use search structures and algorithms including binary search, search trees, and hash tables.
  6. Ability to use and implement search data structures, including search trees and hash tables.
  7. Ability to use and implement priority queues.
  8. Knowledge of and ability to implement sorting algorithms and compare their performance analytically and empirically.
  9. Understanding of graphs and their representations; ability to implement graph search using BFS, DFS, and Dijkstra’s Algorithm.
  10. Ability to write recursive functions and understand when recursion is appropriate to a problem.
  11. Ability to write readable and maintainable code.
  12. Ability to explain computational solutions in person and in writing.
  13. Use probability as a tool in analyzing the efficiency of various data structures
  14. Use basic number theory to analyze basic hash functions

Catalog Entry

Introduces the student to standard data structures (linear structures such as linked lists, (balanced) trees, priority queues, and hashtables), using the C++ programming language.

Prerequisites

Course Websites

Grading Weights and Scale

The following point structure will be used in determining the grade for the course. Your final grade will depend solely on your own performance, graded according to the scale given below.

Weight Item
36% Homework
6% Lab Exercises
28% Midterm Exams
30% Final Exam

Grading Scale

We will guarantee that you will get at least the grade indicated by the following scale. Because of the fairly generous scale we will not round up if you are close to the lower threshold of a letter grade. At the end of the semester, we may decide to lower the scale if the exams were more difficult than intended.

Grade Letter
85% A
80% A-
75% B+
70% B
65% B-
Grade Letter
60% C+
55% C
50% C-
45% D+
40% D

Assignments and Labs

Information regarding homework and labs are available on their respective pages. They contain policies related to grading, assignments, and policies related to submission, contesting grades, academic integrity, etc. You are responsible for reading those pages carefully and following all of its stated policies, which should be considered as part of this syllabus.

Attendance

While regular attendance will not be taken, class participation and attendance is expected.

Textbook

We will be using “Data Structures and Algorithm Analysis in C++” by Mark Weiss. In addition, you should have a Discrete Mathematics textbook (whichever book you used for CSCI 170 will suffice): I will specificially refer to reading from “Essential Discrete Mathematics for Computer Science” by Lewis & Zax. You may also find the course lecture notes useful. You may download (and possibly print) the lecture notes. These are based on teaching of CSCI 104 in past semesters, and cover the material quite accurately as presented in class. However, the lecture notes may be out of order and cover different topics, as we have changed the schedule significantly. We will also be providing detailed lecture slides and recorded videos that you may also use.

We want to provide you with additional references that may enhance study and may be cited during video recordings. In addition to the textbook used for CSCI 103, for the C++ Language the following references are available for free online from the USC Library:

For data structures specifically:

Reading Assignments

Readings from lecture notes and other sources form the base of your learning pyramid. These readings contain theoretical concepts, examples and usable code that will be very helpful for all the work in this course. We also recommend reviewing the lecture slides/notes after each lecture (or at the end of each week to see what you still remember, what doesn’t make sense now that you have to do an exercise yourself, etc.) This will help you retain the content, increase mastery, and prime you to ask quesitons in future lectures.

Exams

Exams will involve analysis and coding. Questions require students to demonstrate their mastery over the material. Exams are currently expected to be in person but will likely be given via Gradescope and require you to bring a laptop. More details will be posted at least 1 week before the exam.

Accommodations

If you have USC approved (OSAS) accommodations, you MUST upload your OSAS generated PDF letter for this class to the linked form.

Statement on Academic Conduct

Below is USC’s official language. However, we have specific rules in CS 104 which are outlined on the assignments & grading page.

Plagiarism - presenting someone else’s ideas as your own, either verbatim or recast in your own words - is a serious academic offense with serious consequences. Please familiarize yourself with the discussion of plagiarism in SCampus in Part B, Section 11, Behavior Violating University Standards https://policy.usc.edu/scampus-part-b/. Other forms of academic dishonesty are equally unacceptable. See additional information in SCampus and university policies on scientific misconduct, http://policy.usc.edu/scientific-misconduct/.

Support Systems