HCL Apptitude Questions

Sample Test Paper

1. Which of the following involves context switch,
(a) system call
(b) priviliged instruction
(c) floating poitnt exception
(d) all the above
(e) none of the above
Ans: (a)

2. In OST, terminal emulation is done in
(a) sessions layer
(b) application layer
(c) presentation layer
(d) transport layer
Ans: (b)

3. For a  25MHz processor , what is the time taken by the instruction which needs 3 clock cycles,
(a)120 nano secs
(b)120 micro secs
(c)75 nano secs
(d)75 micro secs

4. For 1 MB memory, the  number of address lines required,
(a)11
(b)16
(c)22
(d) 24
Ans. (b)

5. Semaphore is used for
(a) synchronization
(b) dead-lock avoidence
(c) box
(d) none
Ans. (a)

6. Which holds true for the following statement
     class c: public A, public B
a) 2 member in class A, B should not have same name
b) 2 member in class A, C should not have same name
c) both
d) none
Ans. (a)

7. Question related to java

8. OLE is used in
a) inter connection in unix
b) interconnection in WINDOWS
c) interconnection in WINDOWS NT

9. Convert a given HEX number to OCTAL

10. Macros and function are related in what aspect?
(a)recursion
(b)varying no of arguments
(c)hypochecking
(d)type declaration

11.Preproconia.. does not do which one of the following
(a) macro
(b) conditional compliclation
(c) in type checking
(d) including load file
Ans. (c)

12. Piggy backing is a technique for
a) Flow control
b) Sequence
c) Acknowledgement
d) retransmition
Ans. (c)

13. In signed magnitude notation what is the minimum value that can be represented with 8 bits
(a) -128
(b) -255
(c) -127
(d) 0

14. There is an employer table with key fields as employer number data
      in every n'th row are needed for a simple following queries will get required results.
(a) select A employee number from employee A , where exists from employee B where A employee no. >= B
     employee having (count(*) mod n)=0
(b) select employee number from employe A, employe B where A employe number>=B employ number
    group by employee number having(count(*) mod n=0 )
(c) both (a) &a