<\/b>
\n<\/p>\n
—————————————————–<\/span><\/p>\n Syllabus<\/a> <\/p>\n —————————————————–<\/span><\/p>\n CSC323 Syllabus, Fall 2017<\/a><\/span><\/p>\n <\/p>\n Module 1: Algorithm Efficiency Analysis<\/a><\/span><\/p>\n <\/p>\n Module 2: Divide and Conquer<\/a><\/span><\/p>\n <\/p>\n Module 3: Greedy Strategy<\/a><\/span><\/p>\n <\/p>\n Module 4: Dynamic Programming<\/a><\/span><\/p>\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 Module 7:Hashing<\/a><\/span><\/p>\n <\/p>\n QB Module 1: Algorithm Efficiency Analysis<\/a><\/span><\/p>\n <\/p>\n QB Module 2 – Classical Design Techniques<\/a><\/span><\/p>\n <\/p>\n QB Module 3 – Greedy Strategy<\/a><\/span><\/p>\n <\/p>\n QB Module 4 – Dynamic Programming<\/a><\/span><\/p>\n <\/p>\n QB Module 5 – Graph Theory Algorithms<\/a><\/span><\/p>\n Project 1 (Bubble Sort vs. Insertion Sort): Due on Sept 21<\/a><\/span><\/p>\n Project 2 (Element Uniqueness Problem): Due on Oct. 5<\/a><\/span><\/p>\n Project 3 (Recursive Algorithm to Find the Minimum Integer in an Array): Due on Oct. 12<\/a><\/span><\/p>\n Project 4 (Binary Search vs. Brute Force Search Algorithms for Finding a Local Minimum in a Two-Dimensional Array): Due on Oct. 26<\/a><\/span><\/p>\n Project 5 (Binary Search Algorithm to Search for a Value with a Certain Precision): Due on Nov. 2<\/a><\/span><\/p>\n Project 6 (Dynamic Programming Algorithm for Optimum Coin Collection in a Two-Dimensional Grid): Due on Nov. 9<\/a><\/span><\/p>\n Project 7 (Dynamic Programming-based Solution for the Longest Common Subsequence Problem): Due on Nov. 14<\/a><\/span><\/p>\n Project 8 (Breadth First Search Algorithm): Due on Nov. 30<\/a><\/span><\/p>\n <\/p>\n Quiz 1 Solutions<\/a><\/span><\/p>\n Quiz 2 Solutions<\/a><\/span><\/p>\n Quiz 3 (Take Home: Due on Oct. 17, in-class)<\/a><\/span><\/p>\n Quiz 4 (Take Home: Due on Oct. 24, in-class)<\/a><\/span><\/p>\n Quiz 5 (Take Home: Due on Oct. 31, in-class)<\/a><\/span><\/p>\n Quiz 6 (Take Home: Due on Nov. 7, in-class)<\/a><\/span><\/p>\n <\/p>\n Basics of Vector Class<\/a><\/span><\/p>\n Populating 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><\/p>\n <\/p>\n Time-Complexity analysis of a recursive algorithm to compute the factorial of an integer<\/a><\/p>\n Example for solving recurrence relations<\/a><\/p>\n Time-complexity analysis of an iterative algorithm to determine whether an array has unique elements<\/a><\/p>\n <\/p>\n Time-Complexity analysis of a recursive algorithm to determine the number of bits needed to represent a positive integer<\/a><\/p>\n Decrease and Conquer – Insertion Sort Algorithm and Examples<\/a><\/p>\n Brute Force Algorithms QB – String Matching Problems<\/a><\/p>\n Divide and Conquer – Theorem-Proof: In order Traversal of a Binary Search Tree<\/a><\/p>\n Divide and Conquer – Master Theorem<\/a><\/p>\n Binary Search Algorithm and Examples<\/a><\/p>\n Comparison of Bottom-up and Top-down Approaches for Heap Construction<\/a><\/p>\n Transform and Conquer – Proof for Euclid’s GCD Formula<\/a><\/p>\n Transform and Conquer – Heap Sort<\/a><\/p>\n Space-Time Tradeoffs for the Sorting Algorithms (Merge, Insertion and Heap Sorts)<\/a><\/p>\n Greedy Technique – Fractional Knapsack Problem<\/a><\/p>\n Greedy Technique – Huffman Codes (Variable Length Prefix-free Encoding)<\/a><\/p>\n Dynamic Programming: Coin-row Problem Discussion and Example<\/a><\/p>\n Dynamic Programming: Binomial Coefficient<\/a><\/p>\n Dynamic Programming Solution for the Coin Collecting Problem in a Two-Dimensional Grid<\/a><\/p>\n Dynamic Programming: Integer Knapsack Problem (0-1 Knapsack Problem)<\/a><\/p>\n Depth First Search on Directed Graph<\/a><\/p>\n Depth First Search and Articulation Points<\/a><\/p>\n Breadth First Search and 2-Colorability of Graphs<\/a><\/p>\n Topological Sort on DAGs and Proof for Neccessary and Sufficient Condition<\/a><\/p>\n Dijkstra’s Algorithm for Shortest Path Trees and Proof for Correctness<\/a><\/p>\n Bellman-Ford Algorithm for Shortest Path Trees and Examples<\/a> New!!<\/span><\/p>\n Kruskal’s Algorithm: Examples to find Minimum Spanning Trees<\/a><\/p>\n Kruskal’s Algorithm: Proof of Correctness<\/a><\/p>\n Properties (1 and 2) of Minimum Spanning Tree: IJ-Cut and Minimum Weight Edge<\/a><\/p>\n Properties (3 and 4) of Minimum Spanning Tree: A graph with unique edge weights has only one minimum spanning tree<\/a><\/p>\n Property 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><\/p>\n Prim’s Algorithm for Minimum Spanning Trees and Proof for Correctness<\/a><\/p>\n <\/a>Floyd’s All Pairs Shortest Paths Algorithm<\/b><\/p>\n Part 1<\/a>\u00a0\u00a0\u00a0\u00a0 Part 2<\/a>\u00a0\u00a0\u00a0\u00a0 Part 3<\/a>\u00a0\u00a0\u00a0\u00a0 Part 4<\/a>\u00a0\u00a0\u00a0\u00a0 Part 5<\/a>\u00a0\u00a0\u00a0\u00a0 Part 6<\/a>\u00a0\u00a0\u00a0\u00a0 Part 7<\/a><\/p>\n Polynomial Reduction: Hamiltonian Circuit to Traveling Salesman Problem<\/a><\/p>\n Minimal Number of Uncovered Neighbors Heuristic: Example to determine an Independent Set, Vertex Cover and Clique<\/a><\/p>\n Polynomial Reductions: Independent Set, Clique and Vertex Cover<\/a><\/p>\n Multi-fragment Heuristic for the Traveling Salesman Problem<\/a><\/p>\n Twice around the tree Heuristic for the Traveling Salesman Problem and the Proof for approximation ratio<\/a><\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n","protected":false},"excerpt":{"rendered":" Exam 3 (Open Notes) on Dec. 5th: Module 5 (Dijkstra Shortest Path algorithm and Floyd-Warshall All Pairs Shortest Paths algorithm) and Module 6 (entire module) from 9 AM to 10.50 AM at ENB 212 —————————————————– Syllabus Lecture Slides Question Bank Project Descriptions Quizzes and Exams Code Tutorial Dr. Meg’s Desktop Selected Lecture Videos Quiz, Exam […]<\/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\/1574"}],"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=1574"}],"version-history":[{"count":59,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/1574\/revisions"}],"predecessor-version":[{"id":1971,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/1574\/revisions\/1971"}],"wp:attachment":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/media?parent=1574"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\n
Lecture Slides<\/a>
\n
\nQuestion Bank<\/a>
\n
\nProject Descriptions<\/a>
\n
\nQuizzes and Exams<\/a>
\n
\nCode Tutorial<\/a>
\n
\nDr. Meg’s Desktop Selected Lecture Videos<\/a>
\n
\nQuiz, Exam and Project Schedules<\/a><\/p>\n<\/a>Syllabus<\/h3>\n
<\/a>Lecture Slides<\/h3>\n
<\/a>Question Bank<\/h3>\n
<\/a>Project Descriptions<\/h3>\n
<\/a>Quizzes and Exams<\/h3>\n
<\/a>Code Tutorial<\/h3>\n
<\/a>Dr. Meg’s Desktop Selected Lecture Videos (YouTube Links)<\/span><\/h3>\n
Module 1: Analyzing the Efficiency of Algorithms<\/span><\/u><\/h4>\n
Module 2: Classical Algorithm Design Techniuqes<\/span><\/u><\/h4>\n
<\/a>Module 3: Greedy Technique<\/span><\/u><\/h4>\n
Module 4: Dynamic Programming<\/span><\/u><\/h4>\n
<\/a>Module 5: Graph Theory Algorithms<\/span><\/u><\/h4>\n
<\/a>Module 6: P, NP and NP-Complete Problems<\/span><\/u><\/h4>\n
<\/a>Quiz, Exam and Project Schedules
![\"\"](\"https:\/\/www.jsums.edu\/nmeghanathan\/files\/2017\/08\/CSC323-Fall2017-Schedule-NEW.jpg\")
<\/a><\/h3>\n