CSCI 3412 - Algorithms

Design and analysis of algorithms. Asymptotic analysis as a means of evaluating algorithm efficiency. The application of induction and other mathematical techniques for proving the correctness of an algorithm. Data structures for simplifying algorithm design, such as hash tables, heaps and search trees. Elementary graph algorithms. Assignments include written work and programming projects. Prereq: CSCI 2312, 2421 and 2511. Restricted to undergraduate Computer Science Majors and Minors. Max hours: 3 Credits. Semester Hours: 3 to 3