Ask studens to work on sorting poker card. Closed books, closed notebook, closed computers.
First write the procedure down in clear English.
Then rewrite in pseduo code. (Many students wrote bubble-sort algorithm, which is O(n^2).
One student write a insertion-sort, close the CLRS textbook version.
With 50 minutes to go, I showed the textbook insertion sorting algorithm, and demos with stylroform cups step-by-step. After 2 steps, I asked students to volunteer and explained them.
I then quickly go over powerpoint, and ask students to present the ppt in video as homework.
Showing posts with label CPSC5210. Show all posts
Showing posts with label CPSC5210. Show all posts
Thursday, August 25, 2016
Thursday, July 21, 2016
CPSC5210 Design and Analysis of Computer Algorithms
CPSC 5210 - Design and Analysis of Computer Algorithms
(3) Credit Hours
Algorithm design techniques including divide and conquer, greedy method, dynamic programming, search and traversal, backtracking, branch and bound, graph algorithms. Introduction to the theory of NP-completeness and to methods of coping with NP-complete problems. Introduction to parallel algorithms. Prerequisite: CPSC 5010 or placement, or department head approval. Standard letter grade. Differential Course Fee will be assessed.
https://mitpress.mit.edu/books/introduction-algorithms
http://www.cs.dartmouth.edu/~thc/
http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/calendar/
https://www.cs.unc.edu/~anderson/teach/comp750/
https://www.cs.unc.edu/~anderson/teach/comp750/syl.pdf
https://www.udacity.com/course/intro-to-algorithms--cs215
https://www.coursera.org/learn/algorithm-design-analysis
Subscribe to:
Posts (Atom)