1. To generate the fibonacci series using recursion.
2. Given a set of words in command line we need to list the words sorted by frequency, if frequency is of same degree we need to sort it alphabetically.
Eg. abb baa abb abb baa aaa aaa
o/p: abb aaa baa
3. Given a text file we need to wrap the text according to the given number n. If the end of the line consists a space or a tab we continue as usual else if a word is present we have to hyphenate it.
The phone interview was a technical interview.
Basic definitions on trees, trie structure, normalizations, operating system, unix commands were asked.
some questions were asked on .NET and AJAX too.
Knowing all the definitions will help you clear this round.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment