.
  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 » PATNI Placement Papers » PATNI Previous Year Placement Paper

 

PATNI Placement Paper -: Data Structure & Programming Questions With Answers


Advertisements
Advertisements




PATNI Previous Years Solved Sample Placement Papers

  1. At a certain moment, a watch shows 2 min lag although it is fast. If it showed a 3 min lag at that moment, but gained 1/2 min more a day than it does, it would show the true time one day sooner than it usually does. How many mins does the watch gain per day?

    A: 2

    B: 5

    C: 6

    D: 4

    E: 75

    Ans: E
  2. An Enterprise Resource Planning application is an example of a(n) ________.

    A: Single-user database application

    B: Multiuser database application

    C: E-commerce database application

    D: Data mining database application

    Ans: B
  3. Which type of entity represents a logical generalization whose actual occurrence is represented by a second, associated entity?

    A: Supertype entity

    B: Subtype entity

    C: Archetype entity

    D: Instance entity

    Ans: C
  4. What is an advantage of placing computations in SQL views?

    A: To save users from having to write an expression.

    B: To ensure that the results are consistent.

    C: To accomplish both of the above.

    D: None of the above is correct - computations cannot be placed in a view.

    Ans: C
  5. You have two jars, one jar which has 10 rings and the other has none. They are placed one above the other. You want to remove the last ring in the jar. And the second jar is weak and cannot be used to store rings for a long time.

    A) Empty the first jar by removing it one by one from the first jar and placing it into the second jar

    B) Empty the first jar by removing it one by one from the first jar and placing it into the second jar and empty the second jar by placing all the rings into the first jar one by one (Ans)

    C) There exists no possible way to do this

    D) Break the jar and remove the last one

  6. What will be the output of the program in 16-bit platform (Turbo C under DOS)?

    #include
    int main()
    {
        printf(“%d, %d, %d”, sizeof(3.0f), sizeof(‘3’), sizeof(3.0));
        return 0;
    }
        

    A. 8, 1, 4

    B. 4, 2, 8

    C. 4, 2, 4

    D. 10, 3, 4

    Ans: B
  7. Point out the error in the program?

    #include
    int main()
    {
        struct emp
        {
            char name[20];
            float sal;
        };
        struct emp e[10];
        int i;
        for(i=0; i<=9; i++)
            scanf(“%s %f”, e[i].name, &e[i].sal);
        return 0;
    }
        

    A. Error: invalid structure member

    B. Error: Floating point formats not linked

    C. No error

    D. None of above

    Ans: B
  8. What will be the output of the program?

    #include
    int main()
    {
        enum days {MON=-1, TUE, WED=6, THU, FRI, SAT};
        printf("%d, %d, %d, %d, %d, %d\n", MON, TUE, WED, THU, FRI, SAT);
        return 0;
    }
        

    A. -1, 0, 1, 2, 3, 4

    B. -1, 2, 6, 3, 4, 5

    C. -1, 0, 6, 2, 3, 4

    D. -1, 0, 6, 7, 8, 9

    Ans: D
  9. What will be the output of the program?

    #include
    struct course
    {
        int courseno;
        char coursename[25];
    };
    int main()
    {
        struct course c[] = { {102, “Java”},
                              {103, “PHP”},
                              {104, “DotNet”} };
        printf(“%d”, c[1].courseno);
        printf(“%s\n”, (*(c+2)).coursename);
        return 0;
    }
        

    A. 103 Dotnet

    B. 102 Java

    C. 103 PHP

    D. 104 DotNet

    Ans: A
  10. In which stage the following code gets replaced by the contents of the file stdio.h?

    #include

    A. During editing

    B. During linking

    C. During execution

    D. During preprocessing

    Ans: D
  11. Point out the error in the program

    #include
    int main()
    {
        int I;
        #if A
            printf(“Enter any number:”);
            scanf(“%d”, &i);
        #elif B
            printf(“The number is odd”);
        #endif
        return 0;
    }
        

    A. Error: unexpected end of file because there is no matching #endif

    B. The number is odd

    C. Garbage values

    D. None of above

    Ans: A




 


.

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