Bhavana S. Karmore, Vishwajit K. Barbudhe, Shraddha N. Zanjat

Design and Analysis of Algorithms

• Broschiertes Buch

Produktbeschreibung

The book contains: Concept Introduction: What is an Algorithm? (T2:1.1), Algorithm Specification (T2:1.2), Analysis Framework (T1:2.1), Performance Analysis: Space complexity, Timecomplexity (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). Important Problem Types: Sorting, Searching, String processing, Graph Problems, Combinatorial Problems. Fundamental Data Structures: Stacks, Queues, Graphs, Trees, Sets and Dictionaries. 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.

Produktdetails

• Verlag: LAP Lambert Academic Publishing
• Seitenzahl: 88
• Erscheinungstermin: 1. März 2020
• Englisch
• Abmessung: 220mm x 150mm x 6mm
• Gewicht: 149g
• ISBN-13: 9786200656414
• ISBN-10: 620065641X
• Artikelnr.: 58924722

Autorenporträt

Dr. Bhavana S. Karmore is working as Assistant Professor and Head of Department at BCA and MCA Department of G. H. Raisoni University, Amravati, for U. G. and P. G. Department. Total years of experience 15+. She published more than 20 papers in international journals. She works as International Expert at international conferences.