yar
maine jb intrview diya tha tb mujhse following question puche gye the..
to shuffle some random no in an arry using any method which is most efficient one..u may use any random fn for that..
2) to find the nearest common predecessor for two given node in a tree through recursion.
3)to find total no of nodes then toatal leaf node in a tree.
4)few question from java -- abt transient fn
collection questions..
most of the question were from tree ..
then bfs,dfs uses which is more efficient and when... suppose in a balanced tree which traversal for finding any node is efficient one..I suggest You to study DS, Java or C++ deeply.
Os, Simple Networking and Apti are other things..
Problem solving and deep knowledge in any one oops language is must.
Aur Daud bhai se kaho ki refer kare, well it is not must, but he will get some bonus for refering you so I am saying.. Rest is upto you.
"Ekta Choudhary" <ektac@belzabar.com>, It is the e-mail ID fof a HR in Belzabar.
Agar wo pooche ki e-mail ID kisne di h to mera nam mat lena Daud bhai ka nam lena ya Santosh ka ya simply kah dena College-Mate se li h..
ok bro
Good Luck!!!
No comments:
Post a Comment