DATA STRUCTURE

A data structure is a storage that is used to store and organize data. It is a way of arranging data on a computer so that it can be accessed and updated efficiently.

What is Data Structure?

A data structure is a storage that is used to store and organize data. It is a way of arranging data on a computer so that it can be accessed and updated efficiently.

A data structure is not only used for organizing the data. It is also used for processing, retrieving, and storing data. There are different basic and advanced types of data structures that are used in almost every program or software system that has been developed. So we must have good knowledge about data structures.

Classification of Data Structure: 

Syllabus Of Data Structure:-

Unit-I

Introduction to Data Structures:

• Algorithms and Flowcharts, Basics Analysis on Algorithm, Complexity of Algorithm,
  Introduction and Definition of Data Structure, Classification of Data, Arrays, Various
  types of Data Structure, Static and Dynamic Memory Allocation, Function,
  Recursion.

Arrays, Pointers and Strings:

• Introduction to Arrays, Definition, One Dimensional Array and Multidimensional
  Arrays, Pointer, Pointer to Structure, various Programs for Array and Pointer. Strings.
  Introduction to Strings, Definition, Library Functions of Strings.

Unit-II

Stacks and Queue :

• Introduction to Stack, Definition, Stack Implementation, Operations of Stack,
  Applications of Stack and Multiple Stacks. Implementation of Multiple Stack Queues,
  Introduction to Queue, Definition, Queue Implementation, Operations of Queue,
  Circular Queue, De-queue and Priority Queue.

Unit-III

Linked Lists and Trees :

• Introduction, Representation and Operations of Linked Lists, Singly Linked List,
  Doubly Linked List, Circular Linked List, And Circular Doubly Linked List.
• Trees
  Introduction to Tree, Tree Terminology Binary Tree, Binary Search Tree, Strictly
  Binary Tree, Complete Binary Tree, Tree Traversal, Threaded Binary Tree, AVL
  Tree B Tree, B+ Tree.

Unit-IV

Graphs, Searching, Sorting and Hashing Graphs :

• Introduction, Representation to Graphs, Graph Traversals Shortest Path Algorithms.

Searching and Sorting :

• Searching, Types of Searching, Sorting, Types of sorting like quick sort, bubble sort,
  merge sort, selection sort.

Hashing :

• Hash Function, Types of Hash Functions, Collision, Collision Resolution Technique
  (CRT), Perfect Hashing.