HP  Placement Paper   Technical - Other   -07 May 2005

HP  Placement Paper   Technical - Other   -07 May 2005


  • Posted by  FreshersWorld 
    7 Jan, 2012

    HP paper pattern:

    The paper is of 3 sections.

    computer concepts -40
    aptitude -20
    c -20
    note that for c , we must follow compiler under unix

    computer concepts: os,unix,networks,data structures,computer organization, digital logic design

    operating systems:

    1)which of the following is not associated with operting systems
    a)swapper b)device drivers c)file system d)process mgmt

    2)what is the size of virtual memory that must be associated
    a)must be same as physical memory b)must be > physical memory
    c)can be of any size d)it must be small enough to allocate process

    3)which of following is true
    a)time sharing is also multi progrmming
    b) multi progrmmming is also time sharing

    4)global variables are stored at
    a)heap b)stack c)data d)code

    computer organization:

    1)32 registers are there.an instructuion can hold upto 3 registers . the opcode is of 4 bits.
    what is minimum size of instruction.
    ans:the minimum sizeof instruction has nothing to do with number of registers

    2) some bit on pipelineling

    3)some bit related to SIMD,MIMD,MISD,SISID

    4)minimum no of nand gates require to implement xor gate
    ans : 4 gates(check out)

    unix:

    1)two way communication is possible by means of means of which of the following
    ann:unix_socket

    2)wc -l x>x prints out
    ans:wc command prints 0

    3)the background process that continusly run
    ans:deamon process

    networks:

    1)fragmented packet is reunited at
    a)destination b)at next gateway c)at highest MTU gateway d)at the next router

    2)the following address 93.58.5.0
    a)class A b) class B c) class C d)class D

    3)network to host protocal is

    ans:RARP

    data structres:

    1)given a doubly linked list .you are given with a node n and a pointer p associated with it. what are the operarions that to be performed to delete that node.


    2)swapping the elements of left child of a tree with that of right child .

    revswap(node*)
    {
    node* tree;
    if(tree!=null)
    swap(tree->left,tree->right)
    revswap(tree->left);
    revswap(tree->right);
    }
    if given tree is
    1
    2 3
    4 5 6 7

    what is the output for about function applied

    ans:
    1
    3 2
    7 6 5 4

     

    3)t(n)=4+t(n/2) ,t(0)=1. what is the complexity


    4)in hashing each element can be found with complexity of
    ans: 1

    5)In a program all the addresses that are to be binded to the caller function are done by
    a)compiler b) linker c) loader d) run time allocator


    6) s->v[integer]
    interger->interger,integer/termial

    ans: a[2,3,5]

     

    7)char 1 byte , short of 2 bytes , integer of 4 byte,

    stuct
    {
    char a;
    char b;
    int a[2];
    short d;
    int e;
    char i;
    } name;
    sizeof(naame) ans:16
    note: consider c compiler unde unix for all c questions

    c:
    ---------

    1)main()
    {

    int i=1;
    swith(i)
    {
    i++;
    case 1: printf("case1");
    break;
    case 2: printf("case 2");
    break;
    default: printf("default");
    }

    ans: when we compile we get warning that unreachable code and if we execute we get "case 1"
    will be printed.

    2)questions related to funtcital pointers
    3)some question on const char*p , char* const p;

     

     

2009-2016 downloadmela.com. All rights reserved.