Related Articles by Labels



Widget by Hoctro
Showing posts with label Hughes Placement Paper. Show all posts
Showing posts with label Hughes Placement Paper. Show all posts

Saturday, September 6, 2008

Hughes Placement Paper 3

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 Placement Paper 2

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. 0b. 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 Placement Paper

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.