the written consisted of 45 questions for 90 minutes.. negative marking was there.. the qs wer based on linux,networks, data structures and pattern matching problems.. some of the qs were..
1. 25 horses, 5 race tracks, choose the top 3 . minimum number of races u need ? 2. 2 clocks A and B are now showing 3'o clock. Clock B is 2 mins/hr faster than clock A. How long will it take them to show the same time again 3.B is 50% faster than A. A starts at 9:00 and B at 10:00. they are now 300km apart.speed of A is 50kmph. at what time will they meet if both move in opposite direction 4.A man has two children.he tells that one of them is a son.what is the probability that the other one is also a boy-1/3 5. a fair dice is rolled.each time the value is noted and running sum is maintained. what is the expected number of runs needed so that the sum is even 7. in how many ways can you represent the number 123456789 using only 1's and 2's-61728395 eg: 7 can be represented in 4 ways as: 1+1+1+1+1+1+1 2+1+1+1+1+1 2+2+1+1+1 2+2+2+1 8. S(n) is a function. if applied to a number , it sums up all the digits until a single digit is obtained. eg: 917=9+1+7=17=8 if D(n) is the resulting summation number i.e 8 in the above case, find how many such numbers exists if 1<n<123456789 and D(n)=5 1.How many steps do you need to swap two nodes in a doubly linked list(swap pointers and not the values) 2.what is the time complexity involved in finding the minimum element in a max heap 3.What is a Zombie process 4.how to find the real time system and process statistics using linux command 5.what signal cannot be issued by the user . options - SIGINT SIGKILL SIGTERM etc 6.what will happen if kill command is issued 7.what is the use of mac 8.what protocol is used to assign ip addresses to machines 9.What is DNS 10.what is the problem in conneting to a remote server using Telnet 11.if L=a*b*c* , then how many Number of strings can be constructed if the length of the string is 4 12.what type of machine can be used to find equal number of 0's and 1's. options-NFA,DFA,PDA,TURING MACHINE 14. in an n-ary tree with 'x' nodes, how many nodes are at the leaf 15. in a complete ternary tree with 364 nodes, what is the depth. (depth at the root node is 0) 16. about CHMOD command- to provide access to a group of users .. 17.write the post fix of the expression ((A+B)*C-(D-E)^(F+G)) 18. what among the following is a wrong equivalent of the regular expression (a+b+c)* a) (a*+b*+c)* b)(a*+b*+c*) c) ((ab)*+c*) d)-- e-- i don remember :P if we find the meaning of (a+b+c)* that wud be good AND LOTS AND LOTS OF LINUX COMMANDS On Wed, Aug 3, 2011 at 11:16 PM, raj kumar <megamonste...@gmail.com> wrote: > Hi Guys, > Directi is visiting our campus on 8th is there anyone if it visited > anyone of your's campuses recently please tell me about the pattern of > questions... > thanks > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Regards, Ayswarya S -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
