Teaching

CS898 2017, Spring Term
Deep learning and its applications. DC 2568, Mondays 2:004:50pm.

CS886 2015, Spring Term
Topics in Natural Language Processing. DC 2568, Wednesdays 2:004:50pm.

CS898 2014, Spring Term
Applications of Kolmogorov complexity. DC 2568, Wednesdays 1:003:50pm.

CS341, Winter, 2011 Algorithms.

CS860 2010, Winter Term
Kolmogorov complexity and applications. MC 2036A, Mondays 3:306:20pm.

CS341, Spring, 2009, Algorithms.

CS798 2007, Fall Term
Kolmogorov complexity and applications. DC 3313, Mondays 4:307:00pm.

2007, Jan. 9, 11: Two Lectures presented in Shai BenDavid course.
Lecture
1
and
Lecture
2.
Assignment (1 hour): Consider an iid English text of length 100. At
each position, each letter from a to z appears independently with
probability
1/26. Compute the probability of aaa and abc occuring in this text,
respectively. (Hint: you can do dynamic programming as in class, you
can
also just do simulation to find the probabilities of aaa and abc.)
You can hand in this little assignment to my mailbox in the
CS main office area, by Jan. 25th.
Large Project: if you are interested in
doing larger projects related to bioinformatics, please email me.

CS882 2006, Fall Term
Protein Folding.

CS860 2005, Spring Term
Introduction to Kolmogorov complexity and applications.

CS882 2004, Winter Term
Advanced Topics in Bioinformatics: Algorithms and Software.

CS360 1999
Fall Term Theory of Computation.

CS340 1996
Winter Term Data Structure.

1995 CS340 Winter Term: Model Solutions to Final
Exam and
Marks for the course Data Structure.

Programming with
Java,
1997 Winter Term. This page contains
my lecture notes (powerpoint files), and best applets made by the
students in this class.