CIS 3490

Analysis/Design of Algorithms

Lec 0101 and Lec 0101 selected

The design and analysis of efficient computer algorithms are studied. Topics that will be studied include: standard methodologies, asymptotic behaviour, optimality, lower bounds, implementation considerations, graph algorithms, matrix computations (e.g. Strassen's method), NP-completeness. [Department(s): School of Computer Science]

Sections

Lecture, pick one

Lec 0101

Wed 11:30-13:20

Wed11:30-13:20MCKN 2326606

Lec 0101

Tue, Thu 14:30-15:50

Tue, Thu14:30-15:50ALEX 2006606

Lec 0102

Tue, Thu 14:30-15:50

Tue, Thu14:30-15:50ALEX 2006607

Lec 0102

Wed 15:30-17:20

Wed15:30-17:20MCKN 2286607

Lec 0103

Mon 11:30-13:20

Mon11:30-13:20MCKN 2306608

Lec 0103

Tue, Thu 14:30-15:50

Tue, Thu14:30-15:50ALEX 2006608

Lec 0104

Mon 8:30-10:20

Mon8:30-10:20MCKN 2316609

Lec 0104

Tue, Thu 14:30-15:50

Tue, Thu14:30-15:50ALEX 2006609

Lec 0105

Mon 8:30-10:20

Mon8:30-10:20MCKN 2296610

Lec 0105

Tue, Thu 14:30-15:50

Tue, Thu14:30-15:50ALEX 2006610

Lec 0106

Tue, Thu 14:30-15:50

Tue, Thu14:30-15:50ALEX 2006611

Lec 0106

Wed 15:30-17:20

Wed15:30-17:20MCKN 2296611

Syllabus

Have the syllabus for CIS 3490? Share it and everyone gets the grading, textbooks and rules.