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.

This course is one of the most fundamental classes in all of Computer Science. The concepts covered in the class are needed for every day programming. Upon successful completion of the course, students will learn: Big O Recursion Hashing Searching Memory Allocation Graphs Trees Heaps

Academic Honesty Students are welcome to work together, ask the instructor for help, and consult alternate text books; however all work submitted must be the individual students own work. Any student found plagiarizing the work of others, or cheating on exams, will be given the grade F (0%) for the class. Attendance You get 2 free absences. For every lecture/lab that is missed after 2, 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. (e. g. It is possible to get an A with an overall average of 88.5%)

CS225 Advanved C/C++ DigiPen 학생이어야합니다. DigiPen 프로그램에 등록되어 있지 않으면이 수업을들을 수 없습니다. You must be a DigiPen student. If you are not in the DigiPen program then you will not be able to take this class.