GPL - CIL Technical & Aptitude Question Paper | PSU |

X Close

You need to enable javascript to view this page properly.

Company

- All
- CIL
- ECIL
- EIL
- ONGC
- SAIL

All

Loading

1.

In a system with 32 bit virtual addresses and 1 KB page size, use of one-level page tables for virtual to physical address translation is not practical because of
A. the large amount of internal fragmentation
B. the large amount of external fragmentation
C. the large memory overhead in maintaining page tables
D. the large computation overhead in the translation process

asked in CIL 2012 CSE

View Comments [0 Reply] Discuss Report
2.

Using a larger block size in a fixed block size file system leads to
A. better disk throughput but poorer disk space utilization
B. better disk throughput and better disk space utilization
C. poorer disk throughput but better disk space utilization
D. poorer disk throughput and poorer disk space utilization

asked in CIL 2012 CSE

View Comments [0 Reply] Discuss Report
3.

A file system with 300 GByte uses a file descriptor with 8 direct block address. 1 indirect block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and the size of each disk block address is 8 Bytes. The maximum possible file size in this file system is
A. 3 Kbytes
B. 35 Kbytes
C. 280 Bytes
D. Dependent on the size of the disk

last reply by CpjJwWHV • 10 years ago • asked in CIL 2012 CSE

View Comments [1 Reply] Discuss Report
1.

Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 On a demand paged virtual memory system running on a computer system that main memory size of 3 pages frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacements policy. Then
A. OPTIMAL < LRU < FIFO
B. OPTIMAL < FIFO < LRU
C. OPTIMAL = LRU
D. OPTIMAL = FIFO

asked in CIL 2012 CSE

View Comments [0 Reply] Discuss Report
2.

consider the 3 processes, P1, P2 and P3 shown in the table
Process Arrival time Burst Time

P₀ 0 ms 9 ms

P1 1 ms 4 ms

P2 2 ms 9 ms
The completion order of the 3 processes under the policies FCFS and RRS (round robin scheduling with CPU quantum of 2 time units) are
A. FCFS: P1, P2, P3 RR2: P1, P2, P3
B. FCFS: P1, P3, P2 RR2: P1, P3, P2
C. FCFS: P1, P2, P3 RR2: P1, P3, P2
D. FCFS: P1, P3, P2 RR2: P1, P2, P3

last reply by CpjJwWHV • 10 years ago • asked in CIL 2012 CSE

View Comments [2 Reply] Discuss Report
1.

A process executes the code
fork ();
fork ();
fork ();

The total number of child processes created is
A. 3
B. 4
C. 7
D. 8

asked in CIL 2012 CSE

View Comments [0 Reply] Discuss Report

10 1 2 ››

High Frequency Word List with Mnemonics

GPL Dictionary is fast way to learn words with mnemonics.
It contains high frequency word list which are mostly asked in various examinations.
It is dedicated for student appearing for PSUs, GRE, UPSC or any other exams in which vocabulary test is taken.
User can save their own mnemonics (key and link).

Check Now