ADOBE

Note : Written is very important. Score as much as possible. WRITTEN :Aptitude : 45 minutes. 45 questions. 15 on analytical and 30 on quantitative. Analytical were of very good quality, but quantitative were normal. Technical : C/C++ Programming (1 hour) and Engineering Questions(1 hour). C/C++ Programming : One programming : Check if the input string has correct parentheses. Rest 9 were on output : Based on concepts of string, array and union. Engineering Questions : 1. JVM has instructions that are know as bytecodes because they are only one byte long. What is the maximum number of instructions that are possible on such a machine? 2. 4 processes with memory 1gb, 2gb, 1.2gb and 4gb are given with the RAM of 4 gb. Options regarding how the processes will be on RAM. 3. Int i=0; while(i) ; i=1; /* Critical Section */ i=0; Options regarding whether this code will be able to provide concurrency mechanism on multiprocessor, single processor, etc. 4. Reverse a linked list. 5. Two sets of 'n' numbers are given A and B. Chose one element from A and one from B such that sum is equal to a given value, 'val'. 6. A 2d matrix is given filled with 1's and 0's. It is given that all 1's in a row come before all the 0's. Design an algorithm for finding the maximum number of 1's in a row. 7. Write a recursive function for multiplying two numbers, using addition. The number of addition should not be greater than the minimum of two numbers. 8. There are 'n' vertices and 0 edges of an undirected graph. What is the maximum number of edges that you can draw such that the graph remains disconnected. 9. Every number ending in a 3 has a multiple which consists only of ones. Eg. 3 has 111, 13 has 111111, etc. You have to write a C function which will take a number ending in 3 and will print the multiple consisting of all ones. The data structure that you use should consist only of primitive data types. Remember that the multiple may overflow a computers integer range, your function should be able to handle this. 10. Not able to remember.

INTERVIEW :Technical Round 1 : He asked about my subjects of interest. I told him Data Structures and Algorithms. Then he asked me questions mainly relating to Operating Systems. 1. 2. 3. 4. 5. What is mutex? How is it different from semaphore? What is race condition? How are processes different from threads? Puzzle : 15 horses, 5 can race at once. Determine 5 best. How is windows different from linux. In terms of Operating System architecture. (Long discussion on this.) 6. Questions about linux hierarchy. What is in /etc, /dev , etc. Technical Round 2 : Lots of questions. On C/C++ , Operating System, Computer Networking, Automata, Computer architecture and Embedded systems. 1. What is thrashing? Give examples of it in Operating System and Computer Networking. How do you resolve this problem (in both examples). 2. What is virtual memory? What limits it? 3. What is FTP? Is there an unreliable FTP ? 4. What does presentation layer do? Give examples. 5. Can there be a static function in a class? What are its properties? Can we declare const static function? 6. What is virtual destructor? 7. What is overloading and overriding? 8. Questions on protected and private inheritance. 9. Can a function be static? Properties of that function. 10. What is RTOS? 11. What is ISR? What is FLIH and SLIH? What is Interrupt Latency? 12. Questions on window sliding protocol. GBN, SR. 13. A C program does input, output, memory allocation/deallocation and computing. What changes should be made in it to convert it in a C++ program. 14. Showed me a state diagram, asked me whether it is DFA or NFA. Write its corresponding regular expression. 15. How does TCP connection gets established. 16. Page scheduling and process scheduling algorithms. 17. Showed me many C++ codes and asked what will happen when they are run. (One of them had a compilation error, i didn't notice it #epic fail) There were many other questions that he asked according to the answers that I gave him. Technical Round 3 : 1. Allocate memory for 2d matrix. 3 methods : using row+1, 2 and 1 malloc calls. What can be wrong with using only one malloc call. Which one is faster for accessing memory, out of method 1 and 2. Write code for freeing this 2d array. 2. Loop in a linked list problem. Loop in a BST. 3. He gave me a code, which added '\n' at the end of the string. Errors in that, how to remove

those errors. 4. Kadane's algorithm. 5. 5 solutions for Y-node problem. 6. Some more questions, all were simple but he wanted more solutions. HR Round : 1. 2. 3. 4. 5. 6. 7. Why do you want to join Adobe? Why should we hire you and not anyone else? Where do you see yourself in 5 years. Family background. Your key strengths and weakness. Questions on what I know about Adobe. Questions based on PPT.