.
  Vyom World.com . Let's Touch the Sky Together!  
.

Home
VyomWorld.com Home
Interview Questions
VyomLinks.com Home
JobsAssist.com Home
Vyom Network
Contact Us
Jobs & Careers
Resume Submitter
Placement Papers
IT Companies Directory
Computer Jobs
Interview Questions
Online Exams
Vyom Career eMag.
Fun
Send FREE SMS!
SMS Jokes
Source Codes Library
Source Codes Home
ASP Source Codes
C Source Codes
C++ Source Codes
COBOL Source Codes
Java Source Codes
Pascal Source Codes
Submit Source Codes
GATE
GATE an Overview
GATE Preparation
Study Materal
GRE
GRE an Overview
GRE Questions
GRE Preparation
GRE Universities
TOEFL Preparation
TOEFL Resources
GMAT Preparation
GMAT Resources
MBA Preparation
MBA Resources
Networking Concepts
Networking Concepts
Testing Preparation
Testing Resources
Webmasters
Free Traffic Builder
Webmaster Articles
Web Hosting
Tutorials
Hardware Tutorial
1500 Free eBooks New!
Get 30,000 Interview Questions & Answers in an eBook.

Interview Success Kit - Get Success in Job Interviews





Interview Success Kit - Get Success in Job Interviews Interview Success Kit - 30,000 Interview Que. & Ans.
Home » Placement Papers » iNautics Placement Papers » iNautics Placement Paper

New Click here to Download 2024 Latest placement papers of this company New


iNautics Placement Paper


Advertisements
Advertisements

 Sample Test Paper 

   Technical Questions

  1. main()
      {
      char **p=="Hello";
      printf("%s",**p);                                                                                          
       }
    Ans: Garbage or nothing

  2. main()
         {
            printf("%d%c\n");
            printf("%d%c\n");
         }
        Ans: Garbage Value

  3. main()
         {
            int x==5;
            printf("%d%d",x++,++x);
         }
          Ans==6 6

  4.  main()
            {
              int x==4;
              printf("%d",printf(" %d %d ",x,x) );
            }
              Ans: 4 4 5

  5. main()
         {
           union                                                                                                      
            {
          int i;
          char p; 
          struct 
              {
                          int t;
                          char e;
                          char o;
                         }w;
                        };
                    printf("%d\n",sizeof(l) );
              }
            Ans: 4

  6. main()
                 {
                   int i==0,n==6;
                   while(n--0);
                   i+==n;
                   printf("%d\n",i);                                                                                       
                   }
              Ans: -1

  7. ain()
                   {
                     char a[]=="Hello";
                     printf("%c\n",*a++);
                   }
                 Ans: Error

  8. a=3,b=2,c=1; 
               What's the value of k?
                k== a< b < c-1;
                Ans: 0

  9. main()
                   {
                  int a=3;
                    do
                       {
                          printf("%d", a);
                          a=-1;
                         } while(a0);                                                                                    
                       }
                   Ans: 3

  10. It is not "exact" Question; But the given Answers is:
           a) PASS1 PASS2
           b) PASS1 FAIL1
           c)FAIL1 FAIL2
          d)FAIL1 PASS2
             main()
                   {
                    char c==-32;
                    int i==-64;
                    unsigned u==-26;
                     if(ci)
                     printf("PASS1");
                     if( i < c)
                       printf("PASS2");
                      else
                        printf("FAIL1");
                      if(i<U)
                        printf("PASS2");                                                                         
                       else
                          printf("FAIL2");
                     }
                     Ans: PASS1 PASS2 PASS1

  11. main()
        {
           int i==0;
           for( i==0; i<= ;i++)
            {
             switch(i)
               {
                 case 0: i+==5;
                 case 1: i+==2;
                 case 2: i+==5;
                 default: i+==4;
                 break;
                 }
             printf("%d",i);                                                                  
           }
        Ans: 16 21

  12.  main()
      {
         int i==4;
         switch(i)
          {
            case 1:
            printf("HEllo"):
            case default: // "case" should not come with "default"
            printf("****");
          }
       }
      Ans: Error

  13. main()
       {
         int sum==0,count;
         for(count==1;sum+==count)
         printf("%d\t",sum);
       }
     Ans: Error

  14. define cond(a) a=e && a<=0                                                               
         main()
           {
             char s=='R';
             if( cond(s) )
             printf("UPPER CASE");
              else
              printf("LOWER CASE");
           }
      Ans:UPPER CASE

  15. main()
     {
         static int i==5;
          printf("%d\t",i--);
          if( i)
          main();
           }
    Ans: 5 4 3 2 1

  16. main()
     {
      char *a1=="new",*a2=="dictionary",*t;
      swap(a1,a2); 
      printf("(%s%s)",a1,a2);                                                             
      t=�;
      a1=�;
      a2==t;
      printf("-(%s%s)",a1,a2);
       }
     swap( char *s1,char *s2)
          {
         char *temp;
         s1=s2;
         s2=s1;
         temp=s1;
         }
      Ans: (newdictionary)-(dictionarynew)

  17. *p++?
     Ans: increments Address

  18. main()
     {
     int a[]=={ 10,20,30,40,50};
     char*p==(char*)a;
      printf("%d", * ( (int *) p+4);                                                                       
      }
     Ans: 50

  19. one question nothig but calling a function before it has been defined.

 

New Click here to Download 2024 Latest placement papers of this company New




 


.

Recently Updated: New Placement Papers added.
Vyom Network : Web Hosting | Dedicated Server | Free SMS, GRE, GMAT, MBA | Online Exams | Freshers Jobs | Software Downloads | Programming & Source Codes | GRE Preparation | Jobs, Discussions | Software Listing | Free eBooks | Free eBooks | Free Business Info | Interview Questions | Free Tutorials | International Business Information | IAS Preparation | Jokes, Songs, Fun | Free Classifieds | Free Recipes | FAQs | Free Downloads | Bangalore Info | Tech Solutions | Project Outsourcing, Web Hosting | GATE Preparation | MBA Preparation | SAP Info | Excellent Mobiles | Software Testing | Interview Questions | Freshers Jobs | Server Insiders | File Extension Directory

Copyright ©2003-2024 Vyom Technosoft Pvt. Ltd., All Rights Reserved. Read our Privacy Policy