Ans. 3 hours 20 minutes.   TECHNICAL SECTION   Q1. typedef struct{
                             char *;
                             nodeptr next;
                             } * nodeptr ;

    What does nodeptr stand for?   Q2.   What does. int *x[](); means ?   Q3.     struct list{
                          int x;
                          struct list *next;
                          }*head;
        the struct head.x =100
        Is the above assignment to pointer is correct or wrong ? Ans. Wrong


Q4.What is the output of the following  ?
        int i;
        i=1;
        i=i+2*i++;
        printf(%d,i); Ans.  4
Q5.      FILE *fp1,*fp2;
            fp1=fopen("one","w")
            fp2=fopen("one","w")
            fputc('A',fp1)
            fputc('B',fp2)
            fclose(fp1)
            fclose(fp2)}
a.error b. c. d. Ans. no error. But It will over writes on same file.
 What are  the output(s) for the following  ?
Q6.    #include<malloc.h>
         char *f()
         {char *s=malloc(8);
         strcpy(s,"goodbye")}
         main()
                    {
                        char *f();
                        printf("%c",*f()='A');
                     }   Q7.     #define MAN(x,y) (x)>(y)?(x):(y)
                    {
                       inti=10;j=5;k=0;
                        k= MAX(i++,++j)
                        printf(%d %d %d %d,i,j,k)
                    } Ans. 10 5 0   Q8.    a=10;b= 5;c=3;d=3;
           if(a<b)&&(c=d++)
           printf(%d %d %d %d a,b,c,d)
           else printf("%d %d %d %d a,b,c,d);   Q9.          #include<stdarg.h>    
                show(int t,va_list ptr1)
                        {    
                            int a,x,i;
                            a=va_arg(ptr1,int)
                            printf("\n %d",a)
                        }
                display(char) 
                       { 
                            int x;
                            listptr;
                            va_star(otr,s);
                            n=va_arg(ptr,int);
                            show(x,ptr);
                        }
               main()
                       {
                            display("hello",4,12,13,14,44);
                       }   Q10.    main()
                   {
                    printf("hello");
                    fork();
                    }       Q11.        main()
                    {
                      int i = 10;
                      printf(" %d %d %d \n", ++i, i++, ++i);
                    }   Q12.      #include<stdio.h>
              main()
                    {
                      int *p, *c, i;
                      i = 5;
                      p = (int*) (malloc(sizeof(i)));
                      printf("\n%d",*p);
                      *p = 10;
                      printf("\n%d %d",i,*p);
                      c = (int*) calloc(2);
                      printf("\n%d\n",*c);
                    }   Q13.     #define MAX(x,y) (x) >(y)?(x):(y)
            main()
                {
                   inti=10,j=5,k=0;
                    k= MAX(i++,++j); 
                    printf("%d..%d..%d",i,j,k);
                }   Q14.        #include <stdio.h>
                main()
                    {
                        enum _tag{ left=10, right, front=100, back};
                        printf("left is %d, right is %d, front is %d, back is %d",left,right,front,back);
                    }   Q15.     main()
                {
                    inta=10,b=20;<BR>                   a>=5?b=100:b=200;
                    printf("%d\n",b);
                }    Q16.    #define PRINT(int) printf("int = %d ",int)
            main()
                {< BR>                    intx,y,z;<BR>                   x=03;y=02;z=01;
                    PRINT(x^x);
                    z<<=3;PRINT(x);
                    y>>=3;PRINT(y);
                }   Q17.    #include<stdio.h>
            main()
                {
                    char s[] = "Bouquets and Brickbats";
                    printf("\n%c, ",*(&s[2]));
                    printf("%s, ",s+5); 
                    printf("\n%s",s);
                    printf("\n%c",*(s+2));
                }   Q18.    main()
             {
                 struct s1
                      {
                        char *str;
                         struct s1 *ptr;
                       };
                static struct s1 arr[] = { {"Hyderabad",arr+1},
                {"Bangalore",arr+2},
                {"Delhi",arr}
                };
            struct s1 *p[3];
            int i; < BR>           for(i=0;i<=2;i++)
            p[i] = arr[i].ptr;

            printf("%s\n",(*p)->str);
            printf("%s\n",(++*p)->str);
            printf("%s\n",((*p)++)->str);
            }   Q19. .main()
            {
                char *p = "hello world!";
                p[0] = 'H'; 
                printf("%s",p);
             } Interview Section
 
1)minimum #of ip addresses requiered for an router ans)2 2)the worst case booth complexity for ans)101010101010101010 3)disadvantage of pcm ans)forgot 4)two binary 8bits are added overflow will come for a)ones complement b)twos complement c)ones complement with signed magnitude c)twos complement with signed magnitude 5)two 8 bit nuos are multiplied and the result is stored in an rom the size of the rom is ans)64*64 doubt 6)how many no of 4x1 muxs are required for making an 16x1 mux ans)5 7)a simple nand gate problem ans)simple 8)the shannon hartley therom give the ans)channel capacity with no error 9)the bandwidth for 500bps is ans)1000bps   doubt 10)a problem with lower triangular matrix ans)x[i]=b[i]-a[i][j]*x[i] 11)a c program with if x>y x=x-y else y=y-x ans)gcd 12)microwave propogation along the curvature of earth is called ans)ductpropogation 13)a simple bit on recurssion   14)csma/cd is used in ans)ethernet 15)what is used for knowing its own ip address ans)rarp 16)no signalling is needded to establish connection in ans ) ip 17)a simple problem, on newton rapshon method 18)(A-B)U(B-A)U(AnB)= ANS)AUB 19) if a number is choosen between 100 and 999 includeing these numberrs what is the provbabilty that the number selected does not contain a 7 is ans)workitout 20)a packet trabvelling in the internet forever can be controlled by having the field ans)time to live (ttl) 21)c code with the follwing choices a)call with value b)call with address c)call with value result ans)call with value result 22) when the following sequence is inserted in the binary search tree no of nodes int left subtree and right sub tree is ans )7,4 23)simple problem in recurssion x(x(5)) ans)17 24)study about reentrant code reusable code recursive code 25)given edges nodes and components of a graph find out its rank 26)in a tree a parent is greater than all its children in folling ans)heap 27)question on pcm signal=3khz 8levels are used ans)18000bps 28)to get the numberr in ascending order the traversal used is ans)inorder traversal 29)a problem in multiprocessing ,multithreading ,multiprogramming ans)multithreading     This paper comprises of an Aptitude test and C-language test   Aptitude-20 questions (2 marks each)   C-language - 20 questions(3 marks each)