Fundamental Algorithms
Overview
Description
In this course, one learns how to design efficient algorithms and becomes familiar with common real-world algorithms. Examples include algorithms for data compression, error correcting codes, common graph algorithms such as shortest paths and network flow, and more. The course also includes algorithm techniques such as divideand-conquer, greedy algorithms, and dynamic programming.
Career
Undergraduate
Credits
Value
4
Max
4
Min
4
Course Count
1
Number Of Credits
4
Number Of Repeats
1
Repeatable
No
Contact Use
Yes
Generate Attendance
No
Left Use
Yes
Present Use
Yes
Reason Use
Yes
Tardy Use
Yes
Template Override
No
Time Use
Yes
Attendance Type
Class Meeting
Auto Create
No
Code
LEC
Instructor Contact Hours
4
Default Section Size
35
Final Exam Type
Yes
Include in Dynamic Date Calc
No
Instruction Mode
In Person
LMS File Type
Blackboard CourseInfo 4
Name
Lecture
OEE Workload Hours
0
Optional Component
No
Preferred Room Features
Academic Scheduling
Workload Hours
4