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...

Explain the ternary tree?

1007

---

Explain the difference between null pointer and void pointer.

1066

---

What does struct node * mean?

998

---

Write a C program to accept a matrix of any size. Find the frequency count of each element in the matrix and positions in which they appear in the matrix

1987

---

What are external variables in c?

1089

---

What is the meaning of typedef struct in c?

1054

---

What is the sizeof () operator?

1065

---

What do you mean by dynamic memory allocation in c? What functions are used?

1151

---

int main() { Int n=20,i; For(i=0;i<=n;i--) { Printf(“-“); Return 0;

1808

---

Describe the header file and its usage in c programming?

1047

---

How can I rethow can I return a sequence of random numbers which dont repeat at all?

1180

---

Is null a keyword in c?

1186

---

Explain how can type-insensitive macros be created?

981

---

The process of repeatedly running a set of computer instructions until some condition is specifed a) condition b) sequential condition c) global d) iteration

1083

---

What is the use of the function in c?

1006

---