Escolar Documentos
Profissional Documentos
Cultura Documentos
Established in the year 1985, Future Software Ltd. are providers of communications software
products and services in emerging technology areas to the global communications industry.
The company's exclusive focus on communications software has enabled them today to be
one of the leading independent software companies worldwide, in this field. Future Soft's
corporate headquarters are in Chennai and its subsidary in USA - Future Communications
Software, markets and supports its products and services to the North American and
European markets.
Future Software is today, an organization of more than 300 engineers, managed by a team of
professionals with extensive experience in software engineering and project management.
Future Software Ltd. is a knowledge organization accelerating the development of advanced
communications technologies through a commitment to partnership and research.
The company has long term partnerships with its existing clientele and its customer list
includes many of the top 25 global communication companies. Future Software Ltd. has been
assessed at SEI CMM Level 4.
The company is offering a remuneration of 2.7 lacs to 3.2 lacs per annum.
For more information about this company visit their homesite at http://www.futsoft.com/
Written Test:
The written test is purely technical and mostly covers mainly computer engineering related
subjects.The paper is multiple choice with negative marking. It consists of some 25 questions
to be done in 1 hour.The questions are based on subjects such as Data Structures ,
Networking, Digital Circuits and Logic Design , C, Operating Systems, Automata Theory,
Basic Communications, Compiler Design, Micro processor.Remeber u will be having the
negative marking.... AND DO CHK ALL THE PAPERS GIVEN BELOW THEY LOOK
SAME BUT THERE ARE SOME DIFF QUESTIONS AVAILABLE IN EACH OF THEM
FROM OTHERS LIKE IN 24 APRIL PAPER QUESTIONS FOR OUTPUT.
Jacob->FUNC(x,y)
int a[10]={60,57,10,5,4,3,2,8,9};
main( )
int varx,vary;
for (i=0;i<10;i++)
if(varx
vary=varx;
varx=a[1];
else if (vary
varx=vary;
vary=a[i];
printf(“%d%d”,varx,vary);
}
8.
int a=40;
void main( )
print(fn( ));
print(fn( ));
print(int (*fn)( ))
printf(“%d”,fn( ));
printf(“%d”,fn( ));
int fn( )
return (i-=5);
q-I
II
automatic
static
global
ans:stack,heap,heap
PAPER ON 18 JUNE
1. S --> AB|AS
A --> a|aA
B --> b
Ans. aa*b
2. How many address lines are needed to address a 64Kb segment with each register storing
upto 512 bytes.
1 11
11
1 11
Ans. ©
#include
void main()
{int i,x,sum=0;
int arr[6]=[1,2,3,4,5,6]
for (i=0;i<4;i++)
sum+ = func(arr[i]);
printf(“%d”, sum);
}
func(int x)
{ int val,x;
val = 2;
return(x+ val++);
}
Find the average time in case of shortest job first (SJF) scheduling.
12. Given a string STOCK and a stack of size 4.
Which of the following strings cannot be generated using this stack.
(a) TSOCK
(b) TOSKC
(c) STOCK
(d) TKOSC
(e) None of these
13. Inversion of a matrix will take which of the following time complexities?
(a) O(n)
(b) O(n²)
(c) O(log n)
(d) O(n³)
(e) None of these
14. A drum rotates at 4000 rpm. What is its average access time.
· Automatic
· Global
· Static
18. What is the greatest disadvantage of dynamic RAM over static RAM
(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
Ans. O(n²)
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
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?
int d=0;
for(int i=0;i<31;i++)
for(int j=0;j<31;j++)
for(int k=0;k<31;k++)
if (((i+j+k) % 3)==0)
d=d+1;
Find value of d
29. e= | | <(e)> |
What forms do the expressions created by the above definition fit in
30. If a set of numbers are in sorted order then which of the following sorting method is best
Ans. List
40 min - 30 Questions
A --> a|aA
B --> b
Ans-> aa*b
stack.
(a) TSOCK
(b) TOSKC
(c) STOCK
(d) TKOSC
Automatic
Global
Static
(a)Heap,Stack,Heap
(b)Stack,Heap,Heap
(c)Heap,Heap,Stack
(d)None of these
Ans-> (d)
4.) What is the greatest disadvantage of dynamic RAM over static RAM
(b)releases the memory and data bus for the interrupting process
(d)gets halted
6.) The s/n id 3 dB and freq is 300hz.Find the capacity of the line.
(a)100
(b)150
(c)300
(d)200
7.) How much infomation can be stored between fffh-f00h address space.
(a)1024 bytes
(b)2048 bytes
(c)4096 bytes
(d)None of these
Ans->(d)
8.)
void main()
printf("%d %d",&ari[4]-&ari[2],&arc[3]-&arc[0]);
Ans -> 2 3
9.) Find the POS form of the expression given below
___
12.) A drum rotates at 4000 rpm. What is its average access time.
(a.) It is ambigous
e edges
(don't remember the rest of the options, though the answer lies
there)
20.) A reference string was given and using LRU page replacement
algorithm we were asked to find the state of the memory during 3rd
21.) A finite automaton was given and we were asked to find the
5 byte header for network layer and maximum data allowed 110 bytes
question was to find the actual number of bytes send if the data
think the answer was that the program was to find the largest and
24.) John and Jacob are assigned the tasks of writing main() and a
the two?
(a.) the position of main and function
27.)
#include
void main()
{int i,x=4,sum=0;
int arr[6]=[1,2,3,4,5,6]
for (i=0;i<4;i++)
sum+ = func(arr[i]);
printf("%d", sum);
func(int x)
{ int val,x;
val = 2;
return(x+ val++);
(a.) 4
(b.) 16
(c.) 32
(d.) 64
9999999999999999999999999999999999999999999999999999999999999
::Another version::
void main()
int i=4,j=5;
printf("%f",i/j);
(a) 0
(b) 0.8
(c) 1
Ans-> (d)
(a) a*b--
(b) a--bc
void main()
int i=0,j=0;
clrscr();
for (i=2;i>=0;i--)
for(j=2;j>=0;j--)
getch();
(a)11 10 9 7 6 5 3 2 1
(b)11 7 3 10 6 2 9 5 1
(c)........
(d)None of these
Ans-> (b)
(2,4,2,4).Which
(a)j1 j3 j2 j4
(b)j1 j2 j4 j3
(c)j1 j3 j4 j2
(d)j3 j1 j2 j4
as
follows:-
p1 - 2000
p2 - 2000
p3 - 2500
p4 - 1500
it be paced
(a)After p1
(b)After p3
(c)Cannot be placed
(d).......
Ans->(b)
is
possible
(a)Only NOR
(b)Only NAND
(c)Only XOR
(d)None of these
Ans-> (d)
{ int a=10,b=11;
printf("%d",a+++b);
printf("%d",a+++b);
(a.) 22,23
(b.) 23,24
(c.) 21,22
(d.) none
Ans->(c)
They themselves had said to us after their powerpoint presentation that they gonna repeat the
questions, so check this up......
PAPER ON 22 JAN
2. max(t1,t2,...tn) = pipelining
4. print (Head(T))
Traverse(left(T))
print (Head(T))
7. LRU : 1, 2, 3.
else p(p(3x+1))
22. cobegin
begin x = y; x= x+1; y= x
coend
K^+ v(a) + 2I - 2a
You try to prepare all subject questions in all the papers being
Mastek
Paper Pattern
2. GD
Here they look for gud points..that is ur ideas are important n not how loud or aggressive u
are.
3. Interview
a few HR Ques are as follows..
40 min - 30 Questions
Correct ans 3 marks
Wrong ans -1 mark
This is my version of questions( this is based on only a vague memory of mine and i
would request any of the members who attended the test and who remember, to contribute
any correction or
improvisation to the questions)
1. S --> AB|AS
A --> a|aA
B --> b
Ans. aa*b
2. How many address lines are needed to address a 64Kb segment with each register
storing upto 512 bytes.
111
11
111
Ans. (c)
Ans. Stack
#include<stdio.h>
void main()
{int i,x,sum=0;
int arr[6]=[1,2,3,4,5,6]
for (i=0;i<4;i++)
sum+ = func(arr[i]);
printf("%d", sum);
}
func(int x)
{ int val,x;
val = 2;
return(x+ val++);
}
(a) TSOCK
(b) TOSKC
(c) STOCK
(d) TKOSC
(e) None of these
13. Inversion of a matrix will take which of the following time complexities?
(a) O(n)
(b) O(n²)
(c) O(log n)
(d) O(n³)
(e) None of these
14. A drum rotates at 4000 rpm. What is its average access time.
Automatic
Global
Static
18. What is the greatest disadvantage of dynamic RAM over static RAM
(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
Ans. O(n²)
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
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?
int d=0;
for(int i=0;i<31;i++)
for(int j=0;j<31;j++)
for(int k=0;k<31;k++)
if (((i+j+k) % 3)==0)
d=d+1;
Find value of d
30. If a set of numbers are in sorted order then which of the following sorting method is
best
Ans. List
4. print (Head(T))
Traverse(left(T))
print (Head(T))
Traverse(right(T)) - ans: none of the above
7. LRU : 1, 2, 3.
22. cobegin
begin x = y; x= x+1; y= x
begin x =y; z= z+1; y= z
coend
How many address lines are needed to address a 64Kb segment with
each register storing upto 512 bytes.
Ans. 14 address lines