Pages

Tuesday, January 3, 2012

Siemens Information Systems Limited

SIEMENS
INFO


Written Test
The written test consists of 50 questions divided into 6 sections to be completed in 40 minutes.The questions are technical based ,you can expect to be tested on DBMS, C++, C, Unix, Motif, x-windows, ms-windows.The test is a multiple based one and is not tough.The questions can be answered easily in 40 minutes provided you have some knowledge about the subjects.

Interview
The test is followed by a Technical and a HR interview.The technical interview is highly specialised and covers almost all subjects you have done in your curriculum. However one is required to name his/her favorite subject on which most of the interview is focussed.For Computer Engineers C,Operating Systems,DBMS,Microprocessors are mostly focussed upon.Electronics Engineers are grilled upon DCLD,Microprocessors and Communications.

Profile
Siemens Information Systems Limited (SISL) is a subsidiary of Siemens - the foremost electrical and electronics company in India.
Siemens today is the acknowledged leader and the pioneering spirit in areas as diverse as industrial automation, medical engineering, power generation, telecommunications and railway signalling. SISL has the benefit of its links with Siemens Business Services, Europe's undisputed leader in information technology.
The main areas of SISL's expertise lies in offering hardware independent software solutions and high-end consultancy to both Indian and global markets.
SISL has over 900 professionals working on various development projects and product development worldwide, as software specialists and application consultants
The company has its corporate office in Mumbai with branches in Gurgaon,Bangalore,Calcutta,Chennai,Pune.
For more information about this company visit their homesite at www.sislindia.com
   THIS PAPER CONSISTS 6 PARTS.    all are multiple choice q's 
  1)general
  2)c/unix
  3)c++/motif
  4)database
  5)x-windows
   6)ms-windows

  We have written q's not acc. to each part.total 50. q's. time is
sufficient. If u have basic idea about all of the u can easily answer the paper.

  paper

 1)which of following operator can't be overloaded.
 a)== b)++ c)?! d)<=
 2)#include<iostream.h
   main()
 {
 printf("Hello World");
 }
 the program prints Hello World without changing main() the o/p should
 be
  intialisation
  Hello World
  Desruct
  the changes should be
 a)iostream operator<<(iostream os, char*s)
 os<<'intialisation'<<(Hello World)<<Destruct
 b)  c)   d)none of the above
 3)CDPATH shell variable is in(c-shell)
 a) b) c) d)
 4) term stickily bit is related to  a)kernel
 b)undeletable file
 c)  d)none
 5)semaphore variable is different from ordinary variable by
 6)swap(int x,y)
 {
 int temp;
 temp=x;
 x=y;
 y=temp;
 }
 main()
 {
 int x=2;y=3;
 swap(x,y);
 }
 after calling swap ,what are yhe values x&y?
 7) static variable will be visible in
 a)fn. in which they are defined
 b)module "   "    "        "
 c)all the program
 d)none
 8)unix system is
 a)multi processing
 b)multi processing ,multiuser
 c)multi processing ,multiuser,multitasking
 d)multiuser,multitasking
 9)x.25 protocol encapsulates the follwing layers
 a)network
 b)datalink
 c)physical
 d)all of the above
 e)none of the above
 10)TCP/IP can work on
 a)ethernet
 b)tokenring
 c)a&b
 d)none
 11)a node has the ip address 138.50.10.7 and 138.50.10.9.But it is
 transmitting data from node1 to node2only. The reason may be
 a)a node cannot have more than one address
 b)class A should have second octet different
 c)classB   "      "    "       "        "
 d)a,b,c
 12) the OSI layer from bottom to top
 13)for an application which exceeds 64k the memory model should be
 a)medium
 b)huge
 c)large
 d)none
 14)the condition required for dead lock in unix sustem is
 15)set-user-id is related to (in unix)
 16) bourne shell has
 a)history record
 b)
 c)
 d)
 17)wrong statement about c++
 a)code removably
 b)encapsulation of data and code
 c)program easy maintenance
 d)program runs faster
 18)struct base {int a,b;
 base();
 int virtual function1();
 }
 struct derv1:base{
 int b,c,d;
 derv1()
 int virtual function1();
 }
 struct derv2 : base
  {int a,e;
 }
 base::base()
 {
 a=2;b=3;
 }
 derv1::derv1(){
 b=5;
 c=10;d=11;}
 base::function1()
 {return(100);
 }
 derv1::function1()
 {
 return(200);
 }
 main()
 base ba;
 derv1 d1,d2;
 printf("%d %d",d1.a,d1.b)
 o/p is
 a)a=2;b=3;
 b)a=3; b=2;
 c)a=5; b=10;
 d)none
 19) for the above program answer the following q's
 main()
 base da;
 derv1 d1;
 derv2 d2;
 printf("%d %d %d",da.function1(),d1.function1(),d2.function1());
 o/p is
 a)100,200,200;
 b)200,100,200;
 c)200,200,100;
 d)none
 20)struct {
 int x;
 int y;
 }abc;
 you can not access x by the following
 1)abc--x;
 2)abc[0]--x;
 abc.x;
 (abc)--x;
 a)1,2,3
 b)2&3
 c)1&2
 d)1,3,4
 21) automatic variables are destroyed after fn. ends because
 a)stored in swap
 b)stored in stack and poped out after fn. returns
 c)stored in data area
 d)stored in disk
 22) relation between x-application and x-server  (x-win)
 23)UIL(user interface language)   (x-win)
 24)which is right in ms-windows
 a)application has single qvalue system has multiple qvalue
 b) "                multiple "       "      single     "
 c)"      "            "                     multiple   "
 d)none
 25)widget in x-windows is
 26)gadget in x_windows is
 27)variable DESTDIR in make program is accessed as
 a)$(DESTDIR)
 b)${DESTDIR}
 c)DESTDIR
 d)DESTDIR
 28)the keystroke mouse entrie are interpreted in ms windows as
 a)interrupt
 b)message
 c)event
 d)none of the above
 29)link between program and out side world (ms -win)
 a)device driver and hardware disk
 b)application and device driver
 c)application and hardware device
 d)none
 30)ms -windows is
 a)multitasking
 b)   c)   d)
 31)dynimic scoping is
 32) after logout the process still runs in the background by giving
 the command
 a)nohop
 b)
 33)process dies out but still waita
 a)exit
 b)wakeup
 c)zombie
 d)steep
 34)in dynamic memory allocation we use
 a)doubly linked list
 b)circularly linked
 c)B trees
 d)L trees
 e)none
 35)to find the key of search the data structure is
 a)hask key
 b)trees
 c)linked lists
 d)records
 36)data base
  --------------------------               
 --------------------------------
 employ_code       salary                    employ_code          leave
 ---------------------------              
 ----------------------------------
                                                           from       to
                                      
 --------------------------------------
 1236             1500                         1238        ---       ---
 1237             2000                         1238        ---       ---
 1238             2500                         1237        ---    
 -----
                                                      1237         ---         ---
                                                      1237        ---       ---
                                                      1237         ---        ---
 --------------------------                --------------------------------------
  select employ_code,employ_data ,leave
 the number of rows in the o/p
 a)18
 b)6
 c)7
 d)3
 37)DBMS
 38)read about SQL,db
 39)which is true
 a)bridge connects dissimiler LANand protocol insensitive
 b)router "       "             "           "       "
 c)gateway "        "           "             "      "
 d)none of the above
 40)read types of tree traversals.
41)42)43)  simple programs on pointers in c

 111101101000100010000011101101111
1. Which of following operator can't be overloaded.
a) ==
b) ++
c) ?!
d) <=

2. For the following C program
#include<iostream.h>
main()
{printf("Hello World");}
The program prints Hello World without changing main() ,the output should
be
intialisation
Hello World
Desruct
The changes should be
a) IOstream operator<<(iostream os, char*s)
     os<<'intialisation'<<(Hello World)<<Destruct
b)
c)
d) none of the above

3. CDPATH shell variable is in(c-shell)

4. The term stickily bit is related to
a) Kernel
b) Undeletable file
c) Both (a) and (b)
d) None

5. Semaphore variable is different from ordinary variable by

6. For the following C program:
swap(int x,y)
{ int temp;
temp=x;
x=y;
y=temp;}
main()
{int x=2;y=3;
swap(x,y);}
After calling swap, what are the values x & y?

7. Static variable will be visible in
a) Function. in which they are defined
b) Module in which they are defined
c) All the program
d) None

8. Unix system is
a) Multi processing
b) Multi processing, multiuser
c) Multi processing, multiuser, multitasking
d) Multiuser, multitasking

9. X.25 protocol encapsulates the follwing layers
a) Network
b) Datalink
c) Physical
d) All of the above
e) None of the above

10. TCP/IP can work on
a) Ethernet
b) Tokenring
c) (a) & (b)
d) None

11. A node has the IP address 138.50.10.7 and 138.50.10.9.
      But it is transmitting data from node1 to node 2only.
      The reason may be
a) A node cannot have more than one address
b) class A should have second octet different
c) class B should have second octed different
d) All of the above

12. The OSI layer from bottom to top

13. For an application which exceeds 64k the memory model should be
a) Medium
b) Huge
c) Large
d) None

14. The condition required for dead lock in unix system is

15. Set-user-id is related to (in unix)

16. Bourne shell has
a) History record****other choices not given

17. Which of the following is not true about C++
a) Code removably
b) Encapsulation of data and code
c) Program easy maintenance
d) Program runs faster

18. For the following C program
struct base {int a,b;
base();
int virtual function1();}
struct derv1:base
{int b,c,d;
derv1()
int virtual function1();}
struct derv2 : base
{int a,e;
}
base::base()
{a=2;b=3;
}
derv1::derv1()
{b=5;
c=10;d=11;}
base::function1()
{return(100);
}
derv1::function1()
{
return(200);
}
main()
base ba;
derv1 d1,d2;
printf("%d %d",d1.a,d1.b)
Output of the program is:
a) a=2;b=3;
b) a=3; b=2;
c) a=5; b=10;
d) none

19. For the above program answer the following q's
main()
base da;
derv1 d1;
derv2 d2;
printf("%d %d %d",da.function1(),d1.function1(),d2.function1());
Output is:
a) 100,200,200;
b) 200,100,200;
c) 200,200,100;
d) None of the above

20. For the following C program
struct {
int x;
int y;
}abc;
x cannot be accessed by the following
1)abc-->x;
2)abc[0]-->x;
3)abc.x;
4)(abc)-->x;
a )1, 2, 3
b) 2 & 3
c) 1 & 2
d) 1, 3, 4


21. Automatic variables are destroyed after fn. ends because
a) Stored in swap
b) Stored in stack and poped out after fn. returns
c) Stored in data area
d) Stored in disk

22. Relation between x-application and x-server (x-win)

23. What is UIL(user interface language) (x-win)

24)Which of the following is right in ms-windows
a) Application has single qvalue system has multiple qvalue
b) Application has multiple qvalue system has single qvalue
c) Application has multipleqvalue system has multiple qvalue
d) None

25. Widget in x-windows is

26. Gadget in x_windows is

27. Variable DESTDIR in make program is accessed as
a) $(DESTDIR)
b) ${DESTDIR}
c) DESTDIR

28. The keystroke mouse entrie are interpreted in ms windows as
a) Interrupt
b) Message
c) Event
d) None of the above

29. Link between program and outside world (ms -win)
a) Device driver and hardware disk
b) Application and device driver
c) Application and hardware device
d) None

30. Ms -windows is
a)multitasking
b)multiuser
c) bothof the above
d) none of the above

31. Dynamic scoping is

32. After logout the process still runs in the background by giving the command

33. Which process dies out but still waits
a) Exit
b) Wakeup
c) Zombie
d) Sleep

34. In dynamic memory allocation we use
a) Doubly linked list
b) Circularly linked
c) B trees
d) L trees
e) None


35. To find the key of search the data structure is
a) Hash key
b) Trees
c) Linked lists
d) Records


36. Which of the following is true
a) Bridge connects dissimiler LANand protocol insensitive
b) Router connects dissimiler LANand protocol insensitive
c) Gateway connects dissimiler LANand protocol insensitive
d) None of the above

37. Read types of tree traversals.

38. Read about SQL/Databases

39.A DBMS table is given along with simple SQL statements. Find the output.

40. Simple programs on pointers in c


No comments:

Receive All Free Updates Via Facebook.