Combinatorial Analysis
4.0
creditsAverage Course Rating
Counting techniques: generating functions, recurrence relations, Polya’s theorem. Combinatorial designs: Latin squares, finite geometries, balanced incomplete block designs. Emphasis on problem solving. Recommended Course Background: AS.550.291 or AS.110.201
Fall 2012
Professor: Edward Scheinerman
The professor is knowledgeable and the course efficiently teaches useful probability skills. Students found it beneficial to do homework collaboratively. Many students did not like the PowerPoint format of the lectures and wished the professor had written on the board more. Students also said that the homework was graded harshly and they were not sure what was expected of them in terms of the homework. Students considering taking this course should know that the prerequisites are very important and they should expect a chal enging course. 18