Engineering Part
- (-5)10 as 2's compliment in 8 bit code
- 4th smallest node in a BST
- Ca Cb are terminals having direct, transitive relationship write an algo to calculate if all the PCs are inter-connected
- write an algo to check if 2 BSTs are equal (COMPARE THE DATA AND NOT POINTERS)
- Draw an expression tree for the exp :: a*(b+c/d)*d-e
- Also represent the above in postfix and prefix
- There are 2 threads. some events are given.1st thread writes meesages into a SHARED queue and the second thread reads from it. Implement threads T1 and T2
- Write ab* using finite automata
- what is a thin client
- in a n-tier application, which tier does the browser lie in ?
- why would you design an application with JSP for the front end of data entry and Javabeans to manage the same
- Why are java packages used
- explain transitive variable
- what is synchronization and serialization
6 comments:
Could you please elaborate on the first question about 2's compliment.
I'm giving an interview at Adobe this weekend. Is there anything else you could tell me?
How many questions are there for Java in total?
Any tips on what topics to cover?
Thanks a lot..
I'll write about my test questions after I'm done.
Nvm about the 2's complement...shouldve google'd it before.
adobe written test paper for 20th july
Please go through this :
I'll make sure to put all 20 questions with solutions.
http://www.cracktheinterview.net/viewforum.php?f=19
PS: Adobe questions getting repeated ( not 1 but ALL)
I am not able to view this forum. Is this some special group?
can you please tell me the solution of 3rd question which ask proof all systems interconnecting using transitive relation?
I have adobe paper after 2 days.
thank you.
hi if have adode interview question please send to me...
bakyaraj.velu@gmail.com
Post a Comment