Introductions to Data Structure and Algorithms


What are Data Structures

Data is a collection of number of Alphabates, Digits and Special symbols.

When we combine such type of data together, it represents an information. Computer takes input in the form of row data, process it and gives predefined data as a output.

Classification of data Structures

Data Structure is divided into 2 categories :

  • Primitive Data Structure
  • Non-primitive Data Structure

  • Primitive Data Structure
The objects of primitive data type can be operated by machine level instruction.
Ex. char, int, float, pointer. 
  • Non-Primitive Data Structure
These are the data structures created from primitive data structures.
Ex. array, structure, file, union, list.
This Image shows the classification of data structures. If in some case image not appearing, you can download the word doc which represent the classification.
Classification of data structures
classification-of-data-structureDownload

Operations on Data Structure

We can perform various different operations on data structure.

  1. Searching : To find the location/position of a specific data from the given data structure.
  2. Insertion : To insert the new data in the old data structure.
  3. Deletion : To remove existing data from the data structure.
  4. Sorting : Arranging the data in some logical order .
  5. Traversing : To access each data only once.
  6. Merging : It means, combine two similar data structures together.

Algorithm

An algorithm is a finite set of instructions to solve any specific problem. These steps are performed on a data representing instance of problem.
Every algorithm gets a input and gives required output by performing sequence of operations on it.

Every algorithm has various properties such as :

  1. Input: Accept one or more input data.
  2. Output: Give desired one or more result.
  3. Finiteness: Every algorithm must terminate after finite number of steps.
  4. Definiteness: Each step should be clear and unambigous (non repeating).
  5. Effectiveness: Each step of algorithm should be written using basic instructions.

There are two different methods for designing an algorithm :

  1. Top-down approch : It is based ion decomposing a large problem into sub-problems and repeat this process till output is not generated.
    Ex. C language.
  2. Bottom-up approch : It is opposite to top-down, means different parts of problems are solved firstly using a programming language and then these parts are combine into complex problem.
    Ex. C++.

Comments

Post a Comment

Popular posts from this blog

Searching Algorithms in Data Structure

Searching is a process of retriving or locating or finding information matching with some specific value. In data structure there are two types of searching. Linear or sequencial search Binary search   Linear or Sequencial Search It is a simplest form of searching and can be applied for sequencial storage such as array, stack, queue, linked list. Algorithm Linear/Sequencial Search Step 1: Start Step 2: Set 0 to i Step 3: Read and store value to search in val Step 4: if a(i) = val, print value is found at (i+1) position and go to step 8 Step 5: Set i to i + 1 Step 6: If i is less than n then, go to Step 4 Step 7: Print element not found Step 8: Stop n - size of array a - array val - value to be searched in array Source Code #include <stdio.h> #include <conio.h> #include <stdlib.h> int main() { int n; printf("Enter the size of array : "); scanf("%d", &n); int arr[n]; for...
Read more

Sorting Algorithms in Data Structure

Sorting is a process of arranging information either in ascending or in descending order of key values. In data structures there are techniques available to sort the data. Types of sorting algorithms Bubble sort Insertion sort Selection sort Quick sort Radix sort Merge sort   1. Bubble Sort It is one of the simplest & popular sorting method. The basic idea of this sorting is that in each pass we have to compare a successive pair of element i.e. a[i] & a[i+1]. Interchange these two values, if they are not place in proper order. Place the element in it's correct position in each pass. In first pass largest element is shifted at bottom. In second pass second largest will be shifted to the second last position & so on. Thus to sort n values n-1 passes are required. Algorithm Bubble Sort Step 1: Start Step 2: Set 1 to pass Step 3: Set o to i Step 4: if a[i]> a[i+1] then, Swap a[i] & a[i+1] Step 5: Add I to i. Step 6: If i...
Read more

Circular Linked List

Image
I n a Circular Linked List the first and the last elements are adjacent. A linked list can be made circular by storing the address of the first node in the next field of the last node. In a circular linked list, last node is connected back to the first node. In some applications, it is convenient to use circular linked list. A queue data structure can be implemented using a circular linked list, with a single pointer "rear" as the front node can be accessed through the rear node. Implementation of Circular Linked List Circular Linked List Creation and Traversal Algorithm for traversing a circular list is slightly different than the same algorithm for a singly linked list because "NULL" is not encountered. Source Code (Circular Linked List Creation and Traversal) #include <stdio.h> #include <stdlib.h> struct Node { int data; struct Node *next; }; void CircularLinkedListTraversal(stru...
Read more