Featured post

-Write C program to find even and odd number using macro

-Write C program to find even and odd number using macro #include<stdio.h> #define number(n)((n%2==0)?1:0) int main() { int num; printf("enter any number"); scanf("%d",&num); if(number(num)) printf("number is even"); else printf("number is odd"); return 0; } ***************************Output*********************** amr@amrj-virtual-machine:~$ gccevenodd.c amr@samr-virtual-machine:~$ ./a.out enter any number 2 number is evensmj@amr-virtual-machine:~$
5 comments

Write a C Program to find the Adjacency List in C (Data Structure )

                    DATA STRUCTURE AND ALGORITHM  

Write a C Program to find the Adjacency List in C (Data Structure )

struct node //If you  have plzz write the Header file

{

int vertex;

struct node *next;

}*v[10];

void create(int m[20][20],int n)

{

int i,j;

char ans;

for(i=0;i<n;i++)

for(j=0;j<n;j++)

{

printf("is there an edge between %d and %d",i+1,j+1);

scanf("%d",&m[i][j]);

}

}

void disp(int m[20][20],int n)

{

int i,j;

printf("\nthe adjancy matrix is:\n");

for(i=0;i<n;i++)

{

for(j=0;j<n;j++)

printf("%d",m[i][j]);

printf("\n");

}

}

void create1(int m[20][20],int n)

{

int i,j;

struct node *temp,*newnode;

for(i=0;i<n;i++)

{

v[i]=NULL;

for(j=0;j<n;j++)

{

if(m[i][j]==1)

{

newnode=(struct node *)malloc(sizeof(struct node));

newnode->next=NULL;

newnode->vertex=j+1;

if(v[i]==NULL)

v[i]=temp=newnode;

else

{

temp->next=newnode;

temp=newnode;

}

}

}

}

}

void displist(int n)

{

struct node *temp;

int i;

for(i=0;i<n;i++)

{

printf("\n v %d |",i+1);

temp=v[i];

while(temp)

{

 

printf("v %d->",temp->vertex);

temp=temp->next;

}

printf("NULL");

}

}

void main()

{

int m[20][20],n;

printf("\n enter no of vertex");

scanf("%d",&n);

create(m,n);

disp(m,n);

create1(m,n);

displist(n);

}

_______________________________________________________________________                           OUTPUT

 

ame@amr-virtual-machine:~$ ./graph

 

enter no of vertex3

is there an edge between 1 and 10

is there an edge between 1 and 21

is there an edge between 1 and 30

is there an edge between 2 and 11

is there an edge between 2 and 20

is there an edge between 2 and 31

is there an edge between 3 and 10

is there an edge between 3 and 20

is there an edge between 3 and 30

 

the adjancy matrix is:

010

101

000

 

 v 1 |v 2->NULL

 v 2 |v 1->v 3->NULL

 v 3 |NULL


Comments

Post a Comment

Welcome to FlutterForge please write your Query

Popular posts from this blog

How to OCR Text Extraction in Flutter Using Google ML Kit

Image
Optical Character Recognition (OCR) is a powerful tool that enables apps to recognize and extract text from images. In this article, I'll walk you through how to implement OCR in a Flutter application using Google ML Kit. This can be particularly useful for creating document scanners, digitizing handwritten notes, or even converting printed text into digital form In this article, we will learn to recognize text from camera in Flutter. Text Recognition: This feature enables the identification of text from images or real-time camera input. The ML Kit Text Recognition API is capable of recognizing text in any Latin-based character set. For further details on Text Recognition, please refer to Google ML Kit's documentation. Using ML Kit for Text Recognition in Flutter For text recognition in Flutter, we are going to use the following Flutter plugins: google_ml_kit and camera. google_ml_kit: This plugin is used for text recognition and many other features. For more details, please...
https://www.amreshtechknowledge.tk/

Stack in Data structure

      Stack Definition:           Amreshtechknowledge.blogspot.com Stack is a order collection of homogeneous data elements where the insertion and deletion operation take place only one end that is called Stack. It is a LIFO (Last in First out) Technique.  It is a Abstract Data type. The position of stack where the operation is perform is called TOS(Top of Stack).                                                    Stack is Basically there are two operation. Push:-This is a insert or adding element in a stack i.e is called Push. Pop:-This is a delete or remove the element of stack is called POP.       Insert and delete   a specific number in stack by using push() and pop() #include<stdio.h> struct Node {    int data...
https://www.amreshtechknowledge.tk/

BCA (SCIENCE) JAVA PRACTICAL SLIPS PAGES.(JAVA) UNIVERSITY OF PUNE

     UNIVERSITY OF PUNE BCA (SCIENCE) JAVA    PRACTICAL SLIPS    PAGES.  BCA (SCIENCE) JAVA  PRACTICAL SLIPS  PAGES.(JAVA) // slip 1. Q1 //Find max element of an array// import java.io.*; class slip1_1 { public static void main(String ar[])throws IOException { BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); int max,i,n; int a[]=new int[10]; System.out.print("enter a how many element you want= "); n=Integer.parseInt(br.readLine()); for(i=0;i<n;i++) { System.out.print("enter a element = "); a[i]=Integer.parseInt(br.readLine()); } max=a[0]; for(i=0;i<n;i++) { if(max<a[i]) { max=a[i]; } } System.out.println("\nTHE MAX ELEMENT IS= "+max); } }   /*================OUTPUT=============== smj@smj-virtual-machine:~$ javac Max.java smj@smj-virtual-machine:~$ java Max enter a how many element you want= 4 enter a element = 12 enter a element = 3 enter a element = 24 enter a element = 54 THE MAX ELEMENT IS= 54 sm...
https://www.amreshtechknowledge.tk/