File and Data Structure

Contents

1. Introduction to Data Structure     

1.1 Introduction     

1.2 Definition of data structure 

1.3 Data structure   

1.4 Abstract data type (Pre and Post Conditions)   

1.5 Implementation of data structures  

1.6 Analysis of programs   

2. Arrays     

2.1 Array as a data structure    

2.2 ADT of an array  

2.3 Arrays in ‘C’    

2.4 Storage representation of arrays         

2.5 Address calculation                      

2.6 Application of arrays                    

2.7 Polynomial representation using arrays   

2.8 Sparse matrices  

3. Stack

3.1 Introduction                 

3.2 Definition of a stack        

3.3 Operations on a stack        

3.4 Implementation of a stack    

3.5 Declarations and functions   

3.6 Multiple stacks        

3.7 Applications of stacks 

4. Queues                 

4.1 Introduction           

4.2 Definition of a queue  

4.3 Operations on a queue  

4.4 Implementation of queues     

4.5 Types of queues  

4.6 Applications of queues

5. Linked List

5.1 Introduction     

5.2 Drawbacks of sequential storage    

5.3 Concept of a linked list     

5.4 Implementation of linked list

5.5 Operations on a list   

5.6 Other operations and applications  

5.7 Operations on circular lists 

5.8 Operations on a linear doubly linked list

5.9 Stack using linked list

5.10 Queue using a linked list    

5.11 Difference between an array and linked list    

5.12 Generalized linked list

6. Tree 

6.1 Introduction     

6.2 Tree terminology 

6.3 Representation of binary trees     

6.4 Operations on binary trees   

6.5 Threaded binary trees  

6.6 Height balanced trees  

6.7 Extended binary tree   

6.8 Applications of binary trees 

7. Sorting    

7.1 Introduction     

7.2 Types of sorting methods     

7.3 Comparison of sorting methods

8. Searching  

8.1 Introduction     

8.2 Types of searching technologies    

8.3 Hashing