GeeksforGeeks

A computer science portal for geeks

GeeksQuiz
Login Home Algorithms DS GATE Interview Corner Q&A C C++ Java Books Contribute Ask a Q About Array Bit Magic C/C++ Articles GFacts Linked List MCQ Misc Output String Tree Graph

Adobe Interview | Set 1

Following are the details of Adobe Interview. Round 1 1. How will you implement a stack using a priority queue. Push and pop should be in O(1). 2. Three mislabeled jars problem.

Round 2 1. How does stack look in function calls? Given a recursive function call, how will the stack look like? 2. When does stack (process stack) overflow? What are the remedies? 3. What are balanced BSTs. Then he randomly gave me various numbers and asked me to create a BST. And to balance it. 4. Advantages of linked list over arrays. And arrays over linked list. 5. How are vectors implemented internally in the library. This question revolved around dynamic implementation of arrays. Then discussed the amortized time of the operations using dynamic implementation of arrays. Round 3 1. 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.
w h i l e ( l o c k ) ; l o c k=1 ; / / C r i t i c a ls e c t i o n l o c k=0 ;

Does this solve critical section problem. I answered that it will solve in uni processor system but not in multiprocessor system. Then he asked me to explain my answer. After a long discussion we came to a conclusion that this wont even solve in uni processor system. Then he asked me the solution to solve this. I did that using testandset instruction. 2. When a function is called in thread, what variables can be accessed from it. There was a long discussion on this too. I went in the wrong direction but corrected myself later. Stack variables are copied but heap variables are same. Round 4 1. What data structures will you use to implement a text editor. Size of editor can be changed and you also need to save the styling information for all the text like italic, bold etc. Round 5 HR Round: Normal HR questions. Source: Adobe Interview Questions 2013 Batch Thanks to Suresh for sharing Adobe Interview Questions. If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Related Tpoics:
Amazon Interview | Set 63 (For SDE-1) Amazon Interview | Set 62 (For SDE-1) Amazon Interview | Set 61 (For Internship) Amazon Interview | Set 60 (For Internship) Flipkart Interview | Set 3 Amazon Interview | Set 59 (Off-campus for SDE-1) Amazon Interview | Set 58 (On-campus for Software Development Engineer) Amazon Interview | Set 57 (Off-Campus for SDE-1)
Like 1 Tw eet 0 0

Writing code in comment? Please use ideone.com and share the link here.

1 Comment
Sort by Newest

GeeksforGeeks
Share

Login
Favorite

Join the discussion

leet

a year ago

For round 3 ,question 1 ,Can you please tell me what is the correct answer? I think as there will be a difference of time between instruction while(lock); and lock =1 then it would be possible for two processes to skip the loop as lock =1 has not been set.So both will enter the critical section.Please comment .. Thanks
/ *P a s t ey o u rc o d eh e r e( Y o um a yd e l e t et h e s el i n e si fn o tw r i t i n gc o d e )* /

Reply Share

Subscribe

Add Disqus to your site

GeeksforGeeks
Like

46,021 people like GeeksforGeeks.

Facebook social plugin

Interview Experiences Advanced Data Structures Dynamic Programming Greedy Algorithms Backtracking

Pattern Searching Divide & Conquer Graph Mathematical Algorithms Recursion

Popular Posts
All permutations of a given string Memory Layout of C Programs Understanding extern keyword in C Median of two sorted arrays Tree traversal without recursion and without stack! Structure Member Alignment, Padding and Data Packing Intersection point of two Linked Lists Lowest Common Ancestor in a BST. Check if a binary tree is BST or not Sorted Linked List to Balanced BST

654

Subscribe

Recent Comments
ATul Yup its only the left shift ie only... Interesting Facts about Bitwise Operators in C 3 minutes ago Rahul If we modify the node structure a little bit,... Find distance between two given keys of a Binary Tree 14 minutes ago

Guest If we modify the node structure a little bit,... Find distance between two given keys of a Binary Tree 19 minutes ago abhamish mishra @geeksforgeeks:disqus .. will the solution work... Find if two rectangles overlap 30 minutes ago niraj its a left shift will increase the value of N... Interesting Facts about Bitwise Operators in C 35 minutes ago hrithikg http://www.slideshare.net/gyan...... Local Classes in C++ 1 hour ago

In Memory Job Interview Interview Tips

How to Interview C++ Stack Overflow

Code Coding Java Coding Coding Job

@geeksforgeeks, Some rights reserved Contact Us! Powered by WordPress & MooTools, customized by geeksforgeeks team