After the completion of this course the student will be able to Analyze the complexity of a given algorithm. Apply classical sorting, searching, optimization and graph algorithms. Compare, contrast, and choose appropriate algorithmic design techniques to present an algorithm that solves a given problem. Explain NP-Completeness and deal with NP-complete problems. Use different algorithm-design techniques, including, but not limited to, greedy, conquer, and dynamic programming techniques, to solve particular problems. Model real problems abstractly using the language of graphs and flows. Make intelligent decisions about alternative data structures and algorithmic techniques in the context of practical software problems, choosing from existing data structures and algorithms or designing your own when necessary. Course Syllabus: Implement Strassen’s Multiplication. Implement Dijkstra’s Algorithm. Implement Prim’s Algorithm. Implement Kruskal’s Algorithm. To determine Shortest Path in Multi-stage graph using Forward & Backward approach. Implement Traveling Salesman Problem using Dynamic Programming. Implement longest common sequence algorithm. Implement DFS traversal of a given graph. Find the strongly connected components of a graph. Find the articulation bi-connected components. Implement FIFO branch and bound algorithm for 0/1 Kanpsack problem. Implement LC branch and bound algorithm for Traveling Salesman problem.
After the completion of this course the student will be able to Analyze the complexity of a given algorithm. Apply classical sorting, searching, optimization and graph algorithms. Compare, contrast, and choose appropriate algorithmic design techniques to present an algorithm that solves a given problem. Explain NP-Completeness and deal with NP-complete problems. Use different algorithm-design techniques, including, but not limited to, greedy, conquer, and dynamic programming techniques, to solve particular problems. Model real problems abstractly using the language of graphs and flows. Make intelligent decisions about alternative data structures and algorithmic techniques in the context of practical software problems, choosing from existing data structures and algorithms or designing your own when necessary. Course Syllabus: Implement Strassen’s Multiplication. Implement Dijkstra’s Algorithm. Implement Prim’s Algorithm. Implement Kruskal’s Algorithm. To determine Shortest Path in Multi-stage graph using Forward & Backward approach. Implement Traveling Salesman Problem using Dynamic Programming. Implement longest common sequence algorithm. Implement DFS traversal of a given graph. Find the strongly connected components of a graph. Find the articulation bi-connected components. Implement FIFO branch and bound algorithm for 0/1 Kanpsack problem. Implement LC branch and bound algorithm for Traveling Salesman problem.
Syllabus%20with%20PEO%27s%20NEW.docx