Note 1

Take Note:

Take a note while surfing.





Note With Ink

Give your Note a Colorful Tag.




Easy to Access

Stay on same information and in Sync wherever you are.

Note 2

Take Note:

Organize your information,It may take Shape.





Think With Ink

Differ your Content by Color.




Easy to Access

Easy to pull up your content from anywhere anytime.

Note 3

Take Note:

Don't Let information to miss,Because it take shape





Note With Ink

Simple an Easy Way to take a note.




Easy to Access

Get the same in next visit.

Interview Questions and Answers :: Alcatel-Lucent

Home > Experience Archives > Alcatel-Lucent > Interview Question Set 1
First Round (F-2-F) Second Round (F-2-F) Third Round (F-2-F)
  • 1. Introduce yourself briefly.
  • Answer:
    Hi,
    I'm Gursharan Singh. I have done diploma in I.T.E.S&M(Information Technology Enable Services & Management). I did schooling from C.B.S.E broad. I have about 4-5 months of experience in web development .I have two sibling.
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 2. write a program to reverse the linklist.
  • Answer:
    struct node * reverseList ( struct node *current, struct node *prev)
    {
    struct node *tmp = current->next;
    current->next = prev;
    if (tmp !=NULL)
    reverseList(tmp, current);

    return current;
    }
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 3. write a program to reverse all the word in given sentence .
    Ex. India is a Great Country.
    Output: aidni si a taerg yrtnuoc.
  • Answer:
    reverseWordString ( char * str)
    {
    int len, i, j;
    len = strlen(str);
    j = 0;
    for (i = 0;i < len; i++)
    if ( str[i] == ' ')
    {
    swap (str, j, i-1)
    j = i+1;
    }

    void swap(char *str1, int start, int end)
    {
    int i = start;
    char tmp;
    for ( ; i<=end; i++, end--)
    tmp = srt1[i];
    str1[i]= str[end];
    str[end] = tmp;
    }
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 4. write a program to set the nth bit .
  • Answer:
    void setNthbit (int num, int bitposition)
    {
    num |= (1 << bitposition);
    }
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 5. Write your own printf.
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 6. write your own strncpy.
  • Answer:
    void owncpyString ( char const *str , char *rev, int length )
    {
    int i ;

    for ( i = 0; (i < length && str[i] != '\0'); i++)
    rev[i] = str[i];
    if (i < length)
    for ( ; i < length; i++)
    rev[i] = '\0';

    }
    Please Login First :
    Tags:

    No Tags on this question yet!

First Round (F-2-F) Second Round (F-2-F) Third Round (F-2-F)
  • 1. Briefly described the current project. Given the marker and board to draw the architecture and explain each phase.
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 2. There were some project specific questions.
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 3. What is difference in int *a[100] & int (*a)[100] .
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 4. int *a[10];
    int (*b)[10];
    int c[10] = {1,2,3,4,5,6,7,8,9}
    a. is the below statement correct ?
    a[0]=&c[0]; a[1]=&c[1]; ...... a[9]=&c[9];
    b=c;
    b. How to print the value using a and c ;
    c. what will be the sizeof(a), sizeof(b), sizeof(c);
    d. which operation is valid
    1. a++
    2. b++
    3. c++
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 5. char *x = "alcatel"
    char y[18] = "alcatel"

    a. What will the the sizeof (x) and sizeof (y), strlen(x),strlen(y)
    b. Whether the below statement is correct.
    x++, y++
    c. Whether the below statement is correct.
    x[0]='L'
    y[0]='L'
    d. What if we allocate the memory and then
    x=malloc(10)
    y=malloc(10)
    now perform the step b.
    e. After the step c what will be the sizeof (x),sizeof(y)
    f. What will be strlen(x), strlen(y);
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 6. lets 32bit no. write a program to circular rotate 1 byte.
    int y=0x01020304;
    output y=0x04010203;
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 7. Write a program to check the bit is set or not.
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 8. Write a program to find the loop in linklist and remove the loop in linklist.
  • Answer:
    int detectLoop(struct node *head)
    {
    struct node *slow = list, *fast = head;

    while (slow && fast && fast->next )
    {
    slow = slow->next;
    fast = fast->next->next;
    if (slow == fast)
    {
    printf("\r\nLoop detected in linked list \r\n");
    removeloop(slow, head);
    }
    }
    return 0;
    }

    void removeLoop(struct node *slow_node, struct node *head)
    {
    struct node *ptr1;
    struct node *ptr2;

    ptr1 = head;
    while (1)
    {
    ptr2 = loop_node;
    while (ptr2->next != loop_node && ptr2->next != ptr1)
    ptr2 = ptr2->next;

    if (ptr2->next == ptr1)
    break;

    ptr1 = ptr1->next;
    }
    ptr2->next = NULL;
    }
    Please Login First :
    Tags:

    No Tags on this question yet!

First Round (F-2-F) Second Round (F-2-F) Third Round (F-2-F)
  • 1. Can you write a program to implement memcpy. copy must be successful even source and destination address overlap.
  • Answer:
    As given copy should be successful even source and dest address overlap, than we should implement memmove functionality

    void ownMemMove(void *dest, void *src, size_t n)
    {

    char *src_l = (char *)src;
    char *dest_l = (char *)dest;

    char *temp [n];

    memset(temp, '\0', n);

    for (int i=0; i < n; i++)
    temp[i] = src_l[i];

    for (int i=0; i < n; i++)
    dest_l[i] = temp[i];

    }
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 2. puzzel:
    There are 100 doors, all closed. In a nearby cage are 100 monkeys. The first monkey is let out, and runs along the doors opening every one.
    The second monkey is then let out, and runs along the doors closing the 2nd, 4th, 6th,... all the even-numbered doors.
    The third monkey is let out. He attends only to the 3rd, 6th, 9th,... doors (every third door, in other words), closing any that is open and opening any
    that is closed, and so on. After all 100 monkeys have done their work in this way, what state are the doors in after the last pass,which doors are left open and which are closed?
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 3. what mechanism used to communicate between kernal and user-space.
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 4. what mechanism used to pass message between protocols.
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 5. In above question he touch the semaphore , mutex, and IPC.
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 6. what is deadlock condition, have you ever observed such scenario in ur carrier.
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 7. what is lock ordering.
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 8. For a given stack dump, how you can analyse. how can you find the call trace.
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 9. Can you implement a memory manager, which will detect the memory corruption.
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!