I am interested in the combinatorial and algorithmic problems. So, I would expect you enjoyed the Discrete Mathematics and Algorithm courses. Here are some questions that you need to be familiar with to work in a project with me.
What is time complexity of an algorithm?
What is sorting? What is the difference between Quicksort and Mergesort?
What is a tree? How does the Binary Search Tree work?
What is a polygon? How do you define Convex-hull of a set of points? What is the time complexity of constructing the convex-hull?
What is a path in a graph? How to find a path between two vertices of a graph?
Here are some ideas about Mini Projects.
Art-Gallery Problem. What are the different versions of it that can be solved efficiently?
Center Finding Problem. What are the different practical modles of this? How to solve them?
Robot Motion Planning. What are the different models of this problem in real life applications?
Interested? You can reach me at my Office N-111 in SCIS or mail me.