DATA STRUCTURES(LECTURE IN ENGLISH)

This course introduces the classical abstract data types (ADT) in computer science. ADTs provide the hierarchical views of data organization used in programming. Among the topics covered are the algorithms and primitives of the data structures for arrays, linked lists, stacks, queues, trees, hash tables, and graphs. In addition, the course provides an introduction to algorithm complexity and notation.

Objectives and Outcomes Upon successful completion of this course, students will understand, implement, and be able to use several data structures and their associated algorithms. Primary data structures that students will work with are arrays, lists, stacks, queues, trees, hash tables, and graphs. In addition, students will be able to apply algorithm complexity and notation in their discussions and evaluations of data structures. Students will have the knowledge to select (and implement) the appropriate data structures that will be used in larger projects, especially the game projects in the third and fourth year.

Attendance is mandatory. For each lecture that is missed, you will lose one point from your final grade (e.g. a 90 becomes an 89). The only exceptions are if you notify me prior to your absence with a valid reason. (Sleeping, studying for another class, working on your game, etc., are not valid reasons for an absence.) Class participation will boost your grade if you are on the border. Workload During the semester there will be two exams (midterm and final) and 6 homework/programming assignments. The programming assignments are more complex than previous courses that I've taught. You will be given adequate time to complete the assignment if you manage your workload properly and start the assignments early. When you submit a programming assignment, another one will be given out. This will mean that you will have a steady-stream of programming assignments throughout the semester. So, in addition to attending the lectures, you can expect to spend 6-8 hours per week programming for this class. Programming assignments may include optional, extra-credit work for students that wish to do it. There are no projects for this class. Submitting Homework Programming assignments will use the C++ language. Although C techniques will also be demonstrated in class as part of the discussions, everyone must be using the same language for assignments, and that language will be Standard C++. (No extensions, Microsoft, GNU, or other). Also, unless otherwise specified, we will not allow the use of the STL for any implementations. A major focus in a data structures class is to learn and understand data structures and their associated algorithms by "constructing the data structures manually." Assignments will be graded using the GNU C++ compiler version 5 (or newer). You are encouraged to build and run your programs other compilers, since this is the only way to help ensure that your code is legal and robust. This is a 4th semester programming course at DigiPen. Any compiler warnings or mem

n/a

C++ Desktop (PC) development.