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)
    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!

    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!

    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!

    Answer:
    void setNthbit (int num, int bitposition)
    {
    num |= (1 << bitposition);
    }
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    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)
    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    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)
    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!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!