{"id":3060,"date":"2020-01-10T22:07:38","date_gmt":"2020-01-11T03:07:38","guid":{"rendered":"https:\/\/www.jsums.edu\/nmeghanathan\/?page_id=3060"},"modified":"2020-04-21T17:42:26","modified_gmt":"2020-04-21T22:42:26","slug":"csc323-sp2020","status":"publish","type":"page","link":"https:\/\/www.jsums.edu\/nmeghanathan\/csc323-sp2020\/","title":{"rendered":"CSC 323 Algorithm Design and Analysis, Spring 2020"},"content":{"rendered":"

\n\tAssignment 12<\/a> (Due: 04\/21, by 11.59 PM) posted. <\/span><\/strong>\n<\/p>\n

\n\tAssignment 13: Quiz (Due: 04\/23, by 11.59 PM) posted in Canvas. <\/span><\/strong>\n<\/p>\n

\n\tReading List of Topics for Assignment 13 <\/a>(Quiz to be posted in Canvas; will be due on 04\/23, by 11.59 PM)<\/span><\/strong>\n<\/p>\n

\n\tTake Home Exam 4<\/a> <\/strong>posted (also available in Canvas). Due in Canvas by April 28th, 11.59 PM for both graduating and non-graduating students.<\/span><\/strong>\n<\/p>\n

\n\tCheck Assignment and Exam Schedules<\/a> for the updated schedule of the course\n<\/p>\n

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

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

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

\n\tSyllabus<\/a>\n<\/p>\n

\n\tTeaching Assistant<\/a>\n<\/p>\n

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

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

\n\tAssignments<\/a>\n<\/p>\n

\n\tExams<\/a>\n<\/p>\n

\n\tDr. Meg's Desktop Selected Lecture Videos<\/a>\n<\/p>\n

\n\tAssignment and Exam Schedules<\/a>\n<\/p>\n

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

\n\t<\/a>Syllabus<\/strong>
\n<\/h3>\n

\n\tCSC323 Syllabus, Spring 2020<\/a><\/strong>\n<\/p>\n

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

\n\t<\/a>Teaching Assistant (TA)<\/strong>\n<\/p>\n

\n\tAmanuel Gebre: Mondays, Fridays: 10 AM to 3 PM; Wednesdays: 11 AM to 3 PM<\/a><\/strong>\n<\/p>\n

\n\tOffice Hours in Canvas:<\/strong> Meet the TA using the "Chat" feature in Canvas during the above timings\n<\/p>\n

\n\tE-mail:<\/strong> J00801049@students.jsums.edu<\/a> <\/b>\n<\/p>\n

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

\n\t<\/a>Lecture Slides<\/strong>
\n<\/h3>\n

\n\t \n<\/p>\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\t                  Sample C++ Code and Explanation on dynamically creating and using a two-dimensional array<\/a>\n<\/p>\n

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

\n\tModule 6: P, NP, NP-Complete Problems<\/a><\/span>\n<\/p>\n

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

\n\t<\/a>Question Bank<\/strong>
\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\t<\/a>Assignments<\/strong>
\n<\/h3>\n

\n\tAssignment 2 (Programming): Design and Implementation of a Θ(n) Algorithm to Simultaneously Determine the Largest and Second Largest Elements of an Array<\/a><\/strong>\n<\/p>\n

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

\n\tAssignment 3 (Programming): Implementation and Performance Comparison of the Bubble Sort and Insertion Sort Algorithms<\/strong> <\/a>\n<\/p>\n

\n\tCheck Canvas for the timer code.\n<\/p>\n

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

\n\tAssignment 4 (Programming): Design and Implementation of a Θ(n) Algorithm to Determine the Most Frequently Occurring Integer in an Array of Integers <\/a><\/strong> <\/a>\n<\/p>\n

\n\tCheck Canvas for the code.\n<\/p>\n

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

\n\tAssignment 5 (Programming): Comparison of two Recursive Algorithms to Determine the Minimum Element in an Array<\/a><\/strong> <\/a>\n<\/p>\n

\n\tCheck Canvas for the code.\n<\/p>\n

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

\n\tAssignment 6 <\/a><\/strong>(Programming): Using the Merge Sort Algorithm to Determine the Number of Inversions and the Inverted Pairs of an Array<\/a><\/strong> <\/a>\n<\/p>\n

\n\tCheck Canvas for the code.\n<\/p>\n

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

\n\tAssignment 7 (Programming): Binary Search vs. Brute Force Search Algorithms for Finding a Local Minimum in a Two-Dimensional Array<\/a><\/strong> <\/a>\n<\/p>\n

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

\n\tAssignment 8 (Programming): <\/a>Dynamic Programming Algorithm for Optimum Coin Collection in a Two-Dimensional Grid<\/a><\/strong>\n<\/p>\n

\n\tCheck Canvas for the sample C++ code to work with two-dimensional arrays.\n<\/p>\n

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

\n\tAssignment 9 (Programming): <\/a>Dynamic Programming-based Solution for the Longest Common Subsequence Problem<\/a><\/strong>\n<\/p>\n

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

\n\tAssignment 10 (Programming): <\/a>Dynamic Programming: Coin Change Problem<\/a><\/strong>\n<\/p>\n

\n\tCheck Canvas for the Code\n<\/p>\n

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

\n\tAssignment 11 (Non-Programming-Take Home): Matrix Chain Multiplication<\/a> (<\/u><\/span><\/a><\/strong>Submit a word or PDF version of the solutions in Canvas by April 9th, 11.59 PM.<\/strong><\/span>)<\/u><\/span><\/a><\/strong>\n<\/p>\n

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

\n\tAssignment 12 (Non-Programming-Take Home): Prim's Minimum Spanning Tree Algorithm<\/a> (<\/u><\/span><\/a><\/strong>Submit a PDF version of the solutions in Canvas by April 21st, 11.59 PM.<\/strong><\/span>)<\/u><\/span><\/a><\/strong>\n<\/p>\n

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

\n\t<\/a>Exams<\/strong>
\n<\/h3>\n

\n\tTake Home Exam 2<\/a> <\/strong> (also available in Canvas). Due in Canvas by March 26th, 11.59 PM. <\/span><\/strong>\n<\/p>\n

\n\tTake Home Exam 3<\/a> <\/strong>posted (also available in Canvas). Due in Canvas by April 16th, 11.59 PM. <\/span><\/strong>\n<\/p>\n

\n\tTake Home Exam 4<\/a> <\/strong>posted (also available in Canvas). Due in Canvas by April 28th, 11.59 PM. For Graduating seniors, it is due on April 24th, 11.59 PM <\/span><\/strong>\n<\/p>\n

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

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

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

\n\t<\/a>Dr. Meg's Desktop Selected Lecture Videos (YouTube Links)<\/strong><\/span>
\n<\/h3>\n

\n\tModule 1: Analyzing the Efficiency of Algorithms<\/span><\/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<\/span><\/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<\/span><\/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<\/span><\/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<\/span><\/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!!<\/span>\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>\n<\/p>\n

\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<\/span><\/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\t<\/a>Assignment and Exam Schedules
\n<\/h3>\n

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

Assignment 12 (Due: 04\/21, by 11.59 PM) posted. Assignment 13: Quiz (Due: 04\/23, by 11.59 PM) posted in Canvas. Reading List of Topics for Assignment 13 (Quiz to be posted in Canvas; will be due on 04\/23, by 11.59 PM) Take Home Exam 4 posted (also available in Canvas). Due in Canvas by April 28th, […]<\/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\/3060"}],"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=3060"}],"version-history":[{"count":46,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/3060\/revisions"}],"predecessor-version":[{"id":3334,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/3060\/revisions\/3334"}],"wp:attachment":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/media?parent=3060"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}