folowing is d internship paper of qualcomm (software position) 3 sections analytical,programming skills and CSE
analytical paper had qs from relationships,to derive code ,pattern matching,sets ,i found it a little bit tough in comparison to other two sections programming paper had input o/p qs ver easy.considerable number od qs were asked from OS (virtual memory,multitasking computers,shallow copy, OS used by IBM pc/2) .ouptut qs from a given flow chart. in CSE section qs like to find avg waiting time for round robin,page fault using FIFO technique,avg waiting time for FCFS scheduling. time complexity for merging to sorted files of diff sizes 50,10,15,25 ;.Program to find reverse of a number as an o/p qs This section ws easy too.. after switching over to another section,the previous attempted section couldnt be accessed -- 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.
