×
Nothing in the world is more common than unsuccessful people with talent.
--Your friends at LectureNotes

# Note for Data Structure using C - DS by Mohit Kaushik

• Data Structure using C - DS
• Note
• A.I.J.H.M COLLEGE - Jat
• Computer Science Engineering
• B.Tech
• 17 Topics
• 303 Views
• Uploaded 7 months ago
Mohit Kaushik
0 User(s)

#### Text from page-1

All India Jat Heroes Memorial College Rohtak CONTENTS UNIT-1 INTRODUCTION 1.1 BASIC TERMINOLOGY: ELEMENTARY DATA ORGANIZATION 1.1.1 Data and Data Item 1.1.2 Data Type 1.1.3 Variable 1.1.4 Record 1.1.5 Program 1.1.6 Entity 1.1.7 Entity Set 1.1.8 Field 1.1.9 File 1.1.10 Key 1.2 ALGORITHM 1.3 EFFICIENCY OF AN ALGORITHM 1.4 TIME AND SPACE COMPLEXITY 1.5 ASYMPTOTIC NOTATIONS 1.5.1 Asymptotic 1.5.2 Asymptotic Notations 1.5.2.1 Big-Oh Notation (O) 1.5.2.2 Big-Omega Notation (Ω) 1.5.2.3 Big-Theta Notation (Θ) 1.5.3 Time Space Trade-off 1.6 ABSTRACT DATA TYPE 1.7 DATA STRUCTURE 1.7.1 Need of data structure 1.7.2 Selecting a data structure 1.7.3 Type of data structure 1.7.3.1 Static data structure 1.7.3.2 Dynamic data structure 1.7.3.3 Linear Data Structure 1.7.3.4 Non-linear Data Structure 1.8 A BRIEF DESCRIPTION OF DATA STRUCTURES 1.8.1 Array 1.8.2 Linked List 1.8.3 Tree 1.8.4 Graph 1.8.5 Queue 1.8.6 Stack 1.9 DATA STRUCTURES OPERATIONS 1.10 ARRAYS: DEFINITION 1.10.1 Representation of One-Dimensional Array 1

#### Text from page-3

All India Jat Heroes Memorial College Rohtak 3.8 THREADED BINARY TREE 3.9 HUFFMAN CODE UNIT-4 GRAPHS 4.1 INTRODUCTION 4.2 TERMINOLOGY 4.3 GRAPH REPRESENTATIONS 4.3.1 Sequential representation of graphs 4.3.2 Linked List representation of graphs 4.4 GRAPH TRAVERSAL 4.5 CONNECTED COMPONENT 4.6 SPANNING TREE 4.6.1 Kruskal’s Algorithm 4.6.2Prim’s Algorithm 4.7 TRANSITIVE CLOSURE AND SHORTEST PATH ALGORITHM 4.6.1 Dijikstra’s Algorithm 4.6.2Warshall’s Algorithm 4.8 INTRODUCTION TO ACTIVITY NETWORKS UNIT-5 SEARCHING 5.1 SEARCHING 5.1.1 Linear Search or Sequential Search 5.1.2 Binary Search 5.2 INTRODUCTION TO SORTING 5.3 TYPES OF SORTING 5.3.1 Insertion sort 5.3.2 Selection Sort 5.3.3 Bubble Sort 5.3.4 Quick Sort 5.3.5 Merge Sort 5.3.6 Heap Sort 5.3.7 Radix Sort 5.4 PRACTICAL CONSIDERATION FOR INTERNAL SORTING 5.5 SEARCH TREES 5.5.1 Binary Search Trees 5.5.2 AVL Trees 5.5.3 M-WAY Search Trees 5.5.4 B Trees 5.5.5 B+ Trees 5.6 HASHING 5.6.1 Hash Function 5.6.2 Collision Resolution Techniques 5.7 STORAGE MANGMENT 5.7.1 Garbage Collection 5.7.2Compaction 3