Here are the data Structures laboratory programs in C. IMPLEMENTATION OF LIST ADT USING LINKED LIST IMPLEMENTATION OF LIST ADT USING A...
Showing posts with label Data Structures Lab. Show all posts
Showing posts with label Data Structures Lab. Show all posts
QUICK SORT
Data Structures Lab
SOURCE CODE: “Quick.h” File: #include<stdio.h> #include<conio.h> #define cutoff (3) void swap(int *x,int *y) { int ...
HEAP SORT
Data Structures Lab
SOURCE CODE: “Heap.h” File: #include<stdio.h> #include<conio.h> #define leftchild(i) (2*i+1) void swap(int *x,int *y) ...
SEARCH TREE ADT - BINARY SEARCH TREE
Data Structures Lab
SOURCE CODE: “Tree.h” File: #include<stdio.h> #include<stdlib.h> #include<conio.h> struct node { int data; ...
APPLICATION OF STACK ADT – CONVERSION OF INFIX TO POSTFIX EXPRESSION
Data Structures Lab
SOURCE CODE: “Iexp.h” File: #include<stdio.h> #include<conio.h> #include<alloc.h> #define MAX 10 struct stack { ...
APPLICATION OF STACK ADT - EVALUATING POSTFIX EXPRESSION
Data Structures Lab
SOURCE CODE: “Pexp.h” File: #include<stdio.h> #include<alloc.h> #include<conio.h> struct node { int data; ...
APPLICATION OF STACK ADT – BALANCING PARENTHESIS
Data Structures Lab
SOURCE CODE: “Balance.h” file #include<stdio.h> #include<conio.h> #include<process.h> #include<alloc.h> #de...
CURSOR IMPLEMENTATION OF LIST ADT
Data Structures Lab
SOURCE CODE: “curslist.h” File: #include<stdio.h> #include<conio.h> #define SPACE_SIZE 10 struct Node { int data; ...
IMPLEMENTATION OF QUEUE ADT USING ARRAY
Data Structures Lab
SOURCE CODE: “qarray.h” File: #include<stdio.h> #include<conio.h> #include<alloc.h> #include<stdlib.h> ...
IMPLEMENTATION OF QUEUE
Data Structures Lab
SOURCE CODE: #include<stdio.h> #include<conio.h> #include<stdlib.h> #define size 5 struct queue { int que[size]...
IMPLEMENTATION OF STACK ADT USING ARRAY
Data Structures Lab
SOURCE CODE: “filo.h” File: # include <stdio.h> # include <conio.h> struct stack { int capacity,size,top; int*ar...
IMPLEMENTATION OF STACK ADT USING LINKED LIST
Data Structures Lab
SPURCE CODE: “Lstack.h” File: #include<stdio.h> #include<conio.h> struct node { int data; struct node *next; };...
IMPLEMENTATION OF LIST ADT USING ARRAY
Data Structures Lab
SOURCE CODE: “Larray.h” File: #include<stdio.h> #include<alloc.h> #include<conio.h> struct list { int capacity;...
IMPLEMENTATION OF LIST ADT USING LINKED LIST
Data Structures Lab
SOURCE CODE: "Llist.h" File: #include<stdio.h> #include<conio.h> #include<alloc.h> struct Node { int dat...
Subscribe to:
Posts (Atom)