2023 2024 EduVark > Education Discussion > Question Papers


  #2  
July 3rd, 2014, 02:45 PM
Super Moderator
 
Join Date: Mar 2012
Re: Last year question placement papers of Adobe Recruitment

As you want to get the last year question placement papers of Adobe Recruitment so here is the information of the same for you:

1) Write a program 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) Write a program to swap two integer pointers.
6) Write a function 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
8) 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)

C Test:-
Q1) linked list using recursion.
Q2) Find if a number is divisible my 3, without using %,/ or *. You can use atoi().
Q3) 2 integers A and B are given, find the no of bits that need to be flipped in A to get B. ( X-OR a and
b and count the number of bits)
Q4) Write a Rotate function for rotating elements in an array, using a reverse function.
Q5) Given 2 sorted arrays A and B with duplicate elements, get C= A -B and does not have duplicates
(use a variation of merging 2 arrays and then remove the duplicates.)
Q6) Some routines to swap int pointers.
Q7) Subtraction of 2 base 13 numbers.
Q8) Min and max nodes of a quad tree.
Q9) Prove that in a tree no of internal nodes is one less than leaves.
Q10) A couple of Boolean logic proofs
Q11) Code to see if a binary tree is a BST or not.
Q12) Switch case program out put

C Paper:
1. What is the difference between Char a[ ]=”string” and char *a=”String”
2. What is wrong with the code? The code was for conversion from Celsius to Fahrenheit : degF
=5/9*(c+32)
In code this line was wrong as we want 5/9 and that to be multiplied with bracket result. But here 9 will
be first multiplied with bracket result.
3. What are Data breakpoints? Give two scenarios where we make the use of this
4. What do you mean by Bit fields? Give example
5. Write the function for changing a number from hexadecimal to integer htoi(s
6. Compare two binary trees they are same or not.
7. You have N computers and [Ca, Cb] means a is connected to b and this connectivity is symmetric
and transitive. then write a program which checks that all computers are interconnected and talk two
each other
8. WAP to find Depth of tree program. We were given the structure of the node using that we need to
write the code.
9. In binary search we have two comparisons one for greater than and other for less than the mid value.
Optimize so that we need to check only once
10. Question was some what like we need to write the function so that we get the two dimensional
array and memory is assigned to it using malloc function. Don’t remember the question exactly. But
this was the only question in proper language
Engineering Paper:
I remember only 5 questions in this. A s this was taken first
1. Binary search Tree was given. Find 4th smallest element.
2. Some code in assembly was given and given five options. What is being calculated?
Ans (XY) 2 + Y + Z
3. Represent (-5)10 in 2’s complement representation in 8 bits
4. Expression was given. Draw tree and then find the postfix
5. Some commands in the assembly language were given. Then need to convert this code in assembly
A=300;
For (i=0 ; i&lt;=10 ; i++)
A=A+200;


Quick Reply
Your Username: Click here to log in

Message:
Options



All times are GMT +5. The time now is 07:46 AM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2024, vBulletin Solutions Inc.
Content Relevant URLs by vBSEO 3.6.0

1 2 3 4 5 6 7 8