CS and IT Gate 2017 Set-2 Questions with Answer

Ques 27 Gate 2017 Set-2

---

An ER model of a database consists of entity types A and B. These are connected by a relationship R which does not have its own attribute. Under which of the following conditions, can the relational table for R be merged with that of A?

(A) Relation R is one-to-many and the participation of A in R is total.
(B) Relation R is one-to-many and the participation of A in R is partial.
(C) Relation R is many-to-one and the participation of A in R is total.
(D) Relation R is many-to-one and the participation of A in R is partial.

See Answer Video Solution

Ques 28 Gate 2017 Set-2

---

Given the following binary number in 32 bit (single precision) IEEE-754 format:

00111110011011010000000000000000

The decimal value closest to this floating-point number is:

See Answer Video Solution

Ques 29 Gate 2017 Set-2

---

Consider a quadratic equation x² - 13x + 36 = 0 with coefficients in a base b. The solutions of this equation in the same base b are x = 5 and x = 6. Then b = ______.

See Answer Video Solution

Ques 30 Gate 2017 Set-2

---

The representation of the value of a 16-bit unsigned integer X in a hexadecimal number system is BCA9. The representation of the value of X in octal number system is:

See Answer Video Solution

Ques 31 Gate 2017 Set-2

---

The read access times and the hit ratios for different caches in a memory hierarchy are as given below:

Cache	Read Access Time (In Nanosecond)	Hit Ratio
I-Cache	2	0.8
D-Cache	2	0.9
L2-Cache	8	0.9

The read access time of main memory in 90 nanoseconds. Assume that the caches use the referred-word-first read policy and the writeback policy. Assume that all the caches are direct mapped caches. Assume that the dirty bit is always 0 for all the blocks in the caches. In execution of a program, 60% od memory reads are for instruction fetch and 40% are for memory operand fetch. The average read access time in nanoseconds (up to 2 decimal places) is _________

See Answer Video Solution

Ques 32 Gate 2017 Set-2

---

A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for 3 processes are shown below:

Process	Allocation Time	Maximum Requirement
P1	3	7
P2	1	6
P3	3	5

Which of the following best describes the current state of the system?

See Answer Video Solution

Ques 33 Gate 2017 Set-2

---

Which of the following is/are shared by all the threads in a process?

I. Program Counter
II. Stack
III. Address space
IV. Registers

See Answer Video Solution