Adobe Interview Questions
- 0of 0 votes
AnswersWhat is transient variable?
- Anonymous March 11, 2010| Report Duplicate | Flag | PURGE
Adobe Java - 0of 0 votes
AnswersWrite an algorithm to find if 2 binary trees are equal (as in the data of the 2 are equal)
- Anonymous March 11, 2010| Report Duplicate | Flag | PURGE
Adobe Algorithm - 0of 0 votes
AnswersWhy would you use the JSPs and JavaBeans in a web application?
- Anonymous March 11, 2010| Report Duplicate | Flag | PURGE
Adobe Java - 0of 0 votes
AnswersWrite a program which prints itself. and no input is provided.
- k.l February 13, 2010| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
AnswersThis is a question on scheduling meeting in a calendar.
- MyFirstOne February 11, 2010
Suppose we want to schedule a meeting amongst 3 employees. When we select them it has to show available time slots free for a meeting.
Example:
Emp A: 9:15 to 10:15; 10:20 to 11:20
Emp B: 9:30 to 10:00; 10:25 to 11:15
Emp C: 9:00 to 10:00; 11:00 to 11:10
...| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersHow will you dynamically allocate 2D array? Use 2 malloc and then do the same thing using only 1 malloc.
- spsneo January 25, 2010| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer C - 0of 0 votes
AnswersMerge 2 sorted arrays in constant space and minimum time complexity
- Anonymous January 10, 2010| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersGiven a file with millions of lines of data. 2 lines are identical, rest all are unique. Each line is so long that it may not even fit in memory. What is the most efficient solution for finding the identical lines?
- Anonymous January 10, 2010| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersConvert in O(n) time:
- Anonymous January 10, 2010
a1a2a3a4.....aNb1b2b3b4.....bN
to
a1b2a2b2a3b3a4b4..........aNbN| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersConvert a binary search tree to a sorted doubly linked list
- Anonymous December 20, 2009
inplace.| Report Duplicate | Flag | PURGE
Adobe Microsoft Software Engineer / Developer Data Structures Trees and Graphs - 0of 0 votes
AnswersWhat are the disadvantages of using pointer?
- Twitty November 12, 2009| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer C++ - 0of 0 votes
Answershow to count no of occurrence of a particular word in a given file of text. [c/c++] And if file is very large hw will u go about it.
- Twitty November 12, 2009| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
AnswersWhat is better Inheritance or Composition and why ??
- Rats November 01, 2009| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer General Questions and Comments - 0of 0 votes
AnswersThere is an sorted array containing some no. Now a no is chosen randomly and all the no on left are shifted downwards and all the no on right are shifted upwards now if have to find any no in the new array what will be the best algorithm?
- twits October 24, 2009| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersWrite a program htoi(char *) to convert a given hexadecimal value to decimal.
- Vaishnavi September 21, 2009| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer C - 0of 0 votes
AnswersSuppose you want to implement an ADT on a set of integers S with the following operations:
- klpd September 15, 2009
• insert (k ) - Places k into S
• extract min(S ) - Removes the smallest element from S
• extract max(S ) - Removes the largest element from S
• min(S ) - Returns (but does not remove) the smallest element from S
• max(S ) - Returns (but does not remove) the largest element from S
Explain how to do this so min and max take O(1) time while insert, extractmin, and extractmax
take O(log n) time.| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Data Structures - 0of 0 votes
AnswersFind the transpose of a square matrix using recursion
- random September 11, 2009| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersTo find the sixth largest number in the array without changing the array and without taking extra o(n) space and in o(n) time complexity.
- ankit gupta August 07, 2009| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Arrays - 0of 0 votes
Answersdiff between malloc and calloc
- Anonymous July 31, 2009| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer C - 0of 0 votes
Answersassembly code to count 1st n numbers.
- Anonymous July 31, 2009| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Coding - 0of 0 votes
Answersflip all odd bits of a number.
- Anonymous July 31, 2009| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
Answersprint all permutations of a string.
- Anonymous July 31, 2009| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersWrite a c program to search for an element in a binary tree[not BST] and if found return its level. root is labelled level 0 and children are one level incremented than its parent.
- technicalChaos July 21, 2009
if not found return -1| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Trees and Graphs - 0of 0 votes
AnswersAmazon has many visitors to its site. And it tracks what pages the customers visited, etc and other stuff. Lets say you store the data of customer id and the page id as a record in a log-file. Now assuming that you have created one log file for each day with that above data-format. Give me the way to find all the customers who made a visit on day1 and day2 and visited atleast two different pages. Say a customer visited two different pages on day1 and then comes back on day2 and visited some other page on day2 he should be listed.
- Viswanatha Reddy June 06, 2009
Lets say the logfile1 has contents like:
c1 p1
c2 p2
c1 p3
c3 p4
c5 p6
And logfile2 has contents:
c10 c7
c4 p4
c3 p4
c5 p1
c1 p2
c2 p1
Then the customers you print out are c1, c2, c5.| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersWrite a program (psuedocode is fine) to implement file diff utility
- Roberto May 29, 2009| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm Coding - 0of 0 votes
Answersimplement a counting semaphore in Java.
- maverick May 06, 2009| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Java - 0of 0 votes
AnswersWrite a function which performs some task e.g. of adding 2 no. and return sum to the main function. now there is nothing wrong with the function syntax wise but the program crashes after the execution of return statement.
- sun May 03, 2009| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Coding - 0of 0 votes
AnswersYou are given a plotter which can plot points provided to it in the form of 'x' and 'y' coordinates. The plotter hand can move horizontally or vertically only. Your program will be given a list of 'n' coordinates in the form of {(x1,y1), (x2,y2} ... (xn,yn)}. Your program must print a sorted list of all 'n' points that would represent the least cumulative distance for the plotter hand to plot all 'n' points in that sorted order. If you are feeling adventurous - modify the program to provide the same output if the plotter can also move diagonally
- Jack April 29, 2009| Report Duplicate | Flag | PURGE
Adobe Analyst - 0of 0 votes
AnswersOil excavation is a common phenomenon in the sea. At every excavation site a rig is setup to extract the oil. The only mode to reach a rig is by a boat. Men who would like to reach a rig use special purpose boats which can run on crude fuel available at the rigs and the shore. These boats can run a mile for every unit of fuel they consume. Each man on the boat consumes a unit of food for every mile he travels. Boats have a limited load capacity. The net weight, including the weight of fuel, food and the men, on boat should never exceed its load capacity. The weight of one unit of fuel is same as the weight of one unit of food. However, as the rigs are far from the shore in the sea it is usually a very long sail. The capacity of the boat available for fuel may not be sufficient to reach the destination rig directly. In such cases, the men may goto a near by rig to load required fuel. The men can also store food at the rigs as well as at the shore for later consumption. They must buy all the food they require to reach the destination rig at the shore only. And all the men who started should be together throughout the sail.
- Jack April 29, 2009
You should now write a program which can help these men decide the minimum amount of food they require to reach the destination rig. The positions of rigs and the boat's starting point are indicated as co-ordinates of a two dimensional plane with x and y axises of 1 mile units. Food at shore is available only in whole units.
Assume that the food and fuel are consumed continuously, that is if you travel a partial mile the number of units of food and fuel consumed is equal to portion of mile traveled.
Input
The first line of input has a list of integers terminated by -1. The first integer is the capacity of the boat. The integers following it up to -1 are the weights of men who need to reach the destination rig.
Lines following will have two integers separated by a space, each line indicating the x and y coordinates of a coordinate pair respectively. The input will be terminated by a coordinate pair (0,0) and this should not be processed. The first co-ordinate pair indicates the position of the boat's starting point. The last coordinate pair indicates the position of the destination rigs. All other points indicate the position of various rigs in the sea in a random order.
Output
Your program should print the minimum amount of food required to reach the destination. If it is not possible to reach destination, then the program should print -1.
Samples
Sample Input 1:
250 20 30 -1
10 -20
-10 5
30 15
15 35
0 0
Output 1:
111
Sample Input 2:
300 15 20 30 -1
10 -20
-10 5
30 15
-30 45
0 0
Output 2:
807
Sample Input 3:
150 20 30 -1
1 1
100 100
0 0
Output 3:
-1| Report Duplicate | Flag | PURGE
Adobe Analyst Algorithm - 0of 0 votes
AnswersOne of the cherished customs of my childhood was choosing up sides for a cricket game. We did it this way: The two bullies of our gully would appoint themselves captains of the opposing teams, and then they would take turns picking other players. On each round, a captain would choose the most capable (or, towards the end, the least inept) player from the pool of remaining candidates, until everyone present had been assigned to one side or the other. The aim of this ritual was to produce two evenly matched teams and, along the way, to remind each of us of our precise ranking in the neighbourhood pecking order.
- Jack April 29, 2009
We all believed this was the fairest process, but does it ensure the fairest selection of players with evenly matched teams? We believed so, but then there were times when, as the game progressed we realized that the other team was stronger than ours and may be an exchange of a couple of players between the teams would have made them balanced. That scope of improvement seemed to be there...
Here, we need to find a way to create two evenly balanced teams for any game(or as evenly balanced as possible considering the strength of each player). A set of players must be divided into two teams. Each player must be on one team or the other; the number of player on the two teams must not differ by more than 1; each player will have a skill-point associated with him. The total skill-points of the players on each team should be as nearly equal as possible.(The absolute difference of the sum of skill-points of players in each team should be the least).
Input:
The first line of input shall contain N, the total number of players. N lines will follow with the first line giving the skill-point of person 1; the second line, the skill-point of person 2; and so on. Each skill-point shall be an integer between 1 and 450. There shall be at most 100 players in all.
Output:
Your output should be a single line containing 2 numbers: the total skill-points of the players on one team, and the total skill-points of the players on the other team. Print the smaller sum first.
Sample Input 1:
3
90
200
100
Output 1:
190 200
Sample Input 2:
10
2
3
10
5
8
9
7
3
5
2
Output 2:
27 27
Sample Input 3:
10
1
1
1
1
1
1
1
1
1
9
Output 3:
5 13
Sample Input 4:
8
87
100
28
67
68
41
67
1
Output 4:
229 230| Report Duplicate | Flag | PURGE
Adobe Analyst Algorithm