Answer Posted / om

There are two good method to solve this problem; first one
takes 2n-3 comparison and second one takes n+lg(n)-2
comparison only.

1) Run bubble sort loop only for 2 times ..the first time it
will do n-1 comparison and put the largest element at the
end of the array.... then by running second time it will do
n-2 comparison and put the second largest element at the
second last position in the array... so n-1 + n-2 =2n-3
comparison. cool naa... I didn't sort the whole array and
found the second largest element.

2)http://www.seeingwithc.org/topic3html.html
check this site...

What is the maximum no. of arguments that can be given in a command line in C.?

1149

---

What does void main () mean?

1238

---

1234554321 1234 4321 123 321 12 21 1 1 12 21 123 321 1234 4321 1234554321

3715

---

Can you please explain the difference between syntax vs logical error?

1190

---

In the DOS enveronment, normal RAM that resides beyond the 1mb mark. a) expanded memory b) swapped memory c) Extended memory d) none

1203

---

What is the use of function overloading in C?

1172

---

How is a macro different from a function?

1180

---

What is a nested formula?

1156

---

When should volatile modifier be used?

1012

---

Explain what does it mean when a pointer is used in an if statement?

1064

---

Differentiate Source Codes from Object Codes

1572

---

What is the explanation for modular programming?

1213

---

Write a program to compute the similarity between two strings - The program should get the two strings as input - Then it will output one single number which is the percentage of similarity between the two strings

2753

---

Write an efficient algo and C code to shuffle a pack of cards.. this one was a feedback process until we came up with one with no extra storage.

1064

---

Can we use visual studio for c?

1090

---