Adobe Questions Collections



C++ 11 features : Lambda Functions, unique pointers and 1-2 more features which I dont remember exactly.


Virtual Functions,, How derived class functions can be accessed by pointer to base class.

Memory map of Derived Class when it is compiled : I gave vPointer and vTable explanation. He discussed in detail what all things get stored in vTable. Accessing Base Class functions .

Memory map of shared pointer object on compilation.


How is reference count shared between shared pointers ? What happens when copy constructor of shared pointer called.

Then came Mutex, Sempahores and Condition Variables. Wait and Notify purpose. When to use Condition variables.
Spurious wake up in case of wait() : This I did not know. He explained the term and its consequences, and why condition wait is in while loop rather than if check.
He asked about std::promise() and std::future(). Write code for set() of promise and get() of future and synchronize between them using lock and condition variables.
In the above discussion he also asked about RAII concept and stack unwinding in case of crash when mutex is locked.
Round 3: F2F Technical
He asked about current projects. Asked me to explain the architecture of the current project which I had done in C++.
Then He asked me to design an SDK which can handle concurrent calls from application : I proposed mutithreaded design for handling concurrent calls to the sdk. He asked me to draw class structures LLD . I explained design of ThreadPool factory class and how would you manage thread creation and destruction and other classes as well. But couldn’t meet his expectation. Not sure what he was looking for. I found the guy very weak in communication, considering him being at one of the higher positions in Adobe.




































































































Comments

Post a Comment

Popular posts from this blog

[13 Feb 2020] Check if a given sequence of moves for a robot is circular or not

Check if a given sequence of moves for a robot is circular or not Link:  https://www.youtube.com/watch?v=f7Zd8hEbCz0 Given a sequence of moves for a robot, check if the sequence is circular or not. A sequence of moves is circular if first and last positions of robot are same. A move can be on of the following. G - Go one unit L - Turn left R - Turn right Input: path[] = "GLGLGLG" Output: Given sequence of moves is circular Input: path[] = "GLLG" Output: Given sequence of moves is circular The idea is to consider the starting position as (0, 0) and direction as East (We can pick any values for these). If after the given sequence of moves, we come back to (0, 0), then given sequence is circular, otherwise not. N | | W -------------- E | | S The move ‘G’ changes either x or y according to following rules. a) If current direction is North, then ‘G’ increments y and doesn’t cha...
Read more

[16 Feb 2020] Given an array where every element occurs three times, except one element which occurs only once.

Find the element that appears once Given an array where every element occurs three times, except one element which occurs only once. Find the element that occurs once. Expected time complexity is O(n) and O(1) extra space. Examples : Input: arr[] = {12, 1, 12, 3, 12, 1, 1, 2, 3, 3} Output: 2 In the given array all element appear three times except 2 which appears once. Input: arr[] = {10, 20, 10, 30, 10, 30, 30} Output: 20 In the given array all element appear three times except 20 which appears once. Following is another O(n) time complexity and O(1) extra space method suggested by aj. We can sum the bits in same positions for all the numbers and take modulo with 3. The bits for which sum is not multiple of 3, are the bits of number with single occurrence. Let us consider the example array {5, 5, 5, 8}. The 101, 101, 101, 1000 Sum of first bits%3 = (1 + 1 + 1 + 0)%3 = 0; Sum of second bits%3 = (0 + 0 + 0 + 0)%0 = 0; Sum of third bits%3 = (1 + 1 + 1 + 0)%3 = 0; Sum of...
Read more

Which data structure is used in redo-undo feature?

Explanation:  Stack data structure is most suitable to implement redo-undo feature. This is because the stack is implemented with LIFO(last in first out) order which is equivalent to redo-undo feature i.e. the last re-do is undo first. Consider a situation where a client receives packets from a server. There may be differences in speed of the client and the server. Which data structure is best suited for synchronization? (A)  Circular Linked List (B)  Queue (C)  Stack (D)  Priority Queue Answer:   (B) Explanation:  Since packets need to be processed in First In First Out order, a queue can be used for synchronization. A data structure is required for storing a set of integers such that each of the following operations can be done in (log n) time, where n is the number of elements in the set. o Delection of the smallest element o Insertion of an element if it is not already present in the set Which of the following data structur...
Read more