Turing Prep | Previous Year Questions | UGC NET CSE - December 2014

Question : 1

A hierarchical memory system that uses cache memory has cache access time of 50 nano seconds, main memory access time of 300 nano seconds, 75% of memory requests are for read, hit ratio of 0.8 for read access and the write-through scheme is used. What will be the average access time of the system both for read and write requests ?

157.5 n.sec.

110 n.sec.

75 n.sec.

82.5 n.sec.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 2

For switching from a CPU user mode to the supervisor mode following type of interrupt is most appropriate

Internal interrupts

External interrupts

Software interrupts

None of the above

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 3

In a dot matrix printer the time to print a character is 6 m.sec., time to space in between characters is 2 m.sec., and the number of characters in a line are 200. The printing speed of the dot matrix printer in characters per second and the time to print a character line are given by which of the following options ?

125 chars/second and 0.8 seconds

250 chars/second and 0.6 seconds

166 chars/second and 0.8 seconds

250 chars/second and 0.4 seconds

Correct Answer : MTA

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 4

Match the following 8085 instructions with the flags :

$\begin{array}{} {} & {\textbf{List – I}} & {} & {\textbf{List – II}} \\ \text{a.} & \text{XCHG} & \text{i.} & \text{Only carry flag is affected }\\ \text{b.} & \text{SUB} & \text{ii.} & \text{No flags are affected}\\ \text{c.} & \text{STC} & \text{iii.} & \text{All flags other than carry are affected} \\ \text{d.} & \text{DCR} & \text{iv.} & \text{All flags are affected}\\ \end{array}$

Codes :

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

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

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

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

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 5

How many times will the following loop be executed ?

LXI B, 0007 H

LOP : DCX B

MOV A, B

ORA C

JNZ LOP

05

07

09

00

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 6

Specify the contents of the accumulator and the status of the S, Z and CY flags when 8085 microprocessor performs addition of 87 H and 79 H.

11, 1, 1, 1

10, 0, 1, 0

01, 1, 0, 0

00, 0, 1, 1

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 7

Location transparency allows :

I. Users to treat the data as if it is done at one location.

II. Programmers to treat the data as if it is at one location.

III. Managers to treat the data as if it is at one location.

Which one of the following is correct ?

I, II and III

I and II only

II and III only

II only

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 8

Which of the following is correct ?

I. Two phase locking is an optimistic protocol.

II. Two phase locking is pessimistic protocol

III. Time stamping is an optimistic protocol.

IV. Time stamping is pessimistic protocol.

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 : 9

__________ rules used to limit the volume of log information that has to be handled and processed in the event of system failure involving the loss of volatile information.

Write-ahead log

Check-pointing

Log buffer

Thomas

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 10

Let R = ABCDE is a relational scheme with functional dependency set F = {A → B, B → C, AC → D}. The attribute closures of A and E are

ABCD, φ

ABCD, E

Φ, φ

ABC, E

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 11

Consider the following statements :

I. Re-construction operation used in mixed fragmentation satisfies commutative rule.

II. Re-construction operation used in vertical fragmentation satisfies commutative rule

Which of the following is correct ?

I

II

Both are correct

None of the statements are correct.

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 12

Which of the following is false ?

Every binary relation is never be in BCNF.

Every BCNF relation is in 3NF.

1 NF, 2 NF, 3 NF and BCNF are based on functional dependencies.

Multivalued Dependency (MVD) is a special case of Join Dependency (JD).

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 13

Which of the following categories of languages do not refer to animation languages ?

Graphical languages

General-purpose languages

Linear-list notations

None of the above

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 14

Match the following :

$\begin{array}{clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{Tablet, Joystick} & \text{i.} & \text{Continuous devices} \\ \text{b.} & \text{Light pen, Touch screen} & \text{ii.} & \text{Direct devices} \\ \text{c.} & \text{Locator, keyboard} & \text{iii.} & \text{Logical devices} \\ \text{d. }& \text{Data Globe, Sonic pen} & \text{iv.} & \text{3D interaction devices} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 15

A technique used to approximate halftones without reducing spatial resolution is known as _________.

Halftoning

Dithering

Error diffusion

None of the above

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 16

Consider a triangle represented by A(0, 0), B(1, 1), C(5, 2). The triangle is rotated by 45 degrees about a point P(–1, –1). The co-ordinates of the new triangle obtained after rotation shall be _______

$A'(-1, \sqrt{2}-1), B'(-1, 2\sqrt{2}-1), C'\left(\frac{3}{2}\sqrt{2}-1, \frac{9}{2}\sqrt{2}-1\right)$

$A'(\sqrt{2}-1, -1), B'(2\sqrt{2}-1, -1), C'\left(\frac{3}{2}\sqrt{2}-1, \frac{9}{2}\sqrt{2}-1\right)$

$A'(-1, \sqrt{2}-1), B'(2\sqrt{2}-1, -1), C'\left(\frac{3}{2}\sqrt{2}-1, \frac{9}{2}\sqrt{2}-1\right)$

$A'(-1, \sqrt{2}-1), B'(2\sqrt{2}-1, -1), C'\left(\frac{9}{2}\sqrt{2}-1, \frac{3}{2}\sqrt{2}-1\right)$

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 17

In Cyrus-Beck algorithm for line clipping the value of t parameter is computed by the relation :

(Here P₁ and P₂ are the two end points of the line, f is a point on the boundary, n₁ is inner normal)

$\frac{(P_{1}-f_{i}).n_{i}}{(P_{2}-P_{1}).n_{i}}$

$\frac{(f_{i}-P_{1}).n_{i}}{(P_{2}-P_{1}).n_{i}}$

$\frac{(P_{2}-f_{i}).n_{i}}{(P_{1}-P_{2}).n_{i}}$

$\frac{(f_{i}-P_{2}).n_{i}}{(P_{1}-P_{2}).n_{i}}$

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 18

Match the following :

$\begin{array}{clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{Cavalier} & \text{i.} & \text{The direction of projection is chosen so} \\ &\text{Projection}&&\text{ that there is no foreshortening of lines} \\ & & & \text{perpendicular to the $xy$ plane.} \\ \text{b.} &\text{Cabinet} & \text{ii.} & \text{The direction of projection is chosen so} \\ & \text{Projection} & &\text{ that lines perpendicular to the $xy$ planes}\\ &&& \text{ are foreshortened by half their lengths.} \\ \text{c. }& \text{Isometric} & \text{iii.} & \text{The direction of projection makes equal }\\ &\text{Projection}&& \text{angles with all of the principal axis.} \\ \text{d. }& \text{Orthographic} & \text{iv. }& \text{Projections are characterized by the fact} \\ &\text{Projection}&& \text{ that the direction of projection is} \\ &&& \text{perpendicular to the view plane.} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 19

Consider the following statements S1, S2 and S3 :

S1 : In call-by-value, anything that is passed into a function call is unchanged in the caller’s scope when the function returns.

S2 : In call-by-reference, a function receives implicit reference to a variable used as argument.

S3 : In call-by-reference, caller is unable to see the modified variable used as argument.

S3 and S2 are true.

S3 and S1 are true.

S2 and S1 are true.

S1, S2, S3 are true.

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 20

How many tokens will be generated by the scanner for the following statement ?

x = x ∗ (a + b) – 5;

12

11

10

07

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 21

Which of the following statements is not true ?

MPI_Isend and MPI_Irecv are non-blocking message passing routines of MPI.

MPI_Issend and MPI_Ibsend are non-blocking message passing routines of MPI.

MPI_Send and MPI_Recv are non-blocking message passing routines of MPI.

MPI_Ssend and MPI_Bsend are blocking message passing routines of MPI.

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 22

The pushdown automation M = ({q₀ , q₁ , q₂ }, {a, b}, {0, 1}, δ, q₀ , 0, {q₀ }) with

δ(q₀ , a, 0) = {(q₁ , 10)}

δ(q₁ , a, 1) = {(q₁ , 11)}

δ(q₁ , b, 1) = {(q₂ , λ)}

δ(q₂ , b, 1) = {(q₂ , λ)}

δ(q₂ , λ, 0) = {(q₀ , λ)}

Accepts the language

L = {aⁿ b^m | n, m ≥ 0}

L = {aⁿ bⁿ | n ≥ 0}

L = {aⁿ b^m | n, m > 0}

L = {aⁿ bⁿ | n > 0}

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 23

Given two languages :

L₁ = {(ab)ⁿ a^k | n > k, k ≥ 0}

L₂ = {aⁿ b^m | n ≠ m} Using pumping lemma for regular language, it can be shown that

L₁ is regular and L₂ is not regular.

L₁ is not regular and L₂ is regular.

L₁ is regular and L₂ is regular.

L₁ is not regular and L₂ is not regular.

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 24

Regular expression for the complement of language L = {aⁿ b^m | n ≥ 4, m ≤ 3} is

(a + b)^* ba(a + b)^*

a^* bbbbb^*

(λ + a + aa + aaa)b^* + (a + b)^* ba(a + b)^*

None of the above

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 25

For n devices in a network, ________ number of duplex-mode links are required for a mesh topology.

n(n + 1)

n (n – 1)

n(n + 1)/2

n(n – 1)/2

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 26

How many characters per second (7 bits + 1 parity) can be transmitted over a 3200 bps line if the transfer is asynchronous ? (Assuming 1 start bit and 1 stop bit)

300

320

360

400

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 27

Which of the following is not a field in TCP header ?

Sequence number

Fragment offset

Checksum

Window size

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 28

What is the propagation time if the distance between the two points is 48,000 ? Assume the propagation speed to be 2.4 × 10⁸ metre/second in cable.

0.5 ms

20 ms

50 ms

200 ms

Correct Answer : MTA

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 29

__________ is a bit-oriented protocol for communication over point-to-point and multipoint links.

Stop-and-wait

HDLC

Sliding window

Go-back-N

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 30

Which one of the following is true for asymmetric-key cryptography ?

Private key is kept by the receiver and public key is announced to the public.

Public key is kept by the receiver and private key is announced to the public.

Both private key and public key are kept by the receiver.

Both private key and public key are announced to the public.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 31

Any decision tree that sorts n elements has height

Ω(n)

Ω(lgn)

Ω(nlgn)

Ω(n²)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 32

Match the following :

$\begin{array}{} & \textbf{List – I} & & \textbf{List – II} \\ \text{a.} & \text{Bucket sort} & \text{i.} & O(n^3\lg n) \\ \text{b.} & \text{Matrix chain multiplication} & \text{ii.} & O(n^3) \\ \text{c.} & \text{Huffman codes} & \text{iii.} & O(n\lg n) \\ \text{d.} & \text{All pairs shortest paths} & \text{iv.} & O(n) \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 33

We can show that the clique problem is NP-hard by proving that

CLIQUE ≤ P 3-CNF_SAT

CLIQUE ≤ P VERTEX_COVER

CLIQUE ≤ P SUBSET_SUM

None of the above

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 34

Dijkstra algorithm, which solves the single-source shortest--paths problem, is a _________, and the Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a _________

Greedy algorithm, Divide-conquer algorithm

Divide-conquer algorithm, Greedy algorithm

Greedy algorithm, Dynamic programming algorithm

Dynamic programming algorithm, Greedy algorithm

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 35

Consider the problem of a chain <A₁, A₂, A₃> of three matrices. Suppose that the dimensions of the matrices are 10 × 100, 100 × 5 and 5 × 50 respectively. There are two different ways of parenthesization : (i) ((A₁ A₂ )A₃ ) and (ii) (A₁ (A₂ A₃ )). Computing the product according to the first parenthesization is ________ times faster in comparison to the second parenthesization.

5

10

20

100

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 36

Suppose that we have numbers between 1 and 1000 in a binary search tree and we want to search for the number 365. Which of the following sequences could not be the sequence of nodes examined ?

4, 254, 403, 400, 332, 346, 399, 365

926, 222, 913, 246, 900, 260, 364, 365

927, 204,913, 242, 914, 247, 365

4, 401, 389, 221, 268, 384, 383, 280, 365

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 37

Which methods are utilized to control the access to an object in multi-threaded programming ?

Asynchronized methods

Synchronized methods

Serialized methods

None of the above

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 38

How to express that some person keeps animals as pets ?

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 39

Converting a primitive type data into its corresponding wrapper class object instance is called

Boxing

Wrapping

Instantiation

Autoboxing

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 40

The behaviour of the document elements in XML can be defined by

Using document object

Registering appropriate event handlers

Using element object

All of the above

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 41

What is true about UML stereotypes ?

Stereotype is used for extending the UML language.

Stereotyped class must be abstract

The stereotype indicates that the UML element cannot be changed

UML profiles can be stereotyped for backward compatibility

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 42

Which method is called first by an applet program ?

start( )

run( )

init( )

begin( )

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 43

Which one of the following is not a source code metric ?

Halstead metric

Function point metric

Complexity metric

Length metric

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 44

To compute function points (FP), the following relationship is used

FP = Count – total × (0.65 + 0.01 × Σ(F_i )) where F_i (i = 1 to n) are value adjustment factors (VAF) based on n questions. The value of n is

12

14

16

18

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 45

Assume that the software team defines a project risk with 80% probability of occurrence of risk in the following manner :

Only 70 percent of the software components scheduled for reuse will be integrated into the application and the remaining functionality will have to be custom developed. If 60 reusable components were planned with average component size as 100 LOC and software engineering cost for each LOC as $ 14, then the risk exposure would be

$ 25,200

$ 20,160

$ 17,640

$ 15,120

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 46

Maximum possible value of reliability is

100

10

1

0

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 47

‘FAN IN’ of a component A is defined as

Count of the number of components that can call, or pass control, to a component A

Number of components related to component A

Number of components dependent on component A

None of the above

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 48

Temporal cohesion means

Coincidental cohesion

Cohesion between temporary variables

Cohesion between local variables

Cohesion with respect to time

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 49

Various storage devices used by an operating system can be arranged as follows in increasing order of accessing speed :

Magnetic tapes → magnetic disks → optical disks → electronic disks → main memory → cache → registers

Magnetic tapes → magnetic disks → electronic disks → optical disks → main memory → cache → registers

Magnetic tapes → electronic disks → magnetic disks → optical disks → main memory → cache → registers

Magnetic tapes → optical disks → magnetic disks → electronic disks → main memory → cache → registers

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 50

How many disk blocks are required to keep list of free disk blocks in a 16 GB hard disk with 1 kB block size using linked list of free disk blocks ? Assume that the disk block number is stored in 32 bits.

1024 blocks

16794 blocks

20000 blocks

1048576 blocks

Correct Answer : MTA

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 51

Consider an imaginary disk with 40 cylinders. A request come to read a block on cylinder 11. While the seek to cylinder 11 is in progress, new requests come in for cylinders 1, 36, 16, 34, 9 and 12 in that order. The number of arm motions using shortest seek first algorithm is

111

112

60

61

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 52

An operating system has 13 tape drives. There are three processes P1, P2 & P3. Maximum requirement of P1 is 11 tape drives, P2 is 5 tape drives and P3 is 8 tape drives. Currently, P1 is allocated 6 tape drives, P2 is allocated 3 tape drives and P3 is allocated 2 tape drives. Which of the following sequences represent a safe state ?

P2 P1 P3

P2 P3 P1

P1 P2 P3

P1 P3 P2

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 53

Monitor is an Interprocess Communication (IPC) technique which can be described as

It is higher level synchronization primitive and is a collection of procedures, variables, and data structures grouped together in a special package.

It is a non-negative integer which apart from initialization can be acted upon by wait and signal operations.

It uses two primitives, send and receive which are system calls rather than language constructs.

It consists of the IPC primitives implemented as system calls to block the process when they are not allowed to enter critical region to save CPU time.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 54

In a distributed computing environment, distributed shared memory is used which is

Logical combination of virtual memories on the nodes.

Logical combination of physical memories on the nodes.

Logical combination of the secondary memories on all the nodes.

All of the above

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 55

Equivalent logical expression for the Well Formed Formula (WFF),

~(∀x) F[x] is

∀x (~F[x])

~(∃x) F[x]

∃x (~F[x])

∀x F[x]

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 56

An A^*algorithm is a heuristic search technique which

is like a depth-first search where most promising child is selected for expansion

generates all successor nodes and computes an estimate of distance (cost) from start node to a goal node through each of the successors. It then chooses the successor with shortest cost.

saves all path lengths (costs) from start node to all generated nodes and chooses shortest path for further expansion.

none of the above

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 57

The resolvent of the set of clauses

(A ∨ B, ~A ∨ D, C ∨ ~B) is

A ∨ B

C ∨ D

A ∨ C

A ∨ D

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 58

Match the following :

$\begin{array}{clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} &\text{Script} & \text{i.} & \text{Directed graph with labelled nodes for graphical} \\ &&&\text{representation of knowledge } \\ \text{b.} & \text{Conceptual} & \text{ii.} & \text{Knowledge about objects and events is stored in} \\&\text{Dependencies}&& \text{record-like structures consisting of slots and} \\ &&&\text{slot values.} \\ \text{c.} & \text{Frames} & \text{iii.} &\text{Primitive concepts and rules to represent natural} \\&&& \text{language statements } \\ \text{d.} & \text{Associative} & \text{iv.} & \text{Frame like structures used to represent} \\ &\text{Network}&& \text{stereotypical patterns for commonly occurring}\\ &&& \text{events in terms of actors, roles, props and scenes. } \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 59

Match the following components of an expert system :

$\begin{array}{clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} &\text{I/O Interface} & \text{i.} & \text{Accepts user’s queries and responds to question} \\ &&& \text{through I/O interface } \\ \text{b.} & \text{Explanation Module} & \text{ii.} & \text{Contains facts and rules about the domain } \\ \text{c.} & \text{Inference Engine} & \text{iii.} &\text{Gives the user, the ability to follow inferencing} \\ &&& \text{steps at any time during consultation} \\ \text{d.} & \text{Knowledge Base} & \text{iv.} & \text{Permits the user to communicate with the}\\ &&& \text{system in a natural way } \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 60

A computer based information system is needed :

I. as it is difficult for administrative staff to process data.

II. due to rapid growth of information and communication technology.

III. due to growing size of organizations which need to process large volume of data.

IV. as timely and accurate decisions are to be taken.

Which of the above statement(s) is/are true ?

I and II

III and IV

II and III

II and IV

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 61

Given the recursively enumerable language (L_RE), the context sensitive language (L_CS), the recursive language (L_REC), the context free language (L_CF) and deterministic context free language (L_DCF). The relationship between these families is given by

L_CF ⊆ L_DCF ⊆ L_CS ⊆ L_RE ⊆ L_REC

L_CF ⊆ L_DCF ⊆ L_CS ⊆ L_REC ⊆ L_RE

L_DCF ⊆ L_CF ⊆ L_CS ⊆ L_RE ⊆ L_REC

L_DCF ⊆ LCF ⊆ L_CS ⊆ L_REC ⊆ L_RE

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 62

Match the following :

$\begin{array} {clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a.}& \text{Context free grammar} & \text{i.} & \text{Linear bounded automaton} \\ \text{b.}& \text{Regular grammar} & \text{ii.} & \text{Pushdown automaton} \\ \text{c.}& \text{Context sensitive grammar} & \text{iii.} & \text{Turing machine} \\ \text{d.}& \text{Unrestricted grammar} & \text{iv.} & \text{Deterministic finite automaton} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 63

According to pumping lemma for context free languages :

Let L be an infinite context free language, then there exists some positive integer m such that any w ∈ L with | w | ≥ m can be decomposed as w = u v x y z

with | vxy | ≤ m such that uvⁱ xyⁱ z ∈ L for all i = 0, 1, 2

with | vxy | ≤ m, and | vy | ≥ 1, such that uvⁱ xyⁱ z ∈ L for all i = 0, 1, 2, …….

with | vxy | ≥ m, and | vy | ≤ 1, such that uvⁱ xyⁱ z ∈ L for all i = 0, 1, 2, …….

with | vxy | ≥ m, and | vy | ≥ 1, such that uvⁱ xyⁱ z ∈ L for all i = 0, 1, 2, …….

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 64

Given two spatial masks

$S_{1}= \begin{bmatrix} 0&1&0 \\ 1&-4&0 \\ 0&1&0 \end{bmatrix}$ and $S_{2} = \begin{bmatrix} 1&1&1 \\ 1&-8&1 \\ 1&1&1 \end{bmatrix}$

The Laplacian of an image at all points (x, y) can be implemented by convolving the image with spatial mask. Which of the following can be used as the spatial mask ?

only S₁

only S₂

Both S₁ and S₂

None of these

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 65

Given a simple image of size 10 × 10 whose histogram models the symbol probabilities and is given by

p₁	p₂	p₃	p₄
a	b	c	d

The first order estimate of image entropy is maximum when

$a = 0, b = 0, c = 0, d = 1$

$a=\frac{1}{2}, b=\frac{1}{2}, c=0, d=0$

$a=\frac{1}{3}, b=\frac{1}{3}, c=\frac{1}{3}, d=0$

$a=\frac{1}{4}, b=\frac{1}{4}, c=\frac{1}{4}, d=\frac{1}{4}$

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 66

A Butterworth lowpass filter of order n, with a cutoff frequency at distance D₀ from the origin, has the transfer function H(u, v) given by

$\frac{1}{1+\left[\frac{D(u, v)}{D_{0}}\right]^{2n}}$

$\frac{1}{1+\left[\frac{D(u, v)}{D_{0}}\right]^{n}}$

$\frac{1}{1+\left[\frac{D_{0}}{D(u, v)}\right]^{2n}}$

$\frac{1}{1+\left[\frac{D_{0}}{D(u, v)}\right]^{n}}$

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 67

If an artificial variable is present in the ‘basic variable’ column of optimal simplex table, then the solution is

Optimum

Infeasible

Unbounded

Degenerate

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 68

The occurrence of degeneracy while solving a transportation problem means that

total supply equals total demand

total supply does not equal total demand

the solution so obtained is not feasible

none of these

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 69

Five men are available to do five different jobs. From past records, the time (in hours) that each man takes to do each job is known and is given in the following table :

Find out the minimum time required to complete all the jobs.

5

11

13

15

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 70

Consider the following statements about a perception :

I. Feature detector can be any function of the input parameters.

II. Learning procedure only adjusts the connection weights to the output layer.

Identify the correct statement out of the following :

I is false and II is false.

I is true and II is false.

I is false and II is true.

I is true and II is true.

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 71

A _________ point of a fuzzy set A is a point x ∈ X at which µ_A (x) = 0.5

core

support

crossover

α-cut

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 72

Match the following learning modes 𝑤.𝑟.𝑡. characteristics of available information for learning :

a. Supervised	i. Instructive information on desired responses, explicitly specified by a teacher.
b. Recording	ii. A priori design information for memory storing
c. Reinforcement	iii. Partial information about desired responses, or only “right” or “wrong” evaluative information
d. Unsupervised	iv. No information about desired responses

Codes :

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

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

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

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

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 73

Which of the following versions of Windows O.S. contain built-in partition manager which allows us to shrink and expand pre-defined drives ?

Windows Vista

Windows 2000

Windows NT

Windows 98

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 74

A Trojan horse is

A program that performs a legitimate function that is known to an operating system or its user and also has a hidden component that can be used for nefarious purposes like attacks on message security or impersonation.

A piece of code that can attach itself to other programs in the system and spread to other systems when programs are copied or transferred.

A program that spreads to other computer systems by exploiting security holes like weaknesses in facilities for creation of remote processes

All of the above

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 75

Which of the following computing models is not an example of distributed computing environment ?

Cloud computing

Parallel computing

Cluster computing

Peer-to-peer computing

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

UGC NET CSE - December 2014 | PAPER - III