Answer Posted / newclient

sorting is not required in this case.u can still use same
technique(not exactly) as mentioned in Cormen.an algorithm
named "QuickSelect" which has an average complexity of
O(nlong(n)).
Anyways to reduce the number of comparisions one can use
tournament algorithm and for kth element we have to
recursively go through the loosers list.

Some coders debug their programs by placing comment symbols on some codes instead of deleting it. How does this aid in debugging?

1083

---

What is pointer & why it is used?

1063

---

What is #line used for?

991

---

in multiple branching construct "default" case is a) optional b) compulsarily c) it is not include in this construct d) none of the above

1017

---

What is a const pointer?

1043

---

What type of function is main ()?

999

---

Explain how can I manipulate strings of multibyte characters?

1163

---

What is mean by Data Driven framework in QTP? Can any one answer me in details on this regard.

2206

---

What is sizeof c?

1004

---

#include main() { enum _tag{ left=10, right, front=100, back}; printf("left is %d, right is %d, front is %d, back is %d",left,right,front,back); }

1070

---

What does c in a circle mean?

1024

---

WHICH TYPE OF JOBS WE GET BY WRITING GROUPS .WHEN THE EXAMS CONDUCTED IS THIS EXAMS ARE CONDUCTED EVERY YEAR OR NOT.PLS TELL ME THE ANSWER

1802

---

Explain high-order bytes.

1062

---

.find the output of the following program? char*myfunc(char*ptr) { ptr +=3; return (ptr); } int main() { char*x,*y; x="HELLO"; y=myfunc(x); printf("y = %s ",y); return 0; }

2506

---

Without Computer networks, Computers will be half the use. Comment.

2254

---