Introduction:
Definition of algorithm, Characteristic of algorithm, Different Control Structures, Writing Structured Programs, Analysis of algorithm.
Divide and Conquer:
General Method, Binary Search, Finding Maximum &
Minimum, Merge Sort, Quick Sort.
Greedy Method:
General method, Knapsack Problem, Job Sequencing with deadline, Minimum – cost Spanning trees, Single – Source Shortest Paths.
Dynamic Programming:
Introduction to Graphs, Definition types, Terms related to graph, General Method, Multistage Graphs, All pair Shortest Paths, 0/1 – knapsack, The traveling salesperson problem, Flow Shop Scheduling.
Basic traversal & Search techniques:
Search & traversal techniques for trees, Search & traversal techniques for graphs.
Backtracking:
General method, The 8- Queens Problem, Sum of subsets, Graph Coloring.
Definition of algorithm, Characteristic of algorithm, Different Control Structures, Writing Structured Programs, Analysis of algorithm.
Divide and Conquer:
General Method, Binary Search, Finding Maximum &
Minimum, Merge Sort, Quick Sort.
Greedy Method:
General method, Knapsack Problem, Job Sequencing with deadline, Minimum – cost Spanning trees, Single – Source Shortest Paths.
Dynamic Programming:
Introduction to Graphs, Definition types, Terms related to graph, General Method, Multistage Graphs, All pair Shortest Paths, 0/1 – knapsack, The traveling salesperson problem, Flow Shop Scheduling.
Basic traversal & Search techniques:
Search & traversal techniques for trees, Search & traversal techniques for graphs.
Backtracking:
General method, The 8- Queens Problem, Sum of subsets, Graph Coloring.
