1

### GATE CSE 2015 Set 2

Consider six memory partitions of sizes $200$ $KB,$ $400$ $KB,$ $600$ $KB,$ $500$ $KB,$ $300$ $KB$ and $250$ $KB,$ where $KB$ refers to kilobyte. These partitions need to be allotted to four processes of sizes $357$ $KB,$ $210$ $KB,$ $468$ $KB$ and $491$ $KB$ in that order. If the best fit algorithm is used, which partitions are NOT allotted to any process?
A
$200$ $KB$ and $300$ $KB$
B
$200$ $KB$ and $250$ $KB$
C
$250$ $KB$ and $300$ $KB$
D
$300$ $KB$ and $400$ $KB$
2
Numerical

### GATE CSE 2015 Set 2

A computer system implements $8$ kilobyte pages and a $32$-bit physical address space. Each page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the maximum size of the page table of a process is $24$ megabytes, the length of the virtual address supported by the system is _______________ bits.

3
Numerical

### GATE CSE 2015 Set 2

Consider the following C function.
int fun ( int n ) {
int x = 1, k ;
if ( n == 1) return x ;
for( k = 1 ; k < n ; ++ k )
x = x + fun( k ) * fun( n - k ) ;
return x ;
}
The return value of fun (5) is ________.

4

### GATE CSE 2015 Set 2

Consider the following function written in the C programming language.
void foo(char *a){
if ( *a && *a != ' '){
foo(a+1);
putchar(*a);
}
}
The output of the above function on input “ABCD EFGH” is
A
ABCD EFGH
B
ABCD
C
HGFE DCBA
D
DCBA

### Paper Analysis of GATE CSE 2015 Set 2

Subject NameTotal Questions
Algorithms5
Compiler Design3
Computer Networks6
Computer Organization4
Data Structures3
Database Management System4
Digital Logic3
Discrete Mathematics12
Operating Systems4
Programming Languages3
Software Engineering3
Theory of Computation4
Web Technologies1