.
  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!


Home » Placement Papers » Alumnus Placement Papers » AlumnusPlacement Paper 1

 

Alumnus Placement Paper 1


Advertisements
Advertisements




Sample Test paper

1.  Find the locus of the point whose sum of distance from 2 fixed points is constant.
2.  [-infinity to +infinity]integration(exp(-x*x))
3.  The product of any 3 consecutive nos is always divisible by _ ? options[12/6/10/24]
4   int i=0,j=50
     while (i<j)
            {
             if(<some condtn>)
               {                                                                                           
                 <body of the loop>
                 i++
              }
            elseif(<some condtn>)
             {   <body of the loop>
                  j--
              } 
          else(<some condtn>)
           {<body of the loop>
             j--
           }
          }

      How many times the body of the loopis going to be executed?
      options[unknown/25/50/depends on the given condtn]

5   How can you include a library code written in C++ in a source code written in C?
       (Options are there)
       Ans. Some cross-linked platform(compiler) is required for this.


6    int a[20],i
      for(i=0;i<20;i++)
         {
          a[i]=i;
         }                                                                                            
         for(i=0;i<20;i++)
          {
            a[i]=a[20-i]
         }
        What is the final content of the program.

7     Which data structure should be used for searching an element in an array in constant time in case of 
        average case?    Ans. Hash table(not sure)

8     One question on ISO OSI model.easy one(not remembered)                     
 9     Another question abt. a protocol Ans. Token/Ring
10    If we want to connect two systems to form a network which leyer(OSI) is of most interest to us?
        Ans. Physical layer.

 







 


.

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