Answer Posted / abdur rab

#include <stdio.h>

int main ( int argc, char* argv[] )
{

int* array_int, nTotalCount = 10, sbig, big, i;
printf ( "\n/********************** Second Biggest
Number ********************/" );
array_int = ( int* ) malloc ( nTotalCount * sizeof
( int ) );

for ( i = 0; i < nTotalCount; i++ )
array_int [i] = rand() % 100;

printf( "\nThe Numbers in given order" );
for ( i = 0; i < nTotalCount; i++ )
printf ( "\t%d", array_int [i] );

for ( i = 0; i < nTotalCount; i++ )
{
switch ( i )
{
case 0:
sbig = big = array_int [i];
break;
default:
if ( big < array_int [i] ) {
sbig = big;
big = array_int [i];
} else {
if ( sbig <
array_int [i] ) sbig = array_int [i] ;
}
break;
}
}
printf ( "\n sbig :%d big :%d", sbig, big );

free ( array_int );
}


For hashtable please refer the following link
http://www.geocities.com/abdur_rab7/Open_Hash/openhash.html

Explain what does the function toupper() do?

1015

---

Is main is a keyword in c?

1079

---

Write a program to print factorial of given number using recursion?

964

---

Define Spanning-Tree Protocol (STP)

1078

---

Explain the priority queues?

1046

---

How can I read data from data files with particular formats?

1009

---

What is sizeof array?

1007

---

I came across some code that puts a (void) cast before each call to printf. Why?

1162

---

Explain what is the difference between null and nul?

1090

---

Why is structure padding done in c?

1084

---

the constant value in the case label is followed by a a) semicolon b) colon c) braces d) none of the above

1209

---

How to throw some light on the b tree?

1033

---

Write a function expand(s1,s2) that expands shorthand notations like a-z in the string s1 into the equivalent complete list abc...xyz in s2 . Allow for letters of either case and digits, and be prepared to handle cases like a-b-c and a-z0-9 and -a-z. z-a:zyx......ba -1-6-:-123456- 1-9-1:123456789987654321 a-R-L:a-R...L a-b-c:abbc

5569

---

Write a program to replace n bits from the position p of the bit representation of an inputted character x with the one's complement. Method invertBit takes 3 parameters x as input character, p as position and n as the number of positions from p. Replace n bits from pth position in 8 bit character x. Then return the characters by inverting the bits.

4163

---

the question is that what you have been doing all these periods (one year gap)

2030

---