Title      : Design and Analysis of Algorithms
Subject      : Computer Science
copyright © 2020   : uzma taj
Author      : uzma taj
Publisher      : CAMBRIDGE INSTITUTE OF TECHNOLOGY
Chapters/Pages      : 3/94
Total Price      : Rs.      : 47
 
 
To Purchase, select the individual chapter(s) or click "Select all" for the complete book.

Please scroll down to view chapter(s).
Chapters
     
Module 1 Total views (0)  
Introduction: What is an Algorithm? (T2:1.1), Algorithm Specification (T2:1.2), Analysis Framework (T1:2.1), Performance Analysis: Space complexity, Time complexity (T2:1.3). Asymptotic Notations: Big-Oh notation (O), Omega notation (Ω), Theta notation (Θ), and Little-oh notation (o), Mathematical analysis of Non-Recursive and recursive Algorithms with Examples (T1:2.2, 2.3, 2.4). ......
Pages: 44
Price: Rs 22   
 
Module 2 Total views (0)  
Divide and Conquer: General method, Binary search, Recurrence equation for divide and conquer, Finding the maximum and minimum (T2:3.1, 3.3, 3.4), Merge sort, Quick sort (T1:4.1, 4.2), Strassen’s matrix multiplication (T2:3.8), Advantages and Disadvantages of divide and conquer. Decrease and Conquer Approach: Topological Sort. (T1:5.3).
Pages: 32
Price: Rs 16   
 
Module 5 Total views (0)  
Backtracking: General method (T2:7.1), N-Queens problem (T1:12.1), Sum of subsets problem (T1:12.1), Graph coloring (T2:7.4), Hamiltonian cycles (T2:7.5). Programme and Bound: Assignment Problem, Travelling Sales Person problem (T1:12.2), 0/1 Knapsack problem (T2:8.2, T1:12.2): LC Programme and Bound solution (T2:8.2), FIFO Programme and Bound solution (T2:8.2). NP ......
Pages: 18
Price: Rs 9   
 


Copyright © 2015 JAGMIT Jamkhandi. All Rights Reserved