Book Details

Design and Analysis of Algorithms

Design and Analysis of Algorithms

Published by uLektz

Course Code:ULZ0458

Author:uLektz

University: General for All University

Regulation:2018

Categories:Computer Science

Format : ico_bookePUB3 (DRM Protected)

Type :eBook

Rs.200 Rs.30 Rs.85% off

Preview Buy Now

Description :Design and Analysis of Algorithms of ULZ0458 covers the latest syllabus prescribed by General for All University for regulation 2018. 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 ANAYLYSIS OF ALGORITHM

1.1 Introduction-Algorithm definition - Algorithm Specification

1.2 Performance Analysis, Space complexity, Time complexity

1.3 Randomized Algorithms

1.4 Divide and conquer - General method, applications

1.5 Binary search

1.6 Merge sort

1.7 Quick sort

1.8 Strassen’s Matrix Multiplication

UNIT II BACKTRACKING

2.1 Disjoint set operations - Union and find algorithms

2.2 AND/OR graphs

2.3 Connected Components and Spanning trees, Bi-connected components

2.4 Backtracking-General method - Applications

2.5 The 8-queen problem

2.6 Sum of subsets problem

2.7 Graph coloring

2.8 Hamiltonian cycles

UNIT III GREEDY METHOD

3.1 Greedy method- General method, applications

3.2 Knapsack problem

3.3 Job sequencing with deadlines

3.4 Minimum cost spanning trees

3.5 Single source shortest path problem

UNIT IV DYNAMIC PROGRAMMING

4.1 Dynamic Programming- General Method, applications

4.2 Chained matrix multiplication

4.3 All pairs shortest path problem

4.4 Optimal binary search trees

4.5 0/1 knapsack problem

4.6 Reliability design

4.7 Traveling sales person problem

UNIT V BRANCH AND BOUND

5.1 Branch and Bound-General Method, applications

5.2 0/1 Knapsack problem, LC Branch and Bound solution, FIFO Branch and Bound solution

5.3 Traveling sales person problem

5.4 NP-Hard and NP-Complete problems: Basic concepts-Non-deterministic algorithms

5.5 Cook’s theorem

loading