{"id":725,"date":"2016-01-12T00:17:22","date_gmt":"2016-01-12T05:17:22","guid":{"rendered":"https:\/\/www.jsums.edu\/nmeghanathan\/?page_id=725"},"modified":"2016-04-14T17:33:18","modified_gmt":"2016-04-14T22:33:18","slug":"csc323-sp2016","status":"publish","type":"page","link":"https:\/\/www.jsums.edu\/nmeghanathan\/csc323-sp2016\/","title":{"rendered":"CSC 323 Algorithm Design and Analysis, Spring 2016"},"content":{"rendered":"

\n\tQuiz 8 on April 19th: (Theorem Proving Quiz): CLOSED NOTES<\/span><\/strong><\/span>.    Reading List<\/span><\/a><\/strong><\/span>\n<\/p>\n

\n\tExam 3 (Final Exam) on April 26th: 1 PM to 2.50 PM. OPEN NOTES. <\/span><\/strong><\/span>Reading List<\/span><\/a><\/span>\n<\/p>\n

\n\tProjects 6 and 7 posted.<\/strong>\n<\/p>\n

\n\t—————————————————–<\/span>\n<\/p>\n

\n\tSyllabus<\/a>
\n\tLecture Slides<\/a>
\n\tQuestion Bank<\/a>
\n\tProject Descriptions<\/a>
\n\tQuiz Solutions<\/a>
\n\tDr. Meg's Desktop Selected Lecture Videos<\/a>
\n\tQuiz, Exam and Project Schedules<\/a>
\n\t—————————————————–\n<\/p>\n

\n\tSyllabus<\/a>
\n<\/h3>\n

\n\tCSC 323 Syllabus, Spring 2016<\/a><\/span>\n<\/p>\n

\n\tLecture Slides<\/a>
\n<\/h3>\n

\n\tModule 1: Algorithm Efficiency Analysis<\/a><\/span>\n<\/p>\n

\n\tModule 2: Classical Design Techniques<\/a><\/span>\n<\/p>\n

\n\tModule 3: Greedy Strategy<\/a><\/span>\n<\/p>\n

\n\tModule 4: Dynamic Programming<\/a><\/span>\n<\/p>\n

\n\tModule 5: Graph Algorithms<\/a><\/span>\n<\/p>\n

\n\tModule 6: NP-Complete Problems and Heuristics<\/a><\/span>\n<\/p>\n

\n\tQuestion Bank<\/a>
\n<\/h3>\n

\n\tQB Module 1: Algorithm Efficiency Analysis<\/a><\/span>\n<\/p>\n

\n\tQB Module 2 – Classical Design Techniques<\/a><\/span>\n<\/p>\n

\n\tQB Module 3 – Greedy Strategy<\/a><\/span>\n<\/p>\n

\n\tQB Module 4 – Dynamic Programming<\/a><\/span>\n<\/p>\n

\n\tQB Module 5 – Graph Theory Algorithms<\/a><\/span>\n<\/p>\n

\n\tProject Descriptions<\/a>
\n<\/h3>\n

\n\tProject 1: Element Uniqueness Problem<\/a>, Due: Feb. 11\n<\/p>\n

\n\tProject 2: Iterative vs. Recursive Algorithms to Compute the Factorial of an Integer<\/a><\/span>, Due: Feb. 18\n<\/p>\n

\n\tProject 3: Computing h-index using Sorting and Max-Min Formulation<\/a>, Due: March 3<\/span>\n<\/p>\n

\n\tProject 4: Determining the Maximum Element in an Unimodal Array using the Binary Search Logic<\/a>, Due: March 10<\/span>\n<\/p>\n

\n\tProject 5: Determining the Common Elements across All Arrays using Hash Tables and Java Collection Classes<\/a>, Due: March 31<\/span>\n<\/p>\n

\n\tProject 6: Bloom Filter and Breadth First Search, Due: April 14, 2016<\/a>\n<\/p>\n

\n\tProject 7: Maximum Bottleneck Path Problem, Due: April 21, 2016<\/a>\n<\/p>\n

\n\t \n<\/p>\n

\n\tQuiz Solutions<\/a>
\n<\/h3>\n

\n\tQuiz-1 Solutions<\/a><\/span>\n<\/p>\n

\n\tQuiz-2 Solutions<\/a><\/span>\n<\/p>\n

\n\tQuiz-3 Solutions<\/a><\/span>\n<\/p>\n

\n\tQuiz-4 Solutions<\/a><\/span>\n<\/p>\n

\n\tQuiz-5 Solutions<\/a><\/span>\n<\/p>\n

\n\t\u200bQuiz-6 Solutions<\/a><\/span>\n<\/p>\n

\n\tQuiz 7 Solutions<\/a><\/span>\n<\/p>\n

\n\tDr. Meg's Desktop Selected Lecture Videos (YouTube Links)<\/a><\/font>
\n<\/h3>\n

\n\tModule 1 (Chapter 2): Analyzing the Efficiency of Algorithms<\/font><\/u>
\n<\/h4>\n

\n\tTime-Complexity analysis of a recursive algorithm to compute the factorial of an integer<\/a>    \n<\/p>\n

\n\tExample for solving recurrence relations<\/a>    \n<\/p>\n

\n\tTime-complexity analysis of an iterative algorithm to determine whether an array has unique elements<\/a>    \n<\/p>\n

\n\tTime-Complexity analysis of a recursive algorithm to determine the number of bits needed to represent a positive integer<\/a>    \n<\/p>\n

\n\tModule 2 (Chapters 3-6): Classical Algorithm Design Techniuqes<\/font><\/u>
\n<\/h4>\n

\n\tBrute Force Algorithms QB – String Matching Problems<\/a>\n<\/p>\n

\n\tDecrease and Conquer – Insertion Sort Algorithm and Examples<\/a>\n<\/p>\n

\n\tDivide and Conquer – Theorem-Proof: In order Traversal of a Binary Search Tree<\/a>\n<\/p>\n

\n\tDivide and Conquer – Master Theorem<\/a>\n<\/p>\n

\n\tBinary Search Algorithm and Examples<\/a>\n<\/p>\n

\n\tComparison of Bottom-up and Top-down Approaches for Heap Construction<\/a>    \n<\/p>\n

\n\tTransform and Conquer – Proof for Euclid's GCD Formula<\/a>\n<\/p>\n

\n\tTransform and Conquer – Heap Sort<\/a>\n<\/p>\n

\n\tSpace-Time Tradeoffs for the Sorting Algorithms (Merge, Insertion and Heap Sorts)<\/a>    \n<\/p>\n

\n\tModule 3 (Chapter 9): Greedy Technique<\/font><\/a><\/u>
\n<\/h4>\n

\n\tGreedy Technique – Fractional Knapsack Problem<\/a>\n<\/p>\n

\n\tGreedy Technique – Huffman Codes (Variable Length Prefix-free Encoding)<\/a>\n<\/p>\n

\n\tModule 4 (Chapter 8): Dynamic Programming<\/font><\/u>
\n<\/h4>\n

\n\tDynamic Programming: Coin-row Problem Discussion and Example<\/a>\n<\/p>\n

\n\tDynamic Programming: Binomial Coefficient<\/a>\n<\/p>\n

\n\tDynamic Programming Solution for the Coin Collecting Problem in a Two-Dimensional Grid<\/a>\n<\/p>\n

\n\tDynamic Programming: Integer Knapsack Problem (0-1 Knapsack Problem)<\/a>\n<\/p>\n

\n\tModule 5: Graph Theory Algorithms<\/font><\/a><\/u>
\n<\/h4>\n

\n\tDepth First Search on Directed Graph<\/a>\n<\/p>\n

\n\tDepth First Search and Articulation Points<\/a>\n<\/p>\n

\n\tBreadth First Search and 2-Colorability of Graphs<\/a>\n<\/p>\n

\n\tTopological Sort on DAGs and Proof for Neccessary and Sufficient Condition<\/a>\n<\/p>\n

\n\tDijkstra's Algorithm for Shortest Path Trees and Proof for Correctness<\/a>\n<\/p>\n

\n\tBellman-Ford Algorithm for Shortest Path Trees and Examples<\/a> New!!<\/font>\n<\/p>\n

\n\tKruskal's Algorithm: Examples to find Minimum Spanning Trees<\/a>\n<\/p>\n

\n\tKruskal's Algorithm: Proof of Correctness<\/a>\n<\/p>\n

\n\tProperties (1 and 2) of Minimum Spanning Tree: IJ-Cut and Minimum Weight Edge<\/a>\n<\/p>\n

\n\tProperties (3 and 4) of Minimum Spanning Tree: A graph with unique edge weights has only one minimum spanning tree<\/a>\n<\/p>\n

\n\tProperty 5 of Minimum Spanning Tree: Given a graph with unique edge weights, the largest weight edge in any cycle cannot be part of any minimum spanning tree<\/a>\n<\/p>\n

\n\tPrim's Algorithm for Minimum Spanning Trees and Proof for Correctness<\/a>\n<\/p>\n

\n\tFloyd's All Pairs Shortest Paths Algorithm<\/b><\/a>
\n\tPart 1<\/a>     Part 2<\/a>     Part 3<\/a>     Part 4<\/a>     Part 5<\/a>     Part 6<\/a>     Part 7<\/a>    \n<\/p>\n

\n\tModule 6: P, NP and NP-Complete Problems<\/font><\/a><\/u>
\n<\/h4>\n

\n\tPolynomial Reduction: Hamiltonian Circuit to Traveling Salesman Problem<\/a>    \n<\/p>\n

\n\tMinimal Number of Uncovered Neighbors Heuristic: Example to determine an Independent Set, Vertex Cover and Clique<\/a>    \n<\/p>\n

\n\tPolynomial Reductions: Independent Set, Clique and Vertex Cover<\/a>    \n<\/p>\n

\n\tMulti-fragment Heuristic for the Traveling Salesman Problem<\/a>    \n<\/p>\n

\n\tTwice around the tree Heuristic for the Traveling Salesman Problem and the Proof for approximation ratio<\/a>    \n<\/p>\n

\n\tQuiz, Exam and Project Schedules<\/a>
\n<\/h3>\n

\n\t\"\"<\/a>\n<\/p>\n

\n\t \n<\/p>\n

\n\t <\/p>\n","protected":false},"excerpt":{"rendered":"

Quiz 8 on April 19th: (Theorem Proving Quiz): CLOSED NOTES.    Reading List Exam 3 (Final Exam) on April 26th: 1 PM to 2.50 PM. OPEN NOTES. Reading List Projects 6 and 7 posted. —————————————————– Syllabus Lecture Slides Question Bank Project Descriptions Quiz Solutions Dr. Meg's Desktop Selected Lecture Videos Quiz, Exam and Project Schedules […]<\/p>\n","protected":false},"author":168,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"open","ping_status":"open","template":"","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0},"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/725"}],"collection":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/users\/168"}],"replies":[{"embeddable":true,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/comments?post=725"}],"version-history":[{"count":53,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/725\/revisions"}],"predecessor-version":[{"id":982,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/725\/revisions\/982"}],"wp:attachment":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/media?parent=725"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}