Still no participant
Still no reviews
Module I: Introduction (4 Hrs)
Mathematics in Computer Science, Problem Solving and Algorithms, Data Structures and Algorithms, Algorithm Efficiency and Importance.
Module II: Problem Types (4 Hrs)
Sorting, Searching, String Processing, Graph and Numerical Problems
Module III: Algorithm Efficiency (6 Hrs)
Orders of Growth, Best-Case, Worst-Case and Average-Case Efficiencies, Analysis of Recursive and Non-Recursive Algorithms
Module IV: Brute Force and Exhaustive Search (10 Hrs)
Selection Sort and Bubble Sort, Sequential Search and Brute-Force String Matching, Exhaustive Search, Depth-First Search and Breadth-First Search.
Module V: Divide and Conquer (10 Hrs)
Merge Sort, Quick Sort, Binary Tree Traversal, Closest-Pair and Convex-Hull Problems
Module VI: Dynamic Programming and Greedy Technique (16 Hrs)
Dynamic programming- Floyd ‘s algorithm, Optimal Binary Search Trees, Knapsack Problem and Memory functions.
Greedy Technique- Prim’sAlgorithm, Kruskal’s Algorithm, Dijkstra’s Algorithm, Huffman Trees.
Module VII: Limitations of Algorithm Power (4 Hrs)
Lower-Bound Arguments, Decision Trees, P, NP and NP- Complete Problems.
Text Books:
Reference Books:
Mathematics in Computer Science, Problem Solving and Algorithms :PPT
Data Structures and Algorithms, Algorithm Efficiency and Importance: PPT
Sorting, Searching, String Processing:PPT
Graph and Numerical Problems: PPT
Orders of Growth, Best-Case, Worst-Case and Average-Case Efficiencies
Analysis of Recursive algorithms: Substitution method, recursion tree method and master method
Analysis of Non-Recursive Algorithms with example
Selection Sort: Problem-solving, Algorithm, Find Best, worst, and average case Time complexity
Practice 1:
Bubble Sort: Problem-solving, Algorithm, Find Best, worst, and average case Time complexity
Practice 2:
Sequential Search and Brute-Force String Matching, Exhaustive Search
Practice 3:
You are given a string “s” and s pattern “p”, you need to check if the pattern is there in the string.
S = “prodevelopertutorial”
P = “rial”
We need to check if “rial” is present in “prodevelopertutorial” string. Use Brute Force Search Approach
Depth-First Search and Breadth-First Search: problem solving, Find Time complexity
Practice 4:
Merge Sort: Problem-solving, Algorithm, Find Best, worst, and average case Time complexity
Practice 5:
Quick Sort: Problem-solving, Algorithm, Find Best, worst, and average case Time complexity
Practice 6:
Binary Tree Traversal, Closest-Pair and Convex-Hull Problems
Dynamic programming- Floyd ‘s algorithm : Problem-solving, Algorithm, Find Best, worst, and average case Time complexity
Practice 7:
Write pseudocode for a linear-time algorithm that generates the optimal binary search tree from the root table.
knapsack problem: Problem solving, Algorithm, Time complexity
Practice 8:
a. Apply the bottom-up dynamic programming algorithm to the following instance of the knapsack problem:
b. How many different optimal subsets does the instance of part (a) have?
c. In general, how can we use the table generated by the dynamic programming algorithm to tell whether there is more than one optimal subset for the knapsack problem’s instance?
Greedy Technique- Prim’sAlgorithm, Kruskal’s Algorithm: Problem solving, Algorithms, Different cases of Time complexities
Practice 9 & 10:
a. Apply Prim’s and Kruskal's algorithm to the following graph.:
Dijkstra’s Algorithm: Problem solving, Algorithms, Different cases of Time complexities
Practice 11:
Solve the following instances of the single-source shortest-paths problem with
vertex a as the source:
Huffman Trees: Problem solving, Algorithms, Different cases of Time complexities
Practice 12:
Consider the five-symbol alphabet {A, B, C, D, _} with the following occurrence frequencies in a text made up of these symbols:
Lower-Bound Arguments, Decision Trees, P, NP and NP- Complete Problems.
Received M.Tech in Information technology from BPUT University in the year of 2010 and continuing my Ph.D. at Sambalpur University. Currently working as an Assistant Professor at Centurion University of Technology and Management since 2009.
Copyright © 2020 Centurion University of Technology & Management
Designed & Developed By I.T Team - CUTM