ITGN 240 Data Structure and Algorithms
The purpose of this course is to introduce the main concepts of data structures such as static and dynamic memory allocation of arrays, using lists, First come First Served (queue), First come Last Served (stack), binary trees, memory heaps, graphs, algorithm analysis, deques, sorting, and hash tables. Course content includes developing scripting applications using searching, matrix, shortest path, and spanning tree algorithms. This intensive practice course uses a programming language to design, build, and test computer applications.