HUGHES PLACEMENT PAPER -------- Placement Paper



HUGHES PLACEMENT PAPER -------- Placement Paper..

Answer / guest

Hughes Placement Papers | Hughes Interview Procedure |
Hughes Aptitude Questions | Hughes TechniHughesl Questions
| Hughes Interview Questions



++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+++++++++++++++++++
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.

Hughes Placement Papers | Hughes Interview Procedure |
Hughes Aptitude Questions | Hughes TechniHughesl Questions
| Hughes Interview Questions




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


Hughes Placement Papers | Hughes Interview Procedure |
Hughes Aptitude Questions | Hughes TechniHughesl Questions
| Hughes Interview Questions



Is This Answer Correct ?    0 Yes 0 No

Post New Answer

More Placement Papers Interview Questions

INFOSYS PLACEMENT PAPERS ----- Placement Paper 16

1 Answers   Infosys,


What kind of Issues/bugs arise in ETL projects? I would like to know few issues (critical to somewhat bugs ) normally occur in ETL process especially when testing? Domains can be banking, retail or any.

0 Answers  


CDM,SAS Clinical Programming,SDTM Training & Placement

1 Answers  


PERSISTENT PLACEMENT PAPER

1 Answers   Persistent,


what is bidirectional?

0 Answers  






bpo interview question answer

3 Answers   Accenture, ECL, Excel, EXL, IBM, TCS,


DESHAW placement papers --------- placement paper 4

5 Answers   Deshaw,


Accenture Placement Papers 27 Apr 2006 - Placement Paper

3 Answers   Accenture,


Wipro Placement Procedure And Interview Rounds --- 2 february 2007

1 Answers   ADP, Wipro,


IBM PLACEMENT PAPERS ------ IBM placement Paper 3

2 Answers   IBM,


SNAPDEAL QUESTIONS 1. A train is going at a speed of 60kmph towards Delhi and returned back at a speed of 30kmph. What is its average speed? ANS : (2*30*60)/(30+60) = 40kmph 2. How many different 4 letter words can be framed that have at least one vowel? ANS : 264 - 214 (total no of 4 digits words – no of words with no vowels) 3. Write an algorithm to find out a number from an array of numbers where only one number occurs once and rest all occurs twice. ANS : XOR all the numbers ,you will get the number with single occurrences . 4. Which among the following have the product of the distance between opposite sides of a regular polygon and it side equals one fourth of the area. A. hexagon B. octagon C. n=16 D. n=18 ANS : n=16.(area of regular polygon = apothem*perimeter/2 Apothem = distance between opposite sides/2 Area = (opp_side_dist * n * a )/4 Product of opp_side_dist and side of reg. polygon = opp_side_dist * a For n= 16 the ration becomes 1:4 5. Which of the following cannot be a relation between two variables? ANS = 4th diagram. 6.what will be the output of this program Void print (int n) { If (n>0) { printf(“hello”); print(n-1); } printf(“world”); } ANS : N times hello followed by N+1 times world. 7. Which among the following cannot be used for future prediction? ANS : 4th Diagram. 8. There are 25 horses. We have to find out the fastest 3 horses In one race maximum 5 horses can run. How many such races are required in minimum to get the result. ANS : 7 races (A. first run all horses = 5 races, eliminate 4th 5th of all races. B. Run horses who came 1st in those 5 races = 1 race , the horse coming first is the fastest Run horses a. 2nd and 3rd with the fastest horse (in first time race A) b. 2nd and 3rd coming horse in B. c. The horse who came 2nd with the horse(who came 2nd in race B) in race A You will have the fastest 3 horses.) 9. In a game of rolling dice you are given 2 dice and you have to roll them. Whatever is the outcome the player will win that many dollars. What should the game owner charge each player (optimum) so that he doesn’t have to bear any loss? ANS : $7 10. We have a function REV(“string”,m,n).This function is capable of reversing the caharacters in the string from mth location to nth location. e.g. REV(“abcd”,2,3)  the output will be acbd We need to swap a string from a position,e.g. SWAP(“abcdefg”,4)  output needs to be efgabcd. How can the REV function used do this. ANS : L = string length,N= position given in SWAP function. SWAP(“abcdefg”,4) = REV(REV(REV(“abcdefg”,N+1,L),1,N),1,L).

1 Answers   SnapDeal,


Tata Technology Placement Paper

2 Answers   TATA, Tata Technologies,


Categories