Provided by www.YuvaJobs.com - Globaledge   Paper    General - other        - 1  April  2005  


GLOBAL EDGE  Placement Question Paper 4 2005
1. Where is the MBR stored?1. maintained by OS2. MBR is in Boot.3 MBR is in First sector of HDD4. None of the above.2. Where is the partition table stored?1. BIOS2. CMOS Setup3. MBR4. stored per partition.3. Where is the boot record stored?1. BIOS2. CMOS Setup3. MBR4. stored per partition.4. How many primary partitons can be created?1. 12. 23. 34. 4ans : 4.
5. What is the difference between primary & extended partion?1. Both are same2. Primary and extended are in logical partion3. primary cannot be subdivided but extended can be.4. extended cannot be subdivided but primary can be.ans 3.
6. Can we create 2 primary dos partions?a)Yes b)No c)Depends on the hard Disk. d)None of the above.Ans: Yes7. Can we create 2 extended partitions ?
a)Yes b)No c)Depends on the hard Disk. d)None of the above.Ans: No.
8. How many partitions can be created on a given harddisk?a) Depends on the size of Disk. b) 24 c)4 d)26
 
9. Can we hide a partition?a) Yes b) No c) Depends on the Hard Disk d) None.ans: Yes.
 
10. Sliding window protocol lies in which layer?1. Transport Layer 2. network Layer 3. Datalink layer 4. Application Layer
Ans : 3. DAtalink layer
11. Which is the highest priority interrupt .1. rst5.52. rst6.53. TRAP4. HLD
12. 8085 is1. 16-bit 2. 8-bit 3. 32-bit 4. 20-bit Microprocessor
Ans : 2. 8 bit
13. protected mode is present in which Processor1. 8085 2. 8086 3. 80386 4.8087
14. The no. of address lines required to address 4k of memorya)11 b)12 c) 14 d) 16Ans: b
15) Where is CMOS setup storeda) Hard Disk b) BIOS c)CMOS  RAM d) MBR.
Ans : CMOS Ram
1) main(){int a;char *p;a = sizeof(int) * p;printf("%d\n",a);}a)compile errorb)run time errorc)4d) Compiler dependentans:a2)#define SIZE sizeof(int)main(){ int i=-1;if( i < SIZE )printf("True\n");elseprintf("False\n");}a) Trueb) Falsec) can,t predictd) None of theseans:b (?)
3) int (*fun())[]a) function returning a pointer to an arrayb) function returning an array of pointersc) pointer to a funtion which takes array as asrumentd) Compiler errorans: a4) main(){int a=8,d;int *p;p=&a;d=a/*p;print("%d\n",d);}a) 1b) 0c) compiler errord) run time errorans: c5)main(){char *a="Hello";*a++ = ,h,;printf("%s\n",a);}a) hellob) elloc) runtime errord) compiler errorans:b6) main(){char p[]="Hello";p[0]=,h,;printf("%s\n", p);}a) hellob) Helloc) compiler errord) run time errorans:a7)#define mysizeof(a) (&a+1) - &amain(float d;printf("%d\n", mysizeof(d) );}note: assume sizeof float is 8 bytesa) 8b) 4c) 1d) compiler errorans:c main(){ int *p=10;printf("%d\n",*p);}a) 10b) run time errorc) compiler errord) 5ans:b (?)
9)main(){int i=-1;i<<=2;printf("%d\n",i);}a) -1b) -2c) -4d) 0ans:c10) main(){int i= 0xffffffff;printf("%d\n",i);}note: size of int is 4 bytesa) -1b) 65635c) 100d) errorans:a
 
 
C questions
1>int A=1,B=2;if(A==B < printf("Hello "))printf("world\n");elseprintf("Bangalore\n");
What is the o/p?
a> world b> Hello bangalore c> bangalore d> Hello world.
ans > d> Hello world.
2>
main(){int i;for(i=0; i< 10; i++){int j=10;j++;printf("j= %d\n", j);}}
what is o/p ?
a> 10 to 19 b> error j undeclared c> 10 times 11 d> 10 - 18
ans> c> 10 times 11.
3>union test{int a;union test *p;};main(){union test q;printf(" a= %d\n ", q.a);}what is o/p?
a> 0 b> syntax error c> garbage value d>run time error
ans > c
4>
register int a,b;main(){for(a=0 ; a<5 ; a++)b++;}
a> 5 b> 4 c> 0 d> error
ans > d
5> # define dprint(expr) printf(" expr= %d \n ", expr)
main(){
int i=10,j=2;
dprint(i / j) ;}
a> 5 b > expr= 5 c> i / j= 5 d> error.
ans > b.
 
Operating system concepts
1> Virtual memory is
a> Infinite, user is not constrained while writing program.b> Finite it is limited by main memory + swap memory.c> Infinite ,Yes As the process needs memory it is allocated by demand paging.d> Finite ,It is limited by machines addressing capacity.
ans> d
2> Find the correct sentence
a> UNIX is monolithic MS-DOS is Microkernelb> UNIX & MS-DOS are both monolithic.c> UNIX & MS-DOS are both Microkernel.d> All are wrong.ans> b
3> In which OSI layer packet sequencing is checked
a> Physical layerb> Data link layerc> Network layerd> Transport layer
ans> d
4> In General purpose OS user cannot change which state of process.
a> premptionb> sleepc> creationd> ready
ans> a
5> Which addressing scheme is not common for 8085 & 8086
a> Register addressingb> Indexed addressingc> Register Indirect addressingd> Direct addressing.
Ans: b
 
June-2004
C What is the output of the following :1. main(){int *p ;p=(int *)malloc(-10);}
a) allocates 0 bytesb) allocates memory, if availablec) compilation errord) Runtime error
Ans) b
2. main(){for( printf("a") ; printf("b") ; printf("c") ) ;}
a) abcb) abc abc abc .....(infinite times)c) a bc bc bc ....(infinite times)d) Error
Ans) c
3. main(){int i= 10 * fun() ;printf("%d",i);}
fun(){return 10 ;}
a) 0b) 10c) 100d) Error
Ans) c
4.int i= 10 * fun() ;main(){printf("%d",i) ;}
fun(){return 10 ;}
a) 0b) 10c) 100d) Error
Ans) d
5. Assume size of int to be 2 bytes :
main(){int i = 100 ;printf("%d ", sizeof(i++));printf("%d ",i) ;}
a) 2 100b) 2 101c) 100 101d) 101 100
Ans) a
Computer Fundamentals :
1. Which one of the following always resides in the memory ?
a) Linkerb) Loaderc) Compilerd) All of the Above
Ans) b
2. Which of these is not a layer in OSI model ?
a) Application layerb) Network Layerc) Internet Layerd) Data Link Layer
Ans) c
3. Which one of the following data structures is best suited for searching ?
a) Arraysb) Singly Linked Listc) Doubly Linked Listd) Hash Table
Ans) d
4. Which of the following data structures is best suited for Deletion ?
a) Arraysb) Singly Linked Listc) Doubly Linked Listd) Hash Table
Ans) c
5.Which one of these is not a scheduling technique in Operating System?
a) Last-Come-First-Serve Schedulingb) First-Come-First-Serve Schedulingc) Preemptive Schedulingd) Round Robin Scheduling
Ans) a
 
6. Demand Paging is
a) All the pages of a process is loaded at the startb) When a single page is demanded then all other pages are also loadedc) When a page is required then only it is loadedd) None of the Above
Ans) c
7. Page Fault is
a) A page is referenced that is not in the memory .b) A page is referenced that is not in the Disk.c) A page being added to the process.d) None of the above
Ans) a
8. If the number of internal nodes in a binary tree is n , then what is the number of external nodes ?
a) n -1b) nc) n + 1d) 2n
Ans) c
9. "Banker,s Algorithm" is used for :
a) Deadlock Detectionb) Deadlock Avoidancec) Deadlock Preventiond) All of the above
Ans) b
10. Which of the following is used fro designing a lexical analyser of a compiler ?
a) Finite Automatab) Push Down Automatac) Turing Machined) None of the above
Ans) a
11. Which layer in the OSI model is responsible for End to End connectivity ?
a) Data Link Layerb) Network Layerc) Transport Layerd) Session Layer
Ans) c   
Provided by www.YuvaJobs.com - Globaledge   Paper    General - other        - 1  April  2005