• Skip to primary navigation
  • Skip to main content
  • Skip to primary sidebar
  • Skip to footer
projectsgeek

ProjectsGeek

Download Mini projects with Source Code, Java projects with Source Codes

  • Home
  • Java Projects
  • C++ Projects
  • VB Projects
  • PHP projects
  • .Net Projects
  • NodeJs Projects
  • Android Projects
    • Project Ideas
      • Final Year Project Ideas
      • JSP Projects
  • Assignment Codes
    • Fundamentals of Programming Language
    • Software Design Laboratory
    • Data Structure and Files Lab
    • Computer Graphics Lab
    • Object Oriented Programming Lab
    • Assembly Codes
  • School Projects
  • Forum

Datastructure Assignments

Data Structure and Files Program Codes

May 2, 2012 by ProjectsGeek 2 Comments

Data Structure and Files Program Codes 

Download Data Structure and Files Program Codes from these Links. All these Data Structure and Files Program Codes are working and tested. If you find any of these codes not working Please comment on the Page, So that it can be corrected.

Download Data Structure and Files Program Codes

Program for Matrix operations with pointers. Matrix operations with pointers 
Program for Hash Table Implementation Hash Table Implementation 
 Program for  Operations on File Operations on File 
Program for Hoffman’s Code Using C Hoffman’s Code 
Program for Dijkstra Algorithm in C Dijkstra Algorithm 
Program for Breadth and Depth First Search  Breadth and Depth First Search 
Program for Traversal of BFS and DFS Traversal of BFS and DFS 
Program for Expression Tree in C Expression Tree 
Program for Operations on Queue Operations on Queue 
 Program for Circular Link List Circular Link List 

Data Structure and Files Program Codes Laboratory Syllabus

Queues

Concept of queues as ADT, Implementation of linear and circular queue using linked and Concept of multi queues, de queue and priority queue. Application of queues. Sequential organization.

Stack

Concept of stack as ADT, Implementation of stacks using linked and sequential organization ,Importance of stack in recursion, Importance of implicit and explicit stack. Concept of multi stacks, Application of stacks.

File organization

Hashing function and it’s characteristics,Concept of sequential, C Files and command line argument,simple Index file and direct access file , Primitive operations and implementation in C. Sequential file organization, direct file organization,Processing of sequential, Index-sequential and direct files. Hashing,Concept of collision resolution, linear probing, index sequential file organization and their implementation rehashing ,chaining with & without replacement.

Graphs

Graph as an ADT, Depth First Search and Breadth First Search. shortest path- Dijkstra’s algorithm Application of these algorithms and Algorithms for minimal spanning tree Representation of graphs using adjacency matrix, adjacency list, Prim’s and Kruskal’s .

Tree

Difference in linear and non-linear data structure, Trees and binary trees-concept and terminology.binary tree as an ADT. Algorithm for tree traversals (recursive and non recursive). Threaded binary tree as an ADT. Pre order, In order traversals of in order threaded binary search tree. Conversion of general tree to binary tree. Binary search trees, Concept of threaded binary tree.

 

Symbol Tables and Dynamic Trees

Basic concepts of hash tables, hash function, hashing methods, collision resolution, bucket hashing.

AVL Trees, Heap data structure its application in heap sort, Notion of Symbol Table,OBST, Huffman’s algorithm,

Other Projects to Try:

  1. BFS AND DFS Algorithm using C Language
  2. Object Oriented Programming Lab programs Codes
  3. Kruskal’s Algorithm , Prims Algorithm
  4. SE(IT) FDS (Fundamentals of Data structure) Practicals or Assignments
  5. To Implement a Program Retrieval of Documents using Inverted Files

Filed Under: Datastructure and Files Tagged With: Datastructure Assignments

SE(IT) FDS (Fundamentals of Data structure) Practicals or Assignments

May 1, 2012 by ProjectsGeek Leave a Comment

SE(IT) FDS (Fundamentals of Data structure) Practicals or Assignments
Below is the list of all Practicals of SE-IT FDS subject with Source code . Fundamentals of Data structure subjects is one of the compulsory subject in SE-IT semester -1 under Pune University and Mumbai University .
 
PROGRAM TO PERFORM VARIOUS OPERATIONS ON SETS
Program Code
PROGRAM TO PERFORM VARIOUS OPERATIONS ON STRINGS
Program Code
Write a program to perform VARIOUS OPERATION IN SIMPLE MATRIX
Program Code
Database in C
Program Code
Write a program to perform Double Link List
Program Code
Write a program to perform Single Link List
Program Code
Write a program to perform Sparse Matrix Operations  in C
Program Code
Program for Mobile user information
Program Code
Program for Operations on a database without using pointers
Program Code
Write a program to perform String operationswith pointers
Program Code
Write a program to perform Set operations – Union,Difference
Intersection ,Symmetric Difference etc.
Program Code
Write a program to perform various string operations such as Copy, Length, Reversing, Palindrome, Concatenation.
Program Code
Write a program to perform operations on matrices like addition,saddle point, magic square ,inverse & transpose .
Program Code

 

Other Projects to Try:

  1. Operations on matrices like addition, multiplication, saddle point, magic square ,inverse & transpose
  2. Data Structure and Files Program Codes
  3. Fundamentals of Programming Languages Codes
  4. Software Design Laboratory Assignments
  5. Software Development Tools Lab TE(Sem-II) practical Assignments

Filed Under: Fundamentals of Datastructure Tagged With: Datastructure Assignments

Operations on matrices like addition, multiplication, saddle point, magic square ,inverse & transpose

September 9, 2011 by ProjectsGeek Leave a Comment

Write a program to perform operations on matrices like addition, multiplication, saddle point, magic square ,inverse & transpose etc using functions & pointers. 


#include
#include
#include
#include void main()
{
int m1[30][30],m2[30][30],m3[30][30]={0};
int i,j,x,k,r1,r2,c1,c2,n,ch,sum=0;
char wish,y;
clrscr();
printf(“enter no of row for 1st matrix”);
scanf(“%d”,&r1);
printf(“enter no of col for 1st matrix”);
scanf(“%d”,&c1);
for(i=0;i<r1;i++)
for(j=0;j<c1;j++)
{
printf(“\n\t\t enter a[%d][%d]:”,i,j);
scanf(“%d”,&m1[i][j]);
}
printf(“enter no of row for 2nd matrix”);
scanf(“%d”,&r2);
printf(“enter no of col for 2nd matrix”);
scanf(“%d”,&c2);
for(i=0;i<r2;i++)
for(j=0;j<c2;j++)
{
printf(“\n\t\t enter a[%d][%d]:”,i,j);
scanf(“%d”,&m2[i][j]);
}
menu:
printf(“\n for sum of matrix press 1”);
printf(“\n for mutiplication of matrix press 2”);
printf(“\n for transpose of 1st matrix  press 3”);
printf(“\n for cheaking symatericness of 1st matrix  press 4”);
printf(“\n for cheaking sqew symatry  matrix press 5\n”);
scanf(“%d”,&ch);
switch(ch)
{
case 1://addition
if((r1==r2)&&(c1==c2))
for(i=0;i<r1;i++)
{
for(j=0;j<c1;j++)
m3[i][j]=m1[i][j]+m2[i][j];
}
else
{
exit(0);
}
for(i=0;i<r1;i++)
{
printf(“\n”);
for(j=0;j<c1;j++)
printf(“\t\t%d”,m3[i][j]);
}
break;
case 2://multiplication
sum=0;
if(c1==r2)
{
for(i=0;i<r1;i++)
{
printf(“\n”);
for(j=0;j<c2;j++)
{
for(k=0;k<c1;k++)
{
sum+=(m1[i][k]*m2[k][j]);
}
printf(“\t\t%d”,sum);
sum=0;
}
}
}
else
exit(0);
break;
case 3:
for(i=0;i<r1;i++)
{
for(j=0;j<c1;j++)
{
m3[j][i]=m1[i][j] ;
}
}
for(i=0;i<r1;i++)
{
for(j=0;j<c1;j++)
{
printf(“\t\t%d”,m3[i][j]);
}
printf(“\n”);
}
break;
case 4:
/*int flag=0;
for(i=0;i<r1;i++)
{
for(j=0;j<c1;j++)
m3[j][i]=m1[i][j];
}
for(i=0;i<r1;i++)
{
for(j=0;j<c1;j++)
{
if(m3[i][j]==m1[i][j])
flag++;
}
}
if(flag==r1*c1)
printf(” 1st matrix  is symatric”);
else
printf(” 1st matrix  is not symatric”);*/
int flag=1;
for(i=0;i<r1;i++)
{
for(j=i+1;j<c1;j++)
{
if(m1[i][j]!=m1[j][i])
{
flag=0;
}
}
}
if(flag==1)
printf(” 1st matrix  is symatric”);
else
printf(” 1st matrix  is not symatric”);
break;
case 5://skew symatric
int fl=0;
for(i=0;i<r1;i++)
{
for(j=0;j<c1;j++)
m3[j][i]=m1[i][j];
}
for(i=0;i<r1;i++)
{
for(j=0;j<c1;j++)
{
if(m3[i][j]==-m1[i][j])
fl++;
}
}
if(fl==r1*c1)
printf(” 1st matrix  is skew symatric”);
else
printf(” 1st matrix  is not  skew symatric”);
}
getch();
}//prg terminates

 

Other Projects to Try:

  1. Matrix Operations with Pointers
  2. Set operations – Union, Intersection, Difference, Symmetric Difference using C
  3. Matrix Operations in C Language
  4. Sparse Matrix Operations Code using C Langauge
  5. Multiply Two 8 Bit Numbers Successive Addition Method

Filed Under: Fundamentals of Datastructure Tagged With: Datastructure Assignments

string operations such as Copy, Length, Reversing, Palindrome, Concatenation

September 9, 2011 by ProjectsGeek Leave a Comment

Write a program to perform various string operations such as Copy, Length, Reversing, Palindrome, Concatenation
#include
#include
#include
void main()
{
int  no,m,ch ,i,j,n,k,flag=0;
char str[20],str2[20],str3[20],str4[20];
char wish;
clrscr();
do
{
menu:
printf(“\n1.length of the string.”);
printf(“\n2.copying string another.”);
printf(“\n3.concatination of two string”);
printf(“\n4.reversing the string”);
printf(“\n5.checking palindrome or not.”);
printf(“\n6.checking sub-string in the string.” );
printf(“\nEnter the choice:”);
scanf(“%d”,&ch);
switch(ch)
{
case 1:
printf(“Enter the string: “);
flushall();
gets(str);
for(i=1;str[i]!=’\0′;i++); //to find the length of the string
printf(“the length of the string is:%d “,i);
break;
case 2:
printf(“Enter the string: “);
flushall();
gets(str);
for(i=0;str[i]!=’\0′;i++)//TO COPY A STRING IN OTHER
{
str2[i]=str[i];
}
str2[i]=’\0′;
printf(“\n the copied string is: “);
puts(str2);
break;
case 3:
printf(“Enter the string: “);
flushall();
gets(str);
printf(“\n Enter the second string”);
flushall();
gets(str2);
i=0;
while(str[i]!=’\0′)
i++;
for(j=0;str2[j]!=’\0′;j++,i++)//TO CONCATINATE TWO STRING
str[i]=str2[j];
str[i]=’\0′;
printf(“\nthe concatinated string is: “);
puts(str);
break;
case 4:
printf(“Enter the string: “);
flushall();
gets(str);
i=0;
while(str[i]!=’\0′)
i++;
i–;
for(j=0;str[j]!=’\0′,i>=0;j++,i–)//TO REVERSE STRING
str2[j]=str[i];
str2[j]=’\0′;
printf(“\n the reverse string is: “);
puts(str2);
break;
case 5:
printf(“Enter the string: “);
flushall();
gets(str);
i=0;
while(str[i]!=’\0′)
i++;
i–;
flag=1;
for(j=0;i>j;j++,i–)
{ 

if(str[i]!=str[j])
{
flag=0;
break;
}
}
if(flag==1)
printf(“\nthe string is palindrom.”);
else
printf(“\nthe string is not palindrom.”);
break;
case 6:
printf(“Enter the string: “);
flushall();
gets(str);
printf(“\nEnter the second string: “);  //TO FIND WETHER SUBSTRING EXISTS OR NOT
gets(str4);
for(m=0;str[m]!=’\0′;m++);
for(k=0;k<=m-1;k++)
{
for(j=0;str4[j]!=’\0′;j++)
{
if(str[k+j]!=str4[j])
{
flag=0;
break;
}
}
if(str4[j]==’\0′)
{
flag=1;break;}
}
if(flag==1)
printf(“\nsubstring found at position:%d “,j+k);
else
printf(“\n substring donot exists”);
break;
default:
printf(“\n wrong choice!!!!”);
break;
}
printf(“\nwant to continue(y/n)”);
scanf(“%c”,&wish);
}
while(wish!=’n’);
getch();
}

Other Projects to Try:

  1. Set operations – Union, Intersection, Difference, Symmetric Difference using C
  2. String Operations with Pointers
  3. String Operations in C Program
  4. Factorial,Greatest Number,String Palindrome Shell code
  5. String Operations in C Language

Filed Under: Fundamentals of Datastructure Tagged With: Datastructure Assignments

Set operations – Union, Intersection, Difference, Symmetric Difference using C

September 9, 2011 by ProjectsGeek Leave a Comment

Write a program to perform Set operations – Union, Intersection, Difference,
Symmetric Difference etc.
#include
#include
#include void main()
{
int i,j,k,p,ch,n1,n2,set1[10],set2[10], set3[20],flag;
char wish;
clrscr();
do
{
printf(“press 1 for union”);
printf(“\npress 2 for intersection”);
printf(“\npress 3 for subtraction”);
printf(“\n enter ur choice”);
scanf(“%d”,&ch);
switch(ch)
{
case 1://for union
printf(“\nenter the size of set1\n”);
scanf(“%d”,&n1);
printf(“enter the element of set1\n”);
for(i=0;i<n1;i++)
scanf(“%d”,&set1[i]);
printf(“enter the size of set2\n”);
scanf(“%d”,&n2);
printf(“enter the elements of set2\n”);
for(i=0;i<n2;i++)
scanf(“%d”,&set2[i]);
k=0;
for(i=0;i<n1;i++)
{
set3[k]=set1[i];
k++;
}
for(i=0;i<n2;i++)
{
flag=1;
for(j=0;j<n1;j++)
{
if(set2[i]==set1[j])
{
flag=0;
break;
}
}
if(flag==1)
{
set3[k]=set2[i];
k++;
}
}
p=k;
for(k=0;k <p;k++)
 

{
printf(” %d”,set3[k]);
} 

break;
case 2: //for intersection
printf(“enter the size of sets1”);
scanf(“%d”,&n1);
printf(“enter the element of set1”);
for(i=0;i<n1;i++)
scanf(“%d”,&set1[i]);
printf(“enter the size of sets2”);
scanf(“%d”,&n2);
printf(“enter the elements of set2”);
for(i=0;i<n2;i++)
scanf(“%d”,&set2[i]);
k=0;
for(i=0;i<n2;i++)
{
flag=1;
for(j=0;j<n1;j++)
{
if(set2[i]==set1[j])
{
flag=0;
break;
}
}
if(flag==0)
{
set3[k]=set2[i];
k++;
}
}
p=k;
for(k=0;k <p;k++)

{
printf(” %d”,set3[k]); 

}
break;
case 3://for subtraction
printf(“enter the size of sets1”);
scanf(“%d”,&n1);
printf(“enter the element of set1”);
for(i=0;i<n1;i++)
scanf(“%d”,&set1[i]);
printf(“enter the size of sets2”);
scanf(“%d”,&n2);
printf(“enter the elements of set2”);
for(i=0;i<n2;i++)
scanf(“%d”,&set2[i]);
k=0;
for(i=0;i<n1;i++)
{
flag=1;
for(j=0;j<n2;j++)
{
if(set1[i]==set2[j])
{
flag=0;
break;
}
}
if(flag==1)
{
set3[k]=set1[i];
k++;
}
}
p=k;
for(k=0;k <p;k++)

{
printf(” %d”,set3[k]); 

}
break;

}

printf(“\n want to continue: “);
flushall();
scanf(“%c”,&wish);
}
while(wish!=’n’);
} //prg terminates

Other Projects to Try:

  1. Operations on matrices like addition, multiplication, saddle point, magic square ,inverse & transpose
  2. string operations such as Copy, Length, Reversing, Palindrome, Concatenation
  3. Bitwise Operations using C++
  4. Matrix Operations with Pointers
  5. String Operations with Pointers

Filed Under: Fundamentals of Datastructure Tagged With: Datastructure Assignments

String Operations with Pointers

June 26, 2011 by ProjectsGeek Leave a Comment

String operations with pointers

Program showing various operations on string(functions implemented
with pointers).
functions implemented:
(1) Reversing a string
(2) Palindrome
(3) Copy
(4) String comparison
(5) Searching a string(substring)

Source Code

 #include  
 #include  
 #include  
 #include  
 /*function prototypes*/  
 void reverse(char *a);  
 int palindrome(char *a);  
 void copy(char *b,char *a);  
 int compare(char *a,char *b);  
 void search(char *a,char *b);  
 void main()  
 { char a[100],b[100];  
 int result,op;  
 clrscr();  
 do  
 { /* display the menu */  
 printf("\n1)Reverse the Given String");  
 printf("\n2)Check for palindrome");  
 printf("\n3)Copy");  
 printf("\n4)String Comparison");  
 printf("\n5)String Searching(substring)");  
 printf("\n6)Quit");  
 printf("\n\nEnter Your Choice:");  
 scanf("%d",&op);  
 flushall();  
 switch(op)  
 {  
 case 1: printf("\n Enter a String:");  
 gets(a);  
 reverse(a);  
 printf("\n Result=%s",a);  
 printf("\n\n press a Character !!!!!!");  
 getch();  
 break;  
 case 2: printf("\n Enter a String:");  
 gets(a);  
 result=palindrome(a);  
 if(result==0)  
 printf("\nNot a palindrome");  
 else  
 printf("\nA palindrome");  
 printf("\n\n press a Character !!!!!!");  
 getch();  
 break;  
 case 3: printf("\n Enter a String:");  
 gets(a);  
 copy(b,a);  
 printf("\nResult=%s",b);  
 printf("\n\n press a Character !!!!!!");  
 getch();  
 break;  
 case 4: printf("\n Enter 1st string:");  
 gets(a);  
 printf("\n Enter 2nd string:");  
 gets(b);  
 result=compare(a,b);  
 if(result==0)  
 printf("\nboth are same");  
 else  
 if(result>0)  
 printf("\n1st>2nd");  
 else  
 printf("\n1st<2nd");  
 printf("\n\n press a Character !!!!!!");  
 getch();  
 break;  
 case 5: printf("\n Enter 1st string:");  
 gets(a);  
 printf("\n Enter 2nd string:");  
 gets(b);  
 search(a,b);  
 printf("\n\n press a Character !!!!!!");  
 getch();break;  
 }  
 }while(op!=6);  
 }  
 void reverse(char *a)  
 { char *p,*q;  
 char temp;  
 /* Algorithm used is an inplace Algorithm  
 1. q is postioned on the last character  
 2. p is postioned on the first character  
 3. *p is interchanged with *q  
 4. p is increased by 1 and q is decremented by 1  
 5. if p"""  
 */  
 p=q=a;  
 while(*q!='\0')  
 q++;  
 /* q is on the null character*/  
 q--;  
 while(p /* Algorith used  
 1. q is positioned on the last character  
 2. p is positioned on the first character  
 3. if *p != *q then it is not a palindrome,return(0)  
 4. p is increased by 1 and q is decremented by 1  
 5. if p"""  
 6. string is a palindrome , return(1)  
 */  
 p=q=a;  
 while(*q!='\0')  
 q++;  
 /* q is on the null character*/  
 q--;/*q is on the last character*/  
 while(p /* Algorithm  
 1.both the strings are compared,character by character  
 from the beginning  
 2.on first point of mismatch:  
 a.if(*a>*b) then a>b  
 b.if(*a  
 3. if both the strings end together then they are eqaul  
 */  
 while(*a!='\0')  
 {  
 if(*a > *b)  
 return(1);  
 if(*a < *b)  
 return(-1);  
 a++;b++;  
 }  
 return(0);  
 }  
 void search(char *a ,char *b)  
 { int lena,lenb;  
 char *i,*j,*k;  
 /*Algorithm  
 1. lenb=length of string b[],lena=length of a[]  
 string a[] is scanned using the pointer i from location  
 0 to length of a[]-lenb+1  
 2. string b[] is matched in string a[] from the position i  
 */  
 for(lena=0;*(a+lena)!='\0';lena++)  
 ;  
 for(lenb=0;*(b+lenb)!='\0';lenb++)  
 ;  
 /* searching */  
 for(i=a;i<=a+lena-lenb+1;i++)  
 { k=i;  
 for(j=b;*k==*j&& *j!='\0';j++,k++)  
 ;  
 if(*j=='\0')  
 printf("\nstring found at location:%d",i-a+1);  
 }  
 }  
 ""  

String operations with pointers Output

1)Reverse the Given String
2)Check for palindrome
3)Copy
4)String Comparison
5)String Searching(substring)
6)Quit

Enter Your Choice:1

Enter a String:India

Result=aidnI

press a Character !!!!!!
1)Reverse the Given String
2)Check for palindrome
3)Copy
4)String Comparison
5)String Searching(substring)
6)Quit

Enter Your Choice:2

Enter a String:India

Not a palindrome

press a Character !!!!!!
1)Reverse the Given String
2)Check for palindrome
3)Copy
4)String Comparison
5)String Searching(substring)
6)Quit

Enter Your Choice:2

Enter a String:madam

A palindrome

press a Character !!!!!!

1)Reverse the Given String
2)Check for palindrome
3)Copy
4)String Comparison
5)String Searching(substring)
6)Quit

Enter Your Choice:3

Enter a String:Asia

Result=Asia

press a Character !!!!!!
1)Reverse the Given String
2)Check for palindrome
3)Copy
4)String Comparison
5)String Searching(substring)
6)Quit

Enter Your Choice:4

Enter 1st string:India

Enter 2nd string:Asia

1st>2nd

press a Character !!!!!!
1)Reverse the Given String
2)Check for palindrome
3)Copy
4)String Comparison
5)String Searching(substring)
6)Quit

Enter Your Choice:5

Enter 1st string:Pacific

Enter 2nd string:c

string found at location:3
string found at location:7

press a Character !!!!!!
1)Reverse the Given String
2)Check for palindrome
3)Copy
4)String Comparison
5)String Searching(substring)
6)Quit

Enter Your Choice:6

Other Projects to Try:

  1. Database Operations without pointers source code
  2. String Operations in C Program
  3. Matrix Operations with Pointers
  4. string operations such as Copy, Length, Reversing, Palindrome, Concatenation
  5. String Operations in C Language

Filed Under: Fundamentals of Datastructure Tagged With: Datastructure Assignments

  • Page 1
  • Page 2
  • Page 3
  • Interim pages omitted …
  • Page 5
  • Go to Next Page »

Primary Sidebar

Tags

.Net Projects Download Android Project Ideas Android Projects Angular 2 Assembly Codes C # Projects C & C++ Projects C++ Projects Class Diagrams Computer Graphics Database Project Data Mining Projects DataScience Projects Datastructure Assignments Download Visual Basic Projects Electronics project Hadoop Projects Installation Guides Internet of Things Project IOS Projects Java Java Interview Questions Java Projects JavaScript JavaScript Projects java tutorial JSON JSP Projects Mechanical Projects Mongodb Networking Projects Node JS Projects OS Problems php Projects Placement Papers Project Ideas Python Projects seminar and presentation Struts

Search this Website


Footer

Download Java Project
Download Visual Basic Projects
Download .Net Projects
Download VB Projects
Download C++ Projects
Download NodeJs Projects
Download School Projects
Download School Projects
Ask Questions - Forum
Latest Projects Ideas
Assembly Codes
Datastructure Assignments
Computer Graphics Lab
Operating system Lab
australia-and-India-flag
  • Home
  • About me
  • Contact Form
  • Submit Your Work
  • Site Map
  • Privacy Policy