Data Structure Tutorial

Programming Approach

Flow Chart

Define Data Structure

DS Problem Solving

Algorithm

DS Data Types

DS Arrays

DS Stack

DS Queue

Number System

Spare matrix

Structure

Polynomials

Application of Stack

DS Linked List

DS Functions

DS Tree

DS Graph

Searching

Exercise Searching

Sorting

Hash Table

DS Questions

Free Workshop on Course Awareness Program for BCA, MCA, IT Students, By ANKIT SIR on Date: 4thFebruary 2023, Venue: Rajouri Garden, near Ramesh Nagar Metro Station. (Topic Highlight - Computer Programming, Website Development). For Registration or any query Whatsapp no. 8287212590

Define Data Structure

Data Structure is a way of storing and organizing data in a computer so that it can be used efficiently. Some examples of Data Structures are arrays, Linked List, Stack, Queue, etc. Data Structures are widely used in almost every aspect of Computer Science i.e. Operating System, Compiler Design, Artifical intelligence, Graphics and many more.

Advantages of Data Structure

  1. Reuse
  2. Hidden
  3. Efficient
  4. Modular
Classifiction of Data Structure:

Data Structures are normally divide into two broad categories:

  1. Primitive Data Structure: These are basic structures and are directly operated by the machine instruction. The common examples are integer, float, character, and boolean etc. are usually called the simple data types or primitive data structure.
  2. Non-Primitive Data Structure: These are more sophisticated data structures. They are derived from the primitive data structure. The non-primitive data structures emphasize on structuring of a group of homogenous (same type) or heterogeneous (different type) data items. Common examples are array, string, stack, queue, list, tree and graph.