User:Abdulknp/Books/D.A.A @ UPTU

Computer Science & Engineering@UPTU

 * UNIT I: Introduction
 * Algorithm
 * Analysis of algorithms
 * Best, worst and average case
 * Big O notation
 * Master theorem
 * Insertion sort
 * Bubble sort
 * Shellsort
 * Selection sort
 * Quicksort
 * Merge sort
 * Heapsort
 * Sorting algorithm
 * Time complexity


 * UNIT II: Advanced Data Structures
 * Red–black tree
 * B-tree
 * Binomial heap
 * Fibonacci heap


 * UNIT III:
 * Knapsack problem
 * Minimum spanning tree
 * Prim's algorithm
 * Kruskal's algorithm
 * Shortest path problem
 * Dijkstra's algorithm
 * Bellman–Ford algorithm


 * UNIT - IV:
 * Floyd–Warshall algorithm
 * Backtracking
 * Travelling salesman problem
 * Graph coloring
 * Eight queens puzzle
 * Subset sum problem


 * UNIT V: Selected Topics
 * Symbolic computation
 * Fast Fourier transform
 * String searching algorithm
 * NP-complete
 * Approximation algorithm
 * Randomized algorithm