C or better in CS211 and MATH 113.
Professor | Office | |
K. Raven Russell | krusselc |
Buchanan 217B |
Maha Shamseddine | mshamse | Buchanan 215I |
Yutao Zhong |
yzhong |
ENGR 4433 |
For All Classes:
For Online and Hybrid Classes:
CS 310 continues the study of data structures from CS 211. Students will learn how to approach larger and more challenging programming problems than the projects in CS 211. Programming is a significant part of this course and students should expect to spend a good deal of time on the programming projects. The course also introduces a variety of data structures and illustrates the types of problems for which they are useful.
Tentative topics to be covered include:
See the schedule available on Piazza (under Resources) for a more detailed topics list.
In CS310, students will:
Category | Percent |
Programming Assignments | 40% |
Participation | 5% |
Midterm Exam | 25% |
Final Exam | 30% |
The following will be applied without rounding:
Small amounts of extra credit may be offered throughout the semester, but there will be no make-up or extra-credit assignments at the end of the semester; your grade should be a measure of your semester-long progress.
Students will receive a number of programming projects during the semester (typically four). These programming projects will be a primary focus of your grade - each one should take multiple sessions of coding, with questions asked in between. Don't be surprised if you're spending 20+ hours on each one. Programming projects are INDIVIDUAL work.
All projects numbered above 0 will be averaged together evenly. If there is a Project 0 (some professors/semesters have this), it will not be part of the calculation, but instead act as a "flag". If you do not pass Project 0 you will not receive credit for any project until you do (infinite resubmissions for Project 0 will be allowed). At the time of the last submission deadline for Project 0 (see schedule), if you still have not passed Project 0, your project grades will be replaced with a 0s.