{"id":1304,"date":"2017-01-10T05:48:10","date_gmt":"2017-01-10T10:48:10","guid":{"rendered":"https:\/\/www.jsums.edu\/nmeghanathan\/?page_id=1304"},"modified":"2017-04-07T20:12:53","modified_gmt":"2017-04-08T01:12:53","slug":"csc323-sp2017","status":"publish","type":"page","link":"https:\/\/www.jsums.edu\/nmeghanathan\/csc323-sp2017\/","title":{"rendered":"CSC 323 Algorithm Design and Analysis, Spring 2017"},"content":{"rendered":"

\n\tExam 3 (Final Exam): Take Home<\/span><\/a>, Due on April 25th (1 PM to 3 PM) at ENB 275. Students need to submit the hard copy of the answers (printed out as instructed) along with the course survey at my office (ENB 275). I will be available at my office from 1 PM to 3 PM. Exams submitted after 3 PM on April 25th will NOT be accepted.<\/strong>\n<\/p>\n

\n\tQuiz 7 on April 11th:<\/span> Topics: Module 5 – Depth First Search (DFS): Undirected graphs and Directed graphs, including DAGs; Open Notes<\/span><\/strong>\n<\/p>\n

\n\tQuiz 8 on April 13th: <\/span>Theorem Proving Quiz (Closed Notes); Reading List<\/span><\/a><\/span><\/strong>\n<\/p>\n

\n\tTerm Project Assigned: Progress Report – March 28; Final Presentations – April 18, 20; Final Report – April 20<\/span><\/a><\/strong><\/span>\n<\/p>\n

\n\tCSC323-Term Project Presentation Schedule-Sp2017<\/span><\/a><\/strong><\/span>\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\tTerm Project<\/a>
\n\tQuizzes and Exams<\/a>
\n\tCode Tutorial<\/a>
\n\tDr. Meg's Desktop Selected Lecture Videos<\/a>
\n\tQuiz, Exam and Project Schedules<\/a>\n<\/p>\n

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

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

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

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

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

\n\tModule 2: Divide and Conquer<\/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 (Due: Feb 9, 1 PM)<\/a><\/span>\n<\/p>\n

\n\tProject 2 (Due: March 2, 1 PM)<\/a><\/span>\n<\/p>\n

\n\tProject 3 (Due on March 30)<\/span><\/a><\/span><\/strong>;  \n<\/p>\n

\n\tProject 4 (Due on April 6)<\/span><\/a><\/span><\/strong>\n<\/p>\n

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

\n\tTerm Project<\/a>
\n<\/h3>\n

\n\tTerm Project Assigned: Progress Report – March 28; Final Presentations – April 18, 20; Final Report – April 20<\/span><\/a><\/strong><\/span>\n<\/p>\n

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

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

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

\n\tQuizzes and Exams<\/a>
\n<\/h3>\n

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

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

\n\tExam 1 (Take Home; Due on Feb 21 @ 1 PM; hard copy in class)<\/span><\/a><\/strong><\/span>\n<\/p>\n

\n\tQuiz 4 posted (Take home: Due on Feb. 28 @ 1 PM; hard copy in class)<\/span><\/a><\/strong><\/span>\n<\/p>\n

\n\tQuiz 5 posted (Take home: Due on March 7 @ 1 PM; hard copy in class)<\/span><\/a><\/strong><\/span>\n<\/p>\n

\n\tExam 2 posted (Take home: Due on March 23 @ 1 PM; hard copy in class)<\/span><\/a><\/span><\/strong>\n<\/p>\n

\n\tQuiz 6 posted (Take home: Due on April 4 @ 1 PM; Email me as instructed in the quiz description)<\/span><\/a><\/span><\/strong>\n<\/p>\n

\n\tCode Tutorial<\/a>
\n<\/h3>\n

\n\tBasics of Vector Class<\/a><\/span>\n<\/p>\n

\n\tPopulating a 1-dim and 2-dim Array with Elements in Random Order chosen from a Vector that has the Elements in Sequential Order<\/a><\/span>\n<\/p>\n

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

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

\n\tModule 1: 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\tDecrease and Conquer – Insertion Sort Algorithm and Examples<\/a>\n<\/p>\n

\n\tModule 2: Classical Algorithm Design Techniuqes<\/font><\/u>
\n<\/h4>\n

\n\tBrute Force Algorithms QB – String Matching Problems<\/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: 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: 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\t \n<\/p>\n

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

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

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

\n\t\"CSC323-Sp2017-Schedule\"<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

Exam 3 (Final Exam): Take Home, Due on April 25th (1 PM to 3 PM) at ENB 275. Students need to submit the hard copy of the answers (printed out as instructed) along with the course survey at my office (ENB 275). I will be available at my office from 1 PM to 3 PM. […]<\/p>\n","protected":false},"author":168,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","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\/1304"}],"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=1304"}],"version-history":[{"count":53,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/1304\/revisions"}],"predecessor-version":[{"id":1510,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/1304\/revisions\/1510"}],"wp:attachment":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/media?parent=1304"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}