Turing Prep | Previous Year Questions | UGC NET CSE - June 2022

Question : 1

A trigger is

A statement that enables to start DBMS

A statement that is executed by the user when debugging an application program.

A condition the system tests for the validity of the database user.

A statement that is executed automatically by the system as a side effect of modification to the database.

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 2

RAD software process model stands for

Rapid Application Development

Relative Application Development

Rapid Application Design

Recent Application Development

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 3

Alpha and Beta testing are forms of

White-Box Testing

Black-Box Testing

Acceptance Testing

System Testing

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 4

Match List I with List II :

\(\begin{array}{ll} \text{List I} & \text{List II} \\ \\ \text { (A) Least frequently used } & \text { (I) Memory is distributed among processors } \\ \text { (B) Critical Section } & \text { (II) Page replacement policy in cache memory } \\ \text { (C) Loosely coupled multiprocessor } & \text { (III) Program section that once begin must} \\ \qquad \text{system}&\qquad \text { complete execution before another processor} \\ &\qquad \text { access the same shared resource } \\ \text{(D) Distributed operating system } & \text{ (IV) O/S routines are distributed among }\\ \qquad \text{organization} \end{array}\)

Choose the correct answer from the options given below :

(A)-(III), (B)-(II), (C)-(IV). (D)-(I)

(A)-(I), (B)-(II), (C)-(III), (D)-(IV)

(A)-(II), (B)-(III), (C)-(I), (D)-(IV)

(A)-(II), (B)-(I), (C)-(Iii), (D)-(IV)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 5

If an operating system does not allow a child process to exist when the parent process has been terminated, this phenomenon is called as.

Threading

Cascading termination

Zombie termination

Process killing

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 6

Size and complexity are a part of

People Metrics

Project Metrics

Process Metrics

Product Metrics

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 7

Consider the following statements:
Statement I: Conservative 2PL is a deadlock-free protocol.
Statement II: Thomas's write rule enforces conflict serializability.
Statement III: Timestamp ordering protocol ensures serializability based on the order of transaction timestamps.

Which of the following is correct ?

Statement I, Statement II true and Statement III false

Statement I, Statement III true and Statement II false

Statement I, Statement II false and Statement III true

Statement I, Statement II and Statement III true

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 8

Hidden surface removal problem with minimal 3D pipeline can be solved with

Painter's algorithm

Window Clipping algorithm

Brute force rasterization algorithm

Flood fill algorithm

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 9

Match List I with List II :

\(\begin{array}{II} \text{List I} & \text{List II} \\ \\ \text{(A) Firmware} & \text{ (I) Number of logical records into physical blocks} \\ \\ \text { (B) Batch file } & \text { (II) ASCII format } \\ \\ \text { (C) Packing } & \text { (III) Resource allocation } \\ \\ \text { (D) Banker's Algorithm } & \text { (IV) ROM } \end{array}\)

Choose the correct answer from the options given below :

(A)-(II), (B)-(I), (C)-(IV), (D)-(III)

(A)-(II), (B)-(I), (C)-(III), (D)-(IV)

(A)-(IV), (B)-(II), (C)-(I), (D)-(III)

(A)-(IV), (B)-(I), (C)-(II), (D)-(III)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 10

Consider the properties of recursively enumerable sets :

(A) Finiteness
(B) Context Freedom
(C) Emptiness
Which of the following is true?

Only (A) and (B) are not decidable

Only (B) and (C) are not decidable

Only (C) and (A) are not decidable,

All (A), (B) and (C) are not decidable

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 11

Fault base testing technique is

Unit testing

Beta testing,

Stress testing

Mutation testing

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 12

The condition num! =65 cannot be replaced by

num >65 || num <65

!( num ==65)

num −65

!(num−65)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 13

Match List I with List II :

\(\begin{array}{ll} \text{List I} & \text{List II} \\ \\ \text {(A) BCNF } & \text { (I) It removes multivalued dependency } \\ \text {(B) 3} \mathrm{NF} & \text { (II) It is not always dependency preserving } \\ \text {(C) 2} \mathrm{NF} & \text{ (III) It removes transitive dependency} \\ \text {(D) 4} \mathrm{NF} & \text { (IV) It removes partial functional dependency }\end{array}\)

Choose the correct answer from the options given below:

(A)-(III), (B)-(II), (C)-(IV), (D)-(I)

(A)-(II), (B)-(IV), (C)-(I), (D)-(III)

(A)-(II), (B)-(III), (C)-(IV), (D)-(I)

(A)-(II), (B)-(I), (C)-(IV), (D)-(III)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 14

Given below are two statements : one is labelled as Assertion (A) and the other is labelled as Reason (R):

Assertion (A): A load-and-go assembler avoids the overhead of writing the object program out and reading it back in.
Reason (R): This can be done with either one-pass or two pass assembler.

In the light of the above statements, choose the correct answer from the options given below :

Both (A) and (R) are true and (R) is the correct explanation of (A),

Both (A) and (R) are true but (R) is (NOT) the correct explanation of (A)

(A) is true but (R) is false

(A) is false but (R) is true

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 15

Consider the following:

\(\begin{array}{ll} \text{List I} & \text{List II} \\ \\ \text{(A) Stack algorithm} & \text{(I) Deadlock} \\ \text{(B) Elevator algorithm} & \text{(II) Disk scheduling} \\ \text{(C) Priority scheduling algorithm} & \text{(III) Page replacement} \\ \text{(D) Havender's algorithm} & \text{(IV) CPU scheduling} \end{array}\)

Which of the following is correct matching ?

(A)-(III), (B)-(II), (C)-(IV), (D)-(I)

(A)-(II), (B)-(III), (C)-(IV), (D)-(I)

(A)-(III), (B)-(II), (C)-(I), (D)-(IV)

(A)-(II), (B)-(III), (C)-(I), (D)-(IV)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 16

In a game playing search tree, upto which depth 𝛼−𝛽 pruning can be applied?

(A) Root (0) level
(B) 6 level
(C) 8 level
(D) Depends on utility value in a breadth first order

Choose the correct answer from the options given below :

(B) and (C) only

(A) and (B) only

(A) (B) and (C) only

(A) and (D) only

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 17

A 4-stage pipeline has the stage delay as 150,120,160 and 140 ns respectively. Registers that are used between the stages have delay of 5 ns. Assuming constant locking rate, the total time required to process 1000 data items on this pipeline is

160.5 ms

165.5 ms

120.5 ms

590.5 ms

Correct Answer : MTA

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 18

There are three boxes. First box has 2 white, 3 black and 4 red balls. Second box has 3 white, 2 black and 2 red balls. Third box has 4 white, 1 black and 3 red balls. A box is chosen at random and 2 balls are drawn out of which 1 is white, and 1 is red. What is the probability that the balls came from first box?

0.237

0.723

0.18

0.452

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 19

Given below are two statements : one is labelled as Assertion (A) and the other is labelled as Reason (R) :
Assertion (A): \(\bar{p}\)
Reason (R): \(\quad(r \rightarrow \bar{q}, r \vee s, s \rightarrow \bar{q}, p \rightarrow q)\)

In the light of the above statements, choose the correct answer from the options given below :

Both (A) and (R) are true and (R) is the correct explanation of (A)

Both (A) and (R) are true but (R) is (NOT) the correct explanation of (A)

(A) is true but (R) is false

(A) false but (R) is true

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 20

Assume that \(𝑓(𝑛)\) and \(𝑔(𝑛)\) are asymptotically positive. Which of the following is correct ?

\(f(n)=O(g(n))\) and \(g(n)=O(h(n)) \Rightarrow f(n)=\omega(h(n))\)

\(f(n)=\Omega(g(n))\) and \(g(n)=\Omega(h(n)) \Rightarrow f(n)=O(h(n))\)

\(f(n)=o(g(n))\) and \(g(n)=o(h(n)) \Rightarrow f(n)=o(h(n))\)

\(f(n)=\omega(g(n))\) and \(g(n)=\omega(h(n)) \Rightarrow f(n)=\Omega(h(n))\)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 21

Which one is a connectionless transport - layer protocol that belongs to the Internet protocol family ?

Transmission Control Protocol (TCP)

User Datagram Protocol (UDP)

Routing Protocol (RP)

Datagram Control Protocol (DCP)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 22

Consider an error-free 64kbps satellite channel used to send 512 byte data frames in one direction with very short acknowledgements coming back the other way. What is the maximum throughput for window size of 15 ?

32kbps

48kbps

64kbps

70kbps

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 23

How many rotations are required during the construction of an AVL tree if the following elements are to be added in the given sequence?

35,50,40,25,30,60,78,20,28

2 left rotations, 2 right rotations

2 left rotations, 3 right rotations

3 left rotations, 2 right rotations

3 left rotations, 1 right rotation

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 24

Of the following, which is NOT a logical error ?

Using the ′=′ instead of ′==′ to determine if two values are equal,

Divide by zero

Failing to initialize counter and total variables before the body of loop,

Using commas instead of two required semicolon in a for loop header

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 25

Let \(e=0.0005\), and Let \(R_𝑒\) be the relation \(\left\{(x, y) \in R^2:|x-y|< \in \right\}\). \(R_𝑒\) could be interpreted as the relation approximately equal. \(R_𝑒\) is

(A) Reflexive
(B) Symmetric
(C) transitive

Choose the correct answer from the options given below :

(A) and (B) only true

(B) and (C) only true

(A) and (C) only true

(A), (B) and (C) true

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 26

Consider the traversal of a tree

Preorder → ABCEIFJDGHKL
Inorder → EICFJBGDKHLA

Which of the following is correct post order traversal ?

EIFJCKGLHDBA

FCGKLHDBUAE

FCGKLHDBAEIJ

IEJFCGKLHDBA

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 27

Consider the following \(\text{NPDA}=\left(\left\{q_{0}, q_{1}, q_{f}\right\}\{a, b\},\{1, z\}, \delta, q_{0}, z,\left\{q_{f}\right\}\right)\)

\(\begin{array}{l} \delta\left(q_{0}, \lambda, z\right)=\left\{\left(q_{f}, z\right)\right\} \\ \delta\left(q_{0}, a, z\right)=\left\{\left(q_{1}, 11 z\right)\right\} \\ \delta\left(q_{1}, a, 1\right)=\left\{\left(q_{1}, 111\right)\right\} \\ \delta\left(q_{1}, b, 1\right)=\left\{\left(q_{1}, \lambda\right)\right\} \\ \delta\left(q_{1}, \lambda, z\right)=\left\{\left(q_{f}, z\right)\right\} \end{array}\)

Which of the following Language \(𝐿\) is accepted by NPDA?

\(L=\left\{a^{2 n} b^{n}: n \geq 0\right\}\)

\(L=\left\{a^{n} b^{2 n}: n \geq 0\right\}\)

\(L=\left\{a^{2 n} b^{n}: n>0\right\}\)

\(L=\left\{a^{n} b^{2 n}: n>0\right\}\)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 28

Which mechanism in XML allows organizations to specify globally unique names as element tags in documents ?

root

header

schema

namespace

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 29

Let ({𝑎,𝑏},∗) be a semigroup, where 𝑎∗𝑎=𝑏.

(A) 𝑎∗𝑏=𝑏∗𝑎
(B) 𝑏∗𝑏=𝑏

Choose the most appropriate answer from the options given below :

(A) only true

(B) only true

Both (A) and (B) true

Neither (A) nor (B) true

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 30

The logic expression \((\bar{P} \wedge Q) \vee(P \wedge \bar{Q}) \vee(P \wedge Q)\) is equivalent to

\(\bar{P} \vee Q\)

\(P \vee \bar{Q}\)

\(P \vee Q\)

\(\bar{P} \vee \bar{Q}\)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 31

Consider the following in Boolean Algebra

\(\begin{array}{l} \mathrm{X}: a \vee(b \wedge(a \vee c))=(a \vee b) \wedge(a \vee c) \\ \mathrm{Y}: a \wedge(b \vee(a \wedge c))=(a \wedge b) \vee(a \wedge c) \\ a \vee(b \wedge c)=(a \vee b) \wedge c \text { is satisfied if } \\ \end{array}\)

X is true

Y is true

Both X and Y are true

It does not depend on X and Y

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 32

A good software requirement specification does NOT have the characteristic

Completeness

Consistency

Clarity

Reliability

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 33

Consider the following statements:

Statement I: LALR parser is more powerful than canonical LR Parser.

Statement II: SLR parser is more powerful than LALR

Which of the following is correct ?

Statement I true and Statement II false

Statement I false and Statement II true

Both Statement I and Statement II false

Both Statement I and Statement II true

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 34

The reduced grammar equivalent to the grammar, whose production rules are given below, is

S→AB∣CA

B→BC∣AB

A→a

C→aB∣b

S→CA,A→a,C→b

S→CA|B,B→BC|B,A→a,C→aB∣b

S→CA|B,B→BC,A→a,C→aB|b

S→AB|AC,B→BC|BA,A→a,C→aB∣b

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 35

Match List I with List II :

List I	List II
(A) Localization	(I) Encapsulationlation
(B) Packaging or binding of a collection of items	(II) Abstraction
(C) Mechanism that enables designer to focus on essential details of a program component.	(III) Characteristic of software that indicates the manner in which information is concentrated in program
(D) Information hiding	(IV) Suppressing the operational details of a program component

Choose the correct answer from the options given below :

(A)-(I), (B)-(II), (C)-(III), (D)-(IV)

(A)-(II), (B)-(I), (C)-(III), (D)-(IV)

(A)-(III), (B)-(I), (C)-(II), (D)-(IV)

(A)-(III), (B)-(I), (C)-(IV), (D)-(II)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 36

For multiprocessor system, interconnection network - cross bar switch is an example of

Non blocking network

Blocking network

That varies from connection to connection

Recurrent network

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 37

Consider the following :

\(\begin{array}{ll}\text { List I } & \text { List II } \\ \text { (A) Activation record } & \text { (I) Linking Loader } \\ \text { (B) Location counter } & \text { (II) Garbage Collection } \\ \text { (C) Reference count } & \text { (III) Subroutine Call } \\ \text { (D) Address relocation } & \text { (IV) Assembler }\end{array}\)

Which of the following is correct matching ?

(A)-(III),(B)-(IV), (C) -(I), (D)-(II)

(A) -(IV), (B)−(III),(C)–(I),(D)−(II)

(A)-(IV), (B)−(III),(C)−(II),(D)−(I)

(A)-(II), (B)−(III),(C)−(I),(D)−(IV)

Correct Answer : MTA

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 38

The solution of the recurrence relation \(T(n)=3 T(n / 4)+n \lg n\) is

\(\theta\left(n^{2} \lg n\right)\)

\(\theta(n \lg n)\)

\(\theta(n \lg n)^{2}\)

\(\theta(n \lg \lg n)\)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 39

Match List I with List II :

List I	List II
(A) Type 0	(I) Finite automata
(B) Type 1	(II) Tuning machine
(C) Type 2	(III) Linear bound automata
(D) Type 3	(IV) Pushdown automata

Choose the correct answer from the options given below :

(A)−(III),(B)−(IV),(C)−(II),(D)−(I)

(A)−(II),(B)−(III),(C)−(IV),(D)−(I)

(A)−(III),(B)−(IV),(C)−(I),(D)−(II)

(A)−(II),(B)−(III),(C)−(II),(D)−(IV)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 40

Consider a logic gate circuit, with 8 input lines \(\left(\mathrm{D}_{0}, \mathrm{D}_{1} \ldots \ldots \mathrm{D}_{7}\right)\) and 3 output lines \(\left(\mathrm{A}_{0}, \mathrm{~A}_{1}, \mathrm{~A}_{2}\right)\) specified by following operations

\(\begin{array}{l} A_{2}=D_{4}+D_{5}+D_{6}+D_{7} \\ A_{1}=D_{2}+D_{3}+D_{6}+D_{7} \\ A_{0}=D_{1}+D_{3}+D_{5}+D_{0} \end{array}\)

Where + indicates logical OR operation. This circuit is

3×8 multiplexer

Decimal to BCD converter

Octal to Binary encoder

Priority encoder

Correct Answer : MTA

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 41

Let R (ABCDEFGH) be a relation schema and F be the set of dependencies 𝐹 = {𝐴→𝐵,𝐴𝐵𝐶𝐷→𝐸,𝐸𝐹→𝐺,𝐸𝐹→𝐻 and 𝐴𝐶𝐷𝐹→𝐸𝐺}. The minimal cover of a set of functional dependencies is

𝐴→𝐵,𝐴𝐶𝐷→𝐸,𝐸𝐹→𝐺, and 𝐸𝐹→𝐻

𝐴→𝐵,𝐴𝐶𝐷→𝐸,𝐸𝐹→𝐺,𝐸𝐹→𝐻 and 𝐴𝐶𝐷𝐹→𝐺

𝐴→𝐵,𝐴𝐶𝐷→𝐸,𝐸𝐹→𝐺,𝐸𝐹→𝐻 and 𝐴𝐶𝐷𝐹→𝐸

𝐴→𝐵,𝐴𝐵𝐶𝐷→𝐸,𝐸𝐹→𝐻 and 𝐸𝐹→𝐺

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 42

The representation of 4 bit code 1101 into 7 bit, even parity Hamming code is

(1010101)

(1111001)

(1011101)

(1110000)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 43

This transformation is called

\(\left[\begin{array}{l} \bar{x} \\ \bar{y} \\ \bar{z} \\ \bar{w} \end{array}\right]=\left[\begin{array}{llll} a_{1} & b_{1} & c_{1} & d_{1} \\ a_{2} & b_{2} & c_{2} & d_{2} \\ a_{3} & b_{3} & c_{3} & d_{3} \\ e & f & g & h \end{array}\right]-\left[\begin{array}{l} x \\ y \\ z \\ 1 \end{array}\right]\)

Scaling

Shear

Homography

Steganography

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 44

Consider the following statements of approximation algorithm :

Statement I: Vertex-cover is a polynomial time 2-approximation algorithm.

Statement II: TSP-tour is a polynomial time 3-approximation algorithm for travelling salesman problem with the triangle inequality.

Which of the following is correct ?

Statement I true and Statement II false

Statement I and Statement II true

Statement I false and Statement II true

Statement I and Statement II false

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 45

Using 'RSA' algorithm, if 𝑝 = 13,𝑞 = 5 and 𝑒 = 7. the value of 𝑑 and cipher value of ′6′ with (𝑒,𝑛) key are

7,4

7,1

7,46

55,1

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 46

Which mode is a block cipher implementation as a self-synchronizing stream cipher ?

Cipher Block Chaining Mode,

Cipher Feedback Mode

Electronic Codebook Mode

Output Feedback Mode

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 47

The number of gate inputs, required to realize expression \(ABC+A \overline{B}CD+E\overline{F}+AD\) is

12

13

14

15

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 48

Consider a memory system having address spaced at a distance of \(𝑚,𝑇\) = Bank cycle time and \(𝑛\) number of banks, then the average data access time per word access in synchronous organization is

\(t=\left\{\begin{array}{l} m, \frac{T}{n} \text { for } m\ll n \\ T \text { for } m \gg n \end{array}\right.\)

\(t=\left\{\begin{array}{l} T / n \text { for } m\ll n \\ T \text { for } m\gg n \end{array}\right.\)

\(t=\left\{\begin{array}{l} m . T \text { for } m \ll n \\ T \text { for } m \gg n \end{array}\right.\)

\(t=\left\{\begin{array}{l} m \cdot T \text { for } m \ll n \\ m / T \text { for } m\gg n \end{array}\right.\)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 49

Which of the following algorithm design approach is used in Quick sort algorithm ?

Dynamic programming

Back Tracking

Divide and conquer

Greedy approach

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 50

For the following page reference string 4,3,2,1,4,3,5,4,3,2,1,5, the number of page faults that occur in Least Recently Used (LRU) page replacement algorithm with frame size 3 is

6

8

10

12

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 51

Given below are two statements :
Statement I: Consider 20 bit 'Branch' microinstruction code format given below:

3	3	3	2	2	7
F1	F2	F3	CD	BR	AD

F1, F2.F3 : Micro-operation fields
CD : Condition for branching
BR : Branch field
AD: Address field

Statement II: Instruction represented in above format can perform branch in
In the light of the above statements, choose the most appropriate answer from the options given below :

Both Statement I and Statement II are correct

Both Statement I and Statement II are incorrect

Statement I is correct but Statement II is incorrect

Statement I is incorrect but Statement II is correct

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 52

The number of nodes of height h in any n-element heap is atmost:

\(n / 2^{n+1}\)

\(\frac{n}{2^{h-1}}\)

\(\frac{n}{2^{h}}\)

\(\frac{n-1}{2^{h-1}}\)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 53

Match List I with List II :

List I	List II
(A) Ontological Engineering	(I) Organizing subclass relations
(B) Taxonomy Hierarchy	(II) Organizing knowledge into category and sub category
(C) Inheritance	(III) Attaches a number with each possibility
(D) Probability mode	(IV) Representing concepts. events, time. physical concepts of different domains

Choose the correct answer from the options given below :

(A)-(II), (B)-(I), (C)-(IV), (D)-(III)

(A)-(I), (B)-(II), (C)-(III), (D)-(IV)

(A)-(IV), (B)-(III), (C)-(I), (D)-(II)

(A)-(IV), (B)-(I), (C)-(II), (D)-(III)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 54

In a cache memory, if address has 9 bits in Tag field and 12 bits in index field, the size of main memory and cache memory would be respectively

2 K,4 K

1024 K,2 K,

4 K,2048 K

2048 K,4 K

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 55

The total storage capacity of a floppy disk having 80 tracks and storing 128 bytes/sector is 163,840 bytes. How many sectors does this disk have ?

27

2048

4 K

16

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 56

Consider the primal problem :
Maximize \(z=5 x_{1}+12 x_{2}+4 x_{3}\)
Subject to

\(\begin{array}{l} \text {Subject to }x_{1}+2 x_{2}+x_{3}=10\\ 2 x_{1}-x_{2}+3 x_{3}=8 \\ x_{1}, x_{2}, x_{3} \geq 0 \end{array}\)

its dual problem is
Minimize \(w=10 y_{1}+8 y_{2}\)
Subject to

\(\begin{array}{l} y_{1}+2 y_{2} \geq 5\\ 2 y_{1}-y_{2} \geq 12 \\ y_{1}+3 y_{2} \geq 4 \end{array}\)

Which of the following is correct ?

\(𝑦_1≥0,𝑦_2\) unrestricted

\(𝑦_1≥0,𝑦_2≥0\)

\(𝑦_1\) is unrestricted, \(𝑦_2≥0\)

\(𝑦_1\) is unrestricted. \(𝑦_2\) restricted

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 57

The process to gather the software requirements from client, analyze and document is known as -

Software Engineering Process

User Engineering Process

Requirement Elicitation Process

Requirement Engineering Process

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 58

A classless address is given as 167.199.170.82/27. The number of addresses in the network is

64 addresses

32 addresses

28 addresses

30 addresses

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 59

Consider two lists A and B of three strings on {0,1}
𝑋 :

List A	List B
1	111
10111	10
10	0

𝑌:

List A	List B
10	101
011	11
101	011

Which of the following is true?

Only PCP in X has solution

Only PCP in Y has solution

PCP in both X and Y has solution

PCP neither in X nor in Y has solution

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 60

If every requirement can be checked by a cost-effective process, then SRS is called

Verifiable

Traceable

Modifiable

Complete

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 61

A top down approach to programming calls for :

Statement I: Working from the general to the specific.
Statement II: Postpone the minor decisions.
Statement III: A systematic approach.
Statement IV: Intermediate coding of the problem

Which of the following is true ?

Statement I only

Statement I and Statement II only

Statement I, Statement II and Statement III only

Statement I, Statement II and Statement IV only

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 62

Which layer divides each message into packets at the source and re-assembles them at the destination ?

Network layer

Transport layer

Data link layer

Physical layer

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 63

Consider the following algorithms and their running times :

Algorithms	Complexities
(A) Breadth First Search	(I) 𝜃(𝑣+𝐸)
(B) Rabin-Karp Algorithm	(II) 𝑂(𝑣+𝐸)
(C) Depth-First Search	(III) 𝜃((𝑛−𝑚−1)𝑚)
(D) Heap sort (worst case)	(IV) 𝑂(𝑛2)
(E) Quick sort (worst case)	(V) 𝑂(𝑛lg⁡𝑛)

Which one of the following is correct?

(A)-(III), (B)-(II), (C)-(I), (D)-(IV), (E)-(V)

(A)-(II), (B)-(III), (C)-(I), (D)-(IV), (E)-(V)

(A)-(II), (B)-(III), (C)-(I), (D)-(V), (E)-(IV)

(A)-(III), (B)-(I), (C)-(II), (D)-(IV), (E)-(V)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 64

Consider the hash table of size 11 that uses open addressing with linear probing. Let ℎ(𝑘) = 𝑘 mod 11 be the hash function. A sequence of records with keys 43,36,92,87.11.47.11,13,14 is inserted into an initially empty hash table, the bins of which are indexed from 0 to 10. What is the index of the bin into which the last record is inserted ?

8

7

10

4

Correct Answer : MTA

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 65

Pointers cannot be used to

find the address of a variable in memory

reference value directly

simulate call by reference

manipulate dynamic data structure

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 66

Match List I with List II:

List I	List II
(A) DES	(I) Key size - 256
(B) AES	(II) Key size - 1024
(C) 3 DES	(III) Key size - 56
(D) RSA	(IV) Key size -168

(A)−(I),(B)−(II),(C)−(IV),(D)−(III)

(A)−(III),(B)−(I),(C)−(IV),(D)−(II)

(A)−(III),(B)−(IV),(C)−(II),(D)−(I)

(A)−(IV),(B)−(II),(C)−(III),(D)−(I)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 67

Match List I with List II :

\(\begin{array}{ll} \text{List I} & \text{List II} \\ \\ \text{(A) BIND} & \text {(I) Block the caller until a connection attempt arrives} \\ \text{(B) LISTEN} & \text{ (II) Give a local address to a socket} \\ \text{(C) ACCEPT} & \text {(III) Show willingness to accept connections} \\ \text {(D) SOCKET} & \text {(IV) Create a new point} \end{array}\)

Choose the correct answer from the options given below :

(A)-(I), (B)-(III), (C)-(II), (D)-(IV)

(A)-(II), (B)-(III). (C)-(I), (D)-(IV)

(A)-(III), (B)-(II), (C)-(I), (D)-(IV)

(A)-(I), (B)-(II), (C)-(III), (D)-(IV)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 68

Consider the following two lists :

\(\begin{array}{ll} \text{List I} & \text{List II} \\ \\ \text {(A) Stack overflow } & \text { (I) Software interrupt } \\ \text {(B)} \mathrm{Timer} & \text { (II) Internal interrupt } \\ \text {(C)} \mathrm{Invalid opcode} & \text{ (III) External interrupt} \\ \text {(D)} \mathrm{Superior call} & \text { (IV) Machine check interrupt }\end{array}\)

Which of the following is correct match ?

(A)-(I), (B)-(II), (C)-(III), (D)-(IV)

(A)-(II), (B)-(III), (C)-(I), (D)-(IV)

(A)-(I), (B)-(II), (C)-(IV), (D)-(III)

(A)-(II), (B)-(III), (C)-(IV), (D)-(I)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 69

Consider the following graph :

For the graph; the following sequences of depth first search (DFS) are given
(A) abcghf
(B) abfchg
(C) abfhgc
(D) afghbc

Which of the following is correct ?

(A),(B) and (D) only

(A),(B),(C) and (D)

(B), (C) and (D) only

(A),(C) and (D) only

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 70

What is called Journalling in Linux operating system ?

Process scheduling

File saving as transaction,

A type of thread

An editor

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 71

Consider a B-tree of height h. minimum degree \(𝑡≥2\) that contains any \(n\)-key, where \(𝑛≥1\). Which of the following is correct ?

\(h \geq \log _{t} \frac{n+1}{2}\)

\(h \leq \log _{t} \frac{n+1}{2}\)

\(h \geq \log _{t} \frac{n-1}{2}\)

\(h \leq \log _{t} \frac{n-1}{2}\)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 72

Consider the following statements about Context Free Language (CFL) :
Statement I: CFL is closed under homomorphism.
Statement II: CFL is closed under complement.

Which of the following is correct ?

Statement I is true and Statement II is false

Statement II is true and Statement I is false

Both Statement I and Statement 𝐼𝐼 are true

Neither Statement I nor Statement II is true

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 73

Consider the grammer S→SbS∣a.
Consider the following statements:
The string abababa has

(A) two parse trees
(B) two left most derivations
(C) two right most derivations

Which of the following is correct ?

All (A). (B) and [(𝐶)] are true,

Only (B) is true

Only (C) is true

Only (A) is true

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 74

The model in which the requirements are implemented by its category is

Evolutionary Development Model

Waterfall Model

Prototyping Model

Iterative Enhancement Model

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 75

In reference to Big data, consider the following database :
(A) Memcached
(B) Couch DB
(C) Infinite graph
Choose the most appropriate answer from the options given below :

(A) and (B) only

(B) and (C) only,

(C) and (A) only

(A) (B) and (C)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 76

Consider the production rules of grammar G:

\(\begin{array}{l} \mathrm{S} \rightarrow \mathrm{AbB} \\ \mathrm{A} \rightarrow \mathrm{aAb} \mid \lambda \\ \mathrm{B} \rightarrow \mathrm{bB} \mid \lambda \end{array}\)

Which of the following language 𝐿 is generated by grammer 𝐺 ?

\(\text L=\left\{a^{n} b^{m}: n \geq 0, m>n\right\}\)

\(\text L=\left\{a^{n} b^{m}: n \geq 0, m \geq 0\right\}\)

\(L=\left\{a^{n} b^{m}: n \geq m\right\}\)

\(L=\left\{a^{n} b^{m}: n \geq m, m>0\right\}\)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 77

Consider \(L = \{a b, a a, b a a\}\)
Which of the following string is NOT in \( L^∗\) ?

baaaaabaaaaa

abaabaaabaa

aaaabaaaa

baaaabaa

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 78

Consider the language \(L=\left\{a^{n} b^{m}: n \geq 4, m \leq 3\right\}\)

Which of the following regular expression represents language \(L\) ?

aaaa* (𝜆+𝑏+𝑏𝑏+𝑏𝑏𝑏)

aaaaa*(𝑏+𝑏𝑏+𝑏𝑏𝑏)

aaaaa *(𝜆+𝑏+𝑏𝑏+𝑏𝑏𝑏)

aaaa* (𝑏+𝑏𝑏+𝑏𝑏𝑏)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 79

Given below are two statements :

Statement I: "Grandparent is a parent of one's parent".

Statement II: First Order Predicate Logic (FOPL) representation of above statement is
\(\forall g\), c grandparent \((g, c) \Leftrightarrow \exists p\) parent \((𝑔,𝑝)∧ parent (𝑝,𝑐)\)

In the light of the above statements, choose the most appropriate answer from the options given below :

Both Statement I and Statement II are correct

Both Statement I and Statement II are incorrect

Statement I is correct but Statement II is incorrect

Statement I is incorrect but Statement II is correct

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 80

Which Metrics are derived by normalizing quality and/or productivity measures by considering the size of the software that has been produced ?

Function - Oriented Metrics

Function - Point Metrics

Line of Code Metrics

Size Oriented Metrics

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 81

Which statement is false ?

All function calls in C pass arguments using call by value.

Call by reference enables a called function to modify a variable in calling function.

Call by value is always more efficient than call by reference.

Programmers use pointers and indirection operation to simulate call by reference.

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 82

Modules X and Y operate on the same input and output, then the cohesion is

Logical cohesion

Sequential cohesion

Procedural cohesion

Communicational cohesion

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 83

Consider the following related to Fourth Generation Technique (4GT) :

(A) It controls efforts.
(B) It controls resources.
(C) It controls cost of development.

Choose the correct answer from the options given below :

(A) and (B) only

(B) and (C) only

(C) and (A) only

All (A), (B) and (C)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 84

Which of the following is correct for the destination address 4A:30:10:21:10:1A ?

unicast address

multicast address

broadcast address

unicast and broadcast address

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 85

In a database, a rule is defined as (P1 and P2) or P3 ? R1(0.8) and R2(0.3), where P1, P2. P3 are premises and R1. R2 are conclusions of rules with certainty factors (CF) 0.8 and 0.3 respectively. If any running program has produced P1, P2, P3 with CF as 0.5,0.8, 0.2 respectively. find the CF of results on the basis of premises.

CF(R1=0.8),CF(R2=0.3)

CF(R1=0.40),CF(R2=0.15)

CF(R1=0.15),CF(R2=0.35)

CF(R1=0.8),CF(R2=0.35)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 86

Match List I with List II:

\(\begin{array}{ll} \text{List I} & \text{List II} \\ \\ \text{(A) Physical layer} & \text {(I) Routing of the signals divide the outgoing message into} \\ & \text {packets, to act as network controller for routing data}\\ \text{(B) Data link layer} & \text{(II) Make and break connections, define voltages and data rates} \\ & \text {convert data bits into electrical signal} \\ \text{(C) Network layer} & \text{(III) Synchronization, error detection and correction.} \\ & \text{To assemble outgoing message into frames } \\ \text{(D) Presentation layer} & \text{(IV) It works as a translating layer} \end{array}\)

Choose the correct answer from the options given below :

(A)-(IV), (B)-(III), (C)-(II), (D)-(I)

(A)-(II), (B)-(III). (C)-(IV), (D)-(I)

(A)-(IV), (B)-(III), (C)-(I), (D)-(II)

(A)-(II), (B)-(III), (C)-(I), (D)-(IV)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 87

Which of the following is an indirect measure of product ?

Quality

Complexity

Reliability

All of these

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 88

Consider the following statements:

Statement I: Composite attributes cannot be divided into smaller subparts.

Statement II: Complex attribute is formed by nesting composite attributes and multivalued attributes in an arbitrary way.

Statement III: A derived attribute is an attribute whose values are computed from other attribute.

Which of the following is correct ?

Statement I, Statement II and Statement III are true

Statement I true and Statement II, Statement III false

Statement I, Statement II true and Statement III false

Statement I false and Statement II, Statement III true

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 89

A magnetic tape drive has transport speed of 200 inches per second and a recording density of 1600 bytes per inch. The time required to write 600000 bytes of data grouped in 100 characters record with a blocking factor 10 is

2.0625sec

2.6251sec

2.0062sec

2.6150sec

Correct Answer : MTA

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 90

Consider \(\alpha, \beta, \gamma\) as logical variables. Identify which of the following represents correct logical equivalence :

(A) \((\alpha \wedge(\beta \vee \gamma)) \equiv((\alpha \wedge \beta) \vee(\alpha \wedge \gamma))\)
(B) \((\alpha \vee \beta) \equiv \neg \alpha \vee \beta\)
(C) \((\alpha \Rightarrow \beta) \equiv(\neg \beta \Rightarrow-\alpha)\)
(D) \((\neg (\alpha \vee \beta)) \equiv(\neg \alpha \Rightarrow-\beta)\)

Choose the correct answer from the options given below :

(A) and (D) only

(B) and (C) only,

(A) and (C) only

(B) and (D) only

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 91

Read the following and Answer the questions:

Consider the relational schema of sailors S, Reserves B and Boats B.

Table 1: Sailors S

\(\begin{array}{|l|l|l|} \hline Sid & Sname & Ratting & Age \\ \hline 22 & Dustin & 7 & 45.0 \\ 29 & Brutus & 1 & 33.0 \\ 31 & Lubber & 8 & 55.5 \\ 32 & Andy & 8 & 25.5 \\ 58 & Rusty & 10 & 35.0 \\ 64 & Horatio & 7 & 35.0 \\ 71 & Zorba & 10 & 16.0 \\ 74 & Horatio & 9 & 35.0 \\ 85 & Art & 3 & 25.5 \\ 95 & Bob & 3 & 63.5 \\ \hline \end{array}\)

Table 2: Reserves R

\(\begin{array}{|l|l|l|} \hline sid & Bid & day \\ \hline 22 & 101 & 10 / 1098 \\ 22 & 108 & 101098 \\ 22 & 108 & 101898 \\ 22 & 104 & 10 / 798 \\ 31 & 108 & 11 / 1098 \\ 31 & 103 & 11 / 699 \\ 31 & 104 & 11 / 298 \\ 64 & 101 & 9558 \\ 64 & 102 & 28858 \\ 74 & 103 & 98958 \\ \hline \end{array}\)

Table 3: Boats B

\(\begin{array}{|l|l|l|} \hline Bid & Bname & Color \\ \hline 101 & Interlake & blue \\ 102 & Interlake & red \\ 103 & Clipper & green \\ 104 & Marine & red \\ \hline \end{array}\)

Which of the following relational algebra query/queries computes/compute the sid’s of sailors with age over 20 who have not reserved red boat ?

\(𝜋 sid (𝛿_{age} >20 Sailors )−𝜋 sid ((𝛿_ {𝑐𝑜𝑙𝑜𝑟} = \ _{𝑟𝑒𝑑} Boats )⋈ Reserves ⋈ Sailors ) \\ \)

\(𝜋 sid ((𝛿_{color} ≠ red ∧ age >20 (Boats ⋈ Sailors ⋈ Reserves ))) \\ \)

\(𝜋 sid ( 𝛿_ {𝑎𝑔𝑒} < 20 Sailors )−𝜋 sid ((𝛿_ {𝑐𝑜𝑙𝑜𝑟} = \ _{𝑟𝑒𝑑} Boats )⋈ Reserves ⋈ Sailors ) \\ \)

\(𝜋 sid (𝛿_{𝑎𝑔𝑒} >20 Sailors )∧𝜋 sid ((𝛿_ {𝑐𝑜𝑙𝑜𝑟} = \ _{𝑟𝑒𝑑} Boats )⋈ Reserves ⋈ Sailors )\)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 92

Read the following and Answer the questions:

Consider the relational schema of sailors S, Reserves B and Boats B.

Table 1: Sailors S

\(\begin{array}{|l|l|l|} \hline Sid & Sname & Ratting & Age \\ \hline 22 & Dustin & 7 & 45.0 \\ 29 & Brutus & 1 & 33.0 \\ 31 & Lubber & 8 & 55.5 \\ 32 & Andy & 8 & 25.5 \\ 58 & Rusty & 10 & 35.0 \\ 64 & Horatio & 7 & 35.0 \\ 71 & Zorba & 10 & 16.0 \\ 74 & Horatio & 9 & 35.0 \\ 85 & Art & 3 & 25.5 \\ 95 & Bob & 3 & 63.5 \\ \hline \end{array}\)

Table 2: Reserves R

\(\begin{array}{|l|l|l|} \hline sid & Bid & day \\ \hline 22 & 101 & 10 / 1098 \\ 22 & 108 & 101098 \\ 22 & 108 & 101898 \\ 22 & 104 & 10 / 798 \\ 31 & 108 & 11 / 1098 \\ 31 & 103 & 11 / 699 \\ 31 & 104 & 11 / 298 \\ 64 & 101 & 9558 \\ 64 & 102 & 28858 \\ 74 & 103 & 98958 \\ \hline \end{array}\)

Table 3: Boats B

\(\begin{array}{|l|l|l|} \hline Bid & Bname & Color \\ \hline 101 & Interlake & blue \\ 102 & Interlake & red \\ 103 & Clipper & green \\ 104 & Marine & red \\ \hline \end{array}\)

Which of the following relational algebra query computes the names of sailor who have reserved all boats?

𝜌 (Tempsids, ( 𝜋 bid Reserves) / 𝜋 bid Boats) 𝜋 sname ((Tempsids) ⋈ Sailors)

𝜌 (Tempsids, ( 𝜋 sid, bid Reserves) / 𝜋 bid Boats) 𝜋 sname ((Tempsids) ⋈ Sailors)

𝜌 (Tempsids. ( 𝜋 sid Sailors) / 𝜋 bid Boats) 𝜋sname ((Tempsids) Sailors)

𝜌 (Tempsids, ( 𝜋 sid Reserves) /𝜋 bid Boats) 𝜋 sname ((Tempsids) ⋈ Boats)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 93

Read the following and Answer the questions:

Consider the relational schema of sailors S, Reserves B and Boats B.

Table 1: Sailors S

\(\begin{array}{|l|l|l|} \hline Sid & Sname & Ratting & Age \\ \hline 22 & Dustin & 7 & 45.0 \\ 29 & Brutus & 1 & 33.0 \\ 31 & Lubber & 8 & 55.5 \\ 32 & Andy & 8 & 25.5 \\ 58 & Rusty & 10 & 35.0 \\ 64 & Horatio & 7 & 35.0 \\ 71 & Zorba & 10 & 16.0 \\ 74 & Horatio & 9 & 35.0 \\ 85 & Art & 3 & 25.5 \\ 95 & Bob & 3 & 63.5 \\ \hline \end{array}\)

Table 2: Reserves R

\(\begin{array}{|l|l|l|} \hline sid & Bid & day \\ \hline 22 & 101 & 10 / 1098 \\ 22 & 108 & 101098 \\ 22 & 108 & 101898 \\ 22 & 104 & 10 / 798 \\ 31 & 108 & 11 / 1098 \\ 31 & 103 & 11 / 699 \\ 31 & 104 & 11 / 298 \\ 64 & 101 & 9558 \\ 64 & 102 & 28858 \\ 74 & 103 & 98958 \\ \hline \end{array}\)

Table 3: Boats B

\(\begin{array}{|l|l|l|} \hline Bid & Bname & Color \\ \hline 101 & Interlake & blue \\ 102 & Interlake & red \\ 103 & Clipper & green \\ 104 & Marine & red \\ \hline \end{array}\)

Which of the following relational algebra query/queries computes/compute the name of sailors who have reserved red boat ?

\(Q1 \ 𝜋 \ sname (( 𝛿_{𝑐𝑜𝑙𝑜𝑟} = \ _{𝑟𝑒𝑑} Boats) ⋈ Reserves ⋈ Sailors) \\ Q2 \ 𝜋 \ sname (𝜋_ {𝑏𝑖𝑑} (( 𝜋_ {𝑏𝑖𝑑} 𝛿_{𝑐𝑜𝑙𝑜𝑟} = \ _{𝑟𝑒𝑑}𝐵𝑜𝑎𝑡𝑠) ⋈ Reserves) ⋈ Sailors) \\ Q3 \ 𝜋 \ sname (( 𝛿_{𝑐𝑜𝑙𝑜𝑟} = \ _{𝑟𝑒𝑑} Reserves) Boats ⋈ Sailors)\)

Both Q1 and Q3

Both Q2 and Q3

Only Q1

Only Q2

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 94

Read the following and Answer the questions:

Consider the relational schema of sailors S, Reserves B and Boats B.

Table 1: Sailors S

\(\begin{array}{|l|l|l|} \hline Sid & Sname & Ratting & Age \\ \hline 22 & Dustin & 7 & 45.0 \\ 29 & Brutus & 1 & 33.0 \\ 31 & Lubber & 8 & 55.5 \\ 32 & Andy & 8 & 25.5 \\ 58 & Rusty & 10 & 35.0 \\ 64 & Horatio & 7 & 35.0 \\ 71 & Zorba & 10 & 16.0 \\ 74 & Horatio & 9 & 35.0 \\ 85 & Art & 3 & 25.5 \\ 95 & Bob & 3 & 63.5 \\ \hline \end{array}\)

Table 2: Reserves R

\(\begin{array}{|l|l|l|} \hline sid & Bid & day \\ \hline 22 & 101 & 10 / 1098 \\ 22 & 108 & 101098 \\ 22 & 108 & 101898 \\ 22 & 104 & 10 / 798 \\ 31 & 108 & 11 / 1098 \\ 31 & 103 & 11 / 699 \\ 31 & 104 & 11 / 298 \\ 64 & 101 & 9558 \\ 64 & 102 & 28858 \\ 74 & 103 & 98958 \\ \hline \end{array}\)

Table 3: Boats B

\(\begin{array}{|l|l|l|} \hline Bid & Bname & Color \\ \hline 101 & Interlake & blue \\ 102 & Interlake & red \\ 103 & Clipper & green \\ 104 & Marine & red \\ \hline \end{array}\)

Which of the following relational algebra query computes the names of sailors who have reserved a red and a green boat ?

\(𝜌 (Tempred, 𝜋 _{sid} ((𝛿_{color} = \ _{‘𝑟𝑒𝑑′} Boats ) ⋈ Reserves)), 𝜌 (Tempgreen. 𝜋 _{sid} ((𝛿_{color} = \ _{‘𝑔𝑟𝑒𝑒𝑛′} \\ Boats ) ⋈ Reserves)), 𝜋 _{sname} (Tempred ∩ Tempgreen) ⋈ Sailors \)

\(𝜌( Tempboats \ 2, (𝛿_ {color} = \ _{‘𝑟𝑒𝑑′} Boats )∩(𝛿 color = \ _{‘𝑔𝑟𝑒𝑒𝑛′} Boats ))𝜋 _{sname} (Tempboats 2 ⋈ Reserves) \\ \)

\(𝜋 sname ((𝛿_{color} = \ _{ ′𝑟𝑒𝑑′} Boats )∩(𝛿_{color} = \ _{ ′𝑔𝑟𝑒𝑒𝑛′} Boats ) (Tempboats ⋈ Sailors ⋈ Reserves)) \)

\(𝜌( Tempboats \ 2, (𝛿 _{𝑐𝑜𝑙𝑜𝑟} = \ _{𝑟𝑒𝑑} Boats 𝛿 _{𝑐𝑜𝑙𝑜𝑟} =\ _{ ‘𝑔𝑟𝑒𝑒𝑛′} Boats )𝜋 _{sname} (Tempboats \ 2 ⋈ sailors)\)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 95

Read the following and Answer the questions:

Consider the relational schema of sailors S, Reserves B and Boats B.

Table 1: Sailors S

\(\begin{array}{|l|l|l|} \hline Sid & Sname & Ratting & Age \\ \hline 22 & Dustin & 7 & 45.0 \\ 29 & Brutus & 1 & 33.0 \\ 31 & Lubber & 8 & 55.5 \\ 32 & Andy & 8 & 25.5 \\ 58 & Rusty & 10 & 35.0 \\ 64 & Horatio & 7 & 35.0 \\ 71 & Zorba & 10 & 16.0 \\ 74 & Horatio & 9 & 35.0 \\ 85 & Art & 3 & 25.5 \\ 95 & Bob & 3 & 63.5 \\ \hline \end{array}\)

Table 2: Reserves R

\(\begin{array}{|l|l|l|} \hline sid & Bid & day \\ \hline 22 & 101 & 10 / 1098 \\ 22 & 108 & 101098 \\ 22 & 108 & 101898 \\ 22 & 104 & 10 / 798 \\ 31 & 108 & 11 / 1098 \\ 31 & 103 & 11 / 699 \\ 31 & 104 & 11 / 298 \\ 64 & 101 & 9558 \\ 64 & 102 & 28858 \\ 74 & 103 & 98958 \\ \hline \end{array}\)

Table 3: Boats B

\(\begin{array}{|l|l|l|} \hline Bid & Bname & Color \\ \hline 101 & Interlake & blue \\ 102 & Interlake & red \\ 103 & Clipper & green \\ 104 & Marine & red \\ \hline \end{array}\)

Which of the following relational algebra query/queries computes/compute the name of sailors who have reserved boat 103 ?

\(Q1 𝜋 _{sname} (( 𝛿_{𝑏𝑖𝑑} = 103 Boats) ⋈ Sailors) \\ Q2 𝜋 _{sname} = ( 𝛿_{𝑏𝑖𝑑} = 103(Reserves ⋈ Sailors)) \\ Q3 𝜋 _{sname} = (( 𝛿_{𝑏𝑖𝑑} = 103 Reserves) ⋈ Sailors)\)

Both Q1 and Q3

Both Q2 and Q3

Only Q3

Only Q2

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 96

Based on the following passage, answer the Questions :

A 3000 km long trunk operates at 1.536mbps and is used to transmit 64 bytes frames and uses sliding window protocol. The propagation speed is 6𝜇 sec/km.
The transmission and propagation delays are respectively

T_t=333.33 𝜇 sec,T_p=18000 𝜇 sec

𝑇_𝑡=300 𝜇 sec,𝑇_𝑝=15360 𝜇 sec

T_t=33.33 𝜇 sec,T_p=1800 𝜇 sec

𝑇_t=1800 𝜇 sec,𝑇p=33.33 𝜇 sec

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 97

Based on the following passage, answer the Questions :

A 3000 km long trunk operates at 1.536mbps and is used to transmit 64 bytes frames and uses sliding window protocol. The propagation speed is 6 𝜇 sec/km.

The sender window size to get the maximum efficiency is

108

109

55

56

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 98

Based on the following passage, answer the Questions :

A 3000 km long trunk operates at 1.536mbps and is used to transmit 64 bytes frames and uses sliding window protocol. The propagation speed is 6 𝜇 sec/km.

The maximum achievable throughput is

0.768

0.678

0.901

0.887

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 99

Based on the following passage, answer the Questions :

A 3000 km long trunk operates at 1.536mbps and is used to transmit 64 bytes frames and uses sliding window protocol. The propagation speed is 6 𝜇 sec/km.
The minimum number of bits required in the sequence number field of the packet is

6 bits

7 bits

5 bits

4 bits

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 100

Based on the following passage, answer the Questions:

A 3000 km long trunk operates at 1.536mbps and is used to transmit 64 bytes frames and uses sliding window protocol. The propagation speed is 6 𝜇 sec/km.
If only 6 bits are reserved for sequence number field, then the efficiency of the system is

0.587

0.875

0.578

0.50

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

UGC NET CSE - June 2022 | PAPER - II