Turing Prep | Previous Year Questions | UGC NET CSE - August 2016

Question : 1

A ripple counter is a (n) :

Synchronous Counter

Asynchronous counter

Parallel counter

None of the above

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 2

8085 microprocessor has ____ bit ALU.

32

16

8

4

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 3

The register that stores the bits required to mask the interrupts is ______.

Status register

Interrupt service register

Interrupt mask register

Interrupt request register

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 4

Which of the following in 8085 microprocessor performs

HL = HL + HL ?

DAD D

DAD H

DAD B

DAD SP

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 5

In ______ addressing mode, the operands are stored in the memory. The address of the corresponding memory location is given in a register which is specified in the instruction.

Register direct

Register indirect

Base indexed

Displacement

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 6

The output of the following combinational circuit

is :

$X . Y$

$X + Y$

$X \oplus Y$

$\overline {X \oplus Y}$

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 7

Which of the following statements is/are True regarding some advantages that an objectoriented DBMS (OODBMS) offers over a relational database ?

I. An OODBMS avoids the “impedance mismatch” problem.

II. An OODBMS avoids the “phantom” problem.

III. An OODBMS provides higher performance concurrency control than most relational databases.

IV. An OODBMS provides faster access to individual data objects once they have been read from disk.

II and III only

I and IV only

I, II, and III only

I, III and IV only

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 8

The Global conceptual Schema in a distributed database contains information about global relations. The condition that all the data of the global relation must be mapped into the fragments, that is, it must not happen that a data item which belongs to a global relation does not belong to any fragment, is called :

Disjointness condition

Completeness condition

Reconstruction condition

Aggregation condition

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 9

Suppose database table $𝑇1(𝑃,𝑅)$ currently has tuples $(10,5),(15,8),(25,6)$ and table $𝑇2(𝐴,𝐶)$ currently has $(10,6),(25,3),(10,5)$. Consider the following three relational algebra queries $𝑅𝐴1,𝑅𝐴2$ and $𝑅𝐴3$:

$𝑅𝐴1$ : $T1 \Join _{T1.P = T2.A}$ where $\Join$ is natural join symbol

$𝑅𝐴2$ : $T1 =\Join _{T1.P = T2.A}$ where $=\Join$ is left outer join symbol

$𝑅𝐴3$ : $T1 \Join_{T1.P = T2.A}$ and $_{T1.R = T2.C} T2$

The number of tuples in the resulting table of $RA1, RA2$ and $RA3$ are given by :

2,4,2 respectively

2,3,2 respectively

3,3,1 respectively

3,4,1 respectively

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 10

Consider the table R with attributes A, B and C. The functional dependencies that hold on

R are : A → B, C → AB. Which of the following statements is/are True ?

I. The decomposition of R into R1(C, A) and R2(A, B) is lossless.

II. The decomposition of R into R1(A, B) and R2(B, C) is lossy.

Only I

Only II

Both I and II

Neither I nor II

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 11

Consider the following ORACLE relations : One (𝑥,𝑦)=,,,,, Two (𝑥,𝑦)=,,,,,,, Consider the following two 𝑆𝑄𝐿 queries 𝑆𝑄1 and 𝑆𝑄2 :

SQ1 :

SELECT * FROM One)

EXCEPT

(SELECT * FROM Two);

SQ2 :

SELECT * FROM One)

EXCEPT ALL

(SELECT * FROM Two);

For each of the SQL queries, what is the cardinality (number of rows) of the result obtained when applied to the instances above ?

2 and 1 respectively

1 and 2 respectively

2 and 2 respectively

1 and 1 respectively

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 12

Which one of the following pairs is correctly matched in the context of database design ?

$\begin{array}{|l|l|l|l|}\hline & \text{List-I(Database term)} && \text{List-II(Definition)} \\\hline \text{I.} & \text{Specialization} & \text{A.} & \text{ Result of taking the union of two or more} \\ &&&\text{disjoint (lower-level) entity sets to produce} \\&&&\text{a higher-level entity set.} \\\hline \text{II.} & \text{Generalization} & \text{B.} & \text{Express the number of entities to which} \\ &&& \text{another entity can be associated via a} \\ &&& \text{relationship set.} \\\hline \text{III.} & \text{Aggregation} & \text{C.} & \text{Result of taking a subset of a higher-level} \\ &&& \text{entity set to form a lower-level entity set.} \\\hline \text{IV.} & \text{Mapping cardinality} & \text{D.} & \text{An abstraction in which relationship sets} \\&&& \text{(along with their associated entity sets) are} \\ &&& \text{treated as higher-level entity sets, and can} \\ &&& \text{participate in relationships. } \\\hline \end{array}$

Codes :

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

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

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

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

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 13

Consider a raster grid having 𝑋𝑌-axes in positive 𝑋-direction and positive upward 𝑌-direction with 𝑋_𝑚𝑎𝑥= 10, 𝑋_𝑚𝑖𝑛= –5, 𝑌_𝑚𝑎𝑥= 11, and 𝑌_𝑚𝑖𝑛= 6. What is the address of memory pixel with location (5,4) in raster grid assuming base address 1 (one) ?

150

151

160

161

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 14

Consider a N-bit plane frame buffer with W-bit wide lookup table with W > N. How many intensity levels are available at a time ?

2^N

2^W

2^N+W

2^N–1

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 15

Consider the Breshenham’s line generation algorithm for a line with gradient greater than one, current point $(𝑥_𝑖,𝑦_𝑖)$ and decision parameter, $𝑑_𝑖$. The next point to be plotted $ (𝑥_𝑖+1,𝑦_𝑖+1) $ and updated decision parameter, $𝑑_𝑖$ +1, for $𝑑_𝑖<0$ are given as _______.

$x_{ i+1} = x _{i +1} \\ y_{i+1} = y_{i} \\ d_{i+1} = d_{i} + 2 dy$

$x _{i+1} = x _{i} \\ y_{i+1} = y_{i + 1} \\ d_{i+1} = d_{i} + 2 dx$

$x _{i+1} = x_{ i} \\ y_{i+1} = y_{i + 1} \\ d_{i+1} = d_{i} + 2 (dx – dy)$

$x_{ i+1} = x_{ i + 1} \\ y_{i+1} = y_{i + 1} \\ d_{i+1} = d_{i} + 2 (dy – dx)$

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 16

A point P(2, 5) is rotated about a pivot point (1, 2) by 60°. What is the new transformed point P' ?

(1, 4)

(–1, 4)

(1, – 4)

(– 4, 1)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 17

In perspective projection (from 3D to 2D), objects behind the centre of projection are projected upside down and backward onto the view-plane. This is known as _____.

Topological distortion

Vanishing point

View confusion

Perspective foreshortening

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 18

The Liang-Barsky line clipping algorithm uses the parametric equation of a line from $(x_{1} , y_{1} )$ to $(x_{2} , y_{2} )$ along with its infinite extension which is given as :

$x = x_{1} + \Delta x.u$

$y = y_{1} + \Delta y.u$

Where $\Delta x = x_{2} – x_{1} , \Delta y = y_{2} – y_{1}$, and $𝑢$ is the parameter with $0 \leq u \leq 1$. A line $𝐴𝐵$ with end points $𝐴(–1,7)$ and $𝐵(11,1)$ is to be clipped against a rectangular window with $x_{min} = 1, x_{max} = 9, y_{min} = 2$, and $y_{max} = 8$. The lower and upper bound values of the parameter u for the clipped line using Liang-Barsky algorithm is given as :

$(0, \frac{2}{3})$

$\left(\frac{1}{6},\frac{5}{6}\right)$

$(0, \frac{1}{3})$

$(0, 1)$

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 19

Match the following with reference to Functional programming history :

$\begin{array}{clcl} \text{a.} & \text{Lambda calculus} & \text{i.} & \text{Church, 1932} \\ \text{b.} & \text{Lambda calculus as} & \text{ii.} & \text{Wordsworth, 1970} \\ & \text{programming language} \\ \text{c.} & \text{Lazy evaluation} & \text{iii.} & \text{Haskel, 1990} \\ \text{d.} & \text{Type classes} & \text{iv.} & \text{Mecarthy, 1960} \\ \end{array}$

Codes :

a-iv, b-i, c-iii, d-ii

a-i, b-iv, c-ii, d-iii

a-iii, b-ii, 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 : 20

Aliasing in the context of programming languages refers to :

Multiple variables having the same location

Multiple variables having the same identifier

Multiple variables having the same value

Multiple use of same variable

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 21

Assume that the program ‘𝑃′ is implementing parameter passing with ‘call by reference’. What will be printed by following print statements in 𝑃?

Program P

{

x=10;

y=3;

funb(y,x,x)

print x;

print y;

}

funb (x,y,z)

{

y=y+4;

z=x+y+z;

}

10, 7

31, 3

10, 3

31, 7

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 22

The regular grammar for the language $L = \{a^{n}b^{m} | \ n + m \ \ is \ even \}$ is given by

S → S₁ | S₂

S₁ → a S₁ | A₁

A₁ → b A₁ | λ

S₂ → aaS₂ | A₂

A₂ → b A₂ | λ

S → S₁ | S₂

S₁ → a S₁ | a A₁

S₂ → aa S₂ | A₂

A₁ → bA₁ | λ

A₂ → bA₂ | λ

S → S₁ | S₂

S₁ → aaa S₁ | aA₁

S₂ → aaS₂ | A₂

A₁ → bA₁ | λ

A₂ → bA₂ | λ

S → S₁ | S₂

S₁ → aa S1 | A₁

S₂ → aaS₂ | aA₂

A₁ → bbA₁ | λ

A₂ → bbA₂ | b

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 23

Let $Σ=𝑎,𝑏$ and language $𝐿=𝑎𝑎,𝑏𝑏$. Then, the complement of $𝐿$ is

$\left\{\lambda, a, b, ab, ba \right\} \cup \left\{w \in\left\{a, b\right\}^{*} | |w| > 3 \right\}$

$\left\{a, b, ab, ba \right\} \cup \left\{w \in \left\{a, b\right\}^{*} | |w| \geq 3 \right\}$

$\left\{w \in \left\{a, b\right\}^{*} | |w| > 3\right\} \cup \left\{a, b, ab, ba \right\}$

$\left\{\lambda, a, b, ab, ba\right\} \cup \left\{w \in \left\{a, b\right\}^{*} | |w| \geq 3 \right\}$

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 24

Consider the following identities for regular expressions :

(a) (r + s)* = (s + r)*

(b) (r*)* = r*

(c) (r* s*)* = (r + s)*

Which of the above identities are true ?

(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 : 25

Suppose transmission rate of a channel is 32 kbps. If there are ‘8’ routes from source to destination and each packet p contains 8000 bits. Total end to end delay in sending packet P is _____.

2 sec

3 sec

4 sec

1 sec

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 26

Consider the following statements :

A. High speed Ethernet works on optic fiber.

B. A point to point protocol over Ethernet is a network protocol for encapsulating PPP frames inside Ethernet frames.

C. High speed Ethernet does not work on optic fiber.

D. A point to point protocol over Ethernet is a network protocol for encapsulating Ethernet frames inside PPP frames.

Which of the following is correct ?

A and B are true; C and D are false.

A and B are false; C and D are true.

A, B, C and D are true.

A, B, C and D are false.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 27

In CRC checksum method, assume that given frame for transmission is 1101011011 and the generator polynomial is $G(x) = x^{4}+ x + 1$.

After implementing CRC encoder, the encoded word sent from sender side is _____.

11010110111110

11101101011011

110101111100111

110101111001111

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 28

A slotted ALOHA network transmits 200 bits frames using a shared channel with 200 kbps bandwidth. If the system (all stations put together) produces 1000 frames per second, then the throughput of the system is _______.

0.268

0.468

0.368

0.568

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 29

An analog signal has a bit rate of 8000 bps and a baud rate of 1000.

Then analog signal has _____ signal elements and carry _____ data elements in each signal.

256, 8 bits

128, 4 bits

256, 4 bits

128, 8 bits

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 30

The plain text message BAHI encrypted with RSA algorithm using e = 3, d = 7 and n = 33 and the characters of the message are encoded using the values 00 to 25 for letters A to Z. Suppose character by character encryption was implemented. Then, the Cipher Text message is _____.

ABHI

HAQC

IHBA

BHQC

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 31

Consider the problem of a chain <A₁,A₂, A₃, A₄> of four matrices. Suppose that the dimensions of the matrices A₁ , A₂ , A₃ and A₄ are 30 × 35, 35 × 15, 15 × 5 and 5 × 10 respectively. The minimum number of scalar multiplications needed to compute the product A₁A₂A₃A₄ is ____.

14875

21000

9375

11875

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 32

Consider a hash table of size $𝑚=10000$, and the hash function $h(K) = floor (m(KA \bmod 1))$ for $A = ( \sqrt{5} – 1)/2$. The key 123456 is mapped to location ______.

46

41

43

48

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 33

Consider a weighted complete graph $𝐺$ on the vertex set $\{𝜈_1,𝜈_2,....𝜈_𝑛\}$ such that the weight of the edge $(𝜈_𝑖,𝜈_𝑗)$ is $4|𝑖–𝑗|.$ The weight of minimum cost spanning tree of $𝐺$ is :

$4n^2$

$n$

$4n - 4$

$2n - 2$

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 34

A priority queue is implemented as a max-heap. Initially, it has five elements. The levelorder traversal of the heap is as follows :

20, 18, 15, 13, 12

Two new elements ‘10’ and ‘17’ are inserted in the heap in that order. The level-order traversal of the heap after the insertion of the element is :

20, 18, 17, 15, 13, 12, 10

20, 18, 17, 12, 13, 10, 15

20, 18, 17, 10, 12, 13, 15

20, 18, 17, 13, 12, 10, 15

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 35

If there are n integers to sort, each integer has d digits, and each digit is in the set {1, 2, …, k}, radix sort can sort the numbers in :

O (k (n + d))

O (d (n + k))

O ((n + k) l g d)

O ((n + d) l g k)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 36

Match the following :

$\begin{array}{clcl} \text{a.} & \text{Prim’s algorithm} & \text{i.} & \text{$O(V^2E)$} \\ \text{b.} & \text{Bellman-Ford algorithm} & \text{ii.} & \text{$O(VElgV)$} \\ \text{c.} & \text{Floyd-Warshall algorithm} & \text{iii.} & \text{$O(ElgV)$} \\ \text{d.} & \text{Johnson’s algorithm} & \text{iv.} & \text{$O(V^3)$} \\ \end{array}$

where $𝑉$ is the set of nodes and $𝐸$ is the set of edges in the graph.

Codes :

a-i, b-iii, c-iv, d-ii

a-i, b-iii, c-ii, d-iv

a-iii, b-i, c-iv, d-ii

a-iii, b-i, c-ii, d-iv

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 37

Constructors have _____ return type.

void

char

int

no

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 38

Method over-riding can be prevented by using final as a modifier at ______.

the start of the class.

the start of method declaration.

the start of derived class.

the start of the method declaration in the derived class.

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 39

Which of the following is a correct statement ?

Composition is a strong type of association between two classes with full ownership.

Composition is a strong type of association between two classes with partial ownership.

Composition is a weak type of association between two classes with partial ownership.

Composition is a weak type of association between two classes with strong ownership.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 40

Which of the following is not a correct statement ?

Every class containing abstract method must be declared abstract.

Abstract class can directly be initiated with ‘new’ operator.

Abstract class can be initiated.

Abstract class does not contain any definition of implementatio

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 41

Which of the following tag in HTML is used to surround information, such as signature of the person who created the page ?

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 42

Java uses threads to enable the entire environment to be ______.

Symmetric

Asymmetric

Synchronous

Asynchronous

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 43

An Operating System (OS) crashes on the average once in 30 days, that is, the Mean Time Between Failures (MTBF) = 30 days. When this happens, it takes 10 minutes to recover the OS, that is, the Mean Time To Repair (MTTR) = 10 minutes. The availability of the OS with these reliability figures is approximately :

96.97%

97.97%

99.009%

99.97%

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 44

Match each software lifecycle model in List – I to its description in List – II :

$\begin{array}{clcl} \text{} & \textbf{List-I} && \textbf{List-II} \\ \text{I.} & \text{Code-and-Fix} & \text{a.} & \text{Assess risks at each step; do most critical} \\ &&& \text{action first} \\ \text{II.} & \text{Evolutionary} & \text{b.} & \text{Build an initial small requirement specifications,} \\ &&&\text{code it, then “evolve” the specifications and code} \\ &\text{Prototyping}&& \text{as needed} \\ \text{III.} & \text{Spiral} & \text{c.} & \text{Build initial requirement specification for several}\\ &&& \text{releases, then design-and-code in sequence} \\ \text{IV.} & \text{Stagged delivery} & \text{d.} & \text{ Standard phases (requirements, design, code, test)} \\&&&\text{in order} \\ \text{V.} & \text{Waterfall} & \text{e.} & \text{Write some code,debug it, repeat(i.e. ad-hoc)} \\ \end{array}$

Codes :

I-e, II-b, III-a, IV-c, V-d

I-e,II-c, III-a IV-b, V-d

I-d, II-a, III-b, IV-c, V-e

I-c, II-e, III-a, IV-b, V-d

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 45

Match each software term in List – I to its description in List – II :

$\begin{array}{clcl} & \textbf{List-I} && \textbf{List-II} \\ \text{I.} & \text{Wizards} & \text{a.} & \text{forms that provides structure} \\ &&& \text{for a document.} \\ \text{II.} & \text{Templates} & \text{b.} & \text{A series of commands grouped} \\ &&& \text{into a single command.} \\ \text{III.} & \text{Macros} & \text{c.} & \text{A single program that incorporates} \\ && & \text{most commonly used tools.} \\ \text{IV.} & \text{Integrated Software} & \text{d.} & \text{step by step guide in application } \\ &&& \text{software.} \\ \text{V.} & \text{Software Suite} & \text{e.} & \text{Bundled group of software program} \\ \end{array}$

Codes :

a-ii, b-iii, c-iv, d-i, e-v

a-ii, b-i, c-iv, d-iii, e-v

a-iv, b-iii, c-v, d-i, e-ii

a-iv, b-iii, c-ii, d-v, e-i

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 46

The ISO quality assurance standard that applies to software Engineering is

ISO 9000 : 2004

ISO 9001 : 2000

ISO 9002 : 2001

ISO 9003 : 2004

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 47

Which of the following are external qualities of a software product ?

Maintainability, reusability, portability, efficiency, correctness.

Correctness, reliability, robustness, efficiency, usability.

Portability, interoperability, maintainability, reusability.

Robustness, efficiency, reliability, maintainability, reusability.

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 48

Which of the following is/are CORRECT statement(s) about version and release ?

I. A version is an instance of a system, which is functionally identical but nonfunctionally distinct from other instances of a system.

II. A version is an instance of a system, which is functionally distinct in some way from other system instances.

III. A release is an instance of a system, which is distributed to users outside of the development team.

IV. A release is an instance of a system, which is functionally identical but nonfunctionally distinct from other instances of a system.

I and III

II and IV

I and IV

II and III

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 49

The Unix Operating System Kernel maintains two key data structures related to processes, the process table and the user structure. Now, consider the following two statements :

I. The process table is resident all the time and contain information needed for all processes, even those that are not currently in memory.

II. The user structure is swapped or paged out when its associated process is not in memory, in order not to waste memory on information that is not needed.

Which of the following options is correct with reference to above statements ?

Only (I) is correct.

Only (II) is correct.

Both (I) and (II) are correct.

Both (I) and (II) are wrong.

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 50

Consider a system which have ‘n’ number of processes and ‘m’ number of resource types. The time complexity of the safety algorithm, which checks whether a system is in safe state or not, is of the order of :

O(mn)

O(m² n ²)

O(m² n)

O(mn²)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 51

An operating system supports a paged virtual memory, using a central processor with a cycle time of one microsecond. It costs an additional one microsecond to access a page other than the current one. Pages have 1000 words, and the paging device is a drum that rotates at 3000 revolutions per minute and transfers one million words per second. Further, one percent of all instructions executed accessed a page other than the current page. The instruction that accessed another page, 80% accessed a page already in memory and when a new page was required, the replaced page was modified 50% of the time. What is the effective access time on this system, assuming that the system is running only one process and the processor is idle during drum transfers ?

30 microseconds

34 microseconds

60 microseconds

68 microseconds

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 52

Consider the following page reference string :

1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6

Which of the following options, gives the correct number of page faults related to LRU, FIFO, and optimal page replacement algorithms respectively, assuming 05 page frames and all frames are initially empty ?

10, 14, 8

8, 10, 7

7, 10, 8

7, 10, 7

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 53

Consider a file currently consisting of 50 blocks. Assume that the file control block and the index block is already in memory. If a block is added at the end (and the block information to be added is stored in memory), then how many disk I/O operations are required for indexed (single-level) allocation strategy ?

1

101

27

0

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 54

An experimental file server is up 75% of the time and down for 25% of the time due to bugs. How many times does this file server have to be replicated to give an availability of at least 99% ?

2

4

8

16

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 55

Given the following two languages :

$L_{1} = \{uww^{R} ν | u, v, w \in (a, b)^{+}\} \\ L_{2} = \{uww^{R} ν | u, ν, w \in (a, b)^{+} , |u| \geq |ν|\}$

Which of the following is correct ?

𝐿₁ is regular language and 𝐿₂ is not regular language.

𝐿₁ is not regular language and 𝐿₂ is regular language.

Both 𝐿₁ and 𝐿₂ are regular languages.

Both 𝐿₁ and 𝐿₂ are not regular languages.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 56

Given a Turing Machine

M = ({q₀ , q₁ }, {0, 1}, {0, 1, B}, δ, B, {q₁ })

Where δ is a transition function defined as

δ(q₀ , 0) = (q₀ , 0, R)

δ(q₀ , B) = (q₁ , B, R) The language L(M) accepted by Turing machine is given as :

0^* 1^*

00^*

10^*

1^*0^*

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 57

Let $𝐺=(𝑉,𝑇,𝑆,𝑃)$ be a context-free grammar such that every one of its productions is of the form $𝐴→𝜈$, with $|𝜈|=𝑘>1$. The derivation tree for any string $𝑊∈𝐿(𝐺)$ has a height such that

$h < \frac{(|W|-1)}{k-1}$

$\log_{k} |W| \leq h$

$\log_{k} |W| < h < \frac{(|W|-1)}{k-1}$

$\log_{k} |W| \leq h \leq \frac{(|W|-1)}{k-1}$

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 58

Which of the following is not used in standard JPEG image compression ?

Huffman coding

Runlength encoding

Zig-zag scan

K-L Transform

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 59

Which of the following is a source coding technique ?

Huffman coding

Arithmetic coding

Run-length coding

DPCM

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 60

If the histogram of an image is clustered towards origin on X-axis of a histogram plot then it indicates that the image is ______.

Dark

Good contrast

Bright

Very low contrast

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 61

Consider the following linear programming problem :

$\ Max. z = 0.50 x_{2} – 0.10x_{1}$

Subject to the constraints

$2x_{1} + 5x_{2} \leq 80 \\ x_{1} + x_{2} \leq 20 \\ and \ \ x_{1}, x_{2} \geq 0$

The total maximum profit ($z$) for the above problem is :

6

8

10

12

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 62

Consider the following statements :

(a) If primal (dual) problem has a finite optimal solution, then its dual (primal) problem has a finite optimal solution.

(b) If primal (dual) problem has an unbounded optimum solution, then its dual (primal) has no feasible solution at all.

(c) Both primal and dual problems may be infeasible. Which of the following is correct ?

(a) and (b) only

(a) and (c) only

(b) and (c) only

(a), (b) and (c)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 63

Consider the following statements :

(a) Assignment problem can be used to minimize the cost.

(b) Assignment problem is a special case of transportation problem.

(c) Assignment problem requires that only one activity be assigned to each resource.

Which of the following options is correct ?

(a) and (b) only

(a) and (c) only

(b) and (c) only

(a), (b) and (c)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 64

What are the following sequence of steps taken in designing a fuzzy logic machine ?

Fuzzification → Rule evaluation → Defuzzification

Fuzzification → Defuzzification → Rule evaluation

Rule evaluation → Fuzzification → Defuzzification

Rule evaluation → Defuzzification → Fuzzification

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 65

Which of the following 2 input Boolean logic functions is linearly inseparable ?

(a) AND (b) OR

(c) NOR (d) XOR

(e) NOT XOR

(a) and (b)

(b) and (c)

(c), (d) and (e)

(d) and (e)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 66

Let R and S be two fuzzy relations defined as

Then, the resulting relation, T, which relates elements of universe of X to elements of universe of Z using max-product composition is given by

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 67

Consider the following operations to be performed in Unix :

“The pipe sorts all files in the current directory modified in the month of “June” by order of size and prints them to the terminal screen. The sort option skips ten fields then sorts the lines in numeric order.”

Which of the following Unix command will perform above set of operations ?

ls – l | grep “June” | sort + 10n

ls – l | grep “June” | sort + 10r

ls – l | grep – v “June” | sort + 10n

ls – l | grep – n “June” | sort + 10x

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 68

Which of the following statements is incorrect for a Windows Multiple Document Interface (MDI) ?

Each document in an MDI application is displayed in a separate child window within the client area of the application’s main window.

An MDI application has three kinds of windows namely a frame window, an MDI client window and number of child windows.

An MDI application can support more than one kind of document.

An MDI application displays output in the client area of the frame window.

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 69

Which of the following statement(s) is/are True regarding ‘nice’ command of UNIX ?

I. It is used to set or change the priority of a process.

II. A process’s nice value can be set at the time of creation.

III. ‘nice’ takes a command line as an argument.

I, II only

II, III only

I, II, III

I, III only

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 70

Let 𝜈(𝑥) mean 𝑥 is a vegetarian, 𝑚(𝑦) for 𝑦 is meat, and 𝑒(𝑥,𝑦) for 𝑥 eats 𝑦. Based on these, consider the following sentences :

I. ∀𝑥∨(𝑥) ⇔ (∀𝑦 𝑒(𝑥,𝑦) ⟹ ¬𝑚(𝑦))

II.∀𝑥∨(𝑥) ⇔ (¬(∃𝑦 𝑚(𝑦) ∧ 𝑒(𝑥,𝑦)))

III.∀𝑥(∃𝑦 𝑚(𝑦) ∧ 𝑒(𝑥,𝑦)) ⇔ (𝑥 ) ⇔ ¬∨(𝑥)

One can determine that

Only 𝐼 and 𝐼𝐼 are equivalent sentences

Only 𝐼𝐼 and 𝐼𝐼𝐼 are equivalent sentences.

Only 𝐼 and 𝐼𝐼𝐼 are equivalent sentence .

𝐼,𝐼𝐼, and 𝐼𝐼𝐼 are equivalent sentences.

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 71

Match each Artificial Intelligence term in List-I that best describes a given situation in List-II :

$\begin{array}{clcl} & \textbf{List-I} && \textbf{List-II} \\ \text{I.} & \text{Semantic Network} & \text{a.} & \text{Knowledge about what to do as} \\ &&& \text{opposed to how to do it} \\ \text{II.} & \text{Frame} & \text{b.} & \text{A premise of rule that is not concluded} \\ &&& \text{by any rule} \\ \text{III.} & \text{Declarative Knowledge} & \text{c.} & \text{A method of knowledge representation that} \\ &&& \text{uses a graph} \\ \text{IV.} & \text{Primitive} & \text{d.} & \text{A data structure representing stereotypical} \\ &&& \text{knowledge} \\ \end{array}$

Codes :

I-d, II-a, III-b, IV-c

I-d, II-c, III-a, IV-b

I-d, II-c, III-b, IV-a

I-c, II-d, III-a, IV-b

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 72

In Artificial Intelligence , a semantic network

is a graph-based method of knowledge representation where nodes represent concepts and arcs represent relations between concepts.

is a graph-based method of knowledge representation where nodes represent relations between concepts and arcs represent concepts.

represents an entity as a set of slots and associated rules.

is a subset of first-order logic.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 73

Criticism free idea generation is a factor of _____.

Decision Support System

Group Decision Support System

Enterprise Resource Support System

Artificial Intelligence

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 74

Consider the following logical inferences :

I₁ : If it is Sunday then school will not open.

The school was open. Inference :

It was not Sunday.

I₂ : If it is Sunday then school will not open.

It was not Sunday. Inference :

The school was open.

Which of the following is correct ?

Both I₁ and I₂ are correct inferences.

I₁ is correct but I₂ is not a correct inference.

I₁ is not correct but I₂ is a correct inference.

Both I₁ and I₂ are not correct inferences.

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 75

Which formal system provides the semantic foundation for Prolog ?

Predicate calculus

Lambda calculus

Hoare logic

Propositional logic

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

UGC NET CSE - August 2016 | PAPER - III