Adobe Interview Questions
- 0of 0 votes
AnswersGiven a binary number in string form, write a function to return its two's complement in string form.
- Parbays April 14, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersWithout using /,% ,+and * operators. write a function to check whether a number is divisible by 3 or nor??
- abhishek April 12, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Coding - 0of 0 votes
Answershow do you count set bits in a Float number?
- mangal.govind April 11, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Knowledge Based - 0of 0 votes
Answersyou have only two functions
- mangal.govind April 11, 2012 in India
1.Loop(count) : Loops for count times
2.Increment(Count): increases a number count times
How would you achieve A-B using only these two operations?
Remember you have no operation like comparison,bit-wise operations or anything, just these two you have......| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Knowledge Based - 0of 0 votes
Answerscode for MS Paint program. N*N pixels area. given pixel and color, change color in pixel to desired color and if adjacent pixels are of same color change them too. efficient algorithm with place and time complexity
- helpme March 01, 2012 in United States| Report Duplicate | Flag | PURGE
Adobe Developer Program Engineer Algorithm - 0of 0 votes
AnswersDecimal number system - { 3 }.i.e a decimal number system without 3.
- Gaurav February 29, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersFind all such number in a matrix if maximum of the row and minimum of the column is same number.
- Gaurav February 29, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Arrays - 0of 0 votes
AnswersGiven a queue with functions as enqueue(), dequeue(), and findmax(). You can use these functions any time. The findmax() should return the largest value in the queue at that point. You can use auxiliary space.
- nihaldps February 21, 2012 in India
Implement the queue with given operations. Find the max value in the queue.| Report Duplicate | Flag | PURGE
Adobe Computer Scientist Data Structures - 0of 0 votes
AnswersDo a merge of two binary trees and tell what the complexity of the merging is. The trees consist of m and n nodes respect.
- nihaldps February 21, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Computer Scientist Trees and Graphs - 0of 0 votes
AnswersReverse a stack without using extra stack (i.e. doing in place reversal). (hinted about using double recursion).
- nihaldps February 21, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Computer Scientist Stacks - 0of 0 votes
AnswersDelete a given node of a linked list, when you do not have info about the head or any other node.
- nihaldps February 21, 2012 in India
The prototype of the function is -
void delete (Struct node* x)
where x is any arbit node of a linked list.| Report Duplicate | Flag | PURGE
Adobe Computer Scientist Linked Lists - 0of 0 votes
AnswersGiven a graph (consider it to be a mxn grid). The nodes are node of a binary tree with left and right pointers. The start point (A) is at the left upper corner and the end point (B) is at right bottom corner. Each node points to its adjacent nodes in the grid (the right pointer points to the node on the right and the left points to the node just below it). The nodes at the lower and right edges will have child as null (right null for the right side edge and left null for the bottom edge). The end node at B is having both as null.
- nihaldps February 21, 2012 in India
How many paths are possible which can lead you to B, if you start from A?| Report Duplicate | Flag | PURGE
Adobe Computer Scientist Trees and Graphs - 0of 0 votes
AnswersYou are give n images with width length dimensions w1*l1,w2*l2........wn*ln .Now you have write an algorithm to fit these n images on a big rectangle of dimension W*H.
- rahul baid February 17, 2012 in India
Constraint:
1)Image resolution should not be changed.you can scale the images keeping aspect ratio unchanged
2)You can perform cropping but as minimum as posisble| Report Duplicate | Flag | PURGE
Adobe Algorithm - 0of 0 votes
AnswersTake an input as integer from user. Check whether it's a palindrome. Say-23432, the answer is true. Check boundary conditions for the input. Consider all cases--+ve/-ve numbers.
- Mike February 14, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer in Test Algorithm - 0of 0 votes
AnswersGiven an n*n matrix. Print the main diagonal elements starting from bottom-left to top-right.
- Mike February 14, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer in Test Algorithm - 0of 0 votes
AnswersAn array contains only 0's and 1's. Code the best way to sort it( Time complexity and space complexity). Length of the array could be very large.
- Mike February 13, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer in Test Algorithm - 0of 2 votes
AnswersOut put ?
- Hmmm January 29, 2012 in United States
#define SQUARE(x) x*x
main() {
int s;
s = 64/SQUARE(4);
print ("%d", s);
}
A. 4 B. 64 C. 16 D. 128
Ans: Answer is 64 -> 64/4*4| Report Duplicate | Flag | PURGE
Adobe Testing / Quality Assurance C - 0of 0 votes
AnswersQuestion on &&, || and ++ operator. Give an expression with combination of these operators and asked to choose evaluated output.
- Hmmm January 29, 2012 in United States| Report Duplicate | Flag | PURGE
Adobe Testing / Quality Assurance C - 0of 0 votes
Answersmain() {
- Hmmm January 29, 2012 in United States
int *p;
print ("%u %u", *&p, &*p);
}
A. Address Address B. Value Address
C. Address Value D. Compilation Error| Report Duplicate | Flag | PURGE
Adobe Testing / Quality Assurance C - 0of 0 votes
AnswersOutput ?
- Hmmm January 29, 2012 in United States
main() {
int x = 2;
switch(x) {
case 1.5: print ("One");
case 2.5: print ("Two");
default: print ("Zero");
}
}
A. One B. Two C. Zero D. None| Report Duplicate | Flag | PURGE
Adobe Testing / Quality Assurance C - 0of 0 votes
AnswersAsked these three questions which are similar but not same.
- Hmmm January 29, 2012 in India
Q1: Output ?
int main() {
int i=-3, j=2, k=0, m;
m = ++i && ++j || ++k;
printf ("%d %d %d %d", i,j,k,m);
return 0;
}
Q2: Output ?
int main() {
int i=-3, j=2, k=0, m;
m = ++i || ++j && ++k;
printf ("%d %d %d %d", i,j,k,m);
return 0;
}
Q3: Output ?
int main() {
int i=-3, j=2, k=0, m;
m = ++i && ++j && ++k;
printf ("%d %d %d %d", i,j,k,m);
return 0;
}| Report Duplicate | Flag | PURGE
Adobe Testing / Quality Assurance - 0of 0 votes
AnswersWhich of the following cannot be checked in switch - case statement ?
- Hmmm January 29, 2012 in United States
A. Char B. Int C. Float D. enum
Ans: I verified, answer is C (float).| Report Duplicate | Flag | PURGE
Adobe Testing / Quality Assurance C - 0of 0 votes
AnswersCalculate how many IP addresses are available in IPv6 address.
- Hmmm January 28, 2012 in United States| Report Duplicate | Flag | PURGE
Adobe Testing / Quality Assurance C - 0of 0 votes
AnswersExplain stic key word while function declaration.
- Hmmm January 28, 2012 in United States| Report Duplicate | Flag | PURGE
Adobe Testing / Quality Assurance C - 0of 0 votes
AnswersGiven Infix expression and asked find postfix exp.
- Hmmm January 28, 2012 in United States| Report Duplicate | Flag | PURGE
Adobe Testing / Quality Assurance C - 0of 0 votes
AnswersProgram to count leaf nodes in binary tree.
- Hmmm January 28, 2012 in United States| Report Duplicate | Flag | PURGE
Adobe Testing / Quality Assurance C - 0of 0 votes
AnswersWrite program to find 2-nd largest element in an array with single loop.
- Hmmm January 28, 2012 in United States| Report Duplicate | Flag | PURGE
Adobe Testing / Quality Assurance C - 0of 0 votes
Answersout put
- Hmmm January 28, 2012 in United States
main() {
unsigned int x;
int y;
x=3;
y=-2;
if(x>y)
pf ("x is greater");
else pf("Y is greater");
}| Report Duplicate | Flag | PURGE
Adobe Testing / Quality Assurance C - 0of 0 votes
AnswersO/P of the program
- Hmmm January 28, 2012 in United States
main() {
int *inptr, temp;
temp=10;
intptr=&temp;
char *chptr;
*chptr=*intptr
print "%d %d", sizeof(inptr), sizeof(chptr);
}| Report Duplicate | Flag | PURGE
Adobe Testing / Quality Assurance C