Answer Posted / raju kalyadapu

int main()
{
int i=0,n=0;
while(i++<8)
n=n+7;
printf("7 * 8 is:%d",n);
}

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.

1214

---

What is the sizeof () operator?

1016

---

What is data structure in c programming?

1028

---

How can I convert a number to a string?

1094

---

What does %d do in c?

910

---

What do header files do?

1019

---

How do you construct an increment statement or decrement statement in C?

1175

---

Differentiate between declaring a variable and defining a variable?

994

---

Why c is faster than c++?

978

---

Is it possible to use curly brackets ({}) to enclose single line code in c program?

1258

---

code for replace tabs with equivalent number of blanks

2099

---

How do shell structures work?

1068

---

Can include files be nested? How many levels deep can include files be nested?

1087

---

What is #include stdio h and #include conio h?

1039

---

What is the difference between int main and void main in c?

1092

---