Software development requires an integral understanding of how data is structured that would allow efficient access and manipulation operations. The algorithms underlying the operations need to be efficient to allow fast execution. This course covers analysis of algorithms, both iterative and recursive. Use of big-Oh, -omega and -theta notations to describe the running time. This course will also cover searching and sorting algorithms; structures, heaps and graphs; algorithm design techniques; and NP-complete problems.
- Teacher: Jay Vince Serato
- Enrolled students: 21