HCL

                    

HCL Technologies is a global IT Services company headquartered in Noida, a suburb of Delhi, India led by Nayar, HCL Technologies, along with its subsidiaries, had consolidated revenues of US$5 billion, as of 2010, and employed more than 58,129 workers. The name HCL is an abbreviation on Hindustan Computers Limited. HCL offers services including Software, Remote Infrastructure Management, Engineering and R&D Services and BPO. HCL’s key services include: Custom Application Services Enterprise Application Services Enterprise Transformation Services Engineering and R&D Services Infrastructure Management Business Processing Outsourcing. In addition to this, HCL AXON, formed after the acquisition of Axon Group plc in December 2008, offers SAP services including: Business Consulting Solutions Implementation Application Management Blue ocean upgrades Integration Services. HCL serves industries such as Financial Services, Education, Hi-tech & Manufacturing, Aerospace & Defense, Telecom, Retail & CPG, Life Sciences, Healthcare, Media & Entertainment, Travel, Transportation & Logistics, Automotive, Government, Energy & Utilities.






2010 place ment papers   ==>  Download 






October 19, 2010             Category : Academics 

HCL-2:

Paper Model:

Section I: Computer awareness (i.e. general things about computer) Q.15

-ve marks -1/4

Section II: Simple C- language Q. 15 & -ve marks: -1/4

Section III: On pointers & structures and C++, JAVA (only 1 on this) Q.10 each question ->2 marks

-ve marks: -1

Section IV: Analytical Q.20 each question -> 2 marks.

-ve marks: -1/4

SECTION-I:

1). Piggy backing is a technique for

a) Flow control b) sequence c) Acknowledgement d) retransmission Ans: c

2). the layer in the OST model handles terminal emulation

a) Session b) application c) presentation d) transport Ans: b

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

13) There is an employer table with key fields as employer no. data in every n'th row are needed for simple following queries will get required results.

a) Select A employee no. from employee A, where exists from employee B where A employee no. >= B employee having (count (*) mod n) =0

b) Select employee no. from employee A, employee B where A employee no.>=B employ no.grouply employee no. having (count (*) mod n=0)

c) Both a& b d) none of the above

14) Type duplicates of a row in a table customer with non-uniform key field customer no. you can see

a) Delete from customer where customer no. exists (select distinct customer no. from customer having count)

b) Delete customer a where customer no. in b rowid

c) Delete customer a where customer no. in (select customer no. from customer a, customer b)

d) None of the above

SECTION-II:

2) Long int size

a) 4 bytes b) 2 bytes c) compiler dependent d) 8 bytes Ans: compiler dependent note: order of a, b, c, d are doubt but answer is correct.

3) X=2,y=6,z=6

x=y==z;

Printf (%d", x)?

4) If (x>2)? 3:4

14) C: class A, B and C can have member functions with same name.

SECTION-III:

1) Ans: b it does not work when rp is the last element in the linked list

2) Ans: a always

3) Ans: b 13

SECTION-IV:

Following are not in order:

2. M > D > Y Ans: (a)

6. 10 in 4 seconds,

? In 6 minutes = 10x6x60/4 = 900 Ans: (a)

7. a=2, b=4, c=5

(a+b)/c - c/(a+b) = 11/30 (ans).

8. 100 (100000000+100000000)/10000 = 2x1000000 (Ans).

9. What does the hex number E78 in radix 7.

(a) 12455 (b) 14153 (c) 14256 (d) 13541 (e) 131112 Ans: (d)

10. Q is not equal to zero and k = (Q x n - s)/2 find n?

(a) (2 x k + s)/Q (b) (2 x s x k)/Q (c) (2 x k - s)/Q (d) (2 x k + s x Q)/Q (e) (k + s)/Q (from GRE book page no: 411)

Data:

A causes B or C, but not both

F occurs only if B occurs

D occurs if B or C occurs

E occurs only if C occurs

J occurs only if E or F occurs

D causes G, H or both

H occurs if E occurs

G occurs if F occurs

NOTE: check following answers.

11. If A occurs which of the following must occurs?

I. F & G

II. E and H

III. D

(a) I only (b) II only (c) III only (d) I, II, & III (e) I & II (or) II & III but not both Ans: (e)

12. If B occurs which must occur?

(a) D (b) D and G (c) G and H (d) F and G (e) J Ans: (a)

13. If J occurs which must have occurred?

a) E (b) either B or C (c) both E & F (d) B (e) both B & C Ans: (b)

14. Which may occurs as a result of cause not mentioned

(1) D (2) A (3) F

(a) 1 only (b) 2 only (c) 1 & 2 (d) 2 & 3 (e) 1, 2, 3 Ans: (c)

15. E occurs which one cannot occurs

(a) A (b) F (c) D (d) C (e) J Ans: (b)

In written test in each section you have to get minimum marks i.e. you have to pass in each section. There will be questions from C, C++, and JAVA. About 10 questions in C++ in the written test.

Section 1
1.Which of the following involves context switch,a) System call                 b)privileged instruction                 c) Floating point exception                d) All the above                e) None of the above
Ans: a
2.In OSI, terminal emulation is done in :a) Semi on             b) Appl..             c) Presents...             d) Transport
Ans: b
3. 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 MBmemory no of address lines required,a)11                 b)16                 c)22                 d) 24
Ans: 16
5. Semaphore is used fora) Synchronization             b) Dead-lock Avoidance                c) Box                     d) None
Ans: a
6. Class c: public A, public Ba) 2 member in class A, B shouldn't have same name
b) 2 member in class A, C " '' '' ''
c) Both 
d) None
Ans : a
7. Question related to java
8. OLE is used ina) Inter connection in UNIX
b) Interconnection in WINDOWS
c) Interconnection in WINDOWS NT

9.No given in HEX ---- write it in OCTAL
10.macros and function are related in what aspect?a) Recursion                 b) Varying no of arguments
c) Hypo checking          d) Type declaration

11.preproconia.. does not do one of the followinga) Macro ......                 b) Conditional complication                c) In type checking                     d)Including load file            
Ans: c

Section 2

1.enum day = { jan = 1 ,feb=4, april, may}
What is the value of may?a) 4             b) 5         c) 6             d) 11             e) None of the above

2. main
{
int x,j,k;
j=k=6;x=2; ans x=1
x=j*k;
printf("%d", x);

3. fn f(x) 
{ if(x<=0)
return; ans fn(5) ....?
else f(x-1) +x;
}

4. i=20,k=0;
for(j=1;j{
k+=j<10?4:3;
}
printf("%d", k); ans k=4

5. int i =10
main ()
{
int i =20,n;
for(n=0;n<=i;)
{
int i=10
i++;
}
printf("%d", i); ans i=20

Multiple Choice Questions:

7. Y=10;
if( Y++>9 && Y++!=10 && Y++>10)
printf("........ Y);
else printf("".... )
Ans : 13

8. f=(x>y)? x:y
a) f points to max of x and y
b) f points to min of x and y
c)error
d) ........
Ans : a

9. if x is even, then
(x%2)=0
x &1 !=1
x! (some stuff is there)
a)only two are correct
b) three are correct
c),
d) ....
Ans: all are correct

10. Which of the function operator cannot be over loaded
a) <=
b)?
c)==
d)*
Ans: b and d

Section 3 (PRG Skill)

(1) STRUCT DOUBLELIST
{ DOUBLE CLINKED
INT DET; LIST VOID
STRUCT PREVIOUS; BE GIVEN AND A PROCEDURE TO DELETE
STRUCT NEW; AN ELEMENT WILL BE GIVEN
} 
DELETE(STRUCT NODE)
{
NODE-PREV-NEXT NODE-NEXT;
NODE-NEXT-PREV NODE-PREV;
IF(NODE==HEAD)
NODE
}
IN WHAT CASE THE PREV WAS
(A) ALL CASES
(B) IT DOES NOT WORK FOR LAST ELEMENT
(C) IT DOES NOT WORK FOR-----

(2) VOID FUNCTION(INT KK)
{
KK+=20;
}
VOID FUNCTION (INT K)
INT MM,N=&M
KN = K
KN+-=10;
}

Section D

(1) a=2,b=3,c=6 c/(a+b)-(a+b)/c=?

(2) No.rep in hexadecimal, write it in radix 7

(3) A B C D E
* 4
---------- find E 
ANS: 13
E D C B A

(4) GRE-MODEL TEST-1, SECTION-6(19-22)

(5) M HAS DOUBLE AMOUNT AS D, Y HAS RS. 3 MORE THAN HALF OF AMOUNT OF D
THE ORDERING A,B,C M C D C Y
ANS:DATA INSUFFICIENT D C M C Y
(6)IN STASTIC MEN CAUSE MORE ACCIDENTS THEN ONE CONCLUSION
(A) MEN DRIVE MORE THAN ONCE
(B) STASTICS GIVE WRONG INFORMATION
(C) WOMEN ARE CAUTION THAN ME ANS; C(VERIFY)
(D)-----ETC

(7) P,Q,R,S,T,U -SECURING GRANT;TWO TOURIST PARTIES AND THEN TWO SECURITY
GAURDS SHOULD GO WITH EACH PARTY

P AND R-ARE ENEMIES, Q DOES NOT GO SOUTH

P&S-ARE WILLING TO BE TOGETHER

THE TWO PARTIES MAY GO SOUTH&NORTH RESPECTIVELY AT ONE POINT EACH MAY PASS EACH OTHER THEN GAURDS CAN EXCHANGE 6 Q BASED ON THIS

(8) pq-r/s =2 what is q inference a, n&d
(a) a can do n units of work in strs, a&b can do n units of work in 2 hrs in how many hrs n units of work ans:3 hr 30 min p = (2s+r)/q

main()
{ 
int var=25,varp;
varp=&var;
varp p = 10;
fnc(varp)
printf("%d%d,var,varp);
}
(a) 20,55                (b) 35,35                (c) 25,25                (d)55,55








2008 papers 

1.pdf  2.pdf  3.pfd 4.pdf 6.pdf 7.pdf  8.pdf  11.pdf 10.pdf  13.pfd  9.pdf 14.pdf 15.pdf