1.

Program has to take the file name dynamically and find out longest
word in the entire file
2. Reverse the 2nd half in the given number (assume total number of
digits are even)
3. Reverse only odd index elements in the given array.
4. Find out the sum of all digits in the given number without any loops.
5. Define consumer and producer pattern by using threads.