Data Structure:
Show that if k is the smallest integer greater than or equal to n+ (log2n)-2, k comparisons are necessary and sufficient to find the largest and second largest elements of a set of n distinct elements. (k comparisons are required to find what you are looking for, but no more than that are needed)
No Answer is Posted For this Question
Be the First to Post Answer
you have a computer with 80GB hard disk and ubuntu 8.04 is installed on entire hard disk.now you have to create a seprate partition for windows OS and install win XP as dual boot.write down the steps involved along with the commands
1 Answers Anand Group, Indian Navy, TCS,
what is runtime exception and compiletime exception ?
It is possible to take number of controls added to form at run-time.ex-when user enter 6, 6 text boxes get added to form,next time number of controls get change as per user number enter. What is code for that?
how can we maintain the previous version scripts to new version.
0 Answers DST Global Solutions,
What is autocall macro and how to create autocall macro? what is the use of it?
What do you understand by modular programming?
what will we require to build project with the help of oracle
What is dialog programming?
plz send me NIC Scientific Officer /Engineer-SB(Programmer) previous question paper or syllabus
what is the difference between set and append?
what is the BAM? where we can use it in BizTalk server?
Diff between IF and where ?