# Design and Analysis of Algorithms (Backtracking, Branch and Bound)

 Course Code : ULZ0071 Author : uLektz University : General for All University Regulation : 2017 Categories : Computer Science Format : ePUB3 (DRM Protected) Type : eBook

FREE

Description : Design and Analysis of Algorithms (Backtracking, Branch and Bound) of ULZ0071 covers the latest syllabus prescribed by General for All University for regulation 2017. Author: uLektz, Published by uLektz Learning Solutions Private Limited.

Note : No printed book. Only ebook. Access eBook using uLektz apps for Android, iOS and Windows Desktop PC.

##### Topics
###### UNIT-I: Introduction to algorithms

1.1 Introduction: Algorithm - Psuedo code for expressing algorithms - Performance Analysis-Space complexity, Time complexity

1.2 Asymptotic Notation- Big oh notation, Omega notation, Theta notation and Little oh notation

1.3 Probabilistic analysis, Amortized analysis.

###### UNIT-II: Divide and conquer algorithm

2.1 Divide and conquer: General method

2.2 Applications-Binary search, Quick sort, Merge sort

###### UNIT-III: Greedy method

3.1 Greedy method: General method

3.2 Applications-Job sequencing with deadlines, knapsack problem, spanning trees, Minimum cost spanning trees, Single source shortest path problem.

###### UNIT-IV: Dynamic Programming

4.1 Dynamic Programming: General method

4.2 Applications-Matrix chain multiplication, Optimal binary search trees, 0/1 knapsack problem, All pairs shortest path problem, Travelling sales person problem, Reliability design.

###### UNIT-V: Backtracking

5.1 Backtracking: General method

5.2 Applications-n-queen problem, sum of subsets problem, graph coloring, Hamiltonian cycles.

###### UNIT-VI: Branch and Bound

6.1 Branch and Bound: General method

6.2 Applications - Travelling sales person problem,0/1 knapsack problem

6.3 LC Branch and Bound solution - FIFO Branch and Bound solution..