HUGHES PAPERS

HUGHES 1996

2007-05-06T04:02:00.001-07:00

This is a list of questions that came in the Hughes test in 1996
Some questions were repeated in 1997 - preceeded by a *
Questions which came only in 1997 are preceeded by **

1. quality factor defines the quality of :
(a) inductor (b) capacitor (c) both (d) none

2. Resistance increases with temp. in :
(a) conductor (b) semi-conductor (c) insulator (d)not dependent

*3. Spanning tree algorithm is used in :
(a) routes (b) bridge (c) repeater (d) gateway

*4. Encryption is done in ________ layer :
(a) (b) (c) (d)

*5. Principle of locality is used in ________:
(a) (b) (c) polling (d) cache

*6.JK built with SR ;J= , K= :
(a) (b) (c) (d)

7. AM spectrum
(a) (b) (c) (d)

8. Noise immunity of AM is ______ than that of FM :
(a)less (b) more (c) equal (d) none

9. Push-pull amp. has the following adv. :
(a) low harmonic (b) high power gain (c) both (d) none

*10. To transmit a signal with freq. f , BW reqd. is :
(a) 1/2 f (b) 2f (c) f (d) none

*11. If o/p of serial shift reg. is connected to its i/p it becomes :
(a) flip-flop (b) seq. memory (c) counter (d) ALU

12. Of the follo. which can't go to a predetermined memory location :
(a)INTR (b) RST 5.5 (c) RST 7.5 (d) TRAP

13.Single parity bit in asynch. transfer is used for :
(a)error detector (b) error correction (c)error detection & correction
(d) none

14. Banking algo. can be used for :
(a) deadlock avoidance (b) dead lock removal (c) (d)

15. in O.S. which is correct :
(a) water (b) dispatch (c) block (d)none

*16. Boolean exp. simplification (x+y)(x+y-) (x- +z)
(a) xz

17. Which of the following is not Demorgan's law:
(a) (aUb)' = a'Ub' etc.

A question on solving an expression was given on solving one expression

*18. int *ptrint,intarr[4];
intarr[0]=1;
intarr[1]=2;
intarr[3]=3;
intarr[4]=4;
ptrint=intarr;
*(intarr + 3) = *(++ptrint) + *(ptrint++)

(a) 1,2,3,4 (b) 1,2,3,5 (c) 1,2,4,5 (d)

19. funca()
{
static int y=10;
printf("%d",y);
y++;
}

what is value of y after 2nd call to function?
(a) 11 (b) 12 (c) infinite (d) compilation error

A question on static variable value was asked this time

20. i/p current=? max. current=? CMRR=? gain of op-amp=?

21. pictorial question on vitual page and phy. page offset given => give memory location ?

*22. The no. of trees that can be constructed with 3 nodes a,b,c is :
(a) 2 (b) 3 (c) 12 (d) infinite

*23. A comp. n/w has 5 nodes fully interconnected the no. of full duplex channels reqd. for interconnection is _______:
(a) 120 (b) 10 (c) 5 (d) 1

24. Diff. between RET and IRET in 8086 is _____:

25. Disad. of CPU reg. is :
(a) eval. of exp. (b) function call (c) arrange implementation (d)none

26. union
{
type 1 ival;
type 2 cval;
}
size of union is ________?

27. MACRO subt x,y
--------
--------

x,y are:
(a) variables (b) actual parameters (c) identifier (d) formal parameters

27. Visibility of static variables is _________.

*28. s1,s2,...,sn are records in ascending order. Given si, to
find s i+1, we need
(a) O(1) (b) O(n) (c) O(n log n) (d) O(n^2)

29. Figure
This is ____ gate.
(a) not b) nor c) and d) nand.
*31. load x
xor y
store x
xor y
store y
xor y
store x
a) flipping x & y contents
b) stores the absolute values of x & y in x,y
c) swapping
d) no change
32. supply voltage =10V, gain =100, i/p voltage=1V, o/p voltage=?
33. o/p of TTL gate is
a) totempole amplifier
b) common emmitter.
c) d).
34. A floating pt. number having 16-bits for mantissa and 8-bit
for exponent is represented in 2's complement form. The max.
and min. numbers possible are .... and ....

*35. The selection of files by the movement of the head of a disk in
its path is referred to as
a) FCFS b) shortest seek job first c) d) none

*36. Address space consists of 1 byte. There are 8k x 4 bits in one chip.
The RAM consists of 4 x 6 array. How many address lines
are required. ans = 17

37. Find the no. of bits & words required to implement a 1 x 4
DMUX using RAM.

38. int a[5..10,-5..10];
The array is arranged in row major form. If the array starts at
100 and each element occupies 4 bytes, the address of a[6,0] is.
39. Pick the wrong one.
a) In I/O mapped I/O, i/o address and memory addresses are
different.
b) In memory mapped I/O they are not different.
c) There are no special opcodes for I/O devices.
d) none of above.
40. Regenerative amplifier is not used for analog signals because
a) they amplify noise also
b) c) d)
41. Zero bit stuffing in LDAP is used for
a) avoidance of occurence of flag data in the message field.
b) c) d)
*42. Pick the wrong one.
a) bridges - data link , gateway - network layer.
b) bidge - network layer , protocol conversion - higher layer.
c) gateway - network layer , protocol conversion - higher layer.
d) none.

HUGHES JADAVPUR

2007-05-06T04:01:00.000-07:00

A*********************************************************************
HUGES PAPERS
JADAVPUR UNIVERSITY
**********************************************************************

Huge Papers(Most of them were from July 2000 ,some are from this
year)
Still I'm sending the questions
the questions were as follows:
Section A consists of Network communications
Section A:
------------
1.Flush of a bathroom is equivalent to which
electronics circiut
(a) Capacitor (b)Integrate and dump circiut
(c)Diode (d)
ans: (a)

2.There were two questions on Unix programming.I don't
remember the programme
exactly.But the question were asked to find the o/p of
the programe and the error of the
programme.

3.In Internet Transprot layer which is not a protocol
a)/etc/host
b)TCP
c)UDP
d)...

4.How many address bits are there in Ipv6?

5.There are 2protocols IP and IPX are running on top
of Ethernet. Suppose
a packet addressed to that ethernt card arrives, to
which protocol the
ethernet sends the packet?
1. It checks the payload of the frame and finds out
the protocol type and
despatches it to the right protocol
2. It fins out the protocol type that is mentioned in
the ethernet frame.
3. despatches to both the protocol

6.path testing
a. black box
b. white box(ans)

7.There were questions on ICV. I don't remember the
questions actually

8.Normalisation

9.One question was from Avalanche diode

10.CSMA/CD is used in
a) token ring
b) FDDI
d) ethernet
Ans : d

11. if even parity is used for parity generation, what
is the
hamming distance
ans:2

12.the code set is {00000,00111,11100,11011}
what is the error detecting and correcting capability?
ans:2,1

13. IEEE 802.5 is
ans: TOKEN RING

14. about deadlock condition

Section B:(Apttitude and reasoning most of them were
mathematics based)
-------------------------------------
1.There were four guys and three girls in a park along
with their dogs.Sangeeta is unmarried
There are two couples.Rahul is Jaya's husband.Neelam
is Gourav's sister.Others were Ravi and
Shakti.Sangeeta doesn't like sitting beside rahul.Jaya
doesn't like the dog so their dog was hold by her
hubby.Ravi was not holdind any dog since his wife was
holding it.Determine the sitting arrangement in the
park.

2.A man spends 1/6th of his total life in child hoos,
1/7th as
youth, 1/12th as bachelor, five years after marriage a
son was born.
the son died four years before his father, at an age
of half of his
father's final age.ans: 84 days

3.Five persons A,B,C,D and E were traveling in a car.
They were two ladies in the group. Of them who knew
the car driving one was a lady. A is brother of D. B
wife of D, drive at the beginning. E drive at the end.

1) Which of the following is a pair of brothers.
(Ans.: A, D)
2) Who was the other lady in the group. (ans: C)
3) In the case of which the following pairs, no
relationship can be established with one else in the
group (ans: C, E)
4) How was E related to A.

4.1,4,9,_,_,_,49,64.

5.One question was on the polynomials and their
degree.I don't actuallyremember the expression.

6.There were 4 more questions on the numbers
series.Practice them from a good book.

7.Find the hypotaneous of a right angle isoceles
tringle whose area is
50. Ans. 10*(root 2)

8.(root 200) - (root 50) =?

9. Factorize y**2 + 8y - 48 =0

10.21, 463, 687, 238, 1134, ----

11.0, 6, 24, 120, 210, ---, ----

12.There were two sums on probability.
13.

14.Cost of article x,first discount is y% of cost,
seconddiscount is z%
of cost . The price of x is
x(1-y/100)(1-z/100)(ans)

HUGHES @IITK 2001

2007-05-06T03:59:00.000-07:00

iitk paper Hughes 2001.

There are 2 sections. One contains 20 question from aptitude and another has
30 question from technical(for both CSE and EE).I attmpted only CSE section so
there i m with CSE section.

Aptitude

1) In a room all except 18 peoples are of more than 50 years. There are 5
peoples of less than 50 year age. How many peoples are in the room.

ans : u can't find out from this much information.

2) party consist of grandmother, father, mother, 4 sons and their wives, each
son has 1 son and 2 daughters. total number of females in party.

ans: 14

3) Avg of 5 consecutive nos. is n. If next two nos are also added to find
the average then average is

ans: increased by 1.

4)If A & B works in the ratio 5:6, what will be the
ratio of their
times in
which they finish?
ans: 6:5

5) boat travelling upstream speed and downstream
(speed given). find
speed in
still water
ans: 2 hrs

6)Bus speed excluding stoppage 54 kmph. with stoppage
45 kmph. for how
long will it stop on the stoppage?
ans: 10 min

7) (10^n - 1) is divisible by 11 only if
ans: n is always even

8) A man travels 14 hrs 40 min. First half of the
journey is covered by train at 60 kmph. second half at 50
kmph by bus. what is the total distance travelled.
ans: 800

9) av. temp from mon to wed is 37 degree C av. temp from tue to thu is
34 degree C. Temp of thursday is 4/5 th that of monday. what is temp of
thursday.
ans: 36 degree C

10) A number when multiplied by 423 was gives 65589 of which the two 5's
were wrong and all the other digits are correct.
What are the correct nos?
ans: 60489.

11) A rupee coin is placed on plain paper. How many coins can be placed there such
that it touches the central and adjacent coins.
ans: 6.

12)one question was on numbers. one digits is mising and u have to find least value of
it so that it must divisible by 8.
ans: 3.

13) = n(n+1)/2.
u have to find where m = <5>.
Ans: 120.

14)Sushil age is 3 times what snehal's was 6 years back.
6 year ahead it'll be 5/3 times snehal's. find age of someone
i couldn't remeber

15) 2^n + 2^(n-1)/2^(n+1) - 2^n is equal to
ans: none of them ( 1/4).

16) there is 40kg milk. 4 kg taken and and in remaning 4 kg water is mixed to make it
40kg again. Process is two more time. U have to tell how much is the milk is the vessel.
ans: sorry i couldn't remeber.

17) An amount of rupees can be paid to A as wages for 21 days & B for
28 days. If it has to be paid for both how many
days will it last ?
ans: 12 days

Sorry guys 3 questions i couldn't remember.

Technical for CSE guys.
Again sorry as i haven't attmpted this section so i couldn't remember it completely.

1)Semaphore is used with which IPC mechanism
a) message queue
b) shared memory
c)d)

2) MS-DOS and os/2 file allocation techinque used
a)indexed
b) contiguous
c)d)

3)Memroy management scheme in intel
a)paging
b)segmentation
c)2level paging
d)3 level paging

4) one on left recursive grammar.productions are given.u have to remove it.

5) 5 question on oracle..ooofff

10) u defined some exception but haven't raised it in function.
what will happen at compile time..

11)A C function is defined in one file.
now in other file this file is not included.
and function with the same name is declared extern
and later used it.
u have to tell the line having error at compilation.

12) IP address size in IPv6

13) sliding window protocol is used in which layer

14) u have to invoke base class function from derived one. How to do that.

15) RS232 is called
a)serial port
b)parallel
c)SCSI d)

16) hard disks cylinder size,sector size etc. information is kept in
a)RAM b) ROM c) CMOS d) EEPROM

17) what processor does when interrupt arises
a)stops execution
b)acknowledge the interrupt
c)d)

18)NICE system call of unix

19)Parse tree can be represented as
a)linked list b)adjacency list c) both d) none

20) insertion sort and heap sort compelxities.

21) O(loglog n) is better then O(log n) for
a)smaller values of n b) larger c) both d) none.

22) DHPC is used for
a) assigning automatic IP addresses.

That's all in my memory.

Ashok Bhatt
ashokb@cse.iitk.ac.in

HUGHES 99 PAPER

2007-05-06T03:57:00.000-07:00

This is HUGHES-99 paper
**********************************
It consist of two section part A and B or C
For CSE student part A & B is better.
Here i am writting some Questions from part A and B for CSE student
Questions are not in order.
***************************************************
1.

f(char *p)
{
p[0]? f(++p):1;
printf("%c",*p);
}
if call that fuction with f(Aabcd) what is the output??
ans:dcbaA (Just reversing the string

2
f(char *p)
{
p=(char *)malloc(sizeof(6));
strcpy(p,"HELLO");
}
main()
{
char *p="BYE";
f(p)
printf("%s",p);
}
what is the o/p???
ans:HELLO
3

To sorting array of 10 elements which sorting is best
a)slection
b)bubble
c)tree sort
d)....
ans:a

4

To saving space paoint of view which sort is best
a)selection
b)insertion
c)both a & b
d)...
check it once.U Can easy Aanswer this question(UCA)

5
Which statement is wrong on heap
a)Any two childs should not same
b)..
c)..
d)...
ans:a
6)
one more question on heap

UCA

7
read about cyclometric complexity..
8

how many null pointer are there in N number binary tree
ans:N+1

9
Two sorted list of size n what are the maximum comparison in merge
ANs:2n-1
10
converting 41.685 to binary
11

pc is incremented while executing ---------- instruction
ans:fetch instruction

12

this is gates (NAND)problem
It means some gate figure has given with all NAND gate we have write
equavalent gate
ans:OR gate

13
x:validating :Are we producing product right
y:verification:Are we producing right right
a)X is wrong statement
b)y is "
c)x and Y "
d)x & y is right statement

14

NFS some queston in NSF.
see distibuted operation System book
by tenaun bamab
15.
IP & IPX is implemented in trasport layer.......
mama all our friends can answer this question .Here i am unable to recall
that question.If u a have any doubts on Ip & IPX contact HARI because he
did his project is B.Tech in that protocals

UCA
16

comparison between hashtable and binary tree
ans:a
UCA

17
client server is working in asyn mode then how communication will take place
bt client and server.

UCA
18
once context swithing occures then ------------will take place
a)saving register
b)saving stack
c)....
d).....
UCA

19
If precondition is failed what u say about postcondition?
Note:Read about preconditon and postcondition
20
whiling download java applete then web broswer do the folling
a)checking the class structure..
b)...c)....d).....
Read about this
21
Strings in Java
a)Mutable
b)variable length string
c)...
d)....
ans:b
22
in Internet Transprot layer which is not a protocol
a)/etc/host
b)TCP
c)UDP
d)...
UCA
23

Which is not specified in CODD's rules
a)....
b)....
c)...
d).....

It is from DBMS question
Refer NAVATHI BOOK chapter -9 appendx topic is CODDE's rules
24

what is the use of Normalization
a)....b)....c)...d)...
Any one can answer
25

Futional dependecy x->y is shows that
a)if x1=x2 then y1=y2
b)...c)...d)...
ans:a
26

one question on IP addsress 243.65.77.8 some thing
a)...b)..c)..d)...
every one can answer
27

If A sends a message to B with encryption then key is
a)A public key
b)B public key
c)A private key
d)B private key
ans:b (Check it once)
28

In a class only declaration of the function is there but defintion is not
there then what is that function
ans:virtual function

29
what is not necessary condition in dead lock
ans:a
30
One question from multible inheritance...
a)..b)..c)...d)......
31)
ICV protocal
i don't know about this mama .Till now i didn't heard that protocol
mama..just know what is that then u can answer this question

32

one question from catches like write-through protocal etc
33
catche access time is 100ns ,memory access time is 1000ns and hit ratio
is 0.9 then what is average memery access time
a)100ns
b)200ns
c)400ns
d)500ns
ans:b
***********************************************************************
Hai friends,
Here am sending 32 question remainings are some C questions and easy
i didn't remeber correctly,sorry.If do 30 question u can select easly.Then
remainning things are depend on ur interview.
HUGHES is not bother about ur GREE english etc it what Indepth at any field
of CSE.
I wishing that atleast 4 or persons will be slected in HUGHES from our
collge(N.B.K.R.S.T).
If u have any doubts at any aspect please ask me. I am praying GOD every our
will settle in good position with 10 or 15 days.
After our selection is competed we allwe meet in one place before our job
appointment
bye....
with love
kissr, Nayudupet.

HUGHES PAPER 1999

2007-05-06T03:55:00.001-07:00

There were two papers one was aptitude ( 36 questions) and other was
technical(20 questions)

1: given an expression tree and asked us to write the in fix of that expression

four choices

2:
global variables in different files are

a:at compiletime
b) loading time
c) linking time
d)execution time

3)size of(int)
a) always 2 bytes
b) depends on compiler that is being used
c) always 32 bits
d) can't tell

4)which one will over flow given two programs
2
prog 1: prog2:

main() main()
{ {
int fact; int fact=0
long int x; for(i=1;i<=n;i++)
fact=factoral(x); fact=fact*i;

} }

int factorial(long int x)
{

if(x>1) return(x*factorial(x-1);
}

a) program 1;
b) program 2;
c) both 1 &2
d) none

}

5) variables of fuction call are allocated in
a) registers and stack
b) registers and heap
c) stack and heap
d)

6)

avg and worst case time of sorted binary tree

7) data structure used for proority queue
a) linked list b) double linkedd list c)array d) tree

8)

main(){
char str[5]="hello";
if(str==NULL) printf("string null");
else printf("string not null");
}
what is out put of the program?
a) string is null b) string is not null c) error in program d) it executes but p
rint nothing

9)there are 0ne 5 pipe line and another 12 pipe line sates are there and flushed
time taken to execute five instructions

a) 10,17
b) 9,16
c)25,144
d)

10)

for hashing which is best on terms of buckets
a)100 b)50 c)21 d)32 ans 32

11)

void f(int value){
for (i=0;i<16;i++){
if(value &0x8000>>1) printf("1")
else printf("0");
}
}
what is printed?
a) bineray value of argument b)bcd value c) hex value d) octal value

12)

void f(int *p){
static val=100;
val=&p;
}
main(){
int a=10;
printf("%d ",a);
f(&a);
printf("%d ",a);
}
what will be out put?
a)10,10

13)

struck a{
int x;
float y;
char c[10];
}
union b{
int x;
float y;
char c[10];
}
which is true?
a) size of(a)!=sizeof(b);
b)
c)
d)

14)

# define f(a,b) a+b
#defiune g(c,d) c*d

find valueof f(4,g(5,6))
a)26 b)51 c) d)

15)

find avg access time of cache
a)tc*h+(1-h)*tm b)tcH+tmH

c) d) tc is time to access cache tm is time to access when miss occure

16)

main()
{
char a[10]="hello";
strcpy(a,'\0');
printf("%s",a);
}
out put of the program?
a) string is null b) string is not null c) program error d)

17)

simplyfy k map

1 x x 0
1 x 0 1

18)

int f(int a)
{
a=+b;

//some stuff

}

main()
{
x=fn(a);
y=&fn;
what are x & y types
a) x is int y is pointer to afunction which takes integer value

19) char a[5][15];
int b[5][15];
address of a 0x1000 and b is 0x2000 find address of a[3][4] and b[3][4]
assume char is 8 bits and int is 32 bits

a) b) c) d)

there are 20 questions all in techinical paper and 36 questions in appititude te
st

in appititude thay have given all diagrams and asked to find what comes next

thay are quite easy and i hope if u practice r.s aggraval u can do it easily

for tecnical thay have given 1 hr for 20 questions and for not technical thay ha
ve given only 40 min
and 36 questions

this is the paper i have right now

1. main()
{
fork();
fork();
fork();
printf("\n hello");
}

How many times print command is executed?

2.main()
{
int i,*j;
i=5;
j=&i;
printf("\ni= %d",i);
f(j);

printf("\n i= %d",i);
}

void f(int*j)
{
int k=10;
j= &k;
}

output is
a 5 10
b 10 5
c 5 5
d none

3.
some question on pipeline like you have to findout the total time
by which execution is completed for a pipeline of 5 stages.

4.

main()
{
int *s = "\0";

if(strcmp(s,NULL)== 0)
printf("\n s is null")p
else
printf("\n s is not null");
}

5.
some syntax which returns a pointer to function

6. size of integer is
a. 2 bytes
b 4 bytes
c. machine dependant
d compiler dependent.

7.max and avg. height of sorted binary tree

a. logn n
b n logn

8.
some question. like the number was shifted everytime by one and bitwise and with 10000000.
one was supposed to find what the code was doing.
I feel the answer was most probably finding decimal value.

9. int a[5][4]
int is 2 bytes base address for array is 4000(Hexa)
what will be addr for a[3][4]?
int is 4 bytes same question.

10.
implementation of priority queue
a. tree
b linked list
c doubly linked list.

HUGHES DEC DELHI 1999

2007-05-06T03:55:00.000-07:00

******************Hughes paper in DCE************

All ques. had four options.

1- What is max. no. of hops in hypercube n/w with n (=2 ^ p) to go from one node to another ?
a. p
b. log p
c. n ^ 2
2- What is Kerberos ?
ans. Authentication Protocol.
3-In completely connected multiprocessor system with n processors
, links will be of the order of
a. O(n ^ 2)
b. O(2 ^ n)
c. O(n/2)
4-When quick sort gives worst performance ?
ans. When elements are in order.
5- o/p of each sorting step of 8 elements was given and had to recognise which sorting algo.?
Ans. Bubble sort (Not Sure , Check it out )
6-In worst case ,which sort is best out of following sorts?
a.heap
b.selection
c.quick (ans.)
d. insertion
7-Three very simple gate circuits each having inputs A,B,C,D were
given and had to tell ,which two give same result ? (DeMorgan's Law was used in solving )
Ans was (a) &(c) (o/p of a & c was coming to be AB +CD)
8-K-map given,had to tell simplified function
Ans was perhaps AB+AD +AC+BCD

K-Map was
CD`
AB 0 0 0 0
0 0 1 0
1 1 1 1
0 1 1 1

9-What is Function Point ?
Ans. S/W estimation technique
10-p points to an integer. We don't want p to change value. In C, what declarations will we use?
A const int *p
b.int *p
c.int const *p
e. int* const p (perhaps ans.)
11-Diff between 2NF &3NF ?
Ans. D (last option)
12.Which does not use client server model ?
a. Email
b. Web access
c. C. Telephone call
d. N/w file system
13-In a pipeline having 3 stages, each having reliability of 0.9
,what is overall reliability of pipeline?
a. 0.9
b. 0.729
c. 0.81
14-2level cacheis there first level cache's access time is 100ns,second
level cache's access time is 33ns & memory access time is 1000 ns
. Wh at is total memory access time ?
ans. 140 ns
15-In public key cryptography,Awillsend message to B
ans. Using B's public key
16-What does projection of a relation give?
Ans.gives vertical partition of relation corresponding to specified columns.
17-For disk or direct access storage, which is best ?
a. AVL
b. B-tree
c. Red tape ...
18-There is a tree with inorder threading Node B is inserted as
left child of nade A. Node A already has right child . Where will the null ptr of B point ?
ans. Parent of A (perhaps)
19-There is a diskless workstation. Which will be the first protocol it will use ?
a FTP
b. ARP
c. HTTP
d. RARP
20-Compiler keeps which of following ?

ans. Symbol table
21- 'ping' command uses which protocol ?
ans. ICMP
22-Merge sort uses which technique?
Ans. Divide and Conquer
23-Program counter is incremented in
a. fetch (ans)
b. decode
c. execute
24-what does the following program do ?
f(int n)
{
int c;
while(n)
{
n&=n-1;
c++;
}
print c;
}
ans. Program prints the no. of set bits in no.
25-What is this called (char *) (*(*(*A[X]) ( ) )) ( )
ans. Array of X pointers to a function returning pointer to functions that are returning pointer to
char (not sure )
26- For synchronisation in distributed computing, what should not be there ?
a. all machines are synchronised by a global clock
b. all systems should have their own clock (perhaps ans)
27-Java applet of a moving /waving file is running on one machine then it means
a.Java's executable code is downloaded and running on the m/c
b.A virtual X server is running on that m/c while the actual program is running on the web server.
28-What is in RSA algo. ?
a. First the session key is encrypted & then whole message is encrypted using RSA Algo.
b. Message is encrypted using RsA algo.
c. First Rsa algo is used &then encrypted with the session key.
29-What is dirty read?
a. Transaction reexecutes and gives diff. Results from the original execution
b. Read is done when the transaction is not yet committed

30-What is coupling ?
a. It tells the strength of interconnection between two program units.
b. It tells the strength of interconnection between twtrength of
interconnection between two program units.
b. It tells the strength of interconnection between twwwtrength
of interconnection between two program units.
b. It tells the strength of interconnection between twwwo program units and one program unit
31-Any n/w on the computer can have only
a. one domain &one IP
b. more than one domain & more than one Ip
c. one domain and more than one IP
d. more than one domain & one IP
32-Which one does not have file descriptor ?
a. process
b. keyboard
c. pipe
d. socket
33-What does CONNECT BY means
a.connect to a different databaser for retreival
b.arrange in tree ordered structure
34-In two phase commit protocol, why log is used during transmission &reception ?
a. To retrieve the status in case of crash
35-In which algo. Waiting time is minimun?
Ans, SJF
36-How many address bits are there in Ipv6
ans. 128 bits
37-During run time heap is managed by
a. a user process in kernel mode
b. A system process manages heap for all the processes
c. A system process for each process
d. A user process in user mode
38-In which of following search is efficient?
a. height balanced tree
b. Weight balanced tree
c. Binary tree
39.A ques. on resource relocation, sharing ( I don't remember more
than this regarding this ques.)
40-some ques. options were sth like
a. transparency control
b. Migration control
c. Concurrency control
41-X:In DFD, input is converted into output by passing through various functional units
Y:DFD cannot be used in object oriented design
a. both X& y are correct
b. both X & Y are incorrect
c. X correct, Y incorrect
d. Xincorrect, Y correct
42-Where regression testing is used ?
a. Dynamic analysers
b. Loaders
43-For Java interfaces , what is true ?
a. Functions declarations are not given'
b. Variables are not declared
c. Instance variables are not used
44-In a linked list, we can delete a node in order of
a. 1
b. n
c. n ^ 2
45-If there are N people and we have to do symmetric & asymmetric
cryptography, how many keys would
be used in these cases respectively?
a. N & N ^ 2 (probably ans)
b. N ^ 2 & N
c. N & N
d. N ^ 2 & N ^2
46-The protected element of a class can't be accessed by
a. member functions of the same class
b. member functions of the derived class
c. member functions of any other class in the same program (Ans.)
47-NFS uses same file structure as unix
48-To solve an expression which of following trees will you use
?
a. postfix
b. infix

> Here are some questions of Hughes software system computer part:-
>
> Q. 1 void x(char* a)
> {
> (a[0])?x(a+1):1;
> printf("%c",*(a+0));
> return 1;
> .........;
> }
> Input string 'a' is assigned as AaBbCc , what is the output?
> Ans.-cCbBaA
>
> Q2 a question on digital gates ANS is OR gate.
>
> Q3 what is the binary representation of 41.6785
>
> Q4 if the precondition for a subroutine does not hold then
> 1.postcondition does not hold
> 2.postcondition may or may not hold
> 3. ?
> 4. ?
> Q5. In java
> 1. java strings are mutable. And some other options on java strings
>
>
> Q6. Void f(char *p)
> {
> p = (char*)malloc(6);
> strcpy(p,"hello");
> }
> void main( )
> {
> char *p = "BYE";
> f(p);
> printf("%s",p);
> }
> ANS BYE
> Q7. A question on write through and write back algo.
> Q8. What is concerned with transport layer.
> Ans PORT.
> Q9. A server can work with ip and ipx protocol.how the server will
> determine to which protocol the incoming packet coresponds .
> Q10. For which purpose dhcp is used ANS ip address
> Q11 global vaariable defined as ststic will serve the purpose of ---
> Q12 Question on NFS ANS It uses the same semantics as unix for
> file system
> Q13. Program counter is incremented typically in which uses ANS fetch
> Q14 NO of NULL pointers in a tree with n leaf nodes ANS N+1
> Q15.thread take less time than process context Why? Ans. Address space is
> same.
> Q.16 Which algo is best for sorting 10 elements?
> Ans. 1> binary tree 2> selection 3> bubble 4> none
> Q.17 a question on ICV(networking)
> a) When A sends an ICV and message, B computes ICV , checks It with given
> ICV,and decodes Message
> b) Similar other
> Q.18 When server A sends a time request to server B, (time
> synchronization), and response becomes past, What does A do?
> a) resets its own clock
> b) resends time request again
>
> Q.19 in public key encryption what does A do such that It is not visible
> to others?
> a) A uses public key part of A
> b) A uses private key part of A
> c) A uses public key part of B
> d) A uses private key part of B
> Q.20 function dependency can be described as:
> Q.21 q. on findind cyclometric complexity of the given program
> 1> 7 2>5 3> 4 4> 0
> Q.22 Codd's rule related to database
> Q.23 path testing comes under
> A) white box
> B) black box
> Q.24 when an ip address is not in the computer adresss resolution file
> what does It do with that packet
> a)Ignores It
> c) sends It to default gateway
> d) sends It to ethernet server
> Q.25 execution divided in different stages then this is called ANS.
> Pipelining
> Q.26 in C the macros are
> ANS. converted in to inline code during preprocessing
> Q.27 X: verification means doing the right things
> Y: validation means doing things right
> a) both true
> b) both false
> c) one true one correct
> Q.28 void insert (key, r)
> Keytype key, data
> {
> if (n>=max)
> ERROR
> Else
> R[n++].key=k;
> Which is best?
> 1> sequential search
> Q.29 which is best for associative list searching?
> 1) single linked list
> 2) doubly linked list
> 3) hash table
> Q.30 A question based on SQL ?
> Q.31 which is not necessary condition for deadlock?
> 1> mutual exclusion
> 2> no preemption
> 3> is ANS.
> 4> Circular wait

/=====================================
>From Venky...
/+++++++++++++++++++++++++++++++++++++++++

questions.
==> 1. a processor has two level cache.Their access time (level1
and level2) is 100ns and 300ns respect.Memeory access time is 1000ns$
==> ans is 140 (b)
==> 2.diskless server uses
==> a rarp
==> b arp
==> c ftp
==> d.telnet
==> ans rarp
==> 3.which one of them is not a client server
==> e-mail
==> telephone
==> webserver
==> and one more
==> ans is e-mail or telephone.
==> 4.Which one is used to represent operations
==> infix
==> postfix
==> binarytree
==> and one more
==> ans binary tree
==> 5.one qustion was on private key and public key.The quest. was
if a wants to send a message to b that no one other that b should $
==> A private key
==> A public key
==> B private key
==> B public key
==> 6.compliers maintain
==> ans is symbol table
==>

/++++++++++++++++++++
>From Diwakar...
/+++++++++++++++++++++++

1) what a java interface not have ?
ans - instance variables
2) what is done with java code on a web-page
ans - downloaded and executed on ur pc
3) what is the order of deleting a node from a linked list given a ptr
to it
ans O(n) ( since u have to traverse the list to reach the prev.
node)
3) what is RSA
4) how can A send a messageto B so that B knows its from A
ans A uses his private key so that B can use A's public key
5) what is the best sort in worst case
ans heap sort
6) what is the given sorting
ans selection ( check it )
7) what can access protected memebers of a class
ans other classes of that program
8) what protocol is used by a machine to map an ip to hardware address
ans arp
9) what is the size of ipv6
ans 128 bits
10) what protocol has ping
ans icmp
11) how many keys are needed in symmetric and asymmetric crptography?
ans - i dont know
12) one on a right threaded tree
13) very easy k-map
ans i think its b)
14) very easy ckt
ans choice which has option : a&c are equivalent
15) what in unix doesnt have a fd
ans process ( this was the first ques ).

Regarding Hughes
paper they conducted two tests. Both were technical(no aptitude test).
First one was compulsory for everybody. In second one could opt for
electronics or computers. In all i suppose there were 50 questions.
I sent a request to my classmates to send me questions whatevery they
could recall. Till now only one person has responded. I am sending those
questions to you.

And just before interview you were supposed to fill up a performa which
they call Behavioural Test. This was to check you interpersonal skills and
socialising capabilities. Questions like - would you like to be elected
leaders of organising committees, do you like peoply express their agonies
to you, do you wish people be close to you type questions were repeated in
one and the other form.

Interview was technical as well as personal. CGPA did count - it seems.
They selected 8 people from here. BTW what's your current CGPA and what's
the strength of your class. Do they come for B.Tech and M.Tech separatel
as the case here is or it's all at once.

Questions :

1.If a precondition of a sub routine fails then
a. post condition fails as well
b. Post condition may fail
c. post condition is declared but now defined.

2. whatz the o/p of the following program

char * a= "AabbCc";
void x(char *a)
{
a[0] == 0 ? x(a+1):1;
printf("%c",*a);
return 1;
}
x(a);

a. AaBbCc
b. cCbBaA

3. What is DHCP used for?

4. There are 2protocols IP and IPX are running on top of Ethernet. Suppose
a packet addressed to that ethernt card arrives, to which protocol the
ethernet sends the packet?
1. It checks the payload of the frame and finds out the protocol type and
despatches it to the right protocol
2. It fins out the protocol type that is mentioned in the ethernet frame.
3. despatches to both the protocol

5. What is the use of global static variable in C?

6. In which stage of the compilation the Macro in C are converted into
Iline code? (this is not the exact Qn a slight variation of it)

7 In the IP/Ethernet network, a packet with destination address
192.32.65.70 arrives and there is no entry for this address in the routing
table of the m/c? what does the m/c do about the packe
a. discards the packet.
b. Brodacasts into the ethernet.
c. sends to default router

8. in Public key Encryption , if A wants to send a encrypted msg to B then
A encrypts the message with
a. A's public key
2. A Pvt key
c. B's public key
d. B's Pvt key

9. consider the SQL statement "Create table New as select * from oldtable"
a. the sql stament is a correct one
b. New is reservd word there is an error
c. you can't select anything while creating a table
10. By Codd's defn for RDBMS whih one is not right?
options , I don't remeber

11. If X and Y are two attriubutes of a relation and 1 and 2 be any two
tuples in that relation
Y is fuctionally dpndant on X iff (X->Y)

a. if (x1 == x2) then y1==y2
b. if (x1==y1) then x2 == y2
someother combinations

12.The normalization process
1.reduces the data redundancy
2.It reduces the inconsistency that arises due to the data redundancy

13. ((A nand A) nand (B Nand B)) = ?
a. A+B

The question was not exactly in this form. gates represented pictorilly

14. whtz the purpose of flow control?
1. to control errors
. to control congession the receiving end
3. to sequnce the out of sequence packets

15. Whic is false about Java strings
1. The are Null terminated
2. Set of Chars
3. The Condition checking == and = on a sme pair of strings gives
different results.

16. When a java Applet is downloaded what does it do?
Don't remeber the options
it's went something like this:
1. checks the magic nubmer

17. Whatz is the Cyclometic complexity of the following code
don't remember the code exactly

Some more questions...
======================

1:a machine A wants to set it's time same as a a machine B
so it sends a packet to B and b sends reply.but the time on packet is over by the timete packet
reached A.A has to
a1:set the time on packet
b2:increment its time slowly so as to reduce deifference
c:send packets repeatedly till it gets a packet with time less tan the current time
d:....

2.which of the following protocols does not find mac address given internet address
a>arp
b.rarp
c....
d...

3.when an java applet get's downloaded what happens
a.the byte verifier checks the magic number
b...
c...
d...

4.when A wants to send a mesg to B using Public key cryptography he uses
a.A's public key
b.A's private key
c.B's public
d.B's private

5.how does a string in java differ from that of c/c++
a1.java strings are mutable
b.java strings does not have a \0
c.
d.

6.given str="AaBbCc"and a small c program
something like

a:b:( )

the program actually reverses the string recursively

7.some protocol SHDC

8.NFS server is similar to
a.provides similar sevices as unix
b.a file trans fer.....
c.just gets the file for reading..
d.

9.an address 202.15.46.45 is to be located.the machine does not have
info about 202.0.0.0 or 202.15.0.0 0r 202.15.46.0
so the DNS server willl now

a.discard the packet
b.send the mesg to a default server if available
c.send mesg to a DNS server if available
d......

10.verification:"are u building the right product"
validation:"are we building the product right"

a.both are wrong(ans)
b.both are correct
c.first wrong second correct
d.first correct second wrong

11.A:"cohesion is a desirable property"
B:"cohesion means the property that the entire unit is one......"

a.both are correct
b.both are wrong
c.first wrong second correct
d.first correct second wrong

12:definition of functional dependency.

13:which of the following does not use extra memory
a.....
b.insertion sort
c.shell sort
d.both b and c.

14:which of the following is better for ten elements

a.bubble sort
b.selection sort
c.quick sort
d......

15.the memory reference time for cache is 100 ms and for memory is 1000ms
.the probalility of a hot is .9.the average memory access time is
a:100
b:200(ans)
c:500
d:1000

16.a question on socket numbers

17there is an ordered binary tree and an index structure
a.we can use ordbintree without ordering
b.orb are used with ordering where as indexing canbe done without ordering
c.indexing uses extra memory
d......

18.there is ethernet protocol and ethernetIPstack in MAC sublayer
when an address has to be found which is used

Some more questions:

====================

A question on multi threading!
It has got a PC, register space kind of options.

A question on NFS.
a. doesn't allow read.
b. it is just like Unix file system.
c. After the file is opened, the whole file os transferred to the client
d. there is no state information maintained.

What takes maximum time in a context switch.
a. saving registers.
b. address space switching.
c. flushing the TLB
d. getting the new process inside the memory.

1.If a precondition of a sub routine fails then
a. post condition fails as well
b. Post condition may fail
c. post condition is declared but now defined.

2. whatz the o/p of the following program

char * a= "AabBCc";
void x(char *a)
{
a[0] == 0 ? x(a+1):1;
printf("%c",*(a+0));
return 1;
}
x(a);

a. AaBbCc
b. cCbBaA

3. What is DHCP used for?
Assignment of IP addresses.

4. There are 2protocols IP and IPX are running on top of Ethernet. Suppose
a packet addressed to that ethernt card arrives, to which protocol the
ethernet sends the packet?
1. It checks the payload of the frame and finds out the protocol type and
despatches it to the right protocol
2. It fins out the protocol type that is mentioned in the ethernet frame.
3. despatches to both the protocol

5. What is the use of global static variable in C?

6. In which stage of the compilation the Macro in C are converted into
Iline code? (this is not the exact Qn a slight variation of it)
pre-processing stage.

7 In the IP/Ethernet network, a packet with destination address
192.32.65.70 arrives and there is no entry for this address in the routing
table of the m/c? what does the m/c do about the packe
a. discards the packet.
b. Brodacasts into the ethernet.
c. sends to default gateway
d. sends to the server

8. in Public key Encryption , if A wants to send a encrypted msg to B then
A encrypts the message with
a. A's public key
2. A Pvt key
c. B's public key(Answer)
d. B's Pvt key

9. consider the SQL statement "Create table New as select * from oldtable"
a. the sql stament is a correct one
b. New is reservd word there is an error
c. none
d. new should come within quotes.

10. By Codd's 14 rules for RDBMS whih one of following is not right?
a. null values r not defined.

11. If X and Y are two attriubutes of a relation and 1 and 2 be any two
tuples in that relation
Y is fuctionally dependant on X iff (X->Y)

a. if (x1 == x2) then y1==y2
b. if (x1==y1) then x2 == y2
someother combinations

12.The normalization process
1.reduces the data redundancy
2.It reduces the inconsistency that arises due to the data redundancy

13. ((A nand A) nand (B Nand B)) = ?
a. A+B

The question was not exactly in this form. gates represented pictorilly

14. whtz the purpose of flow control?
1. to control errors
. to control congession the receiving end
3. to sequnce the out of sequence packets

15. Whic is false about Java strings
1. The are Null terminated
2. Set of Chars
3. The Condition checking == and = on a sme pair of strings gives
different results.

16. When a java Applet is downloaded what does it do?
Don't remeber the options
it's went something like this:
1. checks the magic nubmer

17. Whatz is the Cyclometic complexity of the following code
don't remember the code exactly

Thaz all I rember.

1-N keys to be sorted using n space,which algo?
a. insertion
b. shell
c. both insertion and shell (ans)
d. quick

2-Heap doesn't have following property ?
a. smallest element is at leaf
b. two elements cannot be the same. (ans)
c. height of heap is logn
d.

3-searching time is min. in
a. Hash

4-To sort 10 values, which sort will you use ?
a. bubble (ans)
b. quick
c. binary tree
d. All the above

5-A has to send message toB
ans. A will use B's public key

6-a ques on NAND gates (perhaps same as that in DCE)
a figure was given like
(A nand A ) nand (B nand B)
ans- A or B

7- F(char *p)
{
p=(char*)malloc(6);
strcpy(p,"hello");
}
main()
{
char*p;
p="bye";
f(p)
printf("%s", p);
}

ans- bye

8-In Asynchronous transmission
a) client sends a request and then waits for response....
b. client send a request and then continues with work without expecting a response
c. client sends a request and the continue with work and reacts
for the response when it comes (ans)
d.

9-DHCP is
a. assigning IP addresses

10-Ethernet LAN has IP &IPX protocol at the network layer, a packet comes from some other host.
a. it will not give packet to any layer
b. it will check the data field in the frame for the protocol type and send it accordingly
c. it will check the protocol field for the protocol type and send the frame accordingly (ans)

11-verification:Are we building the right product?
Validation:are we building the product right?
Ans. Both are wrong.

12- Normalisation

13-
char *p="AaBbCc"

int x(char*p)
{
p[0] ? x(a+1):1;
printf("%c",*a);
return 1;
}
ans cCbBaA

14-in line expansion of macros happens in preprocessing stage of compiler

15-when is Write through is better from write back in terms of cache.
a. single cache less instructions (ans)

16. if the compiler gives static allocation for a program then which is not possible
a. Dynamic binding
b. Recursion (ans)
c. Indirect address loaction
d. Direct address location

17-which of the following will have minimum thread switching overhead;
a. INET domain sockets
b. UNIX domain sockets
c. shared memory variables (ans)
d.

18-what is the cyclometric complexity of the following code

if(x==0 or y==o)
{
...
}
else
{
....
while(...)
{
..
..
}
}
a. 3
b. 4
c. 7d Noneof these

19-41.6375->convert into binary

20-binary tree has how many null pointers ptrs
a. n
b. n+1 (ans)
c. 2n

21- No of comparisons in the worst case in Merge sort
a. 2n
b. 2n-1 (ans)
c. 2n-2
d. 2n+1

22-path testing
a. black box
b. white box(ans)

23. Which of the following is true for NFS.
a. It is stateless. (ans)

24-ICV ques

25- A client wants to synchronise it clock with the server over
TCP but the reply packet send time that is already past then what will it do
a. Client will immediately set its clock to the recieved time
b. Client will ignore the reply.
c. Client will repeatedly send the time requests till the time received is longer than its clock.
26-How control in tCP is when
ans congestion .....

27- In order to have a assembly language procedure reentrant what will be done.

28-program counter incremented in which stage.
a.Fetch

29-ordered binary tree & hash -which is better

30-time server

31-why does dram need refreshing periodically.
a. it contains flip flops
b. its charge gets depleted due to memory read
c. its charge gets leaked (ans)

32- some insert algoritms given like
insert(...)
{
..
}
where is it used.
a. binary search
b. interpolating search
c. sequential search

33- In context switching which of the phases takes longer time
a. flushing the translation lookaside buffer
b. swapping out the process to the disk
c. saving the registers
d. loading the new process from the disk (ans)

34- the use of static declaration for external variables
a. localising scope (ans)
b.

35- .If a precondition of a sub routine fails then
a. post condition fails as well
b. Post condition may fail
c. post condition is declared but now defined.
d. post condtion never fails (ans)

36 9. consider the SQL statement "CREATE TABLE NEW AS SELECT * FROM EMP"
a. the sql stament is a correct one (ans)
b. New is reservd word there is an error
c. you can't select anything while creating a table
d. NEW should have been in quotes

37- If X and Y are two attriubutes of a relation and 1 and 2 be any two
tuples in that relation
Y is fuctionally dpndant on X iff (X->Y)
a. if (x1 == x2) then y1==y2 (ans)
b. if (x1==y1) then x2 == y2
someother combinations

38- Whic is false about Java strings
1. The are Null terminated (ans)
2. Set of Chars
3. The Condition checking == and = on a sme pair of strings gives
different results.

39- When a java Applet is downloaded what does bytecode verifier do
a. checks the magic nubmer (ans)
b. checks the bytecode whether it has been written properly
c.

40- given a domain name which of the following does not find the IP address
a. /etc/hosts
b. ARP (ans)
b. RARP
c. DHCP

41- an packet for address 202.15.46.45 is to be sent.the machine does not have
info about 202.0.0.0 or 202.15.0.0 0r 202.15.46.0. so what will be done

a.discard the packet
b.send the mesg to a default gateway if available (ans)
c.send mesg to a DNS server if available
d......

42- A:"cohesion is a desirable property"
B:"cohesion means the property that the entire unit is one......"

a.both are correct (ans)
b.both are wrong
c.first wrong second correct
d.first correct second wrong

43- the memory reference time for cache is 100 ms and for memory is 1000ms
.the probalility of a hot is .9.the average memory access time is
a:100
b:200(ans)
c:500
d:1000

44- what do you use when you want to have differnt phases of instruction
to get exedcuted in different units
a. pipeline (ans)

45- By Codd's rules for RDBMS whih one of following is not right?
a. null values r not defined
b. Integrity constraints are placed in separate files (ans)

Top 10 Interview Tips OF Hughes:
================================

Here are the 10 most commonly asked questions in the job interview, which will
help you prepare yourself better for the forthcoming campus placement and also
give you a competitive edge over others.

A well thought out answer to these questions, prepared and rehearsed in
advance with the logical sequencing of the events will help you sail through.

1. Tell us about yourself

This is an open canvas for you giving you an opportunity to direct and lead
your interview in the direction you want. Good idea will be to structure your
answer in the following three broad heads:
Family Background
Educational Background (starting from schooling to
professional qualifications)
Achievements

In all the above subheads speak only that information which will give strength
to your candidature. Avoid verbose description of yourself.

2. Why do you want to join us?

To answer this question, you must have researched the company well. Here you
can quote some of your personal beliefs, which are in conjunction with the
values of the company or talk about specific products and services which could
be your professional interest too.

In the event where your skill set is mapping with the requirement of the
company, do not miss the chance to highlight the same. Specify the initiatives
taken or work done to attain that skill set.

3. What would you like to be doing five years from now?

This question is asked to assess candidates career plan and ambition for
growth and to see if the company will be able to provide that opportunity over
period of time. Also to assess if your personal goals are not totally off
tangent with what companys objectives are. It is also to check your stability
with the organization. It is good idea to be very realistic in your answer. If
need be take guidance from your seniors who are already in the corporate
environment.

4. Do you prefer working with others or alone?

This question is usually asked to determine whether you are a team player.
Before answering, however, be sure you know whether the job requires you to
work alone. Then answer appropriately.

5. What are your biggest accomplishments

You may like to begin your reply with: "Although I feel my biggest
achievements are still ahead of me, I am proud of my involvement withI made my
contribution as part of that team and learnt a lot in the process". It will
be a good idea to close your answer with also specifying what attributes and
circumstances made you succeed.

6. What are your favorite subjects

It is a leading question giving direction to the panel members for possible
areas where they can probe in further for your knowledge base and in depth
understanding. It is advisable to select the topics that you are competent in.

7. Why should we hire you?

Keep your answer short and to the point. You should highlight areas from your
background that relates to the need of the organization. Recap the
organizations description of the job, meeting it point by point with your
skills.

8. What are your hobbies?

This question is generally asked to assess whether you are "desktop" kind of a
person or an "interaction orientated person". It also indicates your
preference for team - oriented activities or projects with solo contributions.
It enables the organization to place you accordingly after selection. Be
candid with your answer.

9. What is the worst feedback you have ever got?

To answer this question you must admit and share your areas of improvement.
Also sharing an action plan for improving oneself will indicate your ability
to take criticism well. Your answer should be reflection of your
open-mindedness.

10. What is the most difficult situation you have faced?

Here you should be ready with the real life story. The question looks for
information on two fronts: How do you define difficult? and, what was your
handling of the situation? You should be able to clearly lay down the road map
for solving the problem, your ability to do task management and maintain good
interaction with your team members and other peers. It is advisable to close
with highlighting the learning out of the incident.

Interview tips-
==> 1.Family background.
==> 2.Ur interest.Say only the things u know.Sometimes they can
ask wayward questions regarding ur project so be prepared for that.
==> 3.U should have fair idea abut the sub. mentioned in ur resume.
==> 4.If u don't know anything say NO.
==> 5.Try to get stuck in the topic which u know thoroughly.Like
one of my friends got stuck in tcp/ip networking and he got thru.
==> 6.In our college four groups were taking interview so some of
us were unlucky as the judgement varies.
==> 7.Why do u want to join hughes.For this get the answer from their ppt.
==> 8.If ur given a project in some other field would u work.Say
yes i would try to succeed in every task assigned to me.
==> 9.They can ask u to write some algo in datastructure like bubble sort ,quick sort etc.
==>
==> Mostly the technical questions varied from person to person
but generally was concerning their project.Unfortunately they asked m$
==>

About hss - for us
the interview was basically on summer project , networking - routers /
congestion control in tcp etc, some os fundas .HR part was a modified
version of the stuff on the web site - strength/weakness,can u work in
a gp, do u have problems asking ques to ppl, ur future plans , gre .
i think i didnt get it bec. i told them that i plan to do an ms.

books
1. Quantitative apt from RS agarwal
2. Verbal and non verbal reasoning by RS AGARWAL

Only aptitude test is there.

paper contain

3-part

1.quantitative

2.reasoning

3.again quantitative type

total 20+13+12 question = 45 Q's
-----------------------------------

no negative marking and time 45 minute
======================================

pattern of questions
====================

1.first qestion on figure which is easy only one question in paper.(c)

2.1 1 2 3 5 ......
ans:8

3.odd man out - 10 ques from(1)

4. Code for ABCDE is KLMN then code for BEC is ?

5. Array has N elements . To reverse it the subscript should be ?
hint A(N-I) , I=0,1,....

6. There r 800 coins and 1 is of lesser weight . Identify it ?
hint : divide by 2. anad compare .. binary tree

7. Question on permutation and combination like- five alphbets r there , one is
repeating 2 times. its probability?

8. Questions like . A>B, B>C.... find relation b/n others

9.A programme has a complexity of n at the first stage and n^2 in the
second stage and n^3 in the third stage.find overall complexity ?
Ans: n^3(highest)
10. 5 questions on veinn diagram from book (2)

11. 2 questions on relations.

12. Code for MEN is 13-5-14 and TEN . Code for QUIZ is ...
hint : ( code for letter is its order ie for E-5.

13:reasoing:in question 5 dish and 3 drink is given and some codition
is give like
1.you will not take coffee and tea both
2.doctor advise you not to take some two dish given.
and like two more condition is given
a:which drink alwayes taken by person
ans:orange juish.

this is easy question.

14:second reasoinig question is like jone in rank above david and like
3 to 4 statment is give.
and question is like.
1.who is at higest rank.
2.if merry is at rank 3 than the rank of david.
this type question you can find in many book.
Some more q's ( from Delhi )
==============

hi friends
there are three section . there are 44 question in all three section .the time is 45 mainutes.it$

section I -20 question.
section II-11 question . it is GRE resoning .you can easyly do these section.
section III-13 question

there is no time limitatioin in individual section .so do not bothere for that.

1. there is question on figure .it is easy.

ans d) correct 2. there are 1800 coins .one soin is defective in that .in
how many minimum times you can find that the coin is defective.

a)11
b)9
c)7
d)2

3. there are two kind of professonal in a company software & personal.if the
personal are 15% of the total .a party is going .in a party if 50% of the
total professonal left and all are s/w then what is the ratio of the s/w
professonal left to total software professonal.

ans b) 10/17 4. what is the probebility of the talking out two card one
king and one quene of black in a card packet.

ans d) 1/663 (ckeck)

5.1 1 2 3 5 ... 13
ans 8

6.there are two more question of series .they are easy.

7.there are two question of coding and decoding.they are also easy.

8.how many word are be formed by by a 5 alphbet ward in which one word is
twice.(I don't rembere the exact word)
ans 60 (correct0

9.there is one question on price rise and fall .
ans 1% decrese in price.

10. 1,7,17,31,--,71
ans 49
section II

in this there are easy question on reasoning like GRE .

hi friends
there are three section . there are 44 question in all three section
.the time is 45 mainutes.it is suffucent.

section I -20 question.
section II-11 question . it is GRE resoning .you can easyly do these section.
section III-13 question

there is no time limitatioin in individual section .so do not bothere for that.

1. there is question on figure .it is easy.

ans d) correct
2. there are 1800 coins .one soin is defective in that .in how
many minimum times you can find that the coin is defective.

a)11
b)9
c)7
d)2

3. there are two kind of professonal in a company software & personal.if
the personal are 15% of the total .a party is going .in a party if 50% of the total
professonal left and all are s/w then what is the ratio of the
s/w professonal left to total software professonal.

ans b) 10/17
4. what is the probebility of the talking out two card one king
and one quene of black in a card packet.

ans d) 1/663 (ckeck)

5.1 1 2 3 5 ... 13
ans 8

6.there are two more question of series .they are easy.

7.there are two question of coding and decoding.they are also easy.

8.how many word are be formed by by a 5 alphbet ward in which one
word is twice.(I don't rembere the exact word)
ans 60 (correct0

9.there is one question on price rise and fall .
ans 1% decrese in price.

10. 1,7,17,31,--,71
ans 49
section II

in this there are easy question on reasoning like GRE .
I don't remember the passage and question.there are 11 question
in this

HUGHES 99

2007-05-06T03:53:00.002-07:00

HUGHES-99

SECTION A:30 BITS
SECTION B:20 BITS
SECTION C:20 BITS
SECTION A IS COMPULSORY
ATTEMPT EITHER SECTION C OR SECTION B
FOR ELECTRONICS BACKGROUND,IT IS BETTER TO ATTEMPT SEC B

SECTION C:
1.an lead compensator zero is at Z=Zc, pole is at P=Pc
then the following is correct
a.Pc >Zc,pc<0,zc<0
b.
c.
2. gain margin of g(s)h(s)=1/s(s+k);
a. sqrt(1+k2)
b.0
c.infinity
d.1
3.machestor code does not improves
A. clock recovery
b. bandwidth efficiency
c.

4.possion distribution is used for
a. used in FSM
b.
c.used for queuing delay system of mutually identical events of arrival
d. both a and c
5. no.of filpflops for mod 11 counter
a.four
b.five
c.

6. no of comparators required for 4 bit parallel A/D comparator
a. 4
b. 16
c. 15
d. none

7. if even parity is used for parity generation, what is the
hamming distance
(simple fig is given)
ans:2
8. the code set is {00000,00111,11100,11011}
what is the error detecting and correcting capability?
ans:2,1

9. operational amp characteristics following is correct:
1. input impedance is 0
2. output impedance is infinity
3. input impedance is infinity
4. gain is infinity
which combinations are correct?

10. band pass signal having frequencies 2.5k and 4.5k?give the
sampling freq
a. 9k
b. 4k
c. 4.5k
d. 7k

11. defination of avalanche diode multiplication

12. more no of ripples are present in the diagram?which is correct
a. lower order filter
b. high order filter
c.

13. if CPU have one interrupt pin and on to connect with external
devices with some priority?
which type of the following is used?
a. parallel priority interrupt
b. daisy chain
c. RS filpflop
d.

14. one megabit file transfer, serially on 9600 baud one start bit and
two stop bits, then how much time it takes (approx)
a. 4 hours
b. 2 hours
c. 20 minutes
d. 2 minutes

15. IEEE 802.5 is
ans: TOKEN RING
16. Code sequence is given
what is the error correcting distance?

17. bit stuffing used in HDLC Protocol for
ans: b is correct(read on text book)
18.
19.
20.

section A AND B:(BOTH MIXED)
1. If "AaBbCc" is passed to the char

char x(*a)
{
a[0]?x(a+1):1;
printf("%c",a[0]);
return 1;
}
what will be the output?

2. f(*p)
{
p=(char *)malloc(6);
p="hello";
return;
}
main()
{
char *p="bye";
f(p);
printf("%s",p);
}
what is the o/p?
ans:bye

3. when the program counter is incremented in the instruction cycle
a. fetch cycle
b. int cycle
c. execuation cycle
d.

4. two sorted lists of n elements will take at least
fine the order of complexity?
a. 2n
b. n/2
c. square(n)

5. logic diagram is given? find the expression
ans: OR gate
6. question on JAVA string
ans: string ends without a null character
7. cache access time is 100ns. main memory access time is 1000ns, hit ratio
is .9, find mean access time?
ans :200ns
8. which is not suitable to find out IP address
ans:ARP
9. about deadlock condition
10. convert 41.6875 into binary
11. read about IP AND IPX
12. read about NFS
13. DHCP is
a. for routing
b. for network address conversion
c. for diagnosis
d.
14. execution phase can be
a. pipelined
b. no parallelism is possible
c. vector processing
d.

15. In public key algorithm , A wants to send message to B .....
which key is used
a. A public key
b. A private key
c. B public key
d. B private key

16. to prevent replay attacks in transmission
a. symmetric encoding
b. Asymmetric encoding
c. for every exchange, key should be changed

17. virtual functionality is used in C++
a. dynamic binding
b. if the derived func is present but base class not present
c.

18. if there are n nodes in a binary tree, how many null pointers are
there
ans:n+1;
19. if heap sort contains n elements, no of comparsions required are
a. log(n)
b. height of heap sort
c.
d.

20. question on ICV(integrity check)
21. which of the following is efficient in terms of space
a. insertion sort
b. quick sort
c. selection
d. both a and c

22. in 32 bit representation, the range of numbers in 2's complement
form
ans :-2 to the power of 31 to 2 to the power of 31 minus 1
23. about normalization
24. socket is implemented in TCP Layer. which of the following is
related to TCP layer
ans: port number
25. in reentrant procedure, which should be not used for passing
parameters?
a. passed by reg
b. by direct
c. by indirect
d. by stack
26. which is related to thread
a. separate switching reg
b. " stack
c. " address space
d.
27. flow control is used for
a. congestion at receiver
b.
c.
d.
28. 5 questions on DBMS are there
29. in global static variable , declartion in a file
a. localization of scope
b. persistance of the value through out the file
c.
d.
30. in sorted table contains elements , which of the searching is
false
a. hash table
b. binary searching

31. in demand paging overhead of context switching is more due to
a. copy processes from disk to memory
b. viceversa
c. to get associative table
d. swapping to the disk
32. when write through is better than write back(related to cache
memory)
33. which is false when normalization is used?can't express
34. I :verification: are we doing right product
II: validation:are we doing product right
a. I AND II ARE TRUE
b. I AND II ARE FALSE
c. I TRUE AND II FALSE
d. I FALSE AND II TRUE

35. A table contains less than 10 elements which one is fastest
a. bubble sort
b. selection sort
c. quick sort

36. about subroutine, precondition is false. what about post condition
a. post condition is not defined
b. post condition is always true
c.
d.

37. When static variables are used, which one of the following is
not possible?
a. dynamic run time
b.
c.
38. in product of x and y,

if(x=0|y=0)
y=1;
else
y=0;
(not cleared)
what is cyclometric complexity?
a. 3
b. 2
c. 1
d. 0

39. CREATE TABLE NEW AS SELECT BIG FROM EMP
The above SQL statement is correct or not?
(question is not cleared)
40. path testing is
a. white box
b. black box
c. installation test
d. environment test

41. program is given?

above algorithm represents what type of
search?
a. binary search
b. interpolation search
c. sequential search
d.
(may be "b" is correct);

42. if x->y in a relation R, x1 and x2 are in x, y1 and y2 are in y
(question not cleared), about functional dependancy
a.x1=x2 and y1=y2
b.
c.
43. in a down loading from website ,which one is correct?
ans: check the byte code and indicate the error, if any.
44. about UDP
one Address is given but that is not the state table
what will it do the packet
a. packet is discarded
b. packet is sent to ethernet server
c. packet is sent to other address
d.

45. in associated memory for fast accessing
which one is used
a. single linked list
b. double "
c. hash table
d.

HUGHES 1999

2007-05-06T03:53:00.001-07:00

This paper was contributed by Mr. Thejo Prakash pillai
I am thankful to him for this

This is HUGHES-99 paper
**********************************
It consist of two section part A and B or C
For CSE student part A & B is better.
Here i am writting some Questions from part A and B for CSE student
Questions are not in order.
***************************************************
1.

f(char *p)
{
p[0]? f(++p):1;
printf("%c",*p);
}
if call that fuction with f(Aabcd) what is the output??
ans:dcbaA (Just reversing the string

2
f(char *p)
{
p=(char *)malloc(sizeof(6));
strcpy(p,"HELLO");
}
main()
{
char *p="BYE";
f(p)
printf("%s",p);
}
what is the o/p???
ans:HELLO
3

To sorting array of 10 elements which sorting is best
a)slection
b)bubble
c)tree sort
d)....
ans:a

4

To saving space paoint of view which sort is best
a)selection
b)insertion
c)both a & b
d)...
check it once.U Can easy Aanswer this question(UCA)

5
Which statement is wrong on heap
a)Any two childs should not same
b)..
c)..
d)...
ans:a
6)
one more question on heap

UCA

7
read about cyclometric complexity..
8

how many null pointer are there in N number binary tree
ans:N+1

9
Two sorted list of size n what are the maximum comparison in merge
ANs:2n-1
10
converting 41.685 to binary
11

pc is incremented while executing ---------- instruction
ans:fetch instruction

12

this is gates (NAND)problem
It means some gate figure has given with all NAND gate we have write
equavalent gate
ans:OR gate

13
x:validating :Are we producing product right
y:verification:Are we producing right right
a)X is wrong statement
b)y is "
c)x and Y "
d)x & y is right statement

14

NFS some queston in NSF.
see distibuted operation System book
by tenaun bamab
15.
IP & IPX is implemented in trasport layer.......
mama all our friends can answer this question .Here i am unable to recall
that question.If u a have any doubts on Ip & IPX contact HARI because he
did his project is B.Tech in that protocals

UCA
16

comparison between hashtable and binary tree
ans:a
UCA

17
client server is working in asyn mode then how communication will take place
bt client and server.

UCA
18
once context swithing occures then ------------will take place
a)saving register
b)saving stack
c)....
d).....
UCA

19
If precondition is failed what u say about postcondition?
Note:Read about preconditon and postcondition
20
whiling download java applete then web broswer do the folling
a)checking the class structure..
b)...c)....d).....
Read about this
21
Strings in Java
a)Mutable
b)variable length string
c)...
d)....
ans:b
22
in Internet Transprot layer which is not a protocol
a)/etc/host
b)TCP
c)UDP
d)...
UCA
23

Which is not specified in CODD's rules
a)....
b)....
c)...
d).....

It is from DBMS question
Refer NAVATHI BOOK chapter -9 appendx topic is CODDE's rules
24

what is the use of Normalization
a)....b)....c)...d)...
Any one can answer
25

Futional dependecy x->y is shows that
a)if x1=x2 then y1=y2
b)...c)...d)...
ans:a
26

one question on IP addsress 243.65.77.8 some thing
a)...b)..c)..d)...
every one can answer
27

If A sends a message to B with encryption then key is
a)A public key
b)B public key
c)A private key
d)B private key
ans:b (Check it once)
28

In a class only declaration of the function is there but defintion is not
there then what is that function
ans:virtual function

29
what is not necessary condition in dead lock
ans:a
30
One question from multible inheritance...
a)..b)..c)...d)......
31)
ICV protocal
i don't know about this mama .Till now i didn't heard that protocol
mama..just know what is that then u can answer this question

32

one question from catches like write-through protocal etc
33
catche access time is 100ns ,memory access time is 1000ns and hit ratio
is 0.9 then what is average memery access time
a)100ns
b)200ns
c)400ns
d)500ns
ans:b
***********************************************************************
Hai friends,
Here am sending 32 question remainings are some C questions and easy
i didn't remeber correctly,sorry.If do 30 question u can select easly.Then
remainning things are depend on ur interview.
HUGHES is not bother about ur GREE english etc it what Indepth at any field
of CSE.
I wishing that atleast 4 or persons will be slected in HUGHES from our
collge(N.B.K.R.S.T).
If u have any doubts at any aspect please ask me. I am praying GOD every our
will settle in good position with 10 or 15 days.
After our selection is competed we allwe meet in one place before our job
appointment
bye....
with love
kissr, Nayudupet.

HUGHES @ IITK 25/08/97

2007-05-06T03:51:00.000-07:00

****************************************************************************
HUGHES
****************************************************************************
Source : iit k ( this paper is got from rookee and same is given in iitk)
Dated :25/08/97

section A 30m (Compulsary)
section B or C 20 m(changed )m
Attempt either B or C sec B contains CST
C E&C
Better to attempt Electronics paper
(Those who are having electronics background)
----------------------------------------------------------------------------
SECTION A

1. Which of the folowing is not correct
a. (x+y)'=x'.y' b. (x'+y')'=x.y
c. (x'.y')'=x+y d. (x'+y')'=x'.y' [d]

2. Question on logic ckt. U have to find the output
ans. AB'+CD'+EF'

3. Output of MUX
_________
c-----| |
c'----| |-------Y
c'----| | ans. A xor B xor C
c-----| |
---------
| |
A B (select lines)

4.If X and Y are two sets. |X| and |Y| are corresponding
coordinates and exact no.of functions from X to Y is 97
then
a. |X|=97 |Y|=1 b. |X|=1 |Y|=97
c. |X|=97 |Y|=97 d. .....

5. If two dies are thrown simultaneously what is the prob.
of one of the dice getting face 6 ?
a. 11/36 b. 1/3 c. 12/35 d. 1/36 [a]

6. The relation ,<,on reals is
a. a partial order because of symmetric and reflexive
b. ... antisymmetric and ....
c. not ...... .. asymmetric and non reflexive
d. ... .... not anti-symm and non reflexive

7. In C language the parameters are passsed by
a. values b. name c.referrence d....

8. Advantage of SRAM over DRAM
ans. faster

9. Diasy chaining related question (refer Z80)
a. uniform interrupt priority
b.non .... ....
c.interfacing slower peripherals
d.....

10. RAM chips arranged in 4X6 array and of 8kX4bit capacity
each. How many address lines reqd. to access each byte
a. 12 b. 16 c.15 d. 17

11.Question related to AVL trees regarding how many no.of
nodes to be changed to become balanced after addition of
a leaf node to a particular node.
ans . 3

12.When following sequence is insertedin the binary search tree
no.of nodes in left and right subtrees
52 86 64 20 3 25 14 9 85

13.Method used for Disk searching..
a.linked list b.AVL c.B-tree d. binary tree

14. Which of the following is correct statement.
a. 1's complement can have two zero re[resentations
b.2's ... ... represent an extra neg. number
c.2's & 1's have no difference in representing 16-bit no.
d.......

15. AX=B where A is mXn ,b&X are column matrices of order m
a. if m LESS THAN n, X has infinite solutions
b.if m=n, rank of A c.... d....

16. The option avialable in C++, not C:
a.dynamic scoping
b.declaration in the middle of code block
c.seperate compiled and linked units
d. ....

17. int a[4]={1,2,3,4};
int *ptr;
ptr=a;
*(a+3)=*(++ptr)+(*ptr++);
A part of code is shown. The elements in A after
the execution of this code.
a.1 2 3 4 b. 1 2 3 6
c. compilation error d.1 2 2 4 [a]

18. Critical section program segment is
a. enclosed by semaphores with P & V operations
b. deadlock avoidance
c. where shared resources are accessed
d. ...

19. when head is moving back and forth, the disk scheduling
algorithm is _____
a) scan b) sstf c) fcfs d).....

20. how many times the loop will execute

LOOP LXI B,1526H
DCX B
JNZ LOOP
a)1526H times b) 31 c)21 d)38

21. the addressing mode in which the address of the operand is
expressed explicitly within the instruction
a)index addressing b)absolute c)indirect d) immediate

22. (A - B) U (B - A) U (A ^ C) = ?
where A,B are two sets A' , B' are compliments of A and B
a) A U B b) A ^ B c).... d).....

23. the network that does not use virtual circuit
a) IP b) X.25 c).... d).....

24. source routing bridge
a)source will route the frame
b)frame will routed with info in header
c).... d).....

26. cache access time 100 msec. main memory access time 800 msec
if the hit ratio is 95% , what is mean access time ...

27. the module that should be always reside in main memory is
a) loader b)link module c)... d)....

.... and some questions related to

1. addressing mode 2.assembler passes 3.linking and loading
4. file directory search 5. turning machine
6. finite state machine 7. daisy wheel

28. The order of algorithm to merge the two sorted lists of
lengths m and n is
a. O(m) b. O(n) c. O(m+n) d. O(log(m)+log(n))
29.A chocolate block is of 4 X 4 size.How many cuts are needed
to make 1 X 1 size blocks. No simultaneous vert. & horz. cuts.

30. Which among the following is not correct
a. O(n) > O(log n) .. likewise
-----------------------------------------------------------------------------

HUGHES PAPER

2007-05-06T03:50:00.000-07:00

Hughes paper:
total 50 questions (1 hour).
Paper is like GAte CS .

section A : compulsory for CS and Comm students.
section B : for CS only
section C : for comm only.

questions :

1. given a digital ckt with nand gates. what is o/p Ans. nor gate
2. given an logical expr. x,y,z. simplify ans. xz
3. It is recommended to use which type of variables in a recursive module.
Ans. static variables.
4. which one of following is not memory management model?

given buddy system, monitors, paging, swapping Ans. monitors
5. what m/c is used to recognize context free grammar ? Ans. pushdown automata
6. Which type of grammar can be recognized by finite state m/c Ans. right linear
grammar.

7. proc() {

static i=10;
printf("%d",i);
}

If this proc() is called second time, what is the o/p Ans. 11

8. int arr[] = {1,2,3,4}
int *ptr=arr;

*(arr+3) = *++ptr + *ptr++;

Final contents of arr[] Ans. {1,2,3,4}

9. TCP/IP hdr checksum : what method is used ?
Ans. one's complement of sum of one's complement.

10. CSMA/Cd is used in which lan Ans. ethernet

11. 8085 pgm : LXI sp, 2021,
LXI b, 1234 (??)

push b

contents of stack after pushing ?

12. One question on synchronous transmission :

ans. Timing info is embedded in data itself
13. What for start bit is used in RS232 transmission.

14. One solution for deadlock prevention for dining philosopher's problem

Ans. Allow one person to take first left stick and then right stick
and remaining persons in reverse order.

15. 4bit seq no in sliding window protocol with selective repeat.
what is the max no. of acks that can be held at transmitter
ans. 8
16. given a height balanced tree. If we add one more node , how
many nodes gets unbalanced ? Ans. 3

17. Given a arbitrary pointer to an element in a singly linked list?
what is the time complexity for its deletion . Ans. O(n)
18. what is the diff b/n c and c++

a. dynamic scoping
b. nested switching
c. declaration of variables in any code block
d. separation of compilation and linking

Ans. c (??)
19. which one is false ?

a. 0 LESS THAN x LESS TAHN y, n power x = O(n power y)
b. root of log(n) = O(log logn)
c. O(logn/100) = O(100 logn)
d. 2n not = O(n power k);

Ans. b or a. (??)
20. S->S+S; s->s*s; s->a

how many parse trees possible : a+a*a+a Ans. 5
21. 4-1 demultiplexer is to be implemented using a memory chip.
how many address lines and word length required Ans. 4, 1

22. Vector intr mechanism. in 8085.

Ans. fixed locations in memory when an intr comes.
23. ARP is used for : Ans. IP to MAC addr conversion.
24. given 100 to 999 nos. Probability of picking a no. with out
digit 7. Ans. 18/25.
25. Ten film rolls. 3 defective, prob. of picking up 2 defective
rolls with out replacement Ans. 6/90
26. The purpose of hashing is :
Ans. O(1) complexity

27. Given adjacency matrix for a directed graph with n vertices
and e edges. How much time will it take to find out indegree
of a vertex Ans. O(n)
28. No. of nodes of degree 2 in a binary tree with n leaf nodes.
Ans. n-1

HUGHES PAPER

2007-05-06T03:46:00.001-07:00

++++++++++++++++++++++++++++++++++++++++++
1. CSMA/Cd protocol used in
Ans : Ethernet
2. Checksum in IP packet is
Ans : Sum of the bits and 9's complement of sum
3. Inselective repeat Max Seq is given find windowsize
i.e. Ans : (15+1)/2 = 8
4. Main memory cache direct mapping
Ans : 64
5. Address lines and data lines for 4K x 16
Ans : Addr 12, Data 16
6. Infix to postsize commession uses
Ans : operator stack
7. Printing ofstatic variable
Ans : 11
8. Ans : 1,2,3,4 ( Program is given
array[0] = 1;
array[1] = 2;
array[2] = 3
array[3] = 4
ptr = array[0]
*(arr+3) = *(++array ) + *(array-1)++)
)
There may me some mistique in writing
the program. Check it out.
Answer is correct
9. One Question on Scheduling
Preemptive
10. Which of the following is not memory model
(1) buddy system (2) monitor (3) virtual ... etc.
11. Hight balancing AVC time
Ans : 3
12. Virtual to physical address mapping
page table given
13. regular expression of identifier
L(LUD)*
14. Simplification in boolean Algebra
Ans : xz
15. Logical gate is given we have to find what is that
Ans : NOR
16. Solution for Diriving philofphing
Ans : d
17. The feature C++ have and c donot have
Ans : Variables can be declared inside also.
18. Number of nodes with degree two in a binary tree of n leaves
Ans : n-1
19. Difference between syachronous and asynchronous transmission

20. The question on RS232
(Use of sfart bit in Rs 232 protocal)
21. Floating point representation
Ans : 2's complement
1 more negitive number
Two simple probability questions are also there

Section A : 30
Section B : 20

Total 50 questions in 1 hours
P.S. Paper may change. Delhi question paper is not given here.

HUGES
-----

> > (A)Aptitude :25 Qns, 20 Minutes
> >
> > 1. 2 x 4 analytical GRE type qns
> > 2. 2-3 Reasoning qns (GRE type)
> > 3. Probability of getting a sum of 7 when two dices are thrown together
> > 4. Rest quantitative questions
> >
> > (B) Technical: 50 Qns, 45 Minutes
> >
> > 1. 3 qns on operating systems. I qn on dijkestra algorithm
> >
> > 2. Using which pin it's possible to address 16 bit addresses even though there
> > are only 8 address bits in 8085? Ans: ALE
> > 3. Voltage gain for an amplifier is 100 while it is operating at 10 volts.
> > What is the O/P voltage wen i/p is 1 volt
> > 4. Quality factor indicates a0 Quality of inductor b) quality of capacitor
> > c) both
> > 5. Qns related to bridges, routers and generators, which OSI layer they
> > corresspond to. (Refer to stevens 4th chapter)
> > 6.OPAmp's I/P ciurrent, O/p current and CMRR is given, what is the voltage
> > gain
> > 7. 2-3 qns on scope of static variables in C. Qn to view o/p odf a C static
> > var
> > 8. Qn to print a value of a pointer
> > 9.resistance increases with temperature in a) Metal b) semiconductor
> > 10. A qn to find the physical address from a given virtual address, virtual
> > to physical address table was provided
> > 11. 16 bit mantissa and 8 bit exponent can present what maximum value?
> > 12. 4 bit window size in sliding window protocol, how many acknowledements can be held?
> > 13. Security functionality is provided by which layer of OSI
> > 14. Frequency spectrums for AM, FM and PM (figure given, u'veto tell which
> > Kind of modulation it belongs to)
> > 15. Among AM and FM which is better and why?
> > 16.LASt stage of TTL NAND gate is called: Ans: Totem Pole Amplifier
> > 17. SR to JK flip flop conversion. Ans: S=JQ', R=KQ
> > 18. LSB of a shift register is connected to its MSB, what is formed: Ans:
> > RING Counter
> > 19. 2-3 Qns based on Demorgan's laws (identiies: (A+b)' = A'b', etc)
> > 20. 2 qns on Logic gates (O/p of logic gates)
> > 21. Diff in IRET and RET statements of 8086
> > 22. How many address bytes are required to address an array of memory chips
> > (4 * 6), each chip having 4 memory bits and 8k registers.
> > 23. Diff. in memory mapped and I/P O/P mapped Input/Output (Refer a book on Microprocessor)
> > 24. Qn on pipeline architecture
> > 25 QN on LAPB protocol

Iam really sorry for responding so late.
I wanted to sit with your work but I could not ( because of some problems )
I remember very little about the Dharma test pattern.
There was an Apptitude test. Quantitative and Analytical.
The Quantitative is very easy. You should prepare from GRE or any CAT
Material.
The Analytical part is mostly from Barrons Guide. I remember two questions .
they are from Barron's guide. It is something about a village called "kaya-kaya
" where half the people speak truth and half lies. There was one more about set
of houses of itallian,germans,romman etc in a row whose chimmney colours were
given, their favoritr drinks were given. I hope you will find these questions
in Barron's guide. I did not get a Barron's guide to search them for you. The
interview was mostly about C , C++ . They are mostly working on C++. That will
help if you know. They are working on their own SQL. You should brush up your
fundas in DBMS. In interview there are questions in UNIX Internals also. Hope
this info is of some use to you. Good Luck. Keep me informed on the proceedings
of the campus.

HUGHES @ IISc 2000

2007-05-06T03:46:00.000-07:00

HUGHES at IISC 2000

q1) special charracter of c++ regarding oop;
a) funs overloading, b?) polymerisation vc) virtual funs d) data
encapsulation
{
int i=4000;
int j=9000;
main()
{
printf(,i,j);
f(&i,&j);
printf((i,j);
f1(&i,&j);
printf(i,j);

f( int *a, int *b)
{
int *temp;
temp=a;
a=b;
b=temp;
}
f1(int *a,int *b)
{
*b=*a;
*a=500;
}
3) using delaration ---- namespace funda;
4) few questions on inheritence including protcted --- pointer to base
derived class.

5) port address is unique at
a)globaly, b)...
6) ((5+4)*8)*(16+9)*5) convert to prefix
7) there r 2 dices. probabilty to get 7
a) 5/36 b) 7/36 c) 1/36 d) 9/36

8) 4R balls, 5G , 6Y,5O balls. no. of balls are kept linearly . no
of
permutayion that similar color balls will be together.
20! , 6!5!, 4!5!, none

9) a man has color blindness then what will be permutations. ans
may be
24,2,10, none

10_ if the man has closes his eye and arranges then what is the
probability
20,12,24, none

11 3 boys: 3 girls a,b,c: x,y,z a,c unmarried , a& b have a dog. a
thinks
the dog will be with his wife. B's wife thinks that her dog is with
his
husband. they r seated in a line c can sit near x but not near y,z.
now
they have to sit like the distace between dogs is near.
no. of seats between dogs
( one dog is at first other is at 5th)

12) tell the sequence azcxyb
13) X.42 is in which layer
14) TCMP or somewhat like this protocol
15) -------!---------!--------
! !
! R
Z(diode)!
______!______!____

ans) clipper , damper, rectifier, trigger ckt

16
flush as in toilet can be considered electricallyas
a) capaciter b) inductor c) trigger ckt

17) haruard code is
a) orthogonal b) 1

18) which is better
1)semaphore,2) monitor c).....

19 single bit parity checketr can detect
1) 1 bit error 2) 2 bit error etc

20motion estimation is used in
1) satellite 2) communication 3) video

1. What does compiler do? (b is correct)
a. memory management b. symbol table c. -- d.-
2. Kerberos used for- Authentication and security.
3. RSA Algorithm
4. One digital ckt.(simple)
5. One K-map (simple)
6. Min no. of operations in worst case input for - Heap Sort
7. 3 device serially connected, each having a probability of 0.9 of
not
failing. Combined prob. Of the entire ckt to work-0.729 (according
to
me)
8. CONNECT BY command in DBMS
9. Projection in DBMS
10. Program Counter incremented in - Fetch Phase
11. You have to delete a given node in a singly connected link list.
What is
the order of no. of nodes to be traversed - O(n) (acc. To me)
12. Hit ratio for first level cache is 0.9 and access time 100ns, for
second level cache is 0.9 and access time 400ns, memory access
time
is
1000ns. Find time to access an address- 140ns
13. Ping is in - ICMP
14. Def. of Coupling
15. Function pts used in - Software analysis
16. Can DFDs be used in OO Model
17. Protected members in Public class can be accessed by - Don't
remember
the choices.
18. Message to A from B, So B will use- A's private key or A's public
key or
B's private key or B's public key.
19. No. of lines req. to completely connect n nodes - O(n*n)
20. Something on NFS
21. Something on Threaded trees
22. N=2 exp(p) routers, what is the max. hops req. to send a message
between
the farthest two
23. Diff between 3rd and @nd normal form
24. Which is not client server- email access, web access, NFS,
telephone
25. Data structure used to sort direct access or disk files.
26. Least avg waiting time - Shortest job first algo
27. Something on JAVA interface
28. For arithmetic expression evaluation using stack- postfix
29. For diskless systems - RARP
30. Something on dirty bits
31. Something on downloading of Java
32. Bubble sort
33. How to define constant pointer in C
34. Char*(*(*A[X])())() is what
35. Every shared resource has a colocated resource manager for -
concurrency
control,location transparency,replication transparency
36. Can a computer have more than one Domain address and more than one
IP
address
37. Which searches best in binary tree- ht. Balancing, wt. Balancing,
both,
none
38. Heap management is done by library routine - user procedure in user
mode, user proc. In kernel mode, kernel,
39. Something on regression testing
40. IPV6 address bits -128 bits
41. Something on raw IP
40 questions in all, +3 for correct ans ; -1 for wrong one;

1)Question on probability: whats prob that a no b/w 100 & 999(both
inclusive) will not have 7?

2)A question on RARP protocol

3)An algo was given and it was asked as to what does it do??
Ans: evaluate GCD of two numbers

4)a question on cache memory: Disadv of Direct mapped cache memory

5) One question on digial circuits. There were two input variables and
u've
to assign them some values to get the output to be X' + Y;

6)If X'*Y = X+Y and z=X*Y then what is z*X
my answer was not matching any of the alternatives

7)If A and B r two sets then (A-B) U (B-A) U (A intersection B) is:
A U B

8)One question on newton Raphson method find solution to X(square) -
1=0
with initial itertion x=-1

9)A procedure was written and it was asked what will be the result if
procedure calling is call by value, call by reference, call by name etc

10)One question on Page replacement algorithm asking which algo is most
efficient
Ans: The one where the page that will not be used for max time in
future is
replaced

11)An IP packet can get struck into a circular loop while travelling,
which
field in IP header can prevent this::
(i)Source address (ii) destination address (iii) TTL(Time to live)
correct answer(iii)

12)In order to get numbers in sorted order out of a binary tree
Ans: we should do inorder traversal

13) There was a set of data given. U had to tell that How many nodes
will be
there on left and right subtrees, if they were inserted in given order

14) what tree has all the child nodes less than itself
Ans:Heap

15)Which type of data structures can have hetrogeneous elements
(i) array (ii) records (iii) file
Ans (iii)

16)Given bandwidth = 3000 and no of bits transferred per level =8 what
is
Nyquist's max bit rate?
Ans: use formula bitrate = 2*Bandwidth*log(to base 2)of no of bits per
level, therefore Ans=18000bps

17)One question on pulse code modulation. If i remember correctly it
was :
why is it used or when is it used??

18)One question on Graphs, as i haven't done graphs i don't exactly
remember
the question. I guess it was degree of graph given no of nodes and
edges.

19)Given a recursive function
function X(int A)
{
If (A<3)
X=1;
else
X=X(A-1) + X(A-3) + 1
}

U had to tell how many calls does X(X(5)) will make??
Don't remember the answer exactly, but u can work it out!!

20)How many 4 input multiplexers u need to make a 16 input
multiplexer??
Ans: 8

21)What is the worst case for Booth's multiplication algo?

22)SOme question regarding size of ROM:If i remember correctly, it was:
For
multiplication of two 8-bit numbers, what should be the size of ROM?

This is all i could recollect!!

Interview:
Difference between C and C++.
Interrupts, what r they and whats their significance.
C++: inheritance, polymorphism, friend classes etc.
Write an algo to insert a node into singly linked list at a given
location.
B+ tree.
Difference between Win 95 and Win NT.
Regarding the project i m doing in my training.
difference b/w token bus, token ring and ethernet
Multithreading and multitasking.
A few questions on tree balancing , AVL trees and Red Black trees
A question on pointers to pointer,
what do u mean by char ** a[35]
Also asked what is hash table and where it is used??

General:
In OS , semaphores (Ch 6) is most important, and then process
management,
memory management is what u should be thorough with (Ch 4, 8 & 9) Ch 5
is
easy and least important!!

HUGHES SOFTWARE SYSTEMS

2007-05-06T03:45:00.000-07:00

_____________________________________________________________________________

Q1)there was a circuit given using three nand gates with two inputs and one output .you have to find the output.
a)or
b)and
c)xor
d)
ans- a) or
Q2)suggest a sorting algo whic is efficient( in worst case) to 10 values
a)binary tree
b)selection
c)bubble
d)any of the above
Q3)what is the number of comparisons in the worst case to merge two sorted lists containing n elements each.
a)2n
b)2n-1
c)2n+1
d)2n-2
Q4)integrated check value(ICV) are used as follow
ans- the client computes the ICV and then compares it with that send
Q5)one question on client server system using asyn. request from the client
Q6)if a binary tree is constructed using nodes with two pointers each ,how many null pointers does a tree with N nodes have
a)n-1
b)n
c)n+1
d)depends on the number of edges
Q7)which of statement about heap is wrong
a)n element heap has height log n(base of log is 2)
b)smallest element of heap is always a leaf
c)a array in reverse sorted order is a heap
d)a heap can't contain any element more than once
Q8)when applets are downloaded from web sites , a byte verifier performs status check, which of following is not true
Q9) void insert(key,r)
typekey key,data array r;
{
extern int n;
if(n>=max) /*error table if full */
else r[n++].k=key;
}
enables a
a)basic sequential search
b)binary search
c)interpolation search
d)none
ans-interpolation search
Q10) void f(char *p)
{
p=(char *) malloc(6);
strcpy(p,"hello");
}

void main( )
{
char *P="bye";
f(p);
printf("%s',p);
}
Q11)time taken to access cache is 100ns and to access memory is 1000ns. hit ratio given you have to find the average access time
ans-take care of the fact that every data transfer takes place through the cache,even if in memory
Q12)path testing is
a)black box testing strategy
b)white box testing strategy
c)an installation .........
d)...... enviornment
Q13) X:'verification" asks are we building the right product
Y:validation' asks are we building the product right
Q14)which one of the following can't be used to find an internet address given the domain name
a)/etc/host
b)NIS yellow pages
c)DNS
d)ARP
Q15)flow control is necessary for the t.p layer due to the following reasons
a)ureliable link
b)congestion at receiver
c)packets out of sequence
d)none of these
Q16)in public key encryption , if A wants to send a message to B so that no one else can read the message then A encrypts the message using
a)A's public key
b)A's private key
c)B's public key
d)B's private key
Q17)which of the following is not condition having a deadlock resource previous granted can be forcebly taken away from a process
a)resources need to be used in mutually exclusion fashion
b)process can request new resources, as they continue to hold on to old ones
c)here is a cycle in the resource allocation graph
Q16)a IP/IPX packet received by a computer using... having IP/IPX both how the packet is handled.
ans-read the ,field in the packet header with to send IP or IPX protocol.
Q17)the range of the 32 bit number in two's complement form is
ans- -31 31
2 to 2 -1
Q18) cyclomatic complexity
{
if((x=0) or (y=0))
p=0;
else {
p=x;i=1;
while(i!=y) {
p=p+x;
i=i+1; }
}
}
Q19)activation record will contain the
a)storage for simple names
b)information about attributes for local names
c)return address
d) all of the above
Q20) global static variable within a file is intended to
a)localize swap
b)retain value persistently
c) define constant
d)fixed address in memory
Q21)why thread switch is faster than a process switch
Q22)what is the binary equivalent of 41.6875
Q23)checkpoint value will be calculated in
Q24)DHCP is used for
a)IP address allocation
b)dynamic host configuration protocol
Q25)int x(char *a)
{
a=(char *) malloc(10*sizeof(char));
*a="hello";
}
main()]
{
char *a="new";
x(a);
printf("%s",a);
}
a) hello
b)new
c)hello new
d)run time error

HUGHES TECHNICAL QUESTIONS

2007-05-06T03:44:00.001-07:00

There were ten questions in the software section
give the output of the following programs
there were no options given, you have to fill in the given blanks
__________________________________________________________

given A=65
double is 4 byte,int is 2 byte

Q1) this question was based on swaping two varibles

swap(int a,int b)
{
a=a+b;
b=a-b;
a=a-b;
}

main()
{
int a=3;
int b=4;
printf("%d %d\n",a,b);
..............

printf("%d %d",a,b);
}

ans-4 3
4 3
Q2) this question was based on switch statement,break+continue
main()
{
int a=1,b=4;
for (i=0;i<2;i++)
{
switch (a) {
case 1: if (b!=4)
break; // watch out for these
else continue; // two lines
b=....
a=.....
case 2: ....
........
..........
}
}
printf("Output is %d %d",a,b);
}

ans- Output is 1 4
Q3) third question was based on macros
#define dcm(a) a*a
main()
{
int first=3,second=2,var1;
var1=dcm(first+1);
printf("output is %d %d\n",var1++,var1++);
var1=dcm(first++);
printf("output is %d %d",var1++,var1++);
}
ans- output is 8 7
output is 10 9
Q4) what is the output
main()
{
int d;
d=(a&b) ~(~0 ... &c); //there was an expression like this
printf("%d",d);
}
ans- 5

Q5)
fun(char *p1,char *p2)
//this function was displaying the position
{ //the position of DCM in the string
.............
.............
...........
.............
...............
}
main()
{
printf("%d",fun("datasystem","DCM");
printf("%d",fun("DCMDELHI","DCM");
}

ans- -1 ... (for the second answer count the position of DCM in the string)

Q(6)
funct(int var)
{
static int s;
if(var=3) return var;
else { s=s+7;
var=var+1;
funct(var);
}
s=s-var;
return s;
}
main()
{
int munx,munz;
numx=funct(1);
numz=funct(0);
printf("numx=%d numz=%d",numx,numz);
}
ans- numx=9 numz=24

Q9) this question was based on printing char variable using %d flag which prints the ascii value

#include
char a;
func(.......)
{
.........
........
.........
printf("%c",a);
}
main()
{
char a='B';
printf("%d",a);
...........;
printf(................);
.................;
printf(...............);
}
ans- 66BAA66

Q10)
int mask,nbits;
funct(int a) //this function was same as that given
{ //in page 433 in schaum series // c programming book
// this function prints the binary //equivalent of the number passed
for(count=1;count<=nbits;count++) // in blocks of four bits
{ b=(a & mask) ? 1:0;
printf("%x",b);
if(count %4 ==0)
printf(" ");
mask>>1;
}

main()
{
nbits=8*sizeof(int);
mask=0x1 << (nbits -1);
funct(32767);
funct(-32768);
}

ans- 0111 1111 1111 1111 1000 0000 0000 0000

HUGHES 25/07/97

2007-05-06T03:42:00.000-07:00

****************************************************************************
HUGHES
****************************************************************************
Dated :25/07/97

section A 30m (Compulsary)
section B or C 20m
Attempt either B or C sec B contains CST
C E&C
Better to attempt Electronics paper
(Those who are having electronics background)
----------------------------------------------------------------------------
SECTION A

1. Which of the folowing is not correct
a. (x+y)'=x'.y' b. (x'+y')'=x.y
c. (x'.y')'=x+y d. (x'+y')'=x'.y' [d]

2. Question on logic ckt. U have to find the output
ans. AB'+CD'+EF'

3. Output of MUX
_________
c-----| |
c'----| |-------Y
c'----| | ans. A xor B xor C
c-----| |
---------
| |
A B (select lines)

4.If X and Y are two sets. |X| and |Y| are corresponding
coordinates and exact no.of functions from X to Y is 97
then
a. |X|=97 |Y|=1 b. |X|=1 |Y|=97
c. |X|=97 |Y|=97 d. .....

5. If two dies are thrown simultaneously what is the prob.
of one of the dice getting face 6 ?
a. 11/36 b. 1/3 c. 12/35 d. 1/36 [a]

6. The relation ,<,on reals is
a. a partial order because of symmetric and reflexive
b. ... antisymmetric and ....
c. not ...... .. asymmetric and non reflexive
d. ... .... not anti-symm and non reflexive

7. In C language the parameters are passsed by
a. values b. name c.referrence d....

8. Advantage of SRAM over DRAM
ans. faster

9. Diasy chaining related question (refer Z80)
a. uniform interrupt priority
b.non .... ....
c.interfacing slower peripherals
d.....

10. RAM chips arranged in 4X6 array and of 8kX4bit capacity
each. How many address lines reqd. to access each byte
a. 12 b. 16 c.15 d. 17

11.Question related to AVL trees regarding how many no.of
nodes to be changed to become balanced after addition of
a leaf node to a particular node.
ans . 3

12.When following sequence is insertedin the binary search tree
no.of nodes in left and right subtrees
52 86 64 20 3 25 14 9 85

13.Method used for Disk searching..
a.linked list b.AVL c.B-tree d. binary tree

14. Which of the following is correct statement.
a. 1's complement can have two zero re[resentations
b.2's ... ... represent an extra neg. number
c.2's & 1's have no difference in representing 16-bit no.
d.......

16. The option avialable in C++, not C:
a.dynamic scoping
b.declaration in the middle of code block
c.seperate compiled and linked units
d. ....

17. int a[4]={1,2,3,4};
int *ptr;
ptr=a;
*(a+3)=*(++ptr)+(*ptr++);
A part of code is shown. The elements in A after
the execution of this code.
a.1 2 3 4 b. 1 2 3 6
c. compilation error d.1 2 2 4 [a]

18. Critical section program segment is
a. enclosed by semaphores with P & V operations
b. deadlock avoidance
c. where shared resources are accessed
d. ...

19. when head is moving back and forth, the disk scheduling
algorithm is _____
a) scan b) sstf c) fcfs d).....

20. how many times the loop will execute

LOOP LXI B,1526H
DCX B
JNZ LOOP
a)1526H times b) 31 c)21 d)38

21. the addressing mode in which the address of the operand is
expressed explicitly within the instruction
a)index addressing b)absolute c)indirect d) immediate

22. (A - B) U (B - A) U (A ^ C) = ?
where A,B are two sets A' , B' are compliments of A and B
a) A U B b) A ^ B c).... d).....

23. the network that does not use virtual circuit
a) IP b) X.25 c).... d).....

24. source routing bridge
a)source will route the frame
b)frame will routed with info in header
c).... d).....

26. cache access time 100 msec. main memory access time 800 msec
if the hit ratio is 95% , what is mean access time ...

27. the module that should be always reside in main memory is
a) loader b)link module c)... d)....

.... and some questions related to

1. addressing mode 2.assembler passes 3.linking and loading
4. file directory search 5. turning machine
6. finite state machine 7. daisy wheel

28. The order of algorithm to merge the two sorted lists of
lengths m and n is
a. O(m) b. O(n) c. O(m+n) d. O(mn)
29.A chocolate block is of 4 X 4 size.How many cuts are needed
to make 1 X 1 size blocks. No simultaneous vert. & horz. cuts.

30. Which among the following is not correct
a. O(n) > O(log n) .. likewise

**************** WISHING YOU THE BEST OF LUCK ********************

HUGHES 2003

2007-05-05T08:37:00.000-07:00

For aptitude part I’d like to say thanks to Srinivasulu Bheemineni, who earlier send the paper of Hughes held on 26/12/03 to this group.

PART 1: APTITUDE - 10 Q.

1. X is taller than Y and Z is shorter than X. Which of the following statements
would be most accurate ? (similar to this)

a) Z is taller than Y.
b) Z is shorter than Y.
c) Z is as tall as Y.
d) It is impossible to tell Z or Y is taller.

2. A man travels for 12hours 30min. He covers one-third of the journey by train at the rate of 60kmph and two-third of the journey by road at the rate of 30kmph. The distance traveled by him is:

3. Excluding stoppages the speed of a bus is 45 kmph. Including stoppages it is 42kmph. For how many minutes does the bus stop in two hour?

(All the options were under 10.)

4. The rates of working of A and B are in the ratio of 9:6. The number of days taken by them to finish the work would be in the ratio of:

5. The average of 5 consecutive numbers is n. If the next three numbers are also included, the average will:

6. A family consists of a grand father, a father, a mother , five sons and their wives and each son has two son and one daughters. How many males are there in the family ?

7. If the number 423 is multiplied by another number and if the answer is 65589. In the above answer if the two 5’s are wrong, what is the correct answer ? (similar with changed figures, not exactly this one.)

8. If a ship travels a distance of 20km upstream in 2 hours and downstream in 1 hour. How much time it takes to travel a distance of 30km in still water?

9. A sum 650 is divided among A, B, C. If 1/6th of A’s share equal to 1/9th of B’s share it also equal to 1/12th of C’s share, what is the share of B?

10. The diameter of the driving wheel of a bus is 140. How many revolutions per min. must the wheel make in order to keep a speed of 66 kmph.

PART 3: COMPUTER SCIENCE SECTION – 20 Q.

1. Which of the following is used in n/w layer of osi model:

a) bridge b) router c) repeater d) none of those

2. internal fregmentation and external fregmentation are concepts of which memory management:

a) paged only
b) segmented only
c) paged and segmented respectively
d) segmented and paged respectively

3,4,5. Questions were on Boolean expression simplification of 3 variables. Those were very easy. applied k-map method and got the right answer within seconds.

6. in a paged memory, the page hit ratio is 0.35. time required to access a page in secondary memory is equal to 100ns.the time requiredto access a page in primary memory is 10ns. The average time required to access a page is: [similar with changed data, used the basic formula.]

7. in an another easy question, three processes were given with their burst time, time quantum was also given, so the question was to find the time in which second process will finish in round-robin scheduling policy.

8. one que. on binary tree search like should item must be in ascending or descending order while search.

9. one direct que. on RTOS.

10. one que. on MUTEX and critical section.

11.virtual memory
a) greater than physical memory
b) greater than physical address
c) less than physical address
d) equal to physical memory

12. to 19. question on data communication neither I attempted nor I remember as I’m an MCA and this protion was a minor, way back in 3rd sem.

20. a long question on probability.

PART2: PROGRAMMING SKILL – 20 Q.

There were 20 questions on “c”.
We were asked to give the o/p of trickey codes of c language. It’s hard to remember those codes. I can give only idea. Questions were from simple case control, looping constructs, recursion, arrays. some question were asked from bitwise operators. 2-3 theoretical multiple choice ques. were also asked. Not a single code of pointers.

- Gaurav Prakash
MCA-2003

HUGHES DELHI 1997

2007-05-05T07:25:00.000-07:00

Hughes,Delhi:
-------
(A)Aptitude :25 Qns, 20 Minutes
1. 2 x 4 analytical GRE type qns
2. 2-3 Reasoning qns (GRE type)
3. Probability of getting a sum of 7 when two dices are thrown together
4. Rest quantitative questions
(B) Technical: 50 Qns, 45 Minutes
1. 3 qns on operating systems. I qn on dijkestra algorithm
2. Using which pin it's possible to address 16 bit addresses even though
there
are only 8 address bits in 8085? Ans: ALE
3. Voltage gain for an amplifier is 100 while it is operating at 10 volts.
What is the O/P voltage wen i/p is 1 volt
4. Quality factor indicates a0 Quality of inductor b) quality of capacitor
c) both
5. Qns related to bridges, routers and generators, which OSI layer they
corresspond to. (Refer to stevens 4th chapter)
6.OPAmp's I/P ciurrent, O/p current and CMRR is given, what is the voltage
gain
7. 2-3 qns on scope of static variables in C. Qn to view o/p odf a C
static
var
8. Qn to print a value of a pointer
9.resistance increases with temperature in a) Metal b) semiconductor
10. A qn to find the physical address from a given virtual address,
virtual
to physical address table was provided
11. 16 bit mantissa and 8 bit exponent can present what maximum value?
12. 4 bit window size in sliding window protocol, how many acknowledements
can be held?
13. Security functionality is provided by which layer of OSI
14. Frequency spectrums for AM, FM and PM (figure given, u'veto tell which
Kind of modulation it belongs to)
15. Among AM and FM which is better and why?
16.LASt stage of TTL NAND gate is called: Ans: Totem Pole Amplifier
17. SR to JK flip flop conversion. Ans: S=JQ', R=KQ
18. LSB of a shift register is connected to its MSB, what is formed: Ans:
RING Counter
19. 2-3 Qns based on Demorgan's laws (identiies: (A+b)' = A'b', etc)
20. 2 qns on Logic gates (O/p of logic gates)
21. Diff in IRET and RET statements of 8086
22. How many address bytes are required to address an array of memory
chips
(4 * 6), each chip having 4 memory bits and 8k registers.
23. Diff. in memory mapped and I/P O/P mapped Input/Output (Refer a book
on Microprocessor)
24. Qn on pipeline architecture
25 QN on LAPB protocol

HUGHES 26/12/03

2007-05-05T04:16:00.000-07:00

Hughes 26/12/03

PART 1: APTITUDE - 10 Q.

1. X is taller than Y and Z is shorter than X. Which of the following statements
would be most accurate ? (similar to this)

a) Z is taller than Y.
b) Z is shorter than Y.
c) Z is as tall as Y.
d) It is impossible to tell Z or Y is taller.

2. A man travels for 12hours 30min. He covers one-third of the journey by train at the rate of 60kmph and two-third of the journey by road at the rate of 30kmph. The distance traveled by him is:

3. Excluding stoppages the speed of a bus is 45 kmph. Including stoppages it is 42kmph. For how many minutes does the bus stop in two hour?

(All the options were under 10.)

4. The rates of working of A and B are in the ratio of 9:6. The number of days taken by them to finish the work would be in the ratio of:

5. The average of 5 consecutive numbers is n. If the next three numbers are also included, the average will:

6. A family consists of a grand father, a father, a mother , five sons and their wives and each son has two son and one daughters. How many males are there in the family ?

7. If the number 423 is multiplied by another number and if the answer is 65589. In the above answer if the two 5’s are wrong, what is the correct answer ? (similar with changed figures, not exactly this one.)

8. If a ship travels a distance of 20km upstream in 2 hours and downstream in 1 hour. How much time it takes to travel a distance of 30km in still water?

9. A sum 650 is divided among A, B, C. If 1/6th of A’s share equal to 1/9th of B’s share it also equal to 1/12th of C’s share, what is the share of B?

10. The diameter of the driving wheel of a bus is 140. How many revolutions per min. must the wheel make in order to keep a speed of 66 kmph.
****************************************
PART 3: COMPUTER SCIENCE SECTION – 20 Q.

1. Which of the following is used in n/w layer of osi model:

a) bridge b) router c) repeater d) none of those

2. internal fregmentation and external fregmentation are concepts of which memory management:

paged only
segmented only
paged and segmented respectively
segmented and paged respectively

3,4,5. Questions were on Boolean expression simplification of 3 variables. Those were very easy. applied k-map method and got the right answer within seconds.

6. in a paged memory, the page hit ratio is 0.35. time required to access a page in secondary memory is equal to 100ns.the time requiredto access a page in primary memory is 10ns. The average time required to access a page is: [similar with changed data, used the basic formula.]

7. in an another easy question, three processes were given with their burst time, time quantum was also given, so the question was to find the time in which second process will finish in round-robin scheduling policy.

8. one que. on binary tree search like should item must be in ascending or descending order while search.

9. one direct que. on RTOS.

10. one que. on MUTEX and critical section.

11.virtual memory
a) greater than physical memory
b) greater than physical address
c) less than physical address
d) equal to physical memory

12. to 19. question on data communication neither I attempted nor I remember as I’m an MCA and this protion was a minor, way back in 3rd sem.

20. a long question on probability.
*****************************************
PART2: PROGRAMMING SKILL – 20 Q.

There were 20 questions on “c”.
We were asked to give the o/p of trickey codes of c language. It’s hard to remember those codes. I can give only idea. Questions were from simple case control, looping constructs, recursion, arrays. some question were asked from bitwise operators. 2-3 theoretical multiple choice ques. were also asked. Not a single code of pointers.

- Gaurav Prakash
MCA-2003
*******************************************