Goldman Sachs Interview Report
- 0of 0 votes
AnswersPrint a binary tree without using recursion(inorder print) ?
- sonesh January 01, 2013 in India for Strategies Group| Report Duplicate | Flag | PURGE
Goldman Sachs Software Engineer / Developer Algorithm - 1of 1 vote
AnswersHow can we reduce search time in linked list(reduce time complexity to O(log n), it is not given but I gave my answer with O(log n) complexity) ?
- sonesh January 01, 2013 in India for Strategies Group| Report Duplicate | Flag | PURGE
Goldman Sachs Software Engineer / Developer Algorithm Linked Lists - 0of 0 votes
AnswersDesign a data structure for LRU where replacement can take up to O(log n ) time, searching take O(log n) time, inserting will also take only O(log n) time(Big question, I was given some time(around 5 to 10 minute) to think) ?
- sonesh January 01, 2013 in India for Strategies Group| Report Duplicate | Flag | PURGE
Goldman Sachs Software Engineer / Developer Operating System - 0of 0 votes
AnswersWhat is virtual memory, how operating system uses it ?
- sonesh January 01, 2013 in India for Strategies Group| Report Duplicate | Flag | PURGE
Goldman Sachs Software Engineer / Developer Operating System - 0of 0 votes
AnswerDraw a simple model of a Program Control Block ?, Now write a simple code and show all the sections in the code (means when this code will run then which section of the code go where in PCB) ?
- sonesh January 01, 2013 in India for Strategies Group| Report Duplicate | Flag | PURGE
Goldman Sachs Software Engineer / Developer Application / UI Design
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.