how to find turn around time in operating system?

program to find middle element of linklist?

Huawei,

program to find error in linklist.(i.e find whether any node point wrongly to previous nodes instead of next node)

Huawei,

pgm to reverse string using arrays i.e god is love becomes love is god) (assumption:only space is used for seperation of words) no addtional memory used.i.e no temporary arrays can used.

Persistent, Valyoo,

pgm to find number of words starting with capital letters in a file(additional memory usage not allowed)(if a word starting with capital also next letter in word is capital cann't be counted twice)

Subex,

pgm in c to reverse string by word using array(god is love becomes love is god) (no additional array can used,space is only delimiter between words )

Persistent,

pgm to find any error in linklist(in single linklist check whether any node points any of previous nodes instead of next node)

Huawei,

pgm to find middle element of linklist(in efficent manner)

Huawei,

implement general tree using link list

Wipro,

What do you mean by team??

Student,

pgm to find number of words starting with capital letters in a file(additional memory usage not allowed)(if a word starting with capital also next letter in word is capital cann't be counted twice)

Subex, Wipro,

Find Index of least significant bit set in an Integer. ex. int value is say 10001000 results should be 4.

Write the following function in C. stripos — Find position of first occurrence of a case- insensitive string int stripos ( char* haystack, char* needle, int offset ) Returns the numeric position of the first occurrence of needle in the haystack string. Note that the needle may be a string of one or more characters. If needle is not found, stripos() will return - 1. The function should not make use of any C library function calls.

Google, Infosys, JTL, OpenFeel,

Write an interactive c program that will encode or decode a line of text. To encode a line of text, proceed as follows: Convert each character, including blank spaces, to its ASCII equivalent. Generate a positive random integer. Add this integer to the ASCII equivalent of each character. The same random integer will be used for the entire line of text. Suppose that N1 represents the lowest permissible value in the ASCII code, and N2 represents the highest permissible value. If the number obtained in step 2 above exceeds N2, then subtract the largest possible multiple of N2 from this number, and add the remainder to N1. Hence the encoded number will always fall between N1 and N2, and will therefore always represent some ASCII character. Display the characters that correspond to the encoded ASCII values. The procedure is reversed when decoding a line of text. Be certain, however, that the same random number is used in decoding as was used in encoding.

Amazon, CSJM, HCL, Microsoft, TCS, Wipro,

What should be keep precautions while using the recursion method?