we had an online test conducted by Interview street :
2 sections..total time 2 hours..Each section 1 hour and time saved in 1st section can be used in second..u cant come back to 1st section after going to second section
1st section :
9 objective questions(mostly given programs and asked outputs)..refer previous adobe papers they repeated some questions
1 algorithm question : write a function to test for matching braces in arithmetic expression
2nd section :
4-5 objective questions:
1) on JVM saying how many instructions does JVM got if instruction length is 1 byte
a)256
b)infinite
c)depends on version
d)...
2)given unconnected graph with unidirectional edges,maximum no of edges that can be added keeping the graph unconnected
a)nc2
b)(n-1)c2
c)n!
d)(n-1)!
some other objective questions on process,threads which are easy
Algo:
1)to test whether a given no is palindrome or net
2)find a minimum sequence of 1's divisible by given input no(For 3 it is 111)
3)Given a matrix of size n*n which contains all 1's before any 0 in each row.find efficient algo to find row containing max 0's
4)to do multiplication using addition
5)reverse singly linked list
6)algo to find whether the given sum is possible from a set of given no's(they will give array and sum as input)
Either its online or offline most of above questions will be repeated..if its online test go with a good IDE or any c compiler to check answers(its not allowed officialy bt some guys did that.
No comments:
Post a Comment