HCL Placement Papers 39

by mod on December 31, 2009

Section 1- General Computer Concepts

1. Piggy backing is a technique for

a) Flow control b) Sequence c) Acknowledgement d) retransmition

Ans. (c)

2. In OSI, terminal emulation is done in

(a) sessions layer (b) application layer (c) presentation layer (d) transport layer

Ans: (b)

3.Bit parity check,when performed on a byte ,cancatch

a)odd number of errors b)even number of errors c)any number of errors

d)none of the above

Ans: (a)

4. In signed magnitude notation what is the minimum value that can be represented with 8 bits

(a) -128 (b) -255 (c) -127 (d) 0 Ans: (c)

5. For 1 MB memory, the number of address lines required,

(a)11(b)16(c)20(d) 24 Ans. (c)

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

Ans: (a)

7. Semaphore is used for

(a) synchronization(b) dead-lock avoidence(c) both a and b(d) none Ans. (c)

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

9.Virtual address are translated to physicaladdress by

(a)the process (b)operating system (c)MMU (d)All of the above (e) None of the above

10.convert the hexadecimal number 0xFEDB to the octal

(a) 177333

ans: (a)

11. OLE is a mechanism

a)in UNIX for network communication

b)in INTERNET for communication between nodes

c)for communication between processes in a NT system d)used as a network layer protocol in NT & Windows systems

12. an internet IP address of a node

a)has to be unique only for the domain of the node

b)has to be unique in the node’s sub-network c)has to be unique in the country in which the node is present d)none of the above

Reply With Quote

Related posts:

  1. HCL Placement Papers 26
  2. HCL Placement Papers 38
  3. HCL Placement Papers 11
  4. HCL Placement Papers 17
  5. HCL Placement Papers 4

Leave a Comment

Security Code:

Previous post:

Next post: