Actions and Detail Panel
Design and Analysis of Algorithm for 12+
Mon, July 24, 2017, 8:30 AM – 11:30 AM PDT
This 2 weeks/30 hours course presents the fundamental techniques for designing efficient computer algorithms and analyzing their performance. Topics include asymptotic analysis, recurrences, sorting algorithms (heapsort, quicksort, linear time sorting), data structures such as hash tables and binary search tree, and solving optimization problems through greedy algorithms and dynamic programming.
By the end of this course, students will be able to: • Describe the divide-and-conquer paradigm and explain when an algorithmic design situation calls for it. Synthesize divide-andconquer algorithms. Derive and solve recurrences describing the performance of divide-and-conquer algorithms. • Explain the major algorithms for sorting. Synthesize algorithms that employ sorting as a subroutine. Derive lower bounds on the running time of comparison-sorting algorithms, and explain how these bounds can be overcome. • Describe the design of hash tables and binary search trees and understand how to use them. • Describe the greedy paradigm and explain when an algorithmic design situation calls for it.
*Each Session is 2 weeks for 10 classes, 1st session 7/10-7/21 1-4pm, 2nd session 7/24-8/4 8:30-11:30am, 3rd session 8/7-8/18 5-8pm . Total tuition/for full 2 weeks class is $600. Early registration will recieve one free class, only for date 7/10, 7/24, 8/7 which the first day of each session.
Tutition will include all material, program and tool for class need, check all summer classes at San Jose Polytechnic University, please call 408-564-6389 or email firstname.lastname@example.org.