18CS42 MODULE 1 DESIGN AND ANALYSIS OF ALGORITHMS VTU NOTES
18CS42 DESIGN AND ANALYSIS OF ALGORITHMS VTU CBCS Notes Question Papers 18CS42 MODULE 1 DAA VTU NOTES by VTUguide.in.
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). Important Problem Types: Sorting, Searching, String
processing, Graph Problems, Combinatorial Problems. Fundamental Data Structures:
Stacks, Queues, Graphs, Trees, Sets and Dictionaries. (T1:1.3,1.4)