Operating Systems with Unix (NTA-NET (Based on NTA-UGC) Computer Science (Paper-II)): Questions 1 - 4 of 213

Access detailed explanations (illustrated with images and videos) to 2012 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. Subscription can be renewed yearly absolutely FREE! View Sample Explanation or View Features.

Rs. 550.00 or

How to register?

Question number: 1

» Operating Systems with Unix » Memory Management » Paging, Segmentation,Page Fault

Edit

Appeared in Year: 2015

MCQ▾

Question

A virtual memory has a page size of 1K words. There are eight pages and four blocks. The associative memory page table contains the following entries:

Table showing the memory page table contains

The memory page table contains the following entries

PAGE

BLOCK

0

3

2

1

5

2

7

0

Which of the following list of virtual addresses (in decimal) will not cause any page fault if referenced by the CPU? (December)

Choices

Choice (4) Response

a.

2021,4050,5112,7100

b.

1020,3012,6120,8100

c.

1024,3072,4096,6144

d.

1234,4012,5000,6200

Question number: 2

» Operating Systems with Unix » Unix Filters and Commands » Permissions,Rm,Mkdir,Cp,Mv

Edit

Appeared in Year: 2015

MCQ▾

Question

In Unix, the login prompt can be changed by changing the contents of the file …………… (December)

Choices

Choice (4) Response

a.

init

b.

contrab

c.

inittab

d.

gettydefs

Question number: 3

» Operating Systems with Unix » Unix System » Operating System

Edit

Appeared in Year: 2015

MCQ▾

Question

System calls are usually invoked by using: (December)

Choices

Choice (4) Response

a.

A software interrupt

b.

A privileged instruction

c.

Polling

d.

An indirect jump

Question number: 4

» Operating Systems with Unix » Basic Concepts » Interrupts,System Calls,Instructions

Edit

Appeared in Year: 2015

MCQ▾

Question

A system has four processes and five allocatable resources. The current allocation and maximum needs are as follows:

Current allocation and maximum needs are given

Current allocation and maximum needs are given

Allocated

Maximum

Available

Process A

1 0 2 1 1

1 1 2 1 3

0 0 x 1 1

Process B

2 0 1 1 0

2 2 2 1 0

Process C

1 1 0 1 0

2 1 3 1 0

Process D

1 1 1 1 0

1 1 2 2 1

The smallest value of x for which the above system in safe state is …………. (December)

Choices

Choice (4) Response

a.

3

b.

1

c.

2

d.

0

Developed by: