Lucent  Placement Paper   Whole Testpaper   -1 Jan 1900

Lucent  Placement Paper   Whole Testpaper   -1 Jan 1900

  • Posted by  FreshersWorld 
    7 Jan, 2012




    1). Piggy backing is a technique for

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

    ans: c piggy backing

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

    a) session b) application c) presentation d) transport

    ans: b application

    3) there is an employer table with key feilds as employer no. data in every
    n'th row are needed for a simple following queries will get required results.

    a) select A employe no. from employe A , where exists from employe B
    where A employe no. >= B employe having (count(*) mod n)=0
    b) select employe no. from employe A, employe B where
    A employe no. >= B employ no. grouply employe no. having (count(*) mod n=0 )
    c) both a& b
    d)none of the above

    4) type duplicates of a row in a table customer with non uniform key feild
    customer no. you can see

    a) delete from costomer where customer no. exists ( select distinct customer no. from customer having count )
    b) delete customer a where customer no. in (select customer b where custermer no. equal to b custemor no. ) and a rowid > b rowid
    c) delete customer a where custermor no. in (select customer no. from customer a, customer b )
    d) none of the above


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

    2) x=2,y=6,z=6
    printf(%d",x) ?
    3) one question on: -=+,*=-,/=* etc
    then 10/5*45=?

    define max 10
    {int a,b;
    int *p,*q;
    a)error in p=&(a+b) b)error in p=&max c)error in both d) no error


    following are not in order:

    1. M > D > Y ans: (a)

    2. 10 in 4 seconds, ? in 6 minutes = 10x6x60/4 = 900 ans: (a)

    3. 100(100000000+100000000)/10000 = 2x1000000 (ans).

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

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

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

2009-2016 All rights reserved.