1. S –> AB|AS
A –> a|aA
B –> b

What is the grammer accepted by the above?

Ans. aa*b

2. How many address lines are needed to address a 64Kb segment with each register storing upto 512 bytes.

Ans. 14 address lines

3. Find the expression representing the following K-map

4. For the POS form of the expression given below
_ _ _
X.Y.Z + X.Y.Z + X.( Y + Z )

5. In a computer system the ROM :

(a) contains boot software
(b) is permanent
(c) Both of the above
(d) None of the above

Ans. c

6. The binary equivalent of 3B7F is

Ans. 0011 1011 0111 1111

7. The register used by the shift reduce passing method is

Ans. Stack

8. A microprogram can be defines as to consist of

Ans. A primitive operation

9. Find the output for the following C program

int array[4][4] = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16};
for (i=2;i
void main()
{int i,x,sum=0;
int arr[6]=[1,2,3,4,5,6]
for (i=0;i E + E| E * E | E/E | E - E| …. then which is correct

(a) It is ambigous
(b) It is inherently ambigous
(c) It is non inherently ambigous
(d) None of the above

22. If there are n nodes and K edges in a graph then what is the order of traversing

23. A graph is represented as an adjacency list with n vertices and e edges
What is its time complexity

Ans. O(n + e)

24. An array with address KV[a] had n elements. Which of the following correctly addresses the ith element of the array.

(a) KV(a) - 2a + 2i
(b) KV(a) +2i
(c) KV(a) - 2a
(d) None of these

25. Give an example of a primitive instruction in microprocessors.

26. A computer has 8 bit data bus and 16 bit address line.
How many machine cycles will it take to store the contents to a memory location?

27. Where is a variable defined in a function stores?
Ans. Process Swappable Area

28. For the following C progralm

int d=0;
for(int i=0;i | | |
What forms do the expressions created by the above definition fit in

Ans. All arithematic expressions

30. If a set of numbers are in sorted order then which of the following sorting method is best

Ans. Bubble Sort

31. A magnetic tape is similar to which of the following structures

Ans. List

32. The s/n id 3 dB Find the capacity of the line.

The paper pattern is as follows,

totaly 30 questions duration 1hr,
each que carries 3 marks, for every wrong answer 1 mark will be deducted.
the test is fully technical

areas covered
compiler design - grammar, graphs, data structures, C.

i attended around 20 questions. make sure u answer only the questions u know correct answer as -ve marking is there.
actually i came 2 know abt the test n directly went there 2 write. if u drop a resume at their office they will call u for the test.
i dont have the exact postal address, i think u can find the company by getting down at NANDHNAM signal stop, just two blocks away from the bus stop, next 2 an automobile showroom.

The test consisted of all the stuff you learned in BE computer Science and IT.
Concentrate on :
1. compiler design
2. OS
3. C/C++
4. Micro processor (General concepts)

Remeber you will be having the negative marking
I got through the written test.. But our batch had no GD.We just had a HR interview..I got through this also.. Finally only 3 were shorlisted for the Techinical Interview..(including me)..
But the pathatic fact is all the 3 were rejected.
The technical interview concentrated mainly on the computer Networks, C and they pay more attention to your project details.

“REGARDING THE TEST IN FUTURESOFT”.

I HAVE ATTENDED THE FUTURESOFT TEST LAST MONTH AND I DIDN’T GET THROUGH IN IT.

THE TEST DURATION WAS 50 MINUTES AND THERE WERE 30 QUESTIONS

THE QUESTIONS WERE
1)ABOUT COMPILER DESIGN RELATED PROBLEMS
2)PROGRAMMING IN C/C++ TO FIND OUT THE ERROR
3)GENERAL QUESTIONS IN C AND C++ LIKE
3)PROBLEMS IN SIGNAL TO NOISE RATIO IN DATA COMMUNICATION AND
RELATED QUESTIONS IN THAT TOPIC.

THIS IS WHAT I COULD REMEMBER

EACH QUESTIONS CARRY 3 MARKS AND THERE WERE NEGATIVE MARKINGS ALSO.

These are the questions that i remember!

1.Some palindrome question.the answer was (c)

2.Capacity of line…ans was 900

3. Number of null pointers in any binary tree = n+1

4. print (Head(T))
Traverse(left(T))
print (Head(T))
Traverse(right(T)) - ans: none of the above

5. Boolean expn Evalvate

6. Common subexpn : - ans : a + e

7. LRU : 1, 2, 3.

8. Tr. Delay - 10000 bits ans. 10.01

9. Grammar of Number of shift / reduce operator : ans. 4

10. CPU scheduling 9,8 ?

11. S –> AB|AS
A –> a|aA
B –> b
What is the grammer accepted by the above?
Ans. aa*b

13. allocation ans: (ii) only

14. swapping : ans: reference only

15. Compiler - related Qn.

16. LAN frames - ? related Qn.

17. parameter passing (35,20)

18. sliding window protocol
- BUFFER SIZE large

19. kernel mode - deallocate resource

20. logic circuit
ans . Minimum OR = 3

20. Combinatorics related

21. priority scheduling

22. cobegin
begin x = y; x= x+1; y= x
begin x =y; z= z+1; y= z
coend

ans. Number of values possi = 2

23. 2 bits flip / 2 bits exchange

ans : the word with one ‘1′

24. any addr
K^+ v(a) + 2I - 2a

25. S –> AB|AS
A –> a|aA
B –> b
What is the grammer accepted by the above?
Ans. aa*b

How many address lines are needed to address a 64Kb segment with
each register storing upto 512 bytes.
Ans. 14 address lines

Form the POS form of the expression given below
_ _ _
X.Y.Z + X.Y.Z + X.( Y + Z )

22.In a computer system the ROM :
(a) contains boot software
(b) is permanent
(c) Both of the above
(d) None of the above
Ans. (c)

23. Find the output for the following C program
int array[4][4] = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16};
for (i=2;i
void main()
{int i,x,sum=0;
int arr[6]=[1,2,3,4,5,6]
for (i=0;i | | |
What forms do the expressions created by the above definition fit in
Ans. All arithematic expressions
32. The s/n id 3 dB Find the capacity of the line.