Transcription of LECTURE NOTES ON DATA STRUCTURES USING C
{{id}} {{{paragraph}}}
LECTURE NOTES ON DATA STRUCTURES USING C Revision 1 December, 2014 L. V. NARASIMHA PRASAD Professor Department of Computer Science and Engineering E. KRISHNA RAO PATRO Associate Professor Department of Computer Science and Engineering INSTITUTE OF AERONAUTICAL ENGINEERING DUNDIGAL 500 043, HYDERABAD 2014-2015 CONTENTS CHAPTER 1 BASIC CONCEPTS Introduction to Data STRUCTURES Data STRUCTURES : organizations of data Abstract Data Type (ADT) Selecting a data structure to match the operation Algorithm Practical Algorithm design issues Performance of a program Classification of Algorithms Complexity of Algorithms Rate of Growth Analyzing Algorithms Exercises Multiple Choice Questions CHAPTER 2 RECURSION Introduction to Recursion Differences between recursion and iteration Factorial of a given number The Towers of Hanoi Fibonacci Sequence Problem Program USING recursion to calculate the NCR of a given number Program to calculate the least common multiple of a given number Program to calculate the greatest common divisor Exercises Multiple Choice Questions CHAPTER 3 LINKED LISTS Linked List Concepts Types of Linked Lists Single Linked List Source Code for the Implementation of Single Linked List USING a header node Array based linked lists Double Linked List A Complete Source Co
LECTURE NOTES ON DATA STRUCTURES USING C Revision 4.0 1 December, 2014 L. V. NARASIMHA PRASAD ... Minimum Spanning Tree 6.3.1. Kruskal’s Algorithm 6.3.2. Prim’s Algorithm 6.4. Reachability Matrix ... Merging two heap trees 7.6.5. Application of heap tree 7.7. Heap Sort 7.7.1. Program for Heap Sort
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}