Answer Posted / vint

int main()
{
char *p1="Name";
char *p2,*s1,*s2;;
p2=(char *)malloc(20);
s1 = p1;
s2 = p2;
while(*p2++ = *p1++);
printf("%s %s",s1,s2);
return 0;
}

Store the Start address of p1 and p2 before incrementing the pointer so that it could be later used to print the String.

Find the second largest element in an array with minimum no of comparisons and give the minimum no of comparisons needed on an array of size N to do the same.

1282

---

Function calling procedures? and their differences? Why should one go for Call by Reference?

1089

---

Explain what is the most efficient way to store flag values?

1232

---

Explain 'bus error'?

1102

---

Whats s or c mean?

1029

---

Explain what is the benefit of using an enum rather than a #define constant?

1225

---

When can you use a pointer with a function?

1076

---

In C language, a variable name cannot contain?

1278

---

What type is sizeof?

1040

---

What is static volatile in c?

1026

---

What are multibyte characters?

1134

---

What will the code below print when it is executed?   int x = 3, y = 4;         if (x = 4)                 y = 5;         else                 y = 2;         printf ("x=%d, y=%d ",x,y);

1887

---

What is the advantage of an array over individual variables?

1241

---

What is an auto variable in c?

1240

---

How would you rename a function in C?

1046

---