Adobe written test question

Adobe (Test - Jan 25th)
======

First Quans paper(45 mts) , then Engg (45 mts)& then language paper(45 mts)

Engineering Paper (10 questions) ( difficult to solve everything in 45 Mts time)
================================
-> weightage will be given if some problems are solved fully instead of answering all the questions

1)Easy question using Push() & pop () operations again & again on a string
2)If L is letter & D is a digit , Write a Regexp for letter , followed by a letter or digit followed by any number of letter,digit combination.
Ans : From the set of options that were given the correct answer L .(L U D)+
3)Code for printing all paths of a binary tree from root to leaf.
Ans :

Solution (Java)

public void printall() {
int[] path = new int[1000];
printPaths(root, path, 0);
}


private void printPaths(Node node, int[] path, int pathLen) {
if (node==null) return;

path[pathLen] = node.data;
pathLen++;

if (node.left==null && node.right==null) {
printArray(path, pathLen);
}
else {
// otherwise try both subtrees
printPaths(node.left, path, pathLen);
printPaths(node.right, path, pathLen);
}
}

private void printArray(int[] ints, int len) {
int i;
for (i=0; i System.out.print(ints[i] + " ");
}
System.out.println();
}


4)Suggest algo that would be useful to sort a very large dataset , also consider the fact that there is not much memory available & so there is a
need to use the disk , like transfer part of the data set from disk to mem & mem to disk.
Ans : Mergesort

5) Given this struct , write code to see if two rectangles intersect or not.
struct rect
{
unsigned int lower_left_X;
unsigned int lower_left_Y;
unsigned int upper_right_X;
unsigned int upper_right_Y;
}
ANS , do simple bounds checking after calculating all 4 points in both the rectangles.

6) Calculate the number of multiplications that would happen in a recursive function. the function given was a diff version power function using odd,even etc.,

7) one OS question using semaphore , shared mem , events , was asked to write a program.


Analytical(15 questions ) these are similar to GRE questions. not so tough as CAT questions
==========
5 questions based on a passage (very simple)

5 questions related to true/false. (like A is X or P , All x's are M , M's are not N etc.,)

5 questions related to a passage ( little tricky)


Quantitative (30 questions) these are also similar to GRE questions. not so tough as CAT questions
=============
15 questions , exactly GRE type , Given Col A & Col B , tick if A > B , B > A , A == B , Cannot say.
5 questions , based on a graph ( very simple)
Some 5-8 geometry questions based on triangles mostly , so learn triangle geometry thoroughly.
Area of sector , circle questions.
Basic Aptitude questions like Ratio , Percentages


Language Paper(45 mts) - I Chose Perl (there were 5 questions)
======================
All were based on Pattern matching , getting command line arguments ,

1) count no of occurences of a word in a file , tell the line number where the word first occurs in a file along with colum number
2) read a file & based on it produce another file.
3) $version = 1.234.5.6 , you have to make it 1.235.5.6 , how to do it.
ANS: @arr = split (/./,$version);
arr[1] = arr[1] + 1;
print join (".",@arr);

4) write cgi script to connect to DB , run query on employee table & display result as a HTML table
ANS : use DBI package. know how to fetch query details & write ouptut to another file like " ...." , use to give row,col output.