Subscribe Feed (RSS)Here are some questions in the adobe placement paper held at bangalore, 2006
If you are preparing for adobe, the important topics to prepare are Algorithm questions, Trees, C / Java, Recursion, Pointers, etc.
Few Questions from the C Language test:
1) Linked list using recursion.
2) Use the atoi function to find whether a number is divisible by 3 without using %,/ or 8.
3) Two integers are provided. You have to find the number of bits that need to be flipped in one number to get another one. ( xor a and b and count the number of bits)
4) Two arrays are given with duplicate elements. Get C = A – B with no duplicates (Merge 2 arrays and remove the duplicates)
5) Routines to swap int pointers.
6) Write a Rotate function for rotating elements in an array, using a reverse function.
7) Write a program for subtraction of 2 base 13 numbers.
Write a program to find Min and max nodes of a quad tree.
9) Prove that the number of internal nodes in a tree is less than the number of leaves.
10) Boolean logic proofs
11) Program to find if a binary tree is a BST or not.
12) Output of a switch case program.
Adobe Engineering test:
There were mostly algorithms questions.
1. Array question
2. Implement a dictionary manually with a little overhead.
3. Find the nth element from the end in a list.
4. Insert an element into a linked list.
There are a lot of geometry questions too.
In the analytical part of adobe test, there were many questions based on square roots. The square root of 9 is +3/-3.
See other Adobe latest placement papers, technical test and interview questions.
