Powered By Blogger

Friday, August 12, 2011

Samsung Interview Questions


1. Value of EOF??
Ans: - 1
2.struct abc
{
};
struct abc arr[10];
struct abc *p=arr;
Which statement will  increment the pointer to point the next array element?
Ans:- p=p+sizeof(abc);
4.char *a=”hello\0world\0!!”;
printf(“%d”,strlen(a));
a=a+6;
printf(“%d”,strlen(a));
a=a+7;
printf(“%d”,strlen(a));
Ans : 5 5 1 
5.int i=0;
For(;i++;printf(“%d”,i));
printf(“%d”,i);
Ans:1
6.static int i;
main()
{
If(i==5)
printf(“Samsung”);
i++;
return(i=main());
}
Ans: Stack Overflow
8.int *b={1,2,3,4,5,6,9,8};
printf(“%d”,(b+1)[5]);
Ans: 9

9.int i=512;
char *c=(char *)&i;
c[0]=1;
printf(%d”,i);
Ans: 513;
10.enum={black=2,Green=7,Red};
printf(“%d %d %d”,black,green,red}
Ans: 2 7 8
11.class abc
{
};
abc ob;
cout<
Ans: 1;
12.class abc
{
static int i;
int a;
};
abc ob;
cout<cout<
13.char c=’a’;
printf(“%d %d %d”,size(c),size(‘a’),size(“A”);
Ans: 1 4 2;
14.int i=5,*j;
void *k;
k=j=&I;
printf(“%d”,k+1);
Ans: Compilation error (but its running on gnu);
15.int i=0;
switch(i)
{
printf(“samsung”);
case 10:printf(“some string”);
break;
case 5*2:printf(“some string”);
break;
}
Ans: Error Due to Conflicting Case;
16.#define true 1
#define false -1
#define null 0
if(null)
printf(“……”);
else if(false)
printf(“true”);
Ans: True;

Data Structure :-
1.Property of Heap?
Ans: Every Node is Greater Than its Child;
2.Complexity of Binary.Log n;

Operating System :-
1.On Switch on the Computer Which Loader Come in Action First.
Ans: Boot Strap Loader
2.How to Decrease The Page Fault.
Ans :  locality of reference

Wednesday, August 10, 2011

Apology...

Sorry guys...my xams were going so cudn't post more program at that time...however i am back now..so the posting session will continue....njoy and post any C program problem that u face !!

Regards,
Parag Kr. Acharyya

Monday, May 2, 2011

Extended Pigeonhole Principle

#include<stdio.h>
#include<conio.h>
void main()
{
    int p,ph,res=0;
    printf("Enter the no. of pigeons : ");
    scanf("%d",&p);
    printf("Enter the no. of pigeon holes : ");
    scanf("%d",&ph);
    res=((p-1)/ph)+1;
    printf("There must be at least %d pigeons in each pigeon hole.\n",res);
    getch();
}

Program for funtion analysis

//This program takes as input the function in matrix form and checks
// whether the given function is injective,surjective or bijective.
#include<stdio.h>
#include<conio.h>
void main()
{
    int mat[10][10],i,j,in=0,sur=0,bij=0,m,tmp,p,q;
    printf("Enter the order of the matrix :");
    scanf("%d",&m);
    printf("Enter the matrix row-wise : \n");
    for(i=0;i<m;i++)
        for(j=0;j<m;j++)
            scanf("%d",&mat[i][j]);
    //To check whether the given function is valid or not
    for(i=0;i<m;i++)
    {
        tmp=0;
        for(j=0;j<m;j++)
            if(mat[i][j]==1)
                tmp++;
        if(tmp!=1)
        {
            printf("The given function is not valid.\n");
            break;
        }
    }
    //To print the given matrix
    printf("The given function matrix is : \n\n");
    for(i=0;i<m;i++)
        printf("\t%d",i+1);
    printf("\n\n    --------------------------");
    for(i=0;i<m;i++)
    {
        printf(" \n   |\n %d |",i+1);
        for(j=0;j<m;j++)
            printf("\t%d",mat[i][j]);
    }
    printf("\n");
    //To check if its injective
    for(i=0;i<m;i++)
    {
        in=0;
        for(j=0;j<m;j++)
            if(mat[i][j]==1)
                in++;
        if(in>1)
        {
            printf("\nThe given funtion is not injective.\n");
            break;
        }
    }
    if(in==1)
    {
        p=1;
        printf("\nThe given function is injective.\n");
    }
    //To check if its surjective
    for(i=0;i<m;i++)
    {
        sur=0;
        for(j=0;j<m;j++)
            if(mat[i][j]==1)
                sur++;
        if(sur==1)
        {
            printf("\nThe function is not surjective.\n");
            break;
        }
    }
    if(sur>1)
    {
        q=1;   
        printf("\nThe function is surjective\n");
    }
    if(p==1 && q==1)
        printf("\nThe function is bijective.\n");
    else
        printf("\nThe function is not bijective.\n");
    getch();
}

Saturday, April 30, 2011

Binary Search Tree complete operations

#include<stdio.h>
#include<conio.h>
#include<malloc.h>
struct node
{
    int data;
    struct node *l,*r;
};
struct node *root=NULL;
int item,item2,item3;
struct node *insert(struct node *root,int item);
void search(struct node *root,int item);
void preorder(struct node *root);
void inorder(struct node *root);
void postorder(struct node *root);
void delnode(struct node *root,int item3);

void main()
{
    int choice,ch=0;
    do
    {
        printf("\t\t\tBinary Search Tree Operations :\n");
        printf("\t\t1.Insert a node in the tree.\n");
        printf("\t\t2.Traverse and display the tree in inorder.\n");
        printf("\t\t3.Traverse and display the tree in preorder.\n");
        printf("\t\t4.Traverse and display the tree in postorder.\n");
        printf("\t\t5.Delete a node from the tree.\n");
        printf("\t\t6.Search for an element.\n");
        printf("Enter your choice : ");
        scanf_s("%d",&choice);
        switch(choice)
        {
        case 1:root=insert(root,item);
            break;
        case 2:inorder(root);
            break;
        case 3:preorder(root);
            break;
        case 4:postorder(root);
            break;
        case 5:delnode(root,item3);
            break;
        case 6:search(root,item2);
            break;
        default:printf("Wrong choice !!\n");
            break;
        }
        printf("Press 0 to continue.... ");
        scanf("%d",&ch);
    }while(ch==0);
}

struct node *insert(struct node *root,int item)
{
    struct node *p,*f;
    printf("Enter the item : ");
    scanf_s("%d",&item);
    p=root;
    if(root==NULL)
    {
        root=(struct node *)malloc(sizeof(struct node));
        root->data=item;
        root->l=NULL;
        root->r=NULL;
       
    }
    else
    {
       
        while(p!=NULL)
        {
            f=p;
            if(item>p->data)
            {
                p=p->r;
            }
            else
                p=p->l;
        }
        if(item>f->data)
        {
            f->r=(struct node *)malloc(sizeof(struct node));
            f=f->r;
            f->data=item;
            f->l=f->r=NULL;
        }

        else
        {
            f->l=(struct node *)malloc(sizeof(struct node));
            f=f->l;
            f->data=item;
            f->l=f->r=NULL;
        }
    }
    return root;
}

void inorder(struct node *root)
{
    struct node *p;
    p=root;
    if(p!=NULL)
    {
       
       
        inorder(p->l);
        printf("%3d",p->data);
        inorder(p->r);
    }
}

void preorder(struct node *root)
{
    struct node *p;
    p=root;
    if(p!=NULL)
    {
       
       
        printf("%d",p->data);
        preorder(p->l);
        preorder(p->r);
    }
}

void postorder(struct node *root)
{
    struct node *p;
    p=root;
    if(p!=NULL)
    {
       
       
        postorder(p->l);
        postorder(p->r);
        printf("%d",p->data);
    }
}

void search(struct node *root,int item2)
{
    struct node *p;
    if(root==NULL)
    {
        printf("Tree is empty!!\n");
        return;
    }
    else
    {
        p=root;
        printf("Enter the element to be searched : ");
        scanf("%d",&item2);
        while(p!=NULL)
        {
            if(item2==p->data)
            {
                printf("Item found.\n");
                return;
            }
            else if(item2>p->data)
                p=p->r;
            else
                p=p->l;
        }
        printf("Element not found.\n");
    }
}

void delnode(struct node *root,int item3)
{
    struct node *curr,*par,*temp,*tmp;
    int found=0; curr=root;
    if(curr==NULL)
    {
        printf("The tree is empty !!\n");
        return;
    }
    else
    {
        printf("Enter the element to delete : ");
        scanf("%d",&item3);
        while(curr!=NULL)
        {
            par=curr;
            if(item3==curr->data)
            {
                found=1;
                break;
            }
            else if(item3<curr->data)
                curr=curr->l;
            else
                curr=curr->r;
        }
        if(!found)
        {
            printf("Element not found !!\n");
            return;
        }
        if(curr->l==NULL && curr->r==NULL) //Leaf node
        {
            if(par->l==curr)
                par->l=NULL;
            else
                par->r=NULL;
            free(curr);
            return;
        }
        //Node having only RST
        if(curr->l==NULL && curr->r!=NULL) 
        {
            if(par->l==curr)
            {
                par->l=curr->r;
                free(curr);
            }
            else
            {
                par->r=curr->r;
                free(curr);
            }
            return;
        }
        //Node having only LST
        if(curr->l!=NULL && curr->r==NULL)
        {
            if(par->l==curr)
            {
                par->l=curr->l;
                free(curr);
            }
            else
            {
                par->r=curr->l;
                free(curr);
            }
            return;
        }
        if(curr->l!=NULL && curr->r!=NULL)
        {
            //Replace current node's data with smallest element
            struct node *chkr,*lcurr,*lcurrp,*tmp;
            chkr=curr->r;
            if((chkr->l==NULL) && (chkr->r==NULL))
            {
                curr->data=chkr->data;
                curr->r=NULL;
                free(chkr);
                return;
            }
            else if(chkr->l!=NULL)
            {
                //lcurr is the node to be replaced
                lcurr=chkr;
                //lcurrp is the parent of lcurr
                lcurrp=chkr->l;
                while(lcurr->l!=NULL)
                {
                    lcurrp=lcurr;
                    lcurr=lcurr->l;
                }
                curr->data=lcurr->data;
                lcurrp->l=NULL;
                free(lcurr);
            }
            else
            {
                tmp=curr->r;
                curr->data=tmp->data;
                curr->r=tmp->r;
                free(tmp);
            }
        }
   }
   printf("Element terminated\n");
}

       

Friday, April 29, 2011

Can u guess the output... U jst need a simple concept of bitwise and logical operators in C

#include<stdio.h>
int main(void)
{
    int a[10],i=0,s=0;
    printf("Enter 5 digits (choose digits between 0-9)::\n");
    for(i=0;i<5;i++)
        scanf("%d",&a[i]);


    printf("\n\n");
    for(i=0;i<4;i++)
        printf("%5d|%d=%d",a[i+1],a[i],a[i+1]|a[i]);



    printf("\n\n");
    for(i=0;i<4;i++)
        printf("%5d||%d=%d",a[i+1],a[i],a[i+1]||a[i]);
  
  

Some interesting questions in C u would have never guessed :)

Predict the output or error(s) for the following:

1.    void main()
{
    int  const * p=5;
    printf("%d",++(*p));
}
Answer:
        Compiler error: Cannot modify a constant value.
Explanation:
p is a pointer to a "constant integer". But we tried to change the
value of the "constant integer".

2.    main()
{
    char s[ ]="man";
    int i;
    for(i=0;s[ i ];i++)
    printf("%c%c%c%c",s[ i ],*(s+i),*(i+s),i[s]);
}
Answer:
                mmmmaaaannnn
Explanation:
s[i], *(i+s), *(s+i), i[s] are all different ways of expressing the
same idea. Generally  array name is the base address for that array. Here s is
the base address. i is the index number/displacement from the base
address. So, indirecting it with * is same as s[i]. i[s] may be
surprising. But in the  case of  C  it is same as s[i].

3.    main()
{
    float me = 1.1;
    double you = 1.1;
    if(me==you)
printf("I love U");
else
        printf("I hate U");
}
Answer:
I hate U
Explanation:
For floating point numbers (float, double, long double) the values
cannot
be predicted exactly. Depending on the number of bytes, the precession
with of the value  represented varies. Float takes 4 bytes and long
double
takes 10 bytes. So float stores 0.9 with less precision than long
double.
Rule of Thumb:
Never compare or at-least be cautious when using floating point numbers
with relational operators (== , >, <, <=, >=,!= ) .

4.    main()
    {
    static int var = 5;
    printf("%d ",var--);
    if(var)
        main();
    }
Answer:
5 4 3 2 1
            Explanation:
When static storage class is given, it is initialized once. The change
in the value of a static variable is retained even between the function
calls. Main is also treated like any other ordinary function, which can
be called recursively.

5.    main()
{
     int c[ ]={2.8,3.4,4,6.7,5};
     int j,*p=c,*q=c;
     for(j=0;j<5;j++)
         {
        printf(" %d ",*c);
           ++q;     
         }
     for(j=0;j<5;j++)
         {
           printf(" %d ",*p);
           ++p;     
         }
}

Answer:
                2 2 2 2 2 2 3 4 6 5
             Explanation:
Initially pointer c is assigned to both p and q. In the first loop,
since only q is incremented and not c , the value 2 will be printed 5 times.
In second loop p itself is incremented. So the values 2 3 4 6 5 will be
printed.

6.    main()
{
    extern int i;
    i=20;
        printf("%d",i);
}

Answer:
Linker Error : Undefined symbol '_i'
Explanation:
                 extern storage class in the following declaration,
                               extern int i;
specifies to the compiler that the memory for i is allocated in some
other program and that address will be given to the current program at the
time of linking. But linker finds that no other variable of name i is
available in any other program with memory space allocated for it. Hence a linker
error has occurred .

7.    main()
{
    int i=-1,j=-1,k=0,l=2,m;
    m=i++&&j++&&k++||l++;
    printf("%d %d %d %d %d",i,j,k,l,m);
}
Answer:
                0 0 1 3 1
Explanation :
Logical operations always give a result of 1 or 0 . And also the
logical AND (&&) operator has higher priority over the logical OR (||)
operator.So the expression  ‘i++ && j++ && k++’ is executed first. The result of
this expression is 0(-1 && -1 && 0 = 0). Now the expression is 0 || 2
which evaluates to 1 (because OR operator always gives 1 except for
‘0 || 0’ combination- for which it gives 0). So the value of m is 1. The
values of other variables are also incremented by 1.

8.    main()
{
    char *p;
    printf("%d %d ",sizeof(*p),sizeof(p));
}

Answer:
                1 2
Explanation:
The sizeof() operator gives the number of bytes taken by its operand. P
is a character pointer, which needs one byte for storing its value (a
character). Hence sizeof(*p) gives a value of 1. Since it needs two
bytes to store the address of the character pointer sizeof(p) gives 2.

9.    main()
{
    int i=3;
    switch(i)
     {
        default:printf("zero");
        case 1: printf("one");
           break;
       case 2:printf("two");
          break;
      case 3: printf("three");
          break;
      }
}
Answer :
three
Explanation :
The default case can be placed anywhere inside the loop. It is executed
only when all other cases doesn't match.

10.    main()
{
      printf("%x",-1<<4);
}
Answer:
fff0
Explanation :
-1 is internally represented as all 1's. When left shifted four times
the least significant 4 bits are filled with 0's.The %x format specifier
specifies that the integer value be printed as a hexadecimal value.

11.    main()
{
    char string[]="Hello World";
    display(string);
}
void display(char *string)
{
    printf("%s",string);
}
              Answer:
Compiler Error : Type mismatch in redeclaration of function display
              Explanation :
In third line, when the function display is encountered, the compiler
doesn't know anything about the function display. It assumes the
arguments and return types to be integers, (which is the default type). When it
sees the actual function display, the arguments and type contradicts with
what it has assumed previously. Hence a compile time error occurs.

12.    main()
{
    int c=- -2;
    printf("c=%d",c);
}
Answer:
                     c=2;
              Explanation:
Here unary minus (or negation) operator is used twice. Same maths 
rules applies, ie. minus * minus= plus.
Note:
However you cannot give like --2. Because -- operator can  only be
applied to variables as a decrement operator (eg., i--). 2 is a constant and
not a variable.

13.    #define int char
main()
{
    int i=65;
    printf("sizeof(i)=%d",sizeof(i));
}
Answer:
                  sizeof(i)=1
Explanation:
Since the #define replaces the string  int by the macro char

14.    main()
{
int i=10;
i=!i>14;
printf("i=%d",i);
}
Answer:
i=0


     Explanation:
In the expression !i>14 , NOT (!) operator has more precedence than
‘>’symbol.  ! is a unary logical operator. !i (!10) is 0 (not of true is
false).  0>14 is false (zero).

15.    #include<stdio.h>
main()
{
char s[]={'a','b','c','
','c','

Warshall's Algorithm

#include<stdio.h>
#include<conio.h>
void main()
{
    int a[10][10],i,j,k,n;
    printf("Enter the no. of nodes : ");
    scanf("%d",&n);
    //Enter only 1 or 0
    printf("Now enter the matrix row wise : \n");
    for(i=0;i<n;i++)
        for(j=0;j<n;j++)
            scanf("%d",&a[i][j]);
    printf("\nThe matrix u entered is : \n");
    for(i=0;i<n;i++)
    {
        for(j=0;j<n;j++)
            printf("%2d",a[i][j]);
        printf("\n");
    }

    //To find out the transitive relation matrix
    for(k=0;k<n;k++)
    {
        for(i=0;i<n;i++)
            for(j=0;j<n;j++)
                a[i][j]=a[i][j]||(a[i][k]&&a[k][j]);
    }

    //To print the required transitive relation matrix
    printf("\n\nThe required transitive matrix is : \n");
    for(i=0;i<n;i++)
    {
        for(j=0;j<n;j++)
            printf("%2d",a[i][j]);
        printf("\n");
    }
}

N.B. : Check this program for 5x5 matrix and lemme know if there is any fault...

Tuesday, April 26, 2011

Square Root Of a Number Without built-in function


#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
void main()
{
 double n,g1,g2;
 int flag=0;
 clrscr();
 printf("Enter the no.: ");
 scanf("%lf",&n);
 if(n<0)
 {
                n=-n;
                flag=1;
 }
 else if(n==0)
 {
                printf("The root of %6.4lf is",n);
                printf(" %6.4lf\n",g2);
                getch();
                exit(0);
 }
 g2=n/2;
 do
 {
                g1=g2;
                g2=(g1+n/g1)/2;
 }
 while((g1-g2)!=0);
 if(flag==1)
 {
                printf("The root of %6.4lf is",-n);
                printf(" +/- %6.4lf i\n",g2);
 }
 else
 {
                printf("The root of %6.4lf is",n);
printf(" +/- %6.4lf\n",g2);
 }
 getch();
}

Infix to Postfix Conversion



#include<stdio.h>
#include<conio.h>
#include<string.h>
#define MAX 20
char stack[MAX];
int top=-1;
char pop();
void push(char item);
int prcd(char symbol)
{
switch(symbol)
{
case '+':
case '-':return 2;
break;
case '*':
case '/':return 4;
break;
case '^':
case '$':return 6;
break;
case '(':
case ')':
case '#':return 1;
break;
}
}
int isoperator(char symbol)
{
switch(symbol)
{
case '+':
case '-':
case '*':
case '/':
case '^':
case '$':
case '(':
case ')':return 1;
break;
default:return 0;
}
}
void convertip(char infix[],char postfix[])
{
int i,symbol,j=0;
stack[++top]='#';
for(i=0;i<strlen(infix);i++)
{
symbol=infix[i];
if(isoperator(symbol)==0)
{
postfix[j]=symbol;
j++;
}
else{
if(symbol=='(')push(symbol);
else if(symbol==')')
{
while(stack[top]!='(')
{
postfix[j]=pop();
j++;
}
pop();//pop out (.
}
else{
if(prcd(symbol)>prcd(stack[top]))
push(symbol);
else{
while(prcd(symbol)<=prcd(stack[top]))
{
postfix[j]=pop();
j++;
}
push(symbol);
}//end of else.
}//end of else.
}//end of else.
}//end of for.
while(stack[top]!='#')
{
postfix[j]=pop();
j++;
}
postfix[j]='\0';//null terminate string.
}
void main()
{
char infix[20],postfix[20];
clrscr();
printf("Enter the valid infix string:\n");
gets(infix);
convertip(infix,postfix);
printf("The corresponding postfix string is:\n");
puts(postfix);
getch();
}
void push(char item)
{
top++;
stack[top]=item;
}
char pop()
{
char a;
a=stack[top];
top--;
return a;
}


Decimal To Roman Number Conversion


Convert decimail nos to roman equivalent upto 10,000

/*
                     Roman      Decimal
                     1                   i
                     5                   v
                     10                  x
                     50                  l
                     100                 c
                     500                 d
                     1000                m                 */


#include<stdio.h>
#include<conio.h>
void thousand(int i) //Function for generating roman equivalent of 1000's
{
                int x;
                for(x=1;x<=i;x++)
                printf("m");
}
void hundred(int x) //Function for generating roman eq of 100's
{
                int i;
                if(x>=5)
                {
                                 x=x-5;
                                 printf("d");
                }
                for(i=1;i<=x;i++)
                printf("c");
}
void tens(int x) //Function for generating roman eq of 10's
{
                int i;
                if(x>=5)
                {
                                 x=x-5;
                                 printf("l");
                }
                for(i=1;i<=x;i++)
                printf("x");
}
void ones(int x) //Function for generating roman eq of 1's
{
                int i,j;
                if(x==9)
                                 printf("ix");
                else if(x>=5&&x<=8)
                {
                                 printf("v");
                                 for(i=1;i<=x-5;i++)
                                 printf("i");
                }
                else if(x==4)
                                 printf("iv");
                else
                {
                                 for(j=1;j<=x;j++)
                                 printf("i");
                }
}
void main() //Main program
{
                int i,y,j;
                clrscr();
                printf("Enter the year(less than 10,000):");
                scanf("%d",&y);
                printf(" ");
                for(j=1000;j>=1;j=j/10)
                {
                                 i=y/j;         //Extraction of digits for each functions
                                 if(j==1000)
                                                  thousand(i);
                                 else if(j==100)
                                                  hundred(i);
                                 else if(j==10)
                                                  tens(i);
                                 else
                                                  ones(i);
                                 y=y-(i*j); //removing the extracted digit to proceed further
                }
                getch();
}

Determinant Of a Matrix....


#include<stdio.h>
#include<conio.h>
#define LIMIT 10
void main()
{
  int chckdgnl();
  float deter();
  float a[LIMIT][LIMIT],value;
  int i,j,order;
  clrscr();
  printf("Enter order of determent :");
  scanf("%d",&order);
  for(i=0;i<order;i++)
  {
for(j=0;j<order;j++)
{
 printf("Enter (%d,%d) element of the determent :",i+1,j+1);
 scanf("%f",&a[i][j]);
}
  }

  if(chckdgnl(a,order)==0)
value=0;
  else
value=deter(a,order);
  printf("Determinent Value :%f",value);
  getch();
}

float deter(float a[][LIMIT],int forder)
{
  int i,j,k;
  float mult;
  float deter=1;
  for(i=0;i<forder;i++)
  {
for(j=0;j<forder;j++)
{
 mult=a[j][i]/a[i][i];
 for(k=0;k<forder;k++)
 {
if(i==j) break;
a[j][k]=a[j][k]-a[i][k]*mult;
 }
}
  }
  for(i=0;i<forder;i++)
  {
deter=deter*a[i][i];
  }
  return(deter);
}


int chckdgnl(float array[][LIMIT],int forder)
{
  int i,j,k;
  float nonzero;
  for(i=0;i<forder;i++)
  {
if(array[i][i]==0)
{
for(j=0;j<forder;j++)
{
 if(array[i][j]!=0)
 {
k=j;
break;
 }
 if(j==(forder)) //forder-1
return(0);
}
for(j=0;j<forder;j++)
{
 array[j][i]=array[j][i]-array[j][k];
}
}
  }
  return(1);
}

Depth First Search

Important : Please note that here it is pre-assumed that nodes are labelled from 1-8 and BFS is followed......however your valuable suggestion regarding the improvisation of the program is welcome :)

#include<stdio.h>
#include<conio.h>
#include<malloc.h>
#include<stdlib.h>


#define TRUE 1
#define FALSE 0
#define MAX 8
struct node
{
int data;
struct node *next;
};
int visited[MAX];


void dfs(int, struct node **);
struct node *getnode_write(int);
void del(struct node *);


void main()
{
struct node *arr[MAX];
struct node *v1,*v2,*v3,*v4;
int i;

v1=getnode_write(2);
arr[0]=v1;
v1->next=v2=getnode_write(3);
v2->next=NULL;


v1=getnode_write(1);
arr[1]=v1;
v1->next=v2=getnode_write(4);
v2->next=v3=getnode_write(5);
v3->next=NULL;


v1=getnode_write(1);
arr[2]=v1;
v1->next=v2=getnode_write(6);
v2->next=v3=getnode_write(7);
v3->next=NULL;

v1=getnode_write(2);
arr[3]=v1;
v1->next=v2=getnode_write(8);
v2->next=NULL;


v1=getnode_write(2);
arr[4]=v1;
v1->next=v2=getnode_write(8);
v2->next=NULL;


v1=getnode_write(3);
arr[5]=v1;
v1->next=v2=getnode_write(8);
v2->next=NULL;


v1=getnode_write(3);
arr[6]=v1;
v1->next=v2=getnode_write(8);
v2->next=NULL;


v1=getnode_write(4);
arr[7]=v1;
v1->next=v2=getnode_write(5);
v2->next=v3=getnode_write(6);
v3->next=v4=getnode_write(7);
v4->next=NULL;


printf("The list of nodes visited in the dfs traversal are : \n\n\n\t");
dfs(1,arr);
for(i=0;i<MAX;i++)
del(arr[i]);
printf("\n");
getch();
}


struct node *getnode_write(int val)
{
struct node *newnode;
newnode=(struct node*)malloc(sizeof(struct node));
newnode->data=val;
return newnode;
}


void del(struct node *n)
{
struct node *temp;
while(n!=NULL)
{
temp=n->next;
free(n);
n=temp;
}
}


void dfs(int v, struct node **p)
{
struct node *q;
visited[v-1]=TRUE;
printf("%d\t",v);
q=*(p-v+1);
while(q!=NULL)
{
if(visited[q->data-1]==FALSE)
dfs(q->data,p);
else
q=q->next;
}
}

Breadth First Search Technique

Important : Please note that here it is pre-assumed that nodes are labelled from 1-8 and BFS is followed......however your valuable suggestion regarding the improvisation of the program is welcome :)


#include<stdio.h>
#include<conio.h>
#include<malloc.h>
#include<stdlib.h>

#define TRUE 1
#define FALSE 0
#define MAX 8
struct node
{
int data;
struct node *next;
};
int visited[MAX];
int q[8];
int front,rear;

void bfs(int,struct node **);
struct node *getnode_write(int);
void addqueue(int);
int deletequeue();
int isempty();
void del (struct node *);

void main()
{
struct node *arr[MAX];
struct node *v1,*v2,*v3,*v4;
int i;

v1=getnode_write(2);
arr[0]=v1;
v1->next=v2=getnode_write(3);
v2->next=NULL;

v1=getnode_write(1);
arr[1]=v1;
v1->next=v2=getnode_write(4);
v2->next=v3=getnode_write(5);
v3->next=NULL;

v1=getnode_write(1);
arr[2]=v1;
v1->next=v2=getnode_write(6);
v2->next=v3=getnode_write(7);
v3->next=NULL;

v1=getnode_write(2);
arr[3]=v1;
v1->next=v2=getnode_write(8);
v2->next=NULL;

v1=getnode_write(2);
arr[4]=v1;
v1->next=v2=getnode_write(8);
v2->next=NULL;

v1=getnode_write(3);
arr[5]=v1;
v1->next=v2=getnode_write(8);
v2->next=NULL;

v1=getnode_write(3);
arr[6]=v1;
v1->next=v2=getnode_write(8);
v2->next=NULL;

v1=getnode_write(4);
arr[7]=v1;
v1->next=v2=getnode_write(5);
v2->next=v3=getnode_write(6);
v3->next=v4=getnode_write(7);
v4->next=NULL;

front=rear=-1;
printf("The list of nodes visited in the bfs traversal are : \n\n\n\t");
bfs(1,arr);
for(i=0;i<MAX;i++)
del(arr[i]);
printf("\n");
getch();
}

void bfs(int v, struct node **p)
{
struct node *u;
visited[v-1]=TRUE;
printf("%d\t",v);
addqueue(v);
while(isempty()==FALSE)
{
v=deletequeue();
u=*(p+v-1);
while(u!=NULL)
{
if(visited[u->data-1]==FALSE)
{
addqueue(u->data);
visited[u->data-1]=TRUE;
printf("%d\t",u->data);
}
u=u->next;
}
}
}

struct node *getnode_write(int val)
{
struct node *newnode;
newnode=(struct node*)malloc(sizeof(struct node));
newnode->data=val;
return newnode;
}

void addqueue(int vertex)
{
if(rear==MAX-1)
{
printf("\nQueue Overflow.");
exit(0);

}
rear++;
q[rear]=vertex;
if(front==-1)
front=0;
}

int deletequeue()
{
int data;
if(front==-1)
{
printf("\nQueue Underflow.");
exit(0);

}
data=q[front];
if(front==rear)
front=rear=-1;
else
front++;
return data;
}

int isempty()
{
if(front==-1)
return TRUE;
return FALSE;
}

void del(struct node *n)
{
struct node *temp;
while(n!=NULL)
{
temp=n->next;
free(n);
n=temp;
}
}