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

 

Siemens Placement Paper -: Data Structures Questions With Answers


Advertisements
Advertisements




Siemens Previous Years Solved Sample Placement Papers

  1. Static member functions can access "this" pointer:
    1. true
    2. false
    3. compiler dependent
    4. none
  2.             Main() {
                    char arr[12];
                    printf("%d", sizeof(arr));
                }
                
    1. 24
    2. 12
    3. 36
    4. 2
  3.             char *p;
                short i;
                long l;
                (long)i = l;
                
    1. both 1 & 2 are correct
    2. both 1 & 2 are incorrect
    3. Statement 1 is correct
    4. Statement 2 is correct
  4.             Main() {
                    int I;
                    I = 010;
                    printf("%d", I);
                }
                
    1. 2
    2. 8
    3. 10
    4. 4
  5.             Main() {
                    const int val = 5;
                    const int *ptrval;
                    ptrval = &val;
                    *ptrval = 10;
                    printf("%d", val);
                }
                
    1. 5
    2. 10
    3. Garbage
    4. Error
  6. What will print out?
                main() { 
                    char *p1 = "name"; 
                    char *p2;
                    p2 = (char*)malloc(20);
                    memset(p2, 0, 20);
                    while(*p2++ = *p1++);
                    printf("%s\n", p2);
                }
                
    Answer: empty string.
  7. Which of the following operators can't be overloaded:
    1. ==
    2. ++
    3. !
    4. <=
  8. Semaphore variable is different from an ordinary variable by: Mutual exclusion and signaling mechanism.
  9. After calling swap, what are the values of x & y?
                swap(int x, y) {
                    int temp;
                    temp = x;
                    x = y;
                    y = temp;
                }
                main() {
                    int x = 2, y = 3;
                    swap(x, y);
                }
                
    Answer: x = 2, y = 3 (no change due to call by value).
  10. Static variable will be visible in:
    1. function in which they are defined
    2. module in which they are defined
    3. all the program
    4. none
  11. Unix system is:
    1. multi-processing
    2. multi-processing, multi-user
    3. multi-processing, multi-user, multitasking
    4. multi-user, multitasking
  12. TCP/IP can work on:
    1. ethernet
    2. token ring
    3. a & b
    4. none
  13. Automatic variables are destroyed after function ends because:
    1. Stored in swap
    2. Stored in stack and popped out after function returns
    3. Stored in data area
    4. Stored in disk

OS Questions

  1. A page fault occurs when:
    1. system crashes due to lack of memory
    2. page referred belongs to a different program
    3. request for the page currently made is not in memory
    4. 1 & 2
  2. The basic criteria of selecting a page replacement algorithm for virtual memory management is:
    1. low page fault rate
    2. high page fault rate
    3. high page modification rate
    4. low page size
  3. Which of the following is not a scheduling algorithm:
    1. FCFS scheduling
    2. SJF scheduling
    3. Priority based scheduling
    4. Shortest fit scheduling
  4. Which of the following statements is true on demand paging:
    1. used to increase speed of memory access
    2. causes external fragmentation
    3. technique to manage existing main memory efficiently
    4. allows variable sized segments
  5. A multiprocessor system is:
    1. loosely coupled system
    2. tightly coupled system
    3. distributed system
    4. none
  6. What is mutex:
    1. binary semaphore
    2. multitasking facility
    3. bit addressable memory
    4. register




 


.

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-2025 Vyom Technosoft Pvt. Ltd., All Rights Reserved. Read our Privacy Policy