ADOBE Placement Papers – C Language

C test:

Q1) linked list using recursion.
Q2) Find if a number is divisible my 3, without using %,/ or *. You can use atoi().
Q3) 2 integers A and B are given, find the no of bits that need to be flipped in A to get B. ( X-OR a and b and count the number of bits)
Q4) Write a Rotate function for rotating elements in an array, using a reverse function.
Q5) Given 2 sorted arrays A and B with duplicate elements, get C= A -B and does not have duplicates (use a variation of merging 2 arrays and then remove the duplicates.)
Q6) Some routines to swap int pointers.
Q7) Subtraction of 2 base 13 numbers.
Q8) Min and max nodes of a quad tree.
Q9) Prove that in a tree no of internal nodes is one less than leaves.
Q10) A couple of Boolean logic proofs
Q11) Code to see if a binary tree is a BST or not.
Q12) Switch case program out put

Related posts:

1. ADOBE Placement Paper
2. ADOBE Placement Papers – Technical
3. ADOBE latest 2009 Placement Papers
4. ADOBE Placement Papers 1
5. ADOBE Latest Placement Papers

Tagged as: ADOBE, ADOBE 2009 placement papers, ADOBE 2009 question papers, ADOBE 2009 test papers, ADOBE 2010 placement papers, ADOBE 2010 question papers, ADOBE company papers, ADOBE company profile, ADOBE exam paper, ADOBE exam papers, ADOBE exam pattern, ADOBE exam pattern 2009, ADOBE exam pattern 2010, ADOBE interview papers, ADOBE interview pattern 2009, ADOBE interview pattern 2010, ADOBE latest placement paper, ADOBE latest placement papers, ADOBE placement paper 2009, ADOBE placement paper 2010, ADOBE placement papers, ADOBE placement papers 2009, ADOBE previous placement papers, ADOBE profile, ADOBE question papers, ADOBE recent placement papers, ADOBE sample papers, ADOBE solved placement papers, ADOBE solved test papers, ADOBE test papers, placement paper, placement papers, placement papers of ADOBE