Feb 9, 2008

Adobe Written interview questions

1. Write an algo to print all paths in a binary tree.
2. Write an algo to determine if 2 rectangles intersect.
3. If an identifier is defined as follows
letter followed any number of letters and digits then write its regular expression.
4. x=b, z=1;k=n; // n is constant
while(k!=0)
{
if(k is odd) z=z*x;

x=x*x;
k=floor(k/2);
}
what is z at the end in terms of b and n?
5. What is synchronized statement, synchronized function, transient, wait(), notify(), notifyAll();
6. String s = "Hello";
String t = s.append(" Dolly");
Which string do s and t point to ?
7. What is advantage of entity beans over session beans?

8. What are J2EE components?
9. What is multi-tier architecture ? In which layer does browser fits in ?

2 comments:

Ayush Ghai said...

You are given an undirected graph. Each node in the graph is also
assigned a type (say A, B, C, D). There are n nodes in the graph and
there are m possible types that can be associated with each node. You
need to find all the walks from a given source node (say N1) to a
given destination node (sat D1) such that the walk contains a node of
type A. What datastructures would you use? Write the algorithm?

Ayush Ghai said...

http://www.geekinterview.com/articles/50-algorithms-interview-questions.html

a good link