3 Credit Hour Course
Intended For Level 0 Term 0 Students
Prerequisite:
Propositional and predicate calculus; Sets and functions; Mathematical logics and reasoning; Counting; Discrete structures: Graphs; Recurrence relations; Basic algorithms: sorting, searching, hashing; Algorithm design techniques: greedy algorithms, divide and conquer, dynamic programming; Graph algorithms; Complexity classes.
