×
The best revenge is massive SUCCESS

# Note for Data Structure using C - DS By RAVI TEJA REDDY

• Data Structure using C - DS
• Note
• Jawaharlal Nehru Technological University Anantapur (JNTU) College of Engineering (CEP), Pulivendula, Pulivendula, Andhra Pradesh, India - JNTUACEP
• Computer Science Engineering
• 21 Topics
• 1351 Views
Ravi Teja Reddy
0 User(s)

#### Text from page-1

LECTURE NOTES ON DATA STRUCTURES USING C Revision 4.0 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

#### Text from page-3

CHAPTER 4 STACK AND QUEUE 4.1. Stack 4.1.1. Representation of Stack 4.1.2. Program to demonstrate a stack, using array 4.1.3. Program to demonstrate a stack, using linked list 4.2. Algebraic Expressions 4.3. Converting expressions using Stack 4.3.1. Conversion from infix to postfix 4.3.2. Program to convert an infix to postfix expression 4.3.3. Conversion from infix to prefix 4.3.4. Program to convert an infix to prefix expression 4.3.5. Conversion from postfix to infix 4.3.6. Program to convert postfix to infix expression 4.3.7. Conversion from postfix to prefix 4.3.8. Program to convert postfix to prefix expression 4.3.9. Conversion from prefix to infix 4.3.10. Program to convert prefix to infix expression 4.3.11. Conversion from prefix to postfix 4.3.12. Program to convert prefix to postfix expression 4.4. Evaluation of postfix expression 4.5. Applications of stacks 4.6. Queue 4.6.1. Representation of Queue 4.6.2. Program to demonstrate a Queue using array 4.6.3. Program to demonstrate a Queue using linked list 4.7. Applications of Queue 4.8. Circular Queue 4.8.1. Representation of Circular Queue 4.9. Deque 4.10. Priority Queue Exercises Multiple Choice Questions CHAPTER 5 BINARY TREES 5.1. 5.2. 5.3. 5.4. 5.5. 5.6. 5.7. 5.8. 5.9. Trees Binary Tree Binary Tree Traversal Techniques 5.3.1. Recursive Traversal Algorithms 5.3.2. Building Binary Tree from Traversal Pairs 5.3.3. Binary Tree Creation and Traversal Using Arrays 5.3.4. Binary Tree Creation and Traversal Using Pointers 5.3.5. Non Recursive Traversal Algorithms Expression Trees 5.4.1. Converting expressions with expression trees Threaded Binary Tree Binary Search Tree General Trees (m-ary tree) 5.7.1. Converting a m-ary tree (general tree) to a binary tree Search and Traversal Techniques for m-ary trees 5.8.1. Depth first search 5.8.2. Breadth first search Sparse Matrices Exercises Multiple Choice Questions II

#### Text from page-4

CHAPTER 6 GRAPHS 6.1. 6.2. 6.3. 6.4. 6.5. Introduction to Graphs Representation of Graphs Minimum Spanning Tree 6.3.1. Kruskal’s Algorithm 6.3.2. Prim’s Algorithm Reachability Matrix Traversing a Graph 6.5.1. Breadth first search and traversal 6.5.2. Depth first search and traversal Exercises Multiple Choice Questions CHAPTER 7 SEARCHING AND SORTING 7.1. 7.2. 7.3. 7.4. 7.5. 7.6. 7.7. 7.8. Linear Search 7.1.1. A non-recursive program for Linear Search 7.1.1. A Recursive program for linear search Binary Search 7.1.2. A non-recursive program for binary search 7.1.3. A recursive program for binary search Bubble Sort 7.3.1. Program for Bubble Sort Selection Sort 7.4.1 Non-recursive Program for selection sort 7.4.2. Recursive Program for selection sort Quick Sort 7.5.1. Recursive program for Quick Sort Priority Queue and Heap and Heap Sort 7.6.2. Max and Min Heap data structures 7.6.2. Representation of Heap Tree 7.6.3. Operations on heap tree 7.6.4. Merging two heap trees 7.6.5. Application of heap tree Heap Sort 7.7.1. Program for Heap Sort Priority queue implementation using heap tree Exercises Multiple Choice Questions References and Selected Readings Index III