CS and IT GATE 2016 Set-1 Questions with Answer

Ques 40 DBMS

Consider the following two phase locking protocol. Suppose a transaction T accesses (for read or write operations), a certain set of objects {O₁,...,O_k}. This is done in the following manner:

Step 1. T acquires exclusive locks to O₁,...,O_k in increasing order of their addresses.
Step 2. The required operations are performed.
Step 3. All locks are released.

This protocol will

Ques 41 DBMS

A database of research articles in a journal uses the following schema.

(VOLUME, NUMBER, STARTPGE, ENDPAGE, TITLE, YEAR, PRICE)

The primary key is (VOLUME, NUMBER, STARTPAGE, ENDPAGE) and the following functional dependencies exist in the schema.

(VOLUME, NUMBER, STARTPAGE, ENDPAGE) -> TITLE
(VOLUME, NUMBER) -> YEAR
(VOLUME, NUMBER, STARTPAGE, ENDPAGE) -> PRICE

The database is redesigned to use the following schemas.

(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, PRICE)
(VOLUME, NUMBER, YEAR)

Which is the weakest normal form that the new database satisfies, but the old one does not?

Ques 42 DBMS

Which one of the following is NOT a part of the ACID properties of database transactions?

Ques 43 DBMS

Which of the following is NOT a superkey in a relational schema with attributes V, W, X, Y, Z and primary key V Y ?

Ques 44 Design Algorithm Analysis

The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:

Ques 45 Digital Logic Design

We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then repeats. The minimum number of J-K flip-flops required to implement this counter is

Ques 46 Digital Logic Design

The 16-bit 2’s complement representation of an integer is 1111 1111 1111 0101; its decimal representation is

Ques 47 Digital Logic Design

Consider a carry lookahead adder for adding two n-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is

Ques 48 Digital Logic Design

Consider the Boolean operator # with the following properties:

x#0 = x, x#1 = x', x#x = 0 and x#x'= 1

Then x#y is equivalent to

Ques 49 Discrete Mathematics

Consider the recurrence relation

a₁ = 8, a_n = 6n² + 2n + a_n-1.
Let a₉₉ = k x 10⁴.

The value of K is _____

Ques 50 Discrete Mathematics

Let p, q, r, s represent the following propositions.

p: {8, 9, 10, 11, 12}
q: x is a composite number
r: x is a perfect square
s: x is a prime number

The integer x ≥ 2 which satisfies ¬((p ⇒ q)∧(¬r∨ ¬s)) is .

Ques 51 Discrete Mathematics

Let a_n be the number of n-bit strings that do NOT contain two consecutive 1s. Which one of the following is the recurrence relation for a_n?

Ques 52 Mathematics

Consider the following experiment.

Step 1. Flip a fair coin twice.
Step 2. If the outcomes are (TAILS, HEADS) then output Y and stop.
Step 3. If the outcomes are either (HEADS, HEAD) or (HEADS, TAILS), then output N and stop.
Step 4. If the outcomes are (TAILS, TAILS), then go to Step 1.
The probability that the output of the experiment is Y is (up to two decimal places).