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

Question : 1

Infrared signals can be used for short range communication in a closed area using _______ propagation.

ground

sky

line of sight

space

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 2

A bridge has access to _______ address in the same network.

Physical

Network

Datalink

Application

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 3

The minimum frame length for 10 Mbps Ethernet is _______ bytes and maximum is _______ bytes.

64 & 128

128 & 1518

1518 & 3036

64 & 1518

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 4

The bit rate of a signal is 3000 bps. If each signal unit carries 6 bits, the baud rate of the signal is _______.

500 baud/sec

1000 baud/sec

3000 baud/sec

18000 baud/sec.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 5

Match the following :

$\begin{array}{cIcI} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{Physical layer} & \text{i.} & \text{Allow resources to network access} \\ \text{b.} & \text{Datalink layer} & \text{ii.} & \text{Move packets from one destination to other} \\ \text{c.} & \text{Network layer} & \text{iii.} & \text{Process to process message delivery} \\ \text{d.} & \text{Transport layer} & \text{iv.} & \text{Transmission of bit stream} \\ \text{e.} & \text{Application Layer} & \text{v.} & \text{Formation of frames} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 6

A grammar G is LL(1) if and only if the following conditions hold for two distinct productions A → α | β

I. First (α) ∩ First (β) ≠ {a} where a is some terminal symbol of the grammar.

II. First (α) ∩ First (β) ≠ λ

III. First (α) ∩ Follow (A) = φ if λ ∈ First (β)

I and II

I and III

II and III

I, II and III

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 7

Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar ?

Removing left recursion alone

Removing the grammar alone

Removing left recursion and factoring the grammar

None of the above

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 8

A shift reduce parser suffers from

shift reduce conflict only

reduce reduce conflict only

both shift reduce conflict and reduce reduce conflict

shift handle and reduce handle conflicts

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 9

The context free grammar for the language $L= \left\{a^{n}b^{m}c^{k} \mid k = \mid n - m\mid , n \geq 0, m \geq 0, k \geq 0\right\}$ is

$S \rightarrow S_{1}S_{3}, \\ S_{1} \rightarrow aS_{1}c \mid S_{2} \mid \lambda, \\ S_{2} \rightarrow aS_{2}b\mid \lambda, \\ S_{3} \rightarrow aS_{3}b \mid S_{4} \mid \lambda, \\ S_{4} \rightarrow bS_{4}c \mid \lambda$

$S \rightarrow S_{1}S_{3}, \\ S_{1} \rightarrow a S_{1} S_{2}c \mid \lambda, \\ S_{2} \rightarrow aS_{2}b\mid \lambda, \\ S_{3} \rightarrow aS_{3}b \mid S_{4} \mid \lambda, \\S_{4} \rightarrow bS_{4}c \mid \lambda$

$S \rightarrow S_{1} \mid S_{2}, \\S_{1} \rightarrow aS_{1}S_{2}c \mid \lambda, \\S_{2} \rightarrow aS_{2}b\mid \lambda, \\S_{3} \rightarrow aS_{3}b \mid S_{4} \mid \lambda, \\S_{4} \rightarrow bS_{4}c \mid \lambda$

$S \rightarrow S_{1} \mid S_{3}, \\S_{1} \rightarrow aS_{1}c \mid S_{2} \mid \lambda, \\S_{2} \rightarrow aS_{2}b\mid \lambda, \\S_{3} \rightarrow aS_{3}b \mid S_{4} \mid \lambda, \\S_{4} \rightarrow bS_{4}c \mid \lambda$

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 10

The regular grammar for the language L = {w|n_a(w) and n_b(w) are both even, w ∈ {a, b}^*} is given by : (Assume, p, q, r and s are states)

p → aq | br | λ, q → bs | ap

r → as | bp, s → ar | bq, p and s are initial and final states.

p → aq | br, q → bs | ap

r → as | bp, s → ar | bq, p and s are initial and final states.

p → aq | br | λ, q → bs | ap

r → as | bp, s → ar | bq p is both initial and final states.

p → aq | br, q → bs | ap

r → as | bp, s → ar | bq p is both initial and final states.

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 11

KPA in CMM stands for

Key Process Area

Key Product Area

Key Principal Area

Key Performance Area

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 12

Which one of the following is not a risk management technique for managing the risk due to unrealistic schedules and budgets ?

Detailed multi source cost and schedule estimation.

Design cost

Incremental development

Information hiding

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 13

_______ of a system is the structure or structures of the system which comprise software elements, the externally visible properties of these elements and the relationship amongst them.

Software construction

Software evolution

Software architecture

Software reuse

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 14

In function point analysis, the number of complexity adjustment factors is

10

12

14

20

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 15

Regression testing is primarily related to

Functional testing

Development testing

Data flow testing

Maintenance testing

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 16

How many different truth tables of the compound propositions are there that involve the propositions p & q ?

2

4

8

16

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 17

A Boolean function F is called selfdual if and only if

$F(x_1 , x_2 , … x_n ) = F(\bar {x_1} ,\bar {x_2} , … \bar {x_n} )$

How many Boolean functions of degree n are self-dual ?

$2^n $

$(2)^{2^{n}} $

$ (2) ^{n^2} $

$(2) ^{2^{n–1}}$

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 18

Which of the following statement(s) is (are) not correct ?

i. The 2’s complement of 0 is 0.

ii. In 2’s complement, the left most bit cannot be used to express a quantity.

iii. For an n-bit word (2’s complement) which includes the sign bit, there are 2^n–1 positive integers, 2ⁿ⁺¹ negative integers and one 0 for a total of 2ⁿ unique states.

iv. In 2’s complement the significant information is contained in the 1’s of positive numbers and 0’s of the negative numbers.

i & iv

i & ii

iii

iv

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 19

The notation ∃!xP(x) denotes the proposition “there exists a unique x such that P(x) is true”. Give the truth values of the following statements :

I. ∃!xP(x) → ∃xP(x)

II. ∃!x ¬ P(x) → ¬∀xP(x)

Both I & II are true.

Both I & II are false.

I – false, II – true

I – true, II – false

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 20

Give a compound proposition involving propositions p, q and r that is true when exactly two of p, q and r are true and is false otherwise.

(p∨q∧¬r) ∧ (p∧¬q∧r) ∧ (¬p∧q∧r)

(p∧q∧¬r) ∧ (p∨q∧¬r) ∧ (¬p∧q∧r)

(p∧q∧¬r) ∨ (p∧¬q∧r) ∧ (¬p∧q∧r)

(p∧q∧¬r) ∨ (p∧¬q∧r) ∨ (¬p∧q∧r)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 21

Consider the graph given below as :

Which one of the following graph is isomorphic to the above graph ?

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 22

The upper bound and lower bound for the number of leaves in a B-tree of degree K with height h is given by :

$K^{h}$ and $2 \lceil \frac{k}{2} \rceil ^{h-1}$

$K * h $ and $2 \lfloor \frac{k}{2} \rfloor ^{h-1}$

$K^{h}$ and $2 \lfloor \frac{k}{2} \rfloor ^{h-1}$

$K * h$ and $2 \lceil \frac{k}{2} \rceil ^{h-1}$

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 23

Consider a complete bipartite graph k_m,n. For which values of m and n does this, complete graph have a Hamilton circuit

m = 3, n = 2

m = 2, n = 3

m = n $\geq$ 2

m = n $\geq$ 3

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 24

Big-O estimates for the factorial function and the logarithm of the factorial function i.e. n! and log n! is given by

O(n!) and O(n log n)

O(nⁿ) and O(n log n)

O(n!) and O(log n!)

O(nⁿ) and O(log n!)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 25

How many cards must be chosen from a deck to guarantee that atleast

i. two aces of two kinds are chosen.

ii. two aces are chosen.

iii. two cards of the same kind are chosen.

iv. two cards of two different kinds are chosen.

50, 50, 14, 5

51, 51, 15, 7

52, 52, 14, 5

51, 51, 14, 5

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 26

Match the following with respect to the mobile computing technologies :

$\begin{array}{cIcI} & \textbf{List-I} & & \textbf{List-II} \\ \text{a.} & \text{GPRS} & \text{i.} & \text{An Integrated digital radio standard} \\ \text{b.} & \text{GSM} & \text{ii.} & \text{3G wireless/Mobile technology} \\ \text{c.} & \text{UMTS} & \text{iii.} & \text{Nine different schemes for modulation} \\ && & \text{and error correction} \\ \text{d.} & \text{EDGE} & \text{iv.} & \text{An emerging wireless service that offeres} \\ &&& \text{a mobile data} \\ \end{array}$

Codes :

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

a-iv; b-i; c-ii; 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 : 27

Object Request Broker (ORB) is

I. A software program that runs on the client as well as on the application server.

II. A software program that runs on the client side only.

III. A software program that runs on the application server, where most of the components reside.

I, II & III

I & II

II & III

I only

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 28

A software agent is defined as

I. A software developed for accomplishing a given task.

II. A computer program which is capable of acting on behalf of the user in order to accomplish a given computational task.

III. An open source software for accomplishing a given task.

I

II

III

All of the above

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 29

Match the following

$\begin{array}{clcl} & \textbf{List – I} & & \textbf{List – II} \\ \text{a.} & \text{Classification} & \text{i.} & \text{Principal component analysis} \\ \text{b.} & \text{Clustering } & \text{ii.} & \text{Branch and Bound} \\ \text{c.} & \text{Feature Extraction} & \text{iii.} & \text{K-nearest neighbour} \\ \text{d.} & \text{Feature Selection} & \text{iv.} & \text{K-means} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 30

SET, an open encryption and security specification model that is designed for protecting credit card transactions on the internet, stands for

Secure Electronic Transaction

Secular Enterprise for Transaction

Security Electronic Transmission

Secured Electronic Termination

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 31

In a paged memory management algorithm, the hit ratio is 70%. If it takes 30 nanoseconds to search Translation Look-aside Buffer (TLB) and 100 nanoseconds (ns) to access memory, the effective memory access time is

91 ns

69 ns

200 ns

160 ns

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 32

Match the following :

$\begin{array}{clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a}. & \text{Multilevel feedback queue} & \text{i.} & \text{Time-slicing} \\ \text{b.} & \text{FCFS} & \text{ii.} & \text{Criteria to move processes} \\ &&& \text{between queues} \\ \text{c.} & \text{Shortest Process next} & \text{iii.} & \text{Batch Processing} \\ \text{d.} & \text{Round robin scheduling} & \text{iv.} & \text{Exponential smoothening} \\ \end{array}$

Codes :

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

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

a-iii; b-i; c-iv; d-i

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

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 33

Consider a system with five processes 𝑃₀ through 𝑃₄ and three resource types 𝑅₁, 𝑅₂ and 𝑅₃ . Resource type 𝑅₁ has 10 instances, 𝑅₂ has 5 instances and 𝑅₃ has 7 instances. Suppose that at time 𝑇₀, the following snapshot of the system has been taken :

Allocation

𝑅₁ 𝑅₂ 𝑅₃

𝑃₀ 0 1 0

𝑃₁ 2 0 0

𝑃₂ 3 0 2

𝑃₃ 2 1 1

𝑃₄ 0 2 2

Max

𝑅₁ 𝑅₂ 𝑅₃

7 5 3

3 2 2

9 0 2

2 2 2

4 3 3

Available

𝑅₁ 𝑅₂ 𝑅₃

3 3 2

Assume that now the process 𝑃₁ requests one additional instance of type 𝑅₁ and two instances of resource type 𝑅₃. The state resulting after this allocation will be

Ready state

Safe state

Blocked state

Unsafe state

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 34

Match the following :

$\begin{array}{clcl} \text{} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{Contiguous allocation} & \text{i.} & \text{This scheme supports very large}\\&&& \text{ file sizes.} \\ \text{b.} & \text{Linked allocation} & \text{ii.} & \text{This allocation technique supports} \\ &&& \text{ only sequential files.} \\ \text{c.} & \text{Indexed allocation} & \text{iii.} & \text{The number of disks required to} \\&&&\text{access file is minimal.} \\ \text{d.} & \text{Multi-level indexed} & \text{iv.} & \text{This technique suffers from maximum} \\ &&&\text{wastage of space in storing pointers.} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 35

Which of the following commands will output “onetwothree” ?

for val; do echo-n $val; done < one two three

for one two three; do echo-n-; done

for n in one two three; do echo-n $n; done

for n in one two three {echo –n $ n}

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 36

Mergesort makes two recursive calls. Which statement is true after these two recursive calls finish, but before the merge step ?

The array elements form a heap.

Elements in each half of the array are sorted amongst themselves.

Elements in the first half of the array are less than or equal to elements in second half of the array.

All of the above

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 37

A text is made up of the characters α, β, γ, δ and σ with the probability 0.12, 0.40, 0.15, 0.08 and 0.25 respectively. The optimal coding technique will have the average length of

1.7

2.15

3.4

3.8

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 38

Searching for an element in the hash table requires O(1) time for the ________ time, whereas for direct addressing it holds for the ________ time.

worst-case, average

worst-case, worst-case

average, worst-case

best, average

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 39

An algorithm is made up of 2 modules M₁ and M₂ . If time complexity of modules M₁ and M₂ are h(n) and g(n) respectively, the time complexity of the algorithm is

min (h(n), g(n))

max (h(n), g(n))

h(n) + g(n)

h(n) * g(n)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 40

What is the maximum number of parenthesis that will appear on the stack at any one time for parenthesis expression given by ( ( ) ( ( ) ) ( ( ) ) )

2

3

4

5

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 41

Match the following :

$\begin{array}{cIcI} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{Automatic Storage} & \text{i.} & \text{Scope of the variable is global}\\ & \text{Class} \\ \text{b.} & \text{Register Storage } & \text{ii.} & \text{Value of the variable persists between } \\ & \text{Class} && \text{different function calls}\\ \text{c.} & \text{Static Storage} & \text{iii.} & \text{Value stored in memory and local to the block} \\ & \text{Class} && \text{in which the variable is defined}\\ \text{d.} & \text{External Storage} & \text{iv.} & \text{value stored in CPU registers} \\ & \text{class} \\ \end{array}$

Codes :

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

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

a-iv; b-iii; c-ii; d-ii

a-iv; b-iii; ci; d-ii

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 42

When we pass an array as an argument to a function, what actually gets passed ?

Address of the array

Values of the elements of the array

Base address of the array

Number of elements of the array

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 43

While (87) printf(“computer”); The above C statement will

print “computer” 87 times

print “computer” 0 times

print “computer” 1 times

print “computer” infinite times

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 44

A friend function can be used to

avoid arguments between classes.

allow access to classes whose source code is unavailable.

allow one class to access an unrelated class.

None of the above

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 45

Which of the following is the correct value returned to the operating system upon the successful completion of a program ?

0

1

- 1

Program do not return a value.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 46

Manager’s salary details are hidden from the employee. This is called as

Conceptual level data hiding

Physical level data hiding

External level data hiding

Local level data hiding

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 47

Which of the following statements is false ?

Any relation with two attributes is in BCNF.

A relation in which every key has only one attribute is in 2NF.

A prime attribute can be transitively dependent on a key in 3NF relation.

A prime attribute can be transitively dependent on a key in BCNF relation.

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 48

A clustering index is created when _______.

primary key is declared and ordered

no key ordered

foreign key ordered

there is no key and no order

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 49

Let R ={A, B, C, D, E, F} be a relation schema with the following dependencies C → F, E → A, EC → D, A → B Which of the following is a key for R ?

CD

EC

AE

AC

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 50

Match the following :

$\begin{array} {cIcI} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{DDL} & \text{i.} & \text{LOCK TABLE} \\ \text{b.} & \text{DML} & \text{ii.} & \text{COMMIT} \\ \text{c.} & \text{TCL} & \text{iii.} & \text{Natural Differece} \\ \text{d.} & \text{BINARY} & \text{iv.} & \text{REVOKE} \\ & \text{Operation} \end{array}$

Codes :

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

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

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

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

Correct Answer : MTA

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

UGC NET CSE - June 2014 | PAPER - II