2 phone interviews Interview 1 Compute number and print all possible paths from (0,0) to (7,7) in a chess board. you can either move down or right . basically in first interview they either ask about red black, avl , trees or some question based on design and analysis of algorithms. mine was based on dynamic programming Interview 2 what is os, paging, segmentation, virtual memory, i/o mgmt, deadlocks, synchronization - basically all chapters of galvin what happens when you type a url in address bar, how are address resolved, domain name space, some database questions etc