Adobe Interview Questions
- 0of 0 votes
AnswersChar ch='Z'; ch is stored as
- Hmmm January 28, 2012 in United States
A. Z
B. ASCII value of Z
C Z with single quotes
D. A&B| Report Duplicate | Flag | PURGE
Adobe Testing / Quality Assurance C - 0of 0 votes
AnswersFind O/P
- Hmmm January 28, 2012 in United States
#define prod(x,y) x+y*x-y
main() {
print ("%d", prod(3,4));
}| Report Duplicate | Flag | PURGE
Adobe Testing / Quality Assurance C - 0of 0 votes
AnswersCan anyone tell me about the written test of Adobe . I will be greatly thankful to him
- Anonymous August 17, 2011| Report Duplicate | Flag | PURGE
Adobe - 1of 1 vote
AnswersQ1) Write a program to calculate height of a binary tree non - recursively ?
- Decipher August 13, 2011
Q2) Asked which data structure should be used to store browser history.
Q3) Find the anagrams with a huge list of words .
Q4) Mirror a tree iteratively.
Q5) Compute a+bx2+cx3+dx4+... efficiently (a,b,c...given)
Q6) Find one missing alphabet in an array of 26 alphabets(one alphabet repeated twice).| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
Answerswrite paranthesis matching code and to find palindrome .
- gubi August 09, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
AnswersIn an array find out the nth maximum number.
- dheeraj2311 August 06, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Arrays - 0of 0 votes
AnswersHow will you implement your own garbage collector in C.
- dheeraj2311 August 06, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer C - 0of 0 votes
AnswersThere is a 2d matrix and in each point there are some gold coins.
- dheeraj2311 August 06, 2011
Then starting from the bottom left point you have to collect the maximum number of points. The constraint is that you can only move in right and up direction.
Then asked me to optimize it
After that do it using recursion
Compare the two methods
Give a mathematical formula for this problem.| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Data Structures - 0of 0 votes
AnswersLowest common ancestor of bst
- dheeraj2311 August 06, 2011
After that modified it for binary tree| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Trees and Graphs - 0of 0 votes
AnswersGiven a large string . then you have to find out largest string such that all its character are consecutive . Asked me to write a neat C code for this problem.
- dheeraj2311 August 06, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer String Manipulation - 0of 0 votes
AnswersThis round was focused on DS only
- dheeraj2311 August 06, 2011
Reverse a link list
Gave me a link list in which loop is there. What will happen if we reverse such a kind of LL.
Detect loop in LL
Starting node at which loop is starting| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Linked Lists - 0of 0 votes
Answerswhat are threads and processes. what is the meaning of synchronization
- dheeraj2311 July 20, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Operating System - 0of 0 votes
Answersgiven a large chunk of memory. implement your own malloc and free function
- dheeraj2311 July 20, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
Answershow to find out if a point lies inside a triangle or not??
- dheeraj2311 July 20, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Math & Computation - 0of 0 votes
AnswersImplement BFS on a tree using an iterative stack or recursively?
- Anonymous July 19, 2011| Report Duplicate | Flag | PURGE
Adobe - 0of 0 votes
AnswersHow to prove the formula of binomial probability distribution ?
- Anonymous July 13, 2011
n
C (p^r)(1-p)^(n-r)
r| Report Duplicate | Flag | PURGE
Adobe - 1of 1 vote
AnswersSubArray whoes sum is maximum
- Nit July 10, 2011
#include<stdio.h>
int maxSubArraySum(int a[], int size)
{
int max_so_far = 0, max_ending_here = 0;
int i;
for(i = 0; i < size; i++)
{
max_ending_here = max_ending_here + a[i];
if(max_ending_here < 0)
max_ending_here = 0;
if(max_so_far < max_ending_here)
max_so_far = max_ending_here;
}
return max_so_far;
}
/*Driver program to test maxSubArraySum*/
int main()
{
int a[] = {-2, -3, 4, -1, -2, 1, 5, -3};
int max_sum = maxSubArraySum(a, 8);
printf("Maximum contiguous sum is %d\n", max_sum);
getchar();
return 0;
}| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
AnswersHow to build a heap from inoder traversal ?
- Anonymous July 09, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersThere is a river and there are n number of steps between two banks of the river to cross the river.
- alpeshvesuwala July 06, 2011
A frog wants to cross the river with the condition that he can jump max one step. Find the number of ways he can cross the river?
For e.g. if there are 3 steps in between, frog can go from paths: _123_, _2_, _13_ so there are 3 different ways frog can cross the river (in the example _ is two ends of the river)| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
Answerslargest unique substring in string efficiently
- Priti July 04, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersWhat is virtual memory?
- technew June 18, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Operating System - 0of 0 votes
Answerswrite a function which allocates two dimensional array dynamically
- truekool2 June 15, 2011
int ** allocate(int row, int col)| Report Duplicate | Flag | PURGE
Adobe Computer Scientist C - 0of 0 votes
Answersgiven power(x,y)implementation, find number of multiplications in power(5,12)( written test)
- truekool2 June 15, 2011
int pow(int x, int n)
{
if(n==0)return(1);
else if(n%2==0)
{
return(pow(x,n/2)*pow(x,(n/2)));
}
else
{
return(x*pow(x,n/2)*pow(x,(n/2)));
}
}| Report Duplicate | Flag | PURGE
Adobe Computer Scientist C