Adobe Interview Questions

ADOBE Interview Questions for Software Engineering , Software Testing , MTS

Written Test : http://gohired.in/2014/03/adobe-aptitude-c-language-written-test/

Before Starting to prepare for Aptitude and C language test
MOST IMPORTANT TO READ   is Adobe Interview Experience. Where You can see how was other people’s experience about Adobe Interview and How to crack Adobe in best way

1. 1. Implement insertion in tree (Java).
   2. Discussion on projects.
   3. Link List v/s BST
   4. How does strtok() works. How can you make it thread safe.
   5. Given an array, find number of pairs which equal to a given sum.
   6. A building has n steps. A person can take 1,2 or 3 steps. In how many ways can a person reach top of building.
   7. You have a stream of incoming integers. How will you store these numbers and implement following functions : GiveMax(), GiveSecond Max(), Delete Max(), DeleteSecondMax (), Add , Remove an element.ANSWER : Create HashMap , think for more logic
   8. Discussion on Merge Sort.
   9. Amortized Analysis of Heap Sort ANSWER : BestCase WorstCase analysis of Heap Sort
   10. Complete code for dictionary of words(Trie data structure)
   11. Design an LRU cache

Tips to crack ADOBE Interview Questions

Best Interview Preparation books :

c) How Would You Move Mount Fuji?: Microsoft’s Cult of the Puzzle — How the World’s Smartest Companies Select the Most Creative Thinkers : This book covers all good puzzles that can be asked as part of interview, when Interviewer wants to see your thinking ability.

1. Serialize and de-serialize the object in an optimized way( I gave him the idea of Spill overflow etc). I actually took a deep dive by optimizing in bit level) . After the algorithm, he made me design a library such that if there are 100 clients to my lib, it should be maintainable and flexible
2. C program for tail command of Unix using dynamic behavior
3. Implement a generic Object Oriented Stack
4. Reverse a string word by word in place without using the swap function. The string in not-editable.
5. There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration (comparison). All the nuts/bolts might have different diameter.
6. There is a paragraph having million characters. You have to find out the first non –repeating character in the complete paragraph. For example:- aab cld jb then answer should be :- c
7. Any base to any base conversion i.e base 11 to base 7
8. Multi-Threading i.e synchronization or usage of Volatile (Basic questions)
9. Garbage collection algorithms
10. There are chocolates each worth x. You have total amount y with you. And you can exchange z wrappers for 1 chocolate. So in this way how many chocolates he can eat.
11. There are N cities spread in the form of circle. There is road connectivity b/w city 1 and 2, then city 2 and 3 and so on till city n and 1. Each ith city has a petrol pump where you can pick pith petrol and distance between ith and i+1 th city is di . Assume you car has a mileage of 1km/litre. You have to find out if there exist any city, if you start from that city then you can visit all the cities either in the clockwise or anticlockwise fashion.
12. Design a transaction system for a bank with many atms across. He asked me if you want to deal with the bank how will you explain them the model and all the software and hardware requirements.
13. Write complete code for the number of ways a frog can reach nth step by jumping 1 or 2 steps.
14. Why inheritance is used. What is virtual memory and thrashing.norder and level order traversal and queue operations complexity.
15. Write complete code for the number of ways a frog can reach nth step by jumping 1 or 2 steps.
16. Replace a string with another string in a paragraph. Which data structure you will use. Complete code.
17. Implement a generic swap function. –Template
18. Contiguous 2-d matrix dynamically in C.
19. Spiral order traversal of a matrix. Complete code
20. Calculate Fibonacci for nth term. optimize the traditional solution.
21. Check if a number is a Palindrome or not.
22. Multiply two numbers without using * operator and using minimum number of additions.
23. Balancing of parenthesis.
24. Find the row with maximum ones in a 2D array where in each row all 1s occur before all 0s
25. Design a ladder and Snake Problem with TWO Player and Code it.
26. VIRTUAL CONSTRUCTOR, virtual destructor significance.
27. Array only 1 element is unique rest are 2 times. How to find that? He further extend if one unique and rest are multiple of 3.
28. Design rate Maze Problem.
29. Sum of two elements in an Array. Code it.
30. Random Pointer in Linked list. Clone it.
31. computer science topic which i proud of. Eg Map Reduce, MANET any thing
32. Page-Rank Algorithm, a lot of discussion, asked me to code it.
33. Write code for inverted index for MapReduce. Mapper and Reducer Functions.
34. Implement a stack using a priority queue. Push and pop should be in O(1).
35. Three mislabeled jars problem
36. When does stack (process stack) overflow? What are the remedies?
37. create a BST. And to balance it.
38. How are vectors implemented internally in the library. (dynamic implementation of arrays. Then discussed the amortized time of the operations using dynamic implementation of arrays.)
39. There was a question in written round that there is a global static variable ‘lock’ initially set to 0 and there was a code segment given.

while(lock);
lock = 1;
//Critical section
lock = 0;
Does this solve critical section problem in Uni and Multiprocessor ?

50. What data structures will you use to implement a text editor.
51. When a function is called in thread, what variables can be accessed from it.
52. Write a program to search an element in a row-wise and column-wise sorted 2-dimesional array
53. Write a program to convert a binary tree to binary search tree.
54. OS related questions Deadlock,Mutex, Semaphore, IPC etc.
55. Declaration, memory allocation difference between new/malloc, free/delete and details about how memory allocation takes place.
56. Design a chess game.
57. Write a recursive function to print directory structure. Two function were given isfolder() and openfolder().
58. Write proper running code for heapsort
59. Convex Hull problem
60. given a set of points in a plane, how would you make the most optimized triangular mesh-each point is a vertex of a triangle.
61. Intersection of two lines in a plane, if they intersect- determine the point of intersection.
62. Implement the qsort() in c/sort() in c++ library or your own custom sort which will sort any type of data on user defined criteria.
63. How much memory is made available to a user program by the kernel, is there any limit to it? What is the range of addresses a user program can have at max, what determines it?What happens if excess memory is allocated to a user program, say malloc in an infinite loop?
64. What is the difference between mutex and a semaphore. Write down a crude implementation of both. How would you solve the mutual exclusion problem using semaphore
65. Write a pseudo code for Singleton Pattern.
66. Difference between process and thread. Give me a real life example where thread can be used.
67. onsider a recursive function with no end condition and architecture of your own laptop. What will happen? After how much time will the program crash.
68. Write a client server simple code. How will you handle multiple requests?
69. What is Load Balancer?
70. How google handles 1 billion request in 1msec.
71. Implement a stack where you can search an element in the data structure. He asked me to optimize the solution
72. Two strings were given. You have to find whether they are permutations of each other.
73. There is a stream of incoming integers, how would you maintain its median using a minHeap and a maxHeap.
74. You have the start time, end time and index number of racers in a race. You need to tell the rank of each racer. The rank is calculated as following: if racer B starts after racer A but finishesbefore racer A, then the rank of racer A increases by 1.

Eg,

Index             Start Time                   End time

0                    100                                170

1                   80                                  150

2                   120                                165

3                  110                                145

Output

Index             Rank

2                     0

3                     0

1                     1

0                     2

75. How would you determine if a coin is biased or not. Does the degree of biasity effect the number of experiments you have to perform?
76. Given an integer N . tell if it is power of 3 or not.
77. Given infinitely long character array.
    replace all occurrence of particular word with another word of larger length. Solution should be inplace can do copy only one time.
    g.
    Gandhi was born in 1969. Gandhi was from gujrat.
    replace gandhi with mahatma
78. Given a binary search tree delete any node in tree.

ADOBE SDET Testing Interview Questions

1.  Test cases for mail attachment(word doc) not being opened scenario
2. WAP to convert a binary to decimal
3. WAP to print sum of first ‘n’ prime numbers
4. What is op of following

String s = “Hello  “;
s+ = “Adobe  “;
s.trim();
System.out.print(s);

5. What is the testing framework you have used in Android.What is the approach you follow while testing any product.How do you test a method which does not return any value
6. What is memory leak
7. What is the difference between instance variable and local variable
8. If i write java in command prompt from anywhere in system, will it work?If not, how to make it work.
9. Is JVM platform dependant?On what factors it depends?
10. WAP to find out factorial of a number. write the testcases and handle the overflow condition and border cases in the code
11. Write a code for ternary search. Is it better than Binary? He asked me to generalize the search and asked me which is the optimum.
12. I have a hard disk of 100 gb.It has one and only file of 80 GB (database backup).
    What happens if i delete it and it goes to recycle bin.
13. Is the memory freed from the hard disk.
    What happens if i move it from one drive to another.
    What happens in case of permanent delete.
    What happens when we format the disk.
14. Puzzle:10 containers with 100 balls each but one container defective.Find out the defective container in minimum weighings.
15. What is virtual memory.
16. There is one fb user in India and another in US.When they communicate, do they connect to same server. If not then how does the communication happen?What is the data that is being transferred.
17. Test Cases of Mobile for rural area for hardware as well as software point of view.
18. Design a clock in which if you want to know about time in any region of this world, you can know .Hardware given is such that it has already built calculation device inside it.
19. Write a C/C++ function for removing extra spaces in given sentence
20. Write a various test cases for checking the functionality of Adobe reader while saving it
21. Find a 3 digit Number abc such that abc=a!+b!+c!. Ans is 145.
22. Write a C code for converting a string from a2b2c5 to aabbccccc. Then make it generalize. Various Test cases of it
23. Puzzle : There is a pond in which there is x kg ice on 1st November, it becomes 2x on 2nd November then 4x,8x,16x,32x and so on.Like this whole pond is filled with ice on last day i.e. 30th November. On which day pond was filled with half the ice ?
24. Puzzle: you have 100 coins on table, 60 heads and 40 tails. With your eyes closed, how can you separate the coins into 2 groups such that each group has same number of tails.