Placement Papers - Hughes

Why Hughes Placement Papers?

Learn and practice the placement papers of Hughes and find out how much you score before you appear for your next interview and written test.

Where can I get Hughes Placement Papers with Answers?

IndiaBIX provides you lots of fully solved Hughes Placement Papers with answers. You can easily solve all kind of placement test papers by practicing the exercises given below.

How to solve Hughes Placement Papers?

You can easily solve all kind of questions by practicing the following exercises.

Hughes Placement Paper (Technical- C C++ & DS)

Posted By : Amruta Rating : +7, -1

Paper: Hughes Placement Paper (Technical- C C++ & DS)
 
    1) Given an expression tree and asked us to write the in fix of that expression
 
  2) global variables in different files are
a) at compile time
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
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 function call are allocated in
a) registers and stack
b) registers and heap
c) stack and heap
d)heap
 
  6) Average and worst case time of sorted binary tree
 
7) data structure used for priority 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)36,17
 
  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,'');
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 a function 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)
 
20. main()
{
fork();
fork();
fork();
printf("
hello");
}
How many times print command is executed?
 
  21.main()
{
int i,*j;
i=5;
j=&i;
printf("
i= %d",i);
f(j);
printf("
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
 
 
22. some question on pipeline like you have to find out the total time by which execution is completed for a pipeline of 5 stages.
 
  23.
main()
{
int *s = "";
if(strcmp(s,NULL)== 0)
printf("
s is null")p
else
printf("
s is not null");
}
 
  24. size of integer is
a. 2 bytes
b 4 bytes
c. machine dependant
d compiler dependent.
 
  25.max and avg. height of sorted binary tree
a. logn n
b n logn
 
  26. some question. like the number was shifted every time by one and bit wise and with 10000000.
 
27. int a[5][4]
int is 2 bytes base address for array is 4000(Hexa) what will be addr for a[3][4]?
 
  28. implementation of priority queue
a. tree
b linked list
c doubly linked list

Like this page? +7 -1




Companies List:

3i Infotech - AAI - ABACUS - ABB - Accel Frontline - Accenture - Aditi - Adobe - ADP - Agreeya - Akamai - Alcatel Lucent - Allfon - Alumnus - Amazon - Amdocs - AMI - Andhra Bank - AppLabs - Apps Associates - Aricent - Ashok Leyland - Aspire - Atos Origin - Axes - Bajaj - Bank of Maharashtra - BEL - BEML - BHEL - BirlaSoft - Blue Dart - Blue Star - BOB - BPCL - BPL - Brakes - BSNL - C-DOT - Cadence - Calsoft - Canara Bank - Canarys - Capgemini - Caritor - Caterpillar - CDAC - CGI - Changepond - Ciena - Cisco - Citicorp - CMC - Consagous - Convergys - CORDYS - Crompton - CSC - CTS - Cummins - Dell - Deloitte - Delphi-TVS - DeShaw - Deutsche - Dotcom - DRDO - EDS - EIL - ELGI - ELICO - ERICSSON - Essar - Fidelity - Flextronics - Freescale - FXLabs - GAIL - GE - Genpact - Geodesic - Geometric - Globaledge - GlobalLogic - Godrej - Google - Grapecity - HAL - HCL - Hexaware - Honeywell - HP - HPCL - HSBC - Huawei - Hughes - IBM - IBS - ICICI - iGate - Impetus - iNautix - Indian Airforce - Indian Airlines - Infosys - Infotech - Intec - Integra - Intergraph - IOCL - iSOFT - ISRO - Ittiam - JSW - Keane - Kenexa - L & T - L & T Infotech - LG Soft - Lifetree - LionBridge - Mahindra Satyam - Mastek - Maveric - McAfee - MECON - Microsoft - MindTree - Miraclesoft - Mistral - Motorola - Mphasis - MTNL - NIC - Nokia Siemens - Novell - NTPC - Nucleus - ORACLE - Patni - Perot - Polaris - Ramco - Robert Bosch - Samsung - SAP - Sapient - Sasken - SBI - Sierra Atlantic - Sonata - Sony India - Sutherland - Syntel - TCS - Tech Mahindra - VeriFone - Virtusa - Wipro - Zensar.