Summary of Volume 1

G A Vijayalakshmi Pai · 2022

Chapter 1. Introduction1.1.History of algorithms 1.2.Definition, structure and properties of algorithms 1.2.1.Definition 1.2.2.Structure and properties 1.3.Development of an algorithm 1.4.Data structures and algorithms 1.5.Data structures -definition and classification 1.5.1.Abstract data types 1.5.2.Classification 1.6.Algorithm design techniques 1.7.Organization of the book Chapter 2. Analysis of Algorithms 2.1.Efficiency of algorithms 2.2.Apriori analysis 2.3.Asymptotic notations 2.4.Time complexity of an algorithm using the O notation 2.5.Polynomial time versus exponential time algorithms 2.6.Average, best and worst case complexities

Read the paper · More papers on PaperTik