Learn and practice the placement papers of Adobe and find out how much you score before you appear for your next interview and written test.

IndiaBIX provides you lots of fully solved Adobe Placement Papers with answers. You can easily solve all kind of placement test papers by practicing the exercises given below.

## How to solve Adobe Placement Papers?

You can easily solve all kind of questions by practicing the following exercises.

### Adobe Fresher Placement Paper : At MNNIT ALLAHABAD : July 2010

Posted By : Ramanan Rating : +14, -1

Type : Fresher, Job Interview
Exam Date: 17th July 2010
No of Rounds : Screening Test, Aptitude Test, Technical Round-1,  Technical Round-2

WRITTEN ROUND:
Section 1 - 45 mins
15 Ques. Analytical Analysis
30 Ques. Quantitative Analysis (too much easy from my point of view)

Section 2 - 90 mins

Paper 1:
1. There are N address lines in the procesor, which is true regarding  the virtual space of the running process
a. there is no limit on virtual space
b. 2^N bytes in virtual space
c. it depends upon size of RAM
d. Nothing can b said or none of the above( i m not sure abt  this option)

Question : 2
A. threads share memory at heap
C. (this option was related to somthing death of thread then wat happens to  other child thread)

D. thread improve efficiency in multiprocessor system
a. only A
b. Only A & D(or may b option was Only A &C)
c. Only A,C,D
d. none of the above

3. in this a BST was given and u have to find average search for a number of  keys then select the appropriate option for that average value

4. if there N processors in a multiprocessor system them wat is the order of  summing N numbers
a. log n^2
b. log n/2
c. log n
d. n*n

5. indented set of loops were given then u have to find number of the times the  function will b called in the most interior loop. loop was varying like i=1 to N  then inner one j=1 to i then so on....

6. relation sum of degree of each node of the graph and number of edges (may  vertex i dont remember and even dont want to think much more about it) then  relation between number of vertex and number of edges in the graph.

7. write a function with arg NODE *p , NODE* q such that it inserts q between  p and p->next

8. calculate power of a number and complexity of your process.

9. program to find whether a point lies in a traingle or not u were not supposed  to check that the given 3 points representing traingle form a traingle coz u  were allowed to assume that they form a traingle(hint :- there was hint  something related to area i actually dont remember that bt that hint applies  that u have to calculate area of the given traingle then u have to find area of  three traingle formed by the given point and points of the traingle and if they  are equal then point is inside the traingle).

10. write a function for y=a0+a1x+a2x^2.........+anx^n-1 (i actually dont  remember question the question completely because i havennt done this ques)

Paper 2:
1. a union was given with member int and pointer then u have to tell  what will sizeof return
2. difference between calloc and malloc

3. int fun(int n)
{
unsigned static int b=2;
int a=3;
/*some simple code was also there bt i dont remember that with action performed  on a and b*/
return (n+a+b)
}
o/p when u will call printf("%d %d",fun(4),fun(5))

4.write a function to return index of string s where that index represent  righmost occurenece of string t in s
5. write a function to flip odd bits of a unsigned int
6. write a function to print sum of two unsigned integer if there is no overflow  otherwise print a message that overflow is happening
7. write a function to generate all anagrams of a string

8. struct node{
int data;
struct node *prev,*next;
}

if a head pointer is given to the list having the above structure then print  the item in the reverse order that is from end to starting (nothing was given  whether list is doubly linked list or circularly double linked list in all there  was no information abt how list is being mantained).

9. suppose u write this line on command line myprog.exe hello world then u  have to print world hello myprog.exe

10. write a program to swap to interger pointer