Time Left - 10:00 mins

NIELIT- Scientific Assistant Quiz-7 (Technical)

Attempt now to get your rank among 499 students!

Question 1

Consider a schema R(A,B,C,D) and functional dependencies A →B and C →D. Then the decomposition of R into R₁ (AB) and R₂(CD) is

Question 2

Which of the following relational calculus expressions is not safe?

Question 3

A process executes the following code
For (i=0; i < n; i++) fork( );
The total number of child processes created is

Question 4

A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?

Question 5

The Boolean expression for the shaded area in the Venn diagram shown in

Question 6

Which of the following are decidable?
I. Whether the intersection of two regular languages is infinite.
II. Whether a given context-free language is regular
III. Whether two push-down automata accept the same language
IV. Whether a given grammar is context-free

Question 7

On receiving an interrupt from an I/O device, the CPU

Question 8

Two control signals in microprocessor which are related to Direct Memory Access (DMA) are

Question 9

Let a ∗ H and b ∗ H be two cosets of H.
i. Either a ∗ H and b ∗ H are disjoint
ii. a ∗ H and b ∗ H are identical
Then

Question 10

G1 and G2 are two graphs as shown:

499 attempts
1 upvote
11 comments

Tags :

GATE & PSU CS General

Jun 25GATE & PSU CS