EECE 7205 Chapter Notes -Prentice Hall, Time Complexity, Computer Engineering

• School: Northeastern University
• Department: Electrical and Comp Engineering
• Course: EECE 7205
• Professor: Sandy Blank

Document Summary

The class is taught only through video stream les accessible through blackboard. Of ce hours: tuesday, from 2pm to 4pm and by appointment (e-mail). Textbook: (1) introduction to algorithms, third edition, t. h. cormen et al. , mcgraw-hill, 2009. (2) c++, how to program, seventh edition, h. r. deitel and p. j. deitel, prentice hall, 2010 (recommended). (3) notes of the instructor. Trace participation: this class would not improve without the students" feedback. Every student of this class is invited to participate to the trace evaluation system, available via myneu. neu. edu by the end of the course. Course objectives: this course is aimed to give a comprehensive introduction to the study, design and analysis of ef cient basic data structures and algorithm. C++ will be used (basic c programming is a prerequisite for this class). Basic data structures (in c++): arrays, pointers and structs, stack and queues, linked lists. More complex data structures: trees, graphs and related algorithms.