Placement Papers: Adobe Paper on 25th Feb at Noida

Glide to success with Doorsteptutor material for CTET/Paper-1 : get questions, notes, tests, video lectures and more- for all subjects of CTET/Paper-1.

I have given the test on 25 February for the Developer. This was for the experienced people ⇐ 1year. We had to give two tests of Engineering and C or Java.

Both of the paper has 10 questions and 10 marks for each test. And each test is for 45 minutes.

C Paper:

What is the difference between Char a [] = string and char ⚹ a = String

What is wrong with the code? The code was for conversion from Celsius to Fahrenheit

degF = ⚹ (c + 32)

In code this line was wrong as we want and that to be multiplied with bracket result. But here 9 will be first multiplied with bracket result.

What are Data breakpoints? Give two scenarios where we make the use of this

What do you mean by Bit fields? Give example

Write the function for changing a number from hexadecimal to integer htoi՚s

Compare two binary trees they are same or not.

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

WAP to find Depth of tree program. We were given the structure of the node using that we need to write the code.

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

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 4ths 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

Some commands in the assembly language were given. Then need to convert this code in assembly

A = 300.

For (i = 0; i ⇐ 10; i ++)

A = A + 200.

NOTE: NO Automata questions were asked. Good News!

The engineering paper was totally based on the Data Structure, simple assembly programs implementation and some simple algorithms related to data structures.

So read Arrays, Linked list, postfix prefixes inorder post order etc.

Developed by: