Knowledge in Data Structures & algorithms

Queue using linked list

#include<stdio.h> #include<conio.h> struct Node { int data; struct Node *next; }*front = NULL,*rear = NULL; void insert(int); void delete(); void display(); void main() { int choice, value; clrscr(); printf("\n:: Queue Implementation using Linked List ::\n"); while(1){ printf("\n****** MENU ******\n"); printf("1. Insert\n2. Delete\n3. Display\n4. Exit\n"); printf("Enter your choice: "); scanf("%d",&choice); switch(choice){ case 1: printf("Enter the value to be insert: "); scanf("%d", &value); insert(value); break; case 2: delete(); break; case 3: display(); break; case 4: exit(0); default: printf("\nWrong selection!!! Please try again!!!\n"); } } } void insert(int value) { struct Node *newNode; newNode = (struct Node*)malloc(sizeof(struct Node)); newNode->data = value; newNode -> next = NULL; if(front == NULL) front = rear = newNode; else{ rear -> next = newNode; rear = newNode; } printf("\nInsertion is Success!!!\n"); } void delete() { if(front == NULL) printf("\nQueue is Empty!!!\n"); else{ struct Node *temp = front; front = front -> next; printf("\nDeleted element: %d\n", temp->data); free(temp); } } void display() { if(front == NULL) printf("\nQueue is Empty!!!\n"); else{ struct Node *temp = front; while(temp->next != NULL){ printf("%d--->",temp->data); temp = temp -> next; } printf("%d--->NULL\n",temp->data); } }

Gantt Chart

A Gantt chart is a useful graphical tool which shows activities or tasks performed against time. It is also known as visual presentation of a project where the activities are broken down and displayed on a chart which makes it is easy to understand and interpret. A Gantt chart is a popular tool in project management. It basically drills down activities which need to be done by a fixed time period. It is commonly used for tracking project schedules. On the chart, tasks are shown on the vertical axis while the scheduled time-spend is laid out on the horizontal axis. Each task is represented by a bar that shows the time required for the project. The bar then represents or shows percentage of tasks that have been completed. It also shows dependencies, which simply means the interlinkages between various activities in the project.Understanding the interlinkage between activities is very important to monitor and Gantt charts help the project manager to do just that. It conveys the information about the completion of other activities in the project. This information is important because of the interlinkages between various activities and if one activity gets delayed it will have an impact on others. Gantt chart is a useful tool in planning and scheduling the projects. It keeps the management updated as to when the project will get completed. It also keeps the management informed about any additional resources that are required, and manage dependencies between tasks. They are commonly used in scheduling production processes, employee roster or scheduling, events scheduling, production processes, etc. Microsoft Excel can also be used to create Gantt charts apart from other independent software available in the market.  

Linked list

A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers.  In simple words, a linked list consists of nodes where each node contains a data field and a reference(link) to the next node in the list.

Quick Sort Algorithm in PPT

This is quick sort algorithm under data structures and algorithms .This is very important topic in Gate as well and is a very common algorithm.

Binary search tree

Binary search tree implementation

Normalization

This Ppts includes all the knowledge abt Normalization

Data Structures

Its a E book or total text book for the Data Structures

Data Link Layers Services

This ppt is abt the Data link layers and their seriveces

Insertion sort algorithm

 int i, key, j;    for (i = 1; i < n; i++)   {        key = arr[i];        j = i-1;           /* Move elements of arr[0..i-1], that are           greater than key, to one position ahead           of their current position */        while (j >= 0 && arr[j] > key)        {            arr[j+1] = arr[j];            j = j-1;        }        arr[j+1] = key;    } }

Data analysis

Anova test using spss software