Daniel M Kane

 

 


 

aniel Kane is an associate professor at UCSD with a joint appointment between the Department of Computer Science and Engineering and the Department of Mathematics. He has diverse research interests in mathematics and theoretical computer science, though most of his work fits into the broad categories of number theory, complexity theory or combinatorics.




Customize your search:

E.g., 2016-12-09
E.g., 2016-12-09
E.g., 2016-12-09
Dec 12th 2016

A good algorithm usually comes together with a set of good data structures that allow the algorithm to manipulate the data efficiently. In this course, we consider the common data structures that are used in various computational problems. You will learn how these data structures are implemented in different programming languages and will practice implementing them in our programming assignments.

Average: 9 (4 votes)
Dec 12th 2016

The course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming. We will learn a lot of theory: how to sort data and how it helps for searching; how to break a large problem into pieces and solve them recursively; when it makes sense to proceed greedily; how dynamic programming is used in genomic studies. You will practice solving computational problems, designing new algorithms, and implementing solutions efficiently (so that they run in less than a second).

Average: 7.4 (9 votes)