Adobe Interview Questions
- 0of 0 votes
AnswersFind the median in B-tree of order 4? Note that as the tree has order 4, it is not a binary tree.
- purnima chandrasekhar April 20, 2009| Report Duplicate | Flag | PURGE
Adobe Development Support Engineer Algorithm - 0of 0 votes
AnswersYou have N computers and [Ca, Cb] means a is connected to b and this
- code_pro March 15, 2009
connectivity is symmetric and transitive. then write a program which checks that
all computers are interconnected and talk two each other| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersProve that 2^(2n) = O( 2^(2n) )
- Big O February 11, 2009
^ = power of| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Math & Computation - 2of 0 votes
AnswersYou are given a lot of cuboid boxes with different length, breadth and height. You need to find the maximum subset which can fit into each other.
- Me January 21, 2009
For example:
If Box A has LBH as 7 8 9
If Box B has LBH as 5 6 8
If Box C has LBH as 5 8 7
If Box D has LBH as 4 4 4
then answer is A,B,D
A box can fit into another only and only if all dimensions of that is less than the bigger box. Also Rotation of boxes is not possible.| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 1of 0 votes
AnswersGiven a set of coin denominators, find the minimum number of coins to give a certain amount of change.
- spiderman January 16, 2009| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
AnswersHow will you test a function that generates random numbers?
- spiderman January 16, 2009| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
AnswersYou are given an array which represents the heights of every bar of a histogram. Now all these bars are contiguous (juxtaposed wrt each other) and have the same width.
- spiderman January 16, 2009
For Example, A={2,1,4} represents a histogram having 3 bars of height 2,1and 4 in that order. Now you need to find a rectangle in this histogram that has the maximum area.
See figure: http://www.ocf.berkeley.edu/~wwu/YaBBAttachments/hist_rect.gif
Time Complexity: O(n)
Space Complexity:O(1)| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
AnswersYou are given a wooden log of length n. It has n+1 grooves marked on it from 0 to n. You are given an array containing numbers within the range of 1 to n-1. These elements of the array represents the points on the log at which u need to cut the wooden log. Now the cost of cutting a log is proportional to the length of the original log being cut.
- spiderman January 16, 2009
Eg: n=15 and A={1,5,9}
Now when u make a cut at 1, the cost is n (the size of original log)
When u cut at 9, the cost will be n-1 as the length of the new original log is 1 to n i.e n-1
When u cut at 5, since 5 lies between 1 and 9 and the length of this log is 9-1=8, so the cost will be 8.
Hope the situation is clear now...
The question is: given the value of 'n' and the Array A containing the points at which u need to make a cut, find the order in which the cuts must be made in order to minimize the total cost of cutting the wooden log.| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 2of 0 votes
AnswersMinimum Common ancestor of given two values in the Binary tree
- Adobe October 03, 2008| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Trees and Graphs Algorithm - 0of 0 votes
AnswersWhat is the difference between these two statements
- Adobe October 03, 2008
void (*p) (void *a[],int n)
void *(*p[]) (void *a, int n)| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer C - 0of 0 votes
AnswersWrite a function to add two numbers, without using any arithmetic operator. Even the ++ in for statement is not allowed
- Anonymous July 26, 2008| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Coding Algorithm - 0of 0 votes
AnswersIf u have to write your own printf and u don't have va_arg how would you get the arguments in the variable list.
- Anonymous July 26, 2008| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer C - 0of 0 votes
AnswersWrite function similar to malloc.
- Anonymous July 26, 2008
void* myMalloc(int n)
'n' is the num of bytes to allocate.
You are given a void* f pointer that points to the location free in the memory.| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer C Coding - 1of 0 votes
AnswersWrite the function my2DAlloc.
- Anonymous July 26, 2008
Minimize the number of calls to malloc.
Also, the memory should be accessible by the notation arr[i][j].| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer C - -2of 0 votes
AnswersI am trying to write a program to find the longest word made of other
- anonymous May 24, 2008
words. For instance, If my file has the following words (sorted):
test
tester
testertest
testing
testingtester
The longest word should be testingtester. I am trying to use "Trie"
for this. But, I guess there might be some problem in using this. Can
you suggest me any other better solution for this?
Thanks in advance| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Coding - 0of 0 votes
Answersstruct Object {
- Flying Machine March 04, 2008
// THESE FIELDS ARE ALREADY DEFINED; YOU MAY NOT MODIFY THEM
Object* next_ptr; // Next object in list; NULL if end of
list.
unsigned int ID; // unique identifier for this object.
unsigned int parent_ID; // 0, if object is root of tree.
// THESE FIELDS REPRESENT THE TREE WHICH NEED TO BE FILLED
Object* parent_ptr; // Initialized as NULL.
unsigned int child_count; // Initialized as 0.
Object** child_ptr_array; // Initialized as NULL.
} ;
Need to implement the method:
Object* convert_List_To_Tree (Object* list_head);
This returns the pointer to the root node| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
Answersdifference between Array and link list
- Maria January 21, 2008| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersWrite code (in C) to convert a binary search tree into a sorted doubly linked list. The algorithm should use recursion and should be done in place.
- Ravi Kant Pandey April 25, 2007| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Coding Algorithm Linked Lists - 0of 0 votes
AnswersWrite a C code to conert a binary search tree to a linked list
- amar April 14, 2007| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm Linked Lists - 0of 0 votes
Answerstwo link lists starts from head1 and head2 but their some nodes are common as shown below so they end at the same node
- Ravi Kant Pandey March 28, 2007
like
a-b-c-d-e-f-
g-h-i
x-y-z-w-
write an algo to find the first commom element of the list ie g.| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
Answerswrite a program to find whether the m/c is big endian or little endian
- Gaurav February 03, 2007| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Coding