CS35: Data Structures and AlgorithmsFall 2014Course Basics
Welcome to CS35. This course continues the broad introduction to computer science begun in CS21, providing a general background for further study in the field. By concentrating on data structures and algorithms, you will obtain the basic building blocks by which all large software are built. These topics are central to every sub-discipline in computer science, and also connect to central concepts across the sciences. Topics to be covered include object-oriented programming in C++, advanced data structures (such as priority queues, trees, hash tables, and graphs), advanced algorithms, as well as software design and verification. At the end of this course, you will have obtained the ability to successfully analyze problems in the discipline. You will also take your first steps towards developing the skills necessary to synthesize and evaluate the must fundamental questions in the field. To enroll in this course you must have completed CPSC 21 or obtain permission from the instructor. This course is designated as a natural sciences and engineering practicum. Course TextbookYou may rely on either of two text books for the course:
In addition, you will need to read A Transition Guide from Python 2.x to C++ by Michael Goldwasser and David Letscher for the first week or two. Debugging referencesLearning how to debug code efficiently is part of this course material. Many of the lab assignments in this course will be more involved than what you have seen in CS21, and debugging will be essential. Some references for debugging tools:
Additional referencesThis course provides an introduction to object oriented programming as well as the C++ program language. Each could warrant their own course of study and I highly recommend you study them further. Some references of use:
|