Time Left - 20:00 mins

Mission NIELIT Day 24: Subjects Revision Test-4 (OS & Database )

Attempt now to get your rank among 1019 students!

Question 1

A process that is based on IPC mechanism which executes on different systems and can communicate with other processes using message based communication is called ______.

Question 2

Which access method is used for obtaining a record from cassette tape?

Question 3

Process that periodically checks status of an I/O devices, is known as :

Question 4

CPU consist of _______.

Question 5

How many wires are threaded through the cores in a coincident-current core memory?

Question 6

If there is more than one key for relation schema in DBMS then each key in relation schema is classified as :

Question 7

In which one of the following pages replacement policies, Belady’s anomaly may occur ?

Question 8

Consider a system with m resources of same type being shared by n processes. Resources can be requested and released by processes only one at a time. The system is deadlock free if and only if :

Question 9

Considering relational database, functional dependency between two attributs A and B is denoted by:

Question 10

If every functional dependency in set E is also in closure of F then this is classified as :

Question 11

A system has n resources R0,….., Rn-1 and k processes P0,…..Pk-1. The implementation of the resource request logic of each process Pi is as follows:
if (I % 2==0){
if (i < n) request Ri
if (i+2 < n) request Ri+2
}
else {
if (i < n) request Rn-i
if (i+2 < n) request Rn-i-2
}
In which one of the following situations is a deadlock possible?

Question 12

A disk has 200 tracks (numbered 0 through 199). At a given time, it was servicing the request of reading data from track 120 and at the previous request, service was for track 90. The pending requests (in order of their arrival) are for track numbers.
30 70 115 130 110 80 20 25.
How many times will the head change its direction for the disk scheduling policies SSTF (Shortest Seek Time First) and FCFS (First Come First Serve)?

Question 13

Where does the swap space reside?

Question 14

A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never arise is _______

Question 15

Consider the following snapshot of a system running n processes. Process i is holding Xi instances of a resource R, 1<= I <= n. Currently, all instances of R are occupied. Further, for all i, process i has placed a request for an additional Yi instances while holding the Xi instances it already has. There are exactly two processes p and q such that Yp = Yq = 0. Which one of the following can serve as a necessary condition to guarantee that the system is not approaching a deadlock?

Question 16

Process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as :

Question 17

What is described by means of DFDs as studied earlier and represented in algebraic form?

Question 18

Comparing the time T1 taken for a single instruction on a pipelined CPU, with time T2 taken on a non-pipelined but identical CPU, we can say that ____?

Question 19

Which level of Abstraction describes what data are stored in a Database?

Question 20

Select the ‘False’ statement from the following statement about Normal Forms :
  • 1019 attempts
  • 7 upvotes
  • 28 comments
Apr 1GATE & PSU CS