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 :: NEC Technologies

Home > Experience Archives > NEC Technologies > Interview Question Set 2
First Round (F-2-F) Second Round (F-2-F)
    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    It can be verified based on packets ERROR CODE in BCM.
    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:
    create group,
    create Fp entry,
    fp priority set,
    qualifier set,
    values to the qualifier and
    install.
    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:

    It will give a compile time error due to first if condition.



    Given : if(a=0)



    It should be : if(a==0)

    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    int n;
    int a=0;
    scanf("%d",&a);
    n=a;
    while (n>2)
    {
    if(n%2!=0)
    {
    n=n/2;
    if (n>=2)
    {
    printf("%d is prime number", a);
    break;
    }
    }
    else
    {
    printf("%d is not prime number", a);
    break;
    }

    }
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    int a[]= {2,3,4,7,9,3,8,9,6,8,7,9};
    int i=0;
    int j=0;
    int flag=0;
    int n=12;
    static int incr;
    for (i=0;i {
    for(j=0;j {
    if (a[i]==a[j])
    {
    incr++;
    if (incr>=2)
    flag=1;
    }
    }
    if (flag)
    printf("\n %d is repeated %d times in this array", a[i],incr);
    flag=0;
    incr=0;

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

First Round (F-2-F) Second 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 a[]= {2,3,4,7,9,3,8,9,6,8,7,9};
    int i=0;
    int j=0;
    int n=12;
    int sum=12;
    for (i=0;i {
    for(j=++i;j {
    if ((a[i]+a[j]) == sum)
    {
    printf("\n %d + %d positions of sum %d", a[i], a[j], sum);
    continue;
    }
    }
    }
    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 *loop_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!

    Answer:
    int i=1;
    if ((*(char*)&i) == 1)
    printf("LE");
    else
    printf("BE");
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    unsigned int i=0xABABCDAB;
    int b=0;
    for(b=31;b>0;b--)
    {
    if (b<16 && b>7)
    i=(1< }
    printf("\n NEW i = %X \r\n", 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!