Placement Papers - Hughes
Hughes Placement Paper At DCE
Posted by :
Afsheen
(7)
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
HUGHES
Source : IITK ( This paper is got from Rookee and same is given in IITK)
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
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(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
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
HUGHES
Source : IITK ( This paper is got from Rookee and same is given in IITK)
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
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(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
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers