OBJECTIVES To introduce basic concepts of algorithms • To introduce mathematical aspects and analysis of algorithms • To introduce searching and Sorting algorithms • To introduce sequential storage algorithms • Unit Marks Content Hrs. Credit No. No. W + % 20% 4 1 Concepts of Algorithms Algorithm Fundamental: Introduction Notion of Algorithm Fundamentals of – – Algorithmic Solving Important Problem types – – Fundamentals of the Analysis Framework Asymptotic – Notations and Basic Efficiency Classes. Basic Concepts of Flowchart, Algorithm. Array, Pointer, Union, Structure: Structure and Pointer, Structure and Array, Structure within Structure. 2 Mathematical Aspects and Analysis of Algorithms 20% Mathematical Analysis of Non-recursive Algorithm – Mathematical Analysis of Recursive Algorithm Example: – Fibonacci Numbers Empirical Analysis of Algorithms – – Algorithm Visualization. 3 Searching and Sorting Algorithms 30% Linear Search and Binary Search. Bubble Sort, Quick Sort, Internal Sorting Algorithms: Straight Selection Sort, Heap Sort, Simple Insertion Sort, Shell Sort External Sorting Algorithms : Merge Sort, Radix Sort. 4 Sequential Storage Algorithms 30% Data Types : Primitive and Compound Data Structure : Simple, Linear and Non Linear Implementation , Stack Application Queue Implementation, Single, Double,Circular and Priority Queue. Text / Reference Books No Book Name 1 Anany Levitin, to the Design and Analysis of Algorithm”, Pearson Education Asia,2003. “Introduction 2 T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, to Algorithms”, PHI Pvt. Ltd., 2001 “Introduction 3 Sara Baase and Allen Van Gelder, Algorithms - Introduction to Design and Analysis” Pearson “Computer Education Asia, 2003. 4 A.V.Aho, J.E. Hopcroft and J.D.Ullman, Design and Analysis Of Computer Algorithms”,Pearson Education “The Asia, 2003.
OBJECTIVES • To introduce basic concepts of algorithms • To introduce mathematical aspects and analysis of algorithms • To introduce searching and Sorting algorithms • To introduce sequential storage algorithms Unit No. No. Content Hrs. Marks W + % Credit 1 Concepts of Algorithms Algorithm Fundamental: Introduction – Notion of Algorithm – Fundamentals of Algorithmic Solving – Important Problem types – Fundamentals of the Analysis Framework – Asymptotic Notations and Basic Efficiency Classes. Basic Concepts of Flowchart, Algorithm. Array, Pointer, Union, Structure: Structure and Pointer, Structure and Array, Structure within Structure. 20% 4 2 Mathematical Aspects and Analysis of Algorithms Mathematical Analysis of Non-recursive Algorithm – Mathematical Analysis of Recursive Algorithm – Example: Fibonacci Numbers – Empirical Analysis of Algorithms – Algorithm Visualization. 20% 3 Searching and Sorting Algorithms Linear Search and Binary Search. Internal Sorting Algorithms: Bubble Sort, Quick Sort, Straight Selection Sort, Heap Sort, Simple Insertion Sort, Shell Sort External Sorting Algorithms : Merge Sort, Radix Sort. 30% 4 Sequential Storage Algorithms Data Types : Primitive and Compound Data Structure : Simple, Linear and Non Linear Implementation , Stack Application Queue Implementation, Single, Double,Circular and Priority Queue. 30% Text / Reference Books No Book Name 1 Anany Levitin, “Introduction to the Design and Analysis of Algorithm”, Pearson Education Asia,2003. 2 T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, “Introduction to Algorithms”, PHI Pvt. Ltd., 2001 3 Sara Baase and Allen Van Gelder, “Computer Algorithms - Introduction to Design and Analysis” Pearson Education Asia, 2003. 4 A.V.Aho, J.E. Hopcroft and J.D.Ullman, “The Design and Analysis Of Computer Algorithms”,Pearson Education Asia, 2003.