|
|
|
Home » Placement papers » ADOBE PLACEMENT PAPER/2008
Number of Views: 847
Date Of Addition: Monday, November 17, 2008
Section -1 1) Wap to reverse a linked list and sort the same. 2) Given two integers A & B. Determine how many bits required to convert A to B. Write a function int BitSwapReqd(int A, int B); 3) Write an algorithm to insert a node into sorted linked list.After inserting, the list must be sorted. 4) Without using /,% and * operators. write a function to divide a number by 3. itoa() function is available. 5) Wap to swap two integer pointers. 6)Write a funcn int round(float x) to round off a floating point num to int. 7) write an ALP to find sum of First n natural numbers using the following Instructions LDA num ; load Accumulator with num DCR R ; decrement Register R INR R ; increment Register R MOV x,y ; move the contents of register y into register x JZ label ; jump to label if A=0 DJNZ label; Decrement & Jump if A <> 0 you can use B & C registers in addition to A register Cool prove that a tree is BST.what is height of a tree? 9) Given A,B & C Boolean polynomials.Prove That (A+BC)=(A+B)(A+C) Section - 2 There Were four section: 1. Aptitude: They had fairly simple arithmatic question, questions on geometry and questions like whether information can be deduced from the comments given. It was fairly easy and jst u need to have basic clear. 2. Analytical: Questions like pattern matching, odd one out were there. Be careful while attempting these two sections that u wont be having much time. Before u know the time is over. 3. Computers: This paper is mostly from the topics u cover in B.Tech. there was one question on finite automata,Bit manipultaion(flipping the bits), drawing the tree given preorder and inorder traversal, finding the formula for N-ary tree to fine number of external nodes. 4. C/Java: Here u had to write C programs(Mind u no mutiple questions).There was one question to write program to search a string from bigger string, write a algorithm to compute X^n which is of complextity log n, implement atoi function.(U cannot use any standard function in these.) Questions 1. what percentage of total mass does liver has Ans 2.4% What is the ratio of bones to total mass All the questions are simple .. 3. 45 min Testing concept test: 20 objective multiple choice qustions like binary form of numbers, virtual memory, lossy compression, while loop, if-then-else, error codes. ba. lossy compression b. lossless Compression c.text d image 2. output of 11000100 minus 2 3. Memory leakage is because of a. variable not decraled b. variable not free.. like this 4 options were given 4. Virtual memory concept is related to a. memory leagkage {mospagebreak} 5.Regretion testing is defined as a. testing the whole application b.testing the different modules in the application 6. If the time is very limited for the testing then what would u test in the application. a. run all the tests b.look for the most used featues in the application c.go to the test plan and run the test based on the priority I would suggest to go thru all the definition like what is regretion testing .what is unit smoke.etc. 1 Test Case Writing questions: 10 test cases for entering 3 values representing sides of a triangle and the program giving output as scalene, isosceles or eqilauteral (10 Marks) 1 Output of a calculator and finding the error in the output, write the defect log for the bug (5 Marks) 1 Ques on weather Dev should do the testing or not. Give 3 reason on favour and 2 against it. (5 Marks) 1 Question diff between priority of a bug and severity of a bug. Give example of one case where priority is high but severity is low and one case where severity is high bur priority is low. 1 Question on a program that calculates P=R/I where R, I are integer inputs and P a floating point output. Write 10 test cases for this - 5 Marks. 2nd LEVEL INTERVIEW PROCESS 1. Software test: One hour Software test. U will be
placed on a system with an application opened that is containing bugs in it. A
reference doc will be provided where u will find the description of six modules
of the application. U have to find maximum number of bugs in those six modules
given in the reference doc in one hour. Each module contains at least one bug. U
will have to keep writing the bug in a paper provided to u as u keep finding it
with the time when u found it. Be the first one to comment on this Placement Paper
|
|
||||||||||||||
