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.


Please wait...

Interview Questions and Answers :: Hewlett Packard Enterprise

Home > Experience Archives > Hewlett Packard Enterprise > Interview Question Set 1
Telephonic Round First Round (F-2-F) Second Round (F-2-F) Third Round (F-2-F) Managerial Round (F-2-F)
    Question :: 1
    Introduce you self breifly.

    Answer:

    I am from so and so places. I have finished my schoolings in so and so place.

    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 2
    Question were from resume and then about project (what type of data structure you have used.)

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

    No Tags on this question yet!

    Question :: 3
    Did you face any looping issue.If so how you fixed those issues.

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

    No Tags on this question yet!

    Question :: 4
    What is volatile, and have you used it in your project.

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

    No Tags on this question yet!

    Question :: 5
    Do you have question for me?

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

    No Tags on this question yet!

Telephonic Round First Round (F-2-F) Second Round (F-2-F) Third Round (F-2-F) Managerial Round (F-2-F)
    Question :: 1
    Tell me about yourself.

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

    No Tags on this question yet!

    Question :: 2
    How to find mask is valid or not.

    Answer:

    Basically a valid sub-net mask, when written in binary, has to consist
    of only consecutive 1's and then 0's, but no intermittent mixing. I.e.:



    255.255.255.128 -> 11111111.11111111.11111111.10000000 is valid

    255.255.255.0 -> 11111111.11111111.11111111.00000000 is valid
    255.255.255.144 -> 11111111.11111111.11111111.10010000 is not valid <<<<<<<<

    #include <stdio.h>

    int main()
    {
    char ip[4] = {255,255,255,128};
    int count = 0, valid = 0,i,check,j;
    for (j=3;j>=0;j--) {
    count = 0;
    if (valid)
    check++;
    for (i = 0;i < 8;i++)
    {
    if ((ip[j] & 1<<i) && count !=1)
    {
    count = 1;
    }
    if ((count ==1) && !(ip[j] & 1<<i))
    valid = 1;
    }
    }
    if (valid)
    printf("Invalid subnet");
    else

    printf("Valid subnet");

    }



    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 3
    Write a program to find the loop in sigle linked list.

    Answer:
    bool loopInLinkedList(Node *list)
    {
    Node *slow_p, *fast_p;
    slow_p = list;
    fast_p = list;
    while (slow_p && fast_p && fast_p->next)
    {
    slow_p = slow_p->next;
    fast_p = fast_p->next->next;
    if (slow_p == fast_p)
    return TRUE;
    }
    return FALSE;
    }

    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 4
    Write a program to delete a node in single and double linked list.

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

    No Tags on this question yet!

    Question :: 5
    Write a program to reverse a single linked list using pointer or recursive.

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

    No Tags on this question yet!

    Question :: 6
    Impliment a queue using linked list and perform push and pop operation.

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

    No Tags on this question yet!

Telephonic Round First Round (F-2-F) Second Round (F-2-F) Third Round (F-2-F) Managerial Round (F-2-F)
    Question :: 1
    Write a program to find sub string in given string.

    Answer:

    typedef enum {FALSE=0,TRUE} bool;
    bool subStringInString(char const * oString, char const *sString)

    {
    int oLen = 0, sLen = 0;
    int i=0,j=0;
    oLen = strlen(oString);
    sLen = strlen(sString);
    for (i = 0;i <=(oLen-sLen); i++)
    {
    for (j = 0; j < sLen;j++)
    {
    if (sString[j] != oString[i+j])
    break;
    }
    if (j == sLen)
    return TRUE;
    }
    return FALSE;
    }

    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 2
    How scheduling happen, What tpe of scehduligng you have used.

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

    No Tags on this question yet!

    Question :: 3
    What is shared memory and message queue.

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

    No Tags on this question yet!

    Question :: 4
    How memory management work.

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

    No Tags on this question yet!

    Question :: 5
    How ping happen between two Host connected directly and when connected by switch/router.

    [Host-1] -------[Host-2]

    [Host-1] -----[switch]-----[Router] -----[Host-2]

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

    No Tags on this question yet!

Telephonic Round First Round (F-2-F) Second Round (F-2-F) Third Round (F-2-F) Managerial Round (F-2-F)
    Question :: 1
    Introduce you self breifly.

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

    No Tags on this question yet!

    Question :: 2
    What is difference between mutex and semaphore. Does binary semaphore and mutex are same.

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

    No Tags on this question yet!

    Question :: 3
    Write a program by implementing semaphore.

    Answer:
    // C program to demonstrate working of Semaphores
    #include
    #include
    #include
    #include

    sem_t mutex;

    void* thread(void* arg)
    {
    //wait
    sem_wait(&mutex);
    printf("\nEntered..\n");

    //critical section
    sleep(4);

    //signal
    printf("\nJust Exiting...\n");
    sem_post(&mutex);
    }


    int main()
    {
    sem_init(&mutex, 0, 1);
    pthread_t t1,t2;
    pthread_create(&t1,NULL,thread,NULL);
    sleep(2);
    pthread_create(&t2,NULL,thread,NULL);
    pthread_join(t1,NULL);
    pthread_join(t2,NULL);
    sem_destroy(&mutex);
    return 0;
    }
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 4
    Find out the mistake done in below program, and fix it.

    void array-init(int *arr)
    {
    arr = malloc (4*sizeof (int));
    arr[1] = 10;
    arr[0] = 20;

    }

    int main()
    {
    int *p = NULL;
    array-init(p);
    printf("%d", p[0]);
    printf("%d", p[1]);
    return 1;
    }

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

    No Tags on this question yet!

    Question :: 5
    Do you have question for me?

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

    No Tags on this question yet!

Telephonic Round First Round (F-2-F) Second Round (F-2-F) Third Round (F-2-F) Managerial Round (F-2-F)
    Question :: 1
    Introduce you self breifly. About the projects.

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

    No Tags on this question yet!

    Question :: 2
    What type of data structures you have used so for?

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

    No Tags on this question yet!

    Question :: 3
    When you can join us?

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

    No Tags on this question yet!