Hellosoft  placement papers  



Sample Question Paper

Hellosoft technical questions


What is diners phylosophers algorithm. 
What is atomicity.Explain 
Give an example of source- level debugger in unix/linx. 
What is Pre-emptive multitasking. 
Do not remember this one. 

Hellosoft datastructures questions


DataStructures: (ONly 5 Questions)


Where will the parameters be stored when a function is 
called in a program. 
What is recursion?What are its disadvantages. 
Which one is the best and efficient sort? 


Networking questions :(Only 5 Questions)

ASN.1 belongs to which layer. 
Give an example of popular Transport Layer Protocol 
What is the netmask of Class B IP address? 
 Explain CSMA/CD. 
Given a size from 0-7 what would be the least window size. 



C Language  questions (Total 13 Questions)


main() 
{
  printf("%d",printf("HelloSoft"));
} Output? 
case 1: case 2:
      typedef Struct { typedef Struct {
                 int a; char p;
                 char b; int q;
                 int d; char k;
                 char e; int l;
                  }A; }A;
     Assuming 'packing' is not enabled, which case will 
give an error of Sizeof(A) less. 
 main()
  {
   int i=3;
   printf("%d %d %d",i++,i,++i);
    } 
main() 
    { 
      int i=10;
      int j,k=5;
      int a[10];
      for(j=0;j<10;j++)
      a[j]=(i+k)+(i*k);
    }
 Optimize the above code. 
Write In Order Tree Traversal Pseudo-code. 
 main()
    {
   int *p=0x100;
   int *q=0x100;
   int k=p*q;
   printf("%x\n",k);
   } Output ? 
Char* foo(Str...) {
     char str[4];
     strcpy(str,"HelloSoft");
     return str;
      } Output? 
int a[10][20][30][40];
       int *p
        How to access an element of a using p? 
main()
   {
      int i=10;
      if(i>20)
      if(i==10)
         print("Hi");
       else
          printf("Bye");
     } Output ? 
main()
   {
    float f;
    int i;
    //something like this   not remember these 4 
questionsexactly
    f=(float *)malloc(sizeof((float *)*4));
   }
          




  
Hellosoft  placement papers

thank you... very much .. if possible upload some more
papers.. thank u again