Choose the correct methods/techniques from the following options that can be used to design algorithms.

1. Divide and conquer

2. Greedy method

3. Back tracking

4. Branch and bound

k = search ( m, n);

if (k = = ( node *) NULL)

return;

p = k –> next;

k –>next = p –>next;

free (p);

}

What function will the following code perform?

void delete_element ( node *m, int n)

{

node *p, *k;

k = search ( m, n);

if (k = = ( node *) NULL)

return;

p = k –> next;

k –>next = p –>next;

free (p);

}

i=5;

k=abc(i);

printf("%d",k);

return 0;

}

int abc(int a)

{

int b,c,d,e;

b=6;c=9;a=a/2;

d=xyz(b);

e= d+b-(c/d)+1.5;

return(e);

}

int xyz(int w)

{

int p=1;

do

{

    p=p*w;

    w--;

}

while(w>0);

return(p);

}

Choose the correct output of the following C program.

int main()

{

int i,k;

i=5;

k=abc(i);

printf("%d",k);

return 0;

}

int abc(int a)

{

int b,c,d,e;

b=6;c=9;a=a/2;

d=xyz(b);

e= d+b-(c/d)+1.5;

return(e);

}

int xyz(int w)

{

int p=1;

do

{

    p=p*w;

    w--;

}

while(w>0);

return(p);

}

printf("%d %d",u,v);

funct1(&u,&v);

printf(" %d %d\n",u,v);

}

void funct1(int *pu, int *pv)

{

*pu=0;

*pv=0;

return;

}

What is the output of the following program ?

main()

{

int u = 1, v = 3;

printf("%d %d",u,v);

funct1(&u,&v);

printf(" %d %d\n",u,v);

}

void funct1(int *pu, int *pv)

{

*pu=0;

*pv=0;

return;

}

    abc a1;

    return 0;

}

Which of the following is true about 'a1'?

Analyse the given code and answer the following question.

#include <stdio.h>

int main()

{

    typedef char (*(*abc[4])())[10];

    abc a1;

    return 0;

}

Which of the following is true about 'a1'?