Oil India Limited Placement Papers Ramco Placement Papers Rockwell Placement Papers3i Placement PapersABB Placement PapersAccel Frontline Placement PapersAccenture Placement PapersAcumen Software Placement PapersAditi Placement PapersAdobe Placement PapersADP Placement PapersAgile Placement PapersAgreeya Placement PapersAIG Placement PapersAkamai Placement PapersAks Software Systems Placement PapersAlcatel Placement PapersAllahabad Placement PapersAlle Placement PapersALLFON Placement PapersAlter Placement PapersAlumnus Placement PapersAmdocs Placement PapersAMI Placement PapersAndhra Bank Placement PapersANZ Placement PapersAppLabs Placement PapersAricent Placement PapersASDC Placement PapersAshok Placement PapersAshok LeyLand Placement PapersAspire Placement PapersASPNET Placement PapersAST Pvt Ltd Placement PapersAsto Placement PapersAtlas Placement PapersAxentis Soft Placement PapersAxes Placement PapersAztec Placement PapersBAAN Placement PapersBajaj Placement PapersBank Of Maharashtra Placement PapersBARC Placement PapersBEL Placement PapersBEML Placement PapersBently Placement PapersBFL Placement PapersBHEL Placement PapersBirlasoft Placement PapersBlueStar Placement PapersBOB Placement PapersBOSCH Placement PapersBPL Placement PapersBrakes Placement PapersBSNL Placement PapersC-DOT Placement PapersCadence Placement PapersCalsoft Placement PapersCampaq Placement PapersCanarys Placement PapersCapgemini Placement PapersCaritor Placement PapersCarrizalsoft Technologies Placement PapersCarrizalsoft Technologies Pvt Ltd Placement PapersCaterpillar Placement PapersCD Placement PapersCDAC Placement PapersCelstream Placement PapersCGI Placement PapersChangepond Placement PapersChatargee Placement PapersCisco Placement PapersCiticorp Placement PapersCMC Placement PapersCOGNIZENT Placement PapersComputer Placement PapersConsagous Placement PapersConsagous Technologies Placement PapersConvergys Placement PapersCORDYS Placement PapersCOSL Placement PapersCovansys Placement PapersCrompton Placement PapersCSC Placement PapersCTS Placement PapersDaimler Placement PapersDell Placement PapersDeloitte Placement PapersDelphi-tvs Placement PapersDeutsche Placement PapersDharma Placement PapersDigital Placement PapersdMtechnologies Placement PapersDot Placement PapersDot Com Infoway Placement PapersDRDO Placement PapersDSL Placement PapersDSQ Placement PapersDSRC Placement PapersE2E Placement PapersEasyTech Placement PapersEDS Placement PapersEFFIGENT Placement Papersefunds Placement PapersEIL Placement PapersELGI Placement PapersELICO Placement PapersEnercon Placement PapersEpson Placement PapersEricssion Placement PapersEssar Placement PapersFCG Placement PapersFidelity Placement PapersFlextronics Placement PapersForbes Placement PapersFORCE Placement PapersFuture Placement PapersFX Placement PapersFX Labs Placement PapersG2One Network Private Limited Placement PapersGDA Placement PapersGE Placement PapersGenpact Placement PapersGeodesic Placement PapersGeometric Placement PapersGlobal Placement PapersGodrej Placement PapersGoogle Placement PapersGrapcity Placement PapersGSSL Placement PapersHAL Placement PapersHCL Placement PapersHCL Technologies Placement PapersHello Placement PapersHexaware Placement PapersHFCL Placement PapersHindustan Placement PapersHo Placement PapersHoneywell Placement PapersHorizon Placement PapersHP Placement PapersHPCL Placement PapersHSBC Placement PapersHuawei Placement PapersHughes Placement PapersI-Flex Placement PapersI-Gate Placement Papersi2 Placement PapersIBM Placement PapersIBPS Placement PapersIBS Placement PapersICICI PO DRIVE Placement PapersIDBI Placement PapersIikanos Placement PapersIindus Placement PapersIkosindia Placement PapersImpetus Placement Papersinautix Placement PapersIndian Overseas Bank Placement PapersIndusTeqsite Placement PapersInfineon Placement PapersInformatica Placement PapersInfosys Placement Papersinfotech Placement PapersInphlox Placement PapersIntec Placement PapersIntegra Placement PapersIntegraphr Placement PapersInterwoven Placement PapersIntex Placement PapersIOCL Placement PapersIonnor Solutions Placement PapersiSoft Placement PapersIspat Placement PapersISRO Placement PapersIttiam Placement PapersIvega Placement PapersJ&B Placement PapersJataayu Placement PapersJean Placement PapersJean Martin Placement PapersJet Placement PapersJEYPEE Placement PapersJindal Placement PapersJKT Placement PapersJOHN Placement PapersKalam Software Technology Placement PapersKanbay Placement PapersKeane Placement PapersKenexa Placement PapersKkshema Placement PapersKleward Placement PapersKnoah Solutions Placement PapersKPIT Placement PapersKPIT Cummins Placement PapersL&T Placement PapersL&T Infotech Placement PapersL&T(EEC) Placement PapersLCube Placement PapersLG Placement PapersLG Soft India Placement PapersLifetree Placement PapersLinkwell Placement PapersLionBridge Placement PapersLogica Placement PapersLucent Placement PapersM-Phasis Placement PapersMA Placement PapersMANGANESE Placement PapersMascot Placement PapersMastek Placement PapersMatrix Placement PapersMAXSOFT Placement PapersMcAfee Placement PapersMECON Placement PapersMentor Placement PapersMerrill Placement PapersMicrosoft Placement PapersMindfire Solutions Placement PapersMindtree Placement PapersMiraclesoft Placement PapersMistral Placement PapersMotorola Placement PapersMTNL Placement PapersNagarro Placement PapersNalko Placement PapersNCR Placement PapersNess Placement PapersNest Placement PapersNewgen Placement PapersNFL Placement PapersNHPC Placement PapersNihilent Placement PapersNIIT Placement PapersNovartis Placement PapersNovell Placement PapersNTPC Placement PapersNucleus Placement PapersNYROS TECHNOLOGY Placement PapersOil Placement PapersONGC Placement PapersOnline Education Placement PapersOnMobile Placement PapersOracle Placement PapersOrange Placement PapersParagon Placement PapersPCS Placement PapersPDIL Placement PapersPentaware Placement PapersPentaware Tech Placement PapersPerot Placement PapersPersistent Placement PapersPhilips Placement PapersPlanetasia Placement PapersPNESTEC Placement PapersPolaris Placement PapersPoor Placement PapersPramati Placement PapersProdEx Placement PapersPSI Placement PapersQuark Placement PapersQuinnox Placement PapersQwest Placement PapersR Placement PapersRamco Placement PapersRapidigm Placement PapersRBI Placement PapersRedpine Placement PapersReliance Placement PapersReliance(RIL) Placement PapersRinl Placement PapersRipples Infolink Placement PapersRobert Placement PapersRobert Bosch Placement PapersRockwell Placement PapersRRB(Railway Placement PapersRRB(Railway Recruitment Board ) Placement PapersRSsoftware Placement PapersSahi Placement PapersSail Placement PapersSamsung Placement PapersSamtel Placement PapersSAP Placement PapersSapient Placement PapersSasken Placement PapersSatyam Placement PapersSBI Placement PapersScandent Placement PapersSchneider Placement PapersSCT Placement PapersSemanticSpace Placement PapersShriram Placement PapersSIEMENS Placement PapersSierra Placement PapersSkyTECH Placement PapersSLK Software Placement Paperssobha Placement PapersSoftSol Placement PapersSonata Placement PapersSony India Placement PapersSQL Placement PapersSQL Star Placement PapersSSC Placement PapersStarent Placement PapersStarent Networks Placement PapersSTMicroelectronics Placement PapersSubex Placement PapersSUN Placement PapersSuther Placement PapersSynergy Placement PapersSynopsys Placement PapersSyntel Placement PapersSystech Solutions Placement PapersTalisma Placement PapersTata Placement PapersTata Technologies Placement PapersTavant Placement PapersTCE Placement PapersTCS Placement PapersTech Placement PapersTech Mahindra Placement PapersTELCO Placement PapersTelserra Placement PapersTEMNOS Placement PapersTesco Placement PapersTexas Placement PapersThermax Placement PapersThink Placement PapersTHOROGOOD Placement PapersThoughtWorks Placement PapersTIL Placement PapersTISL Placement Paperstorry Placement PapersTriad Placement PapersTriam Placement PapersTrianz Placement PapersTrilogy Placement PapersTSPL Placement PapersTVS Placement PapersUbiNetics Placement PapersUnited Placement PapersUnited Health Group Placement PapersUS Placement PapersValueLabs Placement PapersValueOne Placement PapersVariFone Placement PapersVedanta Placement PapersVerchaska Placement PapersVERITAS Placement PapersVerizon Placement PapersVernalis Placement PapersVirtusa Placement PapersVisual Placement PapersVIT Placement PapersVizag Steel Plant Placement PapersVizual Placement PapersVSNL Placement PapersVsworx Placement PapersWBPDCL Placement PapersWepIndia Placement PapersWilco Placement PapersWipro Placement PapersXansa Placement PapersXcino Placement PapersYahoo Placement PapersYantro Placement PapersYASH Placement PapersZenith Placement PapersZenser Placement PapersZTE Placement Papers

Download hughes Placement Papers in MS Word and PDF Format for Job Interview

List of all download hughes placement papers in ms word and pdf format for job interview. Click Here View Job List. This page will help you to get all details about download hughes placement papers in ms word and pdf format for job interview. Download hughes placement papers in PDF and Ms word format. Latest and hughes last 5 years placement papers with solutions pdf download for campus job.

Hughes Placement Paper : Whole Testpaper Gurgaon

Hughes test conducted at Gurgaon

          The paper contains the two sections
         Section 1 (20 ques) contains all the questions related to quant,s, simple mathematics, and 
         simple logical question. so asfar as theis section is concern u don,t need any extra book 
         only R.S Aggarwal is sufficient. Section 2(30 ques) coice b/t CS paper and Electronics paper. 

  1.   nice(,val,)? unix command

  2.  for(l=1;a<=l;a++)

  3. nt a[4]={1,2,3,4};
        array to the pointer? *a[4] (*a)[4]

  4. valid system prievlage in restricted seesion? 
        a.  create user
        b.  create session
        c.  restricted session

  5. emaphore?
       a.  shared memory

  6. Semaphore?
       a.  shared memory

  7. which is used to store hard disk sector info                                                                  
        a.   eerom 
        b.   rom 
        c .  ram 
        d.  cmos

  8. If duplicate segments , file are there in hardisk which is best for management
       a.  fat 
       b.  san 
       c.  raid(may be) 

  9. If a lan with 100mbps is there which wan can give same features?
       a.   atm 
       b.   isdn 
       c.   x.25 
       d. ....

  10.  IPv6 has how many bytes for its address?
       a.   8
       b.  12
       c.   16

  11. Sliding window in which layer?                                                                            
       a.   session layer
       b.   transport layer
       c.   application layer
       d.   presentation layer

  12. when interupt occurs to cpu what happen?

  13. DEBUG trigger (oracle)

  14. order of insertion sort and Heap sort?
       a.  O(n**2),O(nlogn)

  15. NEXTVAL and CURRENTVAL in sequence (Oracle)?

  16. Which one is called family tree?
          a.   B+ 
          b.   Binary
          c.   AVL

  17. Intel 386 support which memory management?
         a.   paged
         b.   segmented
         c.   paged segmented

  18. Complexity to access name from the given double link list?                                   
          |   |<--|   |
      a.  O(n)
      b.  O(n**2)
      c.  O(nlogn)

  19.  question on virtual function and overloading?

  20.  question to find error in this C++ code.                                                      

  21. used for parse trees?
      a.  linked lists

  22.  The question on RS232?


Hughes Placement Paper : HUGHES PAPER


  Aptitude Questions

  1. Age problem

  2. Time and distance

  3. Coin

  4. direction problem

  5. (2n + 2 n-1/2 n+1 – 2n) what is gives if n = something

  6. ( 10n –1) n>1 when is divisible by divisible by 8

  7. find the missing no. when it is divisible by some no 

  8. Boat problem

  9. Average

           Technical Questions

  1. Which one is called family tree

  2. virtual function and overloading

  3. DHCP protocol

  4. order of insertion and Heap sort                                         

  5. left recursion

  6.  find output: for(l=1;a<=l;a++)
    cout<<++a; cout <<a;

  7. DEBUG trigger (oracle)

  8. In unrestricted session which system privilege mode is used (oracle)

  9. NEXTVAL and CURRENTVAL in sequence (Oracle)

  10. Unix system call ……like Var( )

  11. OS 384 support which memory management

  12.      Complexity to access name from the given double link list

  13. Which WAN network is suitable for the 100Km or m. distance network

  14. If duplicate segments , file are there in hardisk which is best for management
    a) FAT
    b) SAT

  15. stop n wait protocol is associated with which layer

  16. find errors from the c and c++ codes.

  17. 3 qns on operating systems. I qn on dijkestra algorithm                      

  18. Using which pin it,s possible to address 16 bit addresses even though there re only 8 address bits in 8085? Ans: ALE

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

  20. Quality factor indicates a) Quality of inductor b) quality of capacitor c) both

  21. Qns related to bridges, routers and generators, which OSI layer they corresspond to. (Refer to stevens 4th chapter)

  22. OPAmp,s I/P ciurrent, O/p current and CMRR is given, what is the voltage gain

  23. 2-3 qns on scope of static variables in C. Qn to view o/p odf a C static var

  24. Qn to print a value of a pointer

  25. OPAmp,s I/P ciurrent, O/p current and CMRR is given, what is the voltage gain

  26. A qn to find the physical address from a given virtual address, virtual to physical address table was provided

  27. 6 bit mantissa and 8 bit exponent can present what maximum value?

  28. 4 bit window size in sliding window protocol, how many acknowledements can be held?

  29. Security functionality is provided by which layer of OSI

  30. Frequency spectrums for AM, FM and PM (figure given, u,veto tell which Kind of modulation it belongs to)

  31. Among AM and FM which is better and why?

  32. LASt stage of TTL NAND gate is called: Ans: Totem Pole Amplifie

  33. SR to JK flip flop conversion. Ans: S=JQ,, R=KQ

  34. LSB of a shift register is connected to its MSB, what is formed: Ans: RING Counter

  35. 2-3 Qns based on Demorgan,s laws (identiies: (A+b), = A,b,, etc) 

  36. 2 qns on Logic gates (O/p of logic gates)

  37. Diff in IRET and RET statements of 8086                        

  38. How many address bytes are required to address an array of memory chips (4 * 6), each chip having 4 memory bits and 8k registers.

  39. Diff. in memory mapped and I/P O/P mapped Input/Output (Refer a book on Microprocessor)

  40. Qn on pipeline architecture

  41. QN on LAPB protocol


Hughes Placement Paper : Whole Testpaper


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

  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.l  inked 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.

  15. AX=B where A is mXn ,b&X are column matrices of order m a. if m<n, X has infinite solutions
      b.if m=n, rank of A <n then X has trivial solutions  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;
    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)..

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

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

  27. 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))

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

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

      Section C

  1. One question of Set Theory Like there Are two sets A and B and (A-B)union(B-A)union(A intersection B) 
     is equivalent to Ans. A union B

  2.  Union and intersection are in there sign conventions

  3. One question of probability Like between 100 and 999 how many no have the prob that they does not contain 7
     Ans. 16/25 (not sure u can check by own) 

  4. Of Newton Rapson method... 

  5. Of power set A set contains {(fi),a,{a,b}} what is the powerset of it   Ans. 8 

  6. A question of logic gates Ans. U can got the answer very easily

  7. A question on the Booths algo  Ans. The sequence is 1010101010101010 

  8. Relative addressing mode is used for Ans. Dont know.                                            

  9. For how many numbers there is no difference between little endian and big endian 
    Ans. 256

  10. For the multiplication of two 8 bit numbers how much ROM will be used 
    Ans. 64k*16 ROM(Check it)

  11. Why direct mapping is not good for the mapping of Cache Memory
    Ans. Dont know

  12. What is the main property of Desiy I/O Sytem Ans. 

  13. A question on the nyquist theorem 
    Ans. 18000 bps 

  14. What is the shannon theorem... 
    Ans. Refer to data communication(Stalling) book 

  15. CSMA/CD protocol is used in 
    Ans. Ethernet 

  16. What is the limitation of the Pulse Code Modulation 
    Ans. Refer to data communication book 

  17. In CSMA/CD 
    Ans. The Access to the channnel is probabilistic. 

  18. For an IP Router how many IP addresses 
    Ans. Check it i think Answer is Only One. 

  19. Which protocol u used when you want to know the IP address corresponding to a MAC Address 
    Ans. RARP 

  20. Which part of the IP header is used for the time limit of the packet. 
    Ans. TTL 

  21. Which PageReplacement algo will give the best result 
    Ans. By replacing that page which has the next reference after a long time.(optimal algo) 

  22. What the code will be said when it is called by another part and  it is not completed yet 
    Ans. Reentrant Code. 

  23.  three questions on the simple programs                                                                  

  24. There is a sequence of no and prepare a binary tree and tell how many nodes are in the left and right sub tree. 
          Ans. Check it Ans (4,7) 

  25. hat is the rank of the graph 
    Ans. e-n+k 

  26. One question on the multithreading

  27. Which traversal of the tree gives the node in the ascending  order. 
    Ans. Inorder 

  28. Which traversal of the tree gives the node in the ascending  order. 
    Ans. Inorder 

  29. What is garbage collector. 


Hughes Placement Paper : Whole Testpaper


  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

  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

  4. possion distribution is used for
      a. used in FSM
      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

  6.  no.of filpflops for mod 11 counter
       a.  four
       b.  five

  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?

  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 correc

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

  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

  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 minute

  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)         

       Section A  AND B  (Both are mixed )

  1.  If "AaBbCc" is passed to the char
       char x(*a)
        return 1;
        } what will be the output?

  2.   f(*p)
        p=(char *)malloc(6);
              char *p="bye";
             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

  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

  14. execution phase can be
      a. pipelined
      b. no parallelism is possible
      c. vector processing

  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. irtual functionality is used in C++
        a.   dynamic binding
        b.   if the derived func is present but base class not present                              

  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

  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.  flow control is used for
      a. congestion at receiver

  27. flow control is used for a. congestion at receiver

  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                                           

  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

  37. When static variables are used, which one of the following is not possible?
      a. dynamic run time

  38.  in product of x and y,
             (not cleared)
    what is cyclometric complexity?
    a. 3
    b. 2
    c. 1
    d. 0

    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

  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

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


Hughes Placement Paper : Whole Testpaper

HUGHES Sample Questions        

  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. hree 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  . What 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? 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;
        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.

  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. n two phase commit protocol, why log is used during transmission &reception ?
    a.   To retrieve the status in case of crash

  35. n 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. n a linked list, we can delete a node in order of
       a.   1
       b.   n
       c.   n ^ 2

  45. f 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


  1.  void x(char* a)
         return 1;
      Input string ,a, is assigned as AaBbCc , what is the output?

  2.  A question on digital gates ANS is OR gate.

  3.  What is the binary representation of 41.6785

  4.  If the precondition for a subroutine does not hold then 
        1.  postcondition does not hold 
        2.  postcondition may or may not hold
        3 . ?
        4. ?

  5.  In java 
      1. java strings are mutable. And some other options on java strings 

  6. Void f(char *p)
           p = (char*)malloc(6);                                                                              
      void main( )
       char *p = "BYE";
      ANS BYE

  7. A question on write through and write back algo.

  8. What is concerned with transport layer. Ans PORT.

  9. A server can work with ip and ipx the server will  determine to which protocol the incoming packet coresponds .

  10. For which purpose dhcp is used ANS ip address

  11.  global vaariable defined as ststic will serve the purpose of ---

  12.  Question on NFS ANS It uses the same semantics as unix for  file system

  13. Program counter is incremented typically in which uses ANS fetch

  14. NO of NULL pointers in a tree with n leaf nodes ANS N+1

  15. thread take less time than process context Why? Ans. Address space is  same.

  16. Which algo is best for sorting 10 elements?  Ans. 1> binary tree 2> selection 3> bubble 4> none

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

  18. 8 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

  19. 9 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

  20.   function dependency can be described as:

  21. on findind cyclometric complexity of the given program  1> 7 2>5 3> 4 4> 0

  22. Codd,s rule related to database

  23. path testing comes under
      A) white box 
      B) black box

  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

  25. Execution divided in different stages then this is called ANS. Pipelining

  26. In C the macros are ANS. converted in to inline code during preprocessing 

  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

  28. void insert (key, r)  Keytype key, data
           if (n>=max)
         Which is best?   1.  sequential search

  29. which is best for associative list searching?
      1) single linked list
      2) doubly linked list
      3) hash table

  30. A question based on SQL ?

  31.  which is not necessary condition for deadlock?                                               
     1. mutual exclusion
     2. no preemption
     3. is ANS.
     4. Circular wait


Hughes Placement Paper : General - other - 1 January 2003

  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
     ans rarp

  3. which one of them is not a client server
     and one more
     ans is e-mail or telephone.

  4. Which one is used to represent operations
     and one more
     ans binary tree 

  5. one qustion was on private key and public key.The quest. was 
    f 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 Diwaka

  6. what a java interface not have ?
    ans - instance variables

  7. what is done with java code on a web-page
    ans - downloaded and executed on ur pc

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

  9. what is RSA

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

  11. what is the best sort in worst case
    ans heap sort

  12. what can access protected memebers of a class
    ans other classes of that program

  13. what protocol is used by a machine to map an ip to hardware address
    ans arp

  14. hat is the size of ipv6
    ans 128 bits

  15. how many keys are needed in symmetric and asymmetric crptography?
    ans - i dont know

  16. how many keys are needed in symmetric and asymmetric crptography?
    ans - i dont know 

  17. one on a right threaded tree

  18. very easy k-map 
    ans i think its b)

  19. very easy ckt 
    ans choice which has option : a&c are equivalent

  20. what in unix doesnt have a fd
    ans process ( this was the first ques ).


Hughes Placement Paper : General - other

Interview questions
  1.  What are the 7 layers in ISO-OSI layer, describe each layer   

  2. Can I remove Session Layer from ISO_OSI model..?

  3. Can I remove Session Layer from ISO_OSI model..?
     Hem: I said yes.., because there is no session layer in TCP/IP still it satisfies our requirements

  4. why data link layer protocol, what are main functions of it..?

  5. I am sending data  from machine A to machine C, in between there is an intermediate machine B, then how
     machine B will know that it is not intended for it…
      a)  In which layer of machine B determines that the data is not for it..?
      b)The sending data is divided into packets, does machine B tests all the packets of that data
    then what about of other layers…?
    Even data link layer will process both data frames and acknowledge frames, so there is  also data checking .
    In networks layer every packet has its routing information and destination address so is it necessary by machine B to process it..?

  6. Machine A is using both Telnet and Ftp protocols in its application layer and is sending information to machine B’s application layer, then how machine B determines which bits are related to which protocol…? There is only one single communication channel and both protocols are used simultaneously
    Q) I am using Internet Protocol version 4 (IPv4), but I am receiving data from a machine which is using  IPv6, then
         how will the data transformation will takes place and where will it takes place. Does machine B discards the packet 
         as it doesn’t know about IPv6

  7. What do u mean by switched virtual circuit and permanent virtual circuit

  8. Do u know about circuit switching…? What r the basic elements
     Q.  What switches will do in communication..?Hem: this will establish path for data transmission
     Q) In which layer switches will come..?Hem: in network layer
    Q) If switches will establish path for data transmission what is the necessity of routers. Do they are similar

  9.   I am sending data from one data link layer to another data link layer, how will u come to know whether there is error in data transmission..? explain some methods to find that..?

  10. Tell about 1’s and 2’s complement..Both will perform bitwise operations then what is the difference betweenthem..?When will you go for 1’s complement, when will you go for 2’s complement..? Give one real time example for those two..?

  11. Give some real time example for TCP and UDP protocols…

  12.  What is difference between #include in C++ and import statement in Java..?

  13.  What is difference between #include in C++ and import statement in Java..?

  14. What is the difference between the following two statements..

  15. What are register variables in C, why those are needed..?

  16. I declared 10 register variables, but I have only 6 registers what will happen..?

  17. What is virtual function, why we need it..?

  18. What is virtual destructor.. Where will you use..?

  19. What is a process..?
    Q.   At any time only one process is in execution, so do u mean that there is no multi programmed operating systems..? if    the program under execution is the process, then why there are scheduling algorithms…Scheduling algorithms are there in OS, so there may be more that one process in memory, does it mean CPU will execute more than one process at a time.

  20. Explain about memory management functions performed by OS

  21. Can I have a OS without secondary memory

  22. does it allocate, memory to a process where there is free memory..?

  23. Will OS always follows one of these algorithms..?

  24. How OS comes to know which locations are free and which are allocated..?

  25. what is meant by fragmentation..?

  26. How will you remove fragments..?

  27. What is meant by compaction..?

  28.  Is there any relation between compaction and paging…?

  29. What is paged segmentation and segmented paging..? Differentiate between them..?

  30. VX works is selling under the name of real time OS, but windows is not selling under name of real time OS, where is the difference..?

  31. There are three OS’s namely Unix, VXworks and some X. They will execute one job in 10ms, 8 ms and 1ms respectively. Can u say the OS X is real time OS, if yes why..?, if no why..?

  32. Which scheduling algorithm is used for real time operating system..?

  33. What is meant by deadlock..?

  34. How will u avoid deadlocks..? what r those four conditions to test..?

  35. How will u avoid deadlocks..? what r those four conditions to test..?

  36. A lower process is allocated 2 resources, higher process came for execution and it needs totally 4 resources and presently 2 are allocated.. what will happen..?

  37.  What will happen when context switch takes place… what are the OS activities in context switch.

  38. When a low priority process executes its instructions, high priority process comes what will happen..?
    Hem: low priority process is preempted and high priority gets the CPU. After completion of execution of higher priority process low priority process will get the cpu.
     Q. How OS will know where to start the execution 

  39. When Page fault occurs, what are actions taken by cpu at that time, if there is no memory for page swapping what will happen, is it need to remove the page from memory..?The page to be removed from memory now, is bring from hard disk initially, so is it needed to put back into hard disk once again. If yes why..? 


Hughes Placement Paper : General - other - 21 March 2004

  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;
      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.  CSMA/Cd is used in which lan Ans. ethernet

  10. 8085 pgm : LXI sp, 2021,
    LXI b, 1234 (??)
    push b
    contents of stack after pushing ?

  11. One question on synchronous transmission : ans. Timing info is embedded in data itself

  12. What for start bit is used in RS232 transmission.

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

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

  15. given a height balanced tree. If we add one more node , how
    many nodes gets unbalanced ? Ans. 3

  16. Given a arbitrary pointer to an element in a singly linked list?
    what is the time complexity for its deletion . Ans. O(n)

  17. 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 (??)

  18. which one is false ?
        a. 0<x<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. (??

  19.  S->S+S; s->s*s; s->a how many parse trees possible : a+a*a+a Ans. 5

  20. 4-1 demultiplexer is to be implemented using a memory chip. how many address lines and word length required Ans. 4, 1

  21. Vector intr mechanism. in 8085. Ans. fixed locations in memory when an intr comes.

  22. ARP is used for : Ans. IP to MAC addr conversion.

  23.  given 100 to 999 nos. Probability of picking a no. with out digit 7. Ans. 18/25.

  24. Ten film rolls. 3 defective, prob. of picking up 2 defective rolls with out replacement Ans. 6/90

  25. Ten film rolls. 3 defective, prob. of picking up 2 defective rolls with out replacement Ans. 6/90

  26. 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)

  27. No. of nodes of degree 2 in a binary tree with n leaf nodes. Ans. n-1



Hughes Placement Paper : General - other - 1 January 2004


  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  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 mystique 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. Solution for Diriving philofphing Ans : d

  20. The question on RS232 (Use of sfart bit in Rs 232 protocal)

  21.  Floating point representation Ans : 2,s complement


By Category
Post Your Resume Here