GeekInterview.com
   Home |  Tech FAQ  |   Interview Questions |  Placement Papers |  Tech Articles |  Learn |  Freelance Projects |  Online Testing |  Geeks Talk |  Job Postings |  Knowledge Base | Site Search |  Add/Ask Question

  GeekInterview.com  >  Placement Papers  >  Adobe  >  Placement Papers

 Print  |  
Question:  HI Everybody,
I attended Adobe test on 16-07-2006. it was cool test. The test was 3 hours. I am sending u Questions Asked on Engineering and C. Merit-Trac conducted the test. The test was for both Developmnt & testing Domain. I attended for Dev posn.

ADOBE Written Test

1) Wap to reverse a linked list and sort the same.

2) Given two integers A & B. Determine how many bits required to convert
A to B. Write a function int BitSwapReqd(int A, int B);

3) Write an algorithm to insert a node into sorted linked list.After inserting,
the list must be sorted.

4) Without using /,% and * operators. write a function to divide a number by 3.
itoa() function is available.

5) Wap to swap two integer pointers.

6)Write a funcn int round(float x) to round off a floating point num to int.

7) write an ALP to find sum of First n natural numbers using the following Instructions

LDA num ; load Accumulator with num
DCR R ; decrement Register R
INR R ; increment Register R
MOV x,y ; move the contents of register y into register x
JZ label ; jump to label if A=0
DJNZ label; Decrement & Jump if A <> 0
you can use B & C registers in addition to A register

8) Find the n th node in a Singly Linked list starting from the End in a Single Pass.

9)prove that a tree is BST.what is height of a tree?

10) Given A,B & C Boolean polynomials.Prove That (A+BC)=(A+B)(A+C)




May 05, 2007 04:14:48 #10
 mrinmoy   Member Since: Visitor    Total Comments: N/A 

RE: HI Everybody, I attended Adobe test on...
 

2) Given two integers A & B. Determine how many bits required to convert
A to B. Write a function int BitSwapReqd(int A, int B)

#include

void showbits( int n);

int main()
{
    int a,b,sa,sb;
    register int i = 0;
    int andmask,count=0;

    clrscr();
    printf("nEnter A :: ");
    scanf("%d",&a);
    printf("nEnter B :: ");
    scanf("%d",&b);

    showbits(a);
    showbits(b);
    for(i=15;i>=0;i--)
    {
        andmask = 1 << i;
        sa = a & andmask;
        sb = b & andmask;
        if(sa != sb)
            count++;
    }

    printf("n%d Bits are required to convert A(%d) to B(%d)...",count,a,b);
    getch();
    return 0;
}

void showbits( int n)
{
    int a,andmask;
    register int i = 0;

    for(i=15;i>=0;i--)
    {
        andmask = 1 << i;
        a = n & andmask;
        a==0 ? printf("0") : printf("1");
    }
}
     

 

Back To Question