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

Question : 1

Beam-penetration and shadow-mask are the two basic techniques for producing color displays with a CRT. Which of the following is not true ?

I. The beam-penetration is used with random scan monitors.

II. Shadow-mask is used in rasterscan systems.

III. Beam-penetration method is better than shadow-mask method.

IV. Shadow-mask method is better than beam-penetration method.

I and II

II and III

III only

IV only

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 2

Line caps are used for adjusting the shape of the line ends to give them a better appearance. Various kinds of line caps used are

Butt cap and sharp cap

Butt cap and round cap

Butt cap, sharp cap and round cap

Butt cap, round cap and projecting square cap

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 3

Given below are certain output primitives and their associated attributes. Match each primitive with its corresponding attributes :

$\begin{array}{cIcI} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{Line} & \text{i.} & \text{Type, Size, Color} \\ \text{b.} & \text{Fill Area} & \text{ii.} & \text{Color, Size, Font} \\ \text{c.} & \text{Text} & \text{iii.} & \text{Style, Color, Pattern} \\ \text{d.} & \text{Marker} & \text{iv.} & \text{Type, Width, Color} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 4

Consider a window bounded by the lines : x = 0; y= 0; x = 5 and y = 3. The line segment joining (–1, 0) and (4, 5), if clipped against this window will connect the points

(0, 1) and (2, 3)

(0, 1) and (3, 3)

(0, 1) and (4, 3)

(0, 1) and (3, 2)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 5

Which of the following color models are defined with three primary colors ?

RGB and HSV color models

CMY and HSV color models

HSV and HLS color models

RGB and CMY color models

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 6

In a digital transmission, the receiver clock is 0.1 percent faster than the sender clock. How many extra bits per second does the receiver receive if the data rate is 1 Mbps ?

10 bps

100 bps

1000 bps

10000 bps

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 7

Given U = {1, 2, 3, 4, 5, 6, 7}

A = {(3, 0.7), (5, 1), (6, 0.8)}

then $\tilde{A} $ will be : (where ~ → complement)

{(4, 0.7), (2, 1), (1, 0.8)}

{(4, 0.3), (5, 0), (6, 0.2) }

{(1, 1), (2, 1), (3, 0.3), (4, 1), (6, 0.2), (7, 1)}

{(3, 0.3), (6.0.2)}

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 8

Consider a fuzzy set old as defined below

Old = {(20, 0.1), (30, 0.2), (40, 0.4), (50, 0.6), (60, 0.8), (70, 1), (80, 1)}

Then the alpha-cut for alpha = 0.4 for the set old will be

{(40, 0.4)}

{50, 60, 70, 80}

{(20, 0.1), (30, 0.2)}

{(20, 0), (30, 0), (40, 1), (50, 1), (60, 1), (70, 1), (80, 1)}

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 9

Perceptron learning, Delta learning and LMS learning are learning methods which falls under the category of

Error correction learning – learning with a teacher

Reinforcement learning – learning with a critic

Hebbian learning

Competitive learning – learning without a teacher

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 10

Code blocks allow many algorithms to be implemented with the following parameters :

clarity, elegance, performance

clarity, elegance, efficiency

elegance, performance, execution

execution, clarity, performance

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 11

Match the following with respect to the jump statements :

$\begin{array}{cIcI} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{return} & \text{i.} & \text{The conditional test and increment portions }\\ \text{b.} & \text{goto} & \text{ii.} & \text{A value associated with it}\\ \text{c.} & \text{break} & \text{iii.} & \text{Requires a label for operation}\\ \text{d.} & \text{continue} & \text{iv.} & \text{An exit from only the innermost loop} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 12

The control string in C++ consists of three important classifications of characters

Escape sequence characters, Format specifiers and Whitespace characters

Special characters, White-space characters and Non-white space characters

Format specifiers, White-space characters and Non-white space characters

Special characters, White-space characters and Format specifiers

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 13

Match the following with respect to I/O classes in object oriented programming :

$\begin{array}{cIcI} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{return} & \text{i.} & \text{The conditional test and increment portions }\\ \text{b.} & \text{goto} & \text{ii.} & \text{A value associated with it}\\ \text{c.} & \text{break} & \text{iii.} & \text{Requires a label for operation}\\ \text{d.} & \text{continue} & \text{iv.} & \text{An exit from only the innermost loop} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 14

Which one of the following describes the syntax of prolog program ?

I. Rules and facts are terminated by full stop (.)

II. Rules and facts are terminated by semicolon (;)

III. Variables names must start with upper case alphabets.

IV. Variables names must start with lower case alphabets.

Codes :

I, II

III, IV

I, III

II, IV

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 15

Let L be any language. Define even (W) as the strings obtained by extracting from W the letters in the even-numbered positions and even(L) = {even (W) | W ∈ L}. We define another language Chop (L) by removing the two leftmost symbols of every string in L given by Chop(L) = {W | ν W ∈ L, with | ν | = 2}.

If L is regular language then

even(L) is regular and Chop(L) is not regular.

Both even(L) and Chop(L) are regular.

even(L) is not regular and Chop(L) is regular.

Both even(L) and Chop(L) are not regular.

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 16

Software testing is

the process of establishing that errors are not present.

the process of establishing confidence that a program does what it is supposed to do.

the process of executing a program to show that it is working as per specifications.

the process of executing a program with the intent of finding errors.

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 17

Assume that a program will experience 200 failures in infinite time. It has now experienced 100 failures. The initial failure intensity was 20 failures/CPU hr. Then the current failure intensity will be

5 failures/CPU hr

10 failures/CPU hr.

20 failures/CPU hr.

40 failures/CPU hr.

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 18

Consider a project with the following functional units :

Number of user inputs = 50

Number of user outputs = 40

Number of user enquiries = 35

Number of user files = 06

Number of external interfaces = 04

Assuming all complexity adjustment factors and weighing factors as average, the function points for the project will be

135

722

675

672

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 19

Match the following :

$\begin{array}{clcl} & \textbf{List – I}&& \textbf{List – II} \\ \text{a.} & \text{Correctness}& \text{i.} & \text{The extent to which a software tolerates} \\ &&& \text{the unexpected problems.} \\ \text{b.} & \text{Accuracy}& \text{ii.} & \text{The extent to which a software meets its} \\ &&& \text{specification} \\ \text{c.} & \text{Robustness}& \text{iii.} & \text{The extent to which a software has the} \\ &&& \text{specified functions} \\ \text{d.} & \text{Completeness}& \text{iv.} & \text{Meeting specifications with precision} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 20

Which one of the following is not a definition of error ?

It refers to the discrepancy between a computed, observed or measured value and the true, specified or theoretically correct value.

It refers to the actual output of a software and the correct output.

It refers to a condition that causes a system to fail.

It refers to human action that results in software containing a defect or fault.

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 21

Which one of the following is not a key process area in CMM level 5 ?

Defect prevention

Process change management

Software product engineering

Technology change management

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 22

Consider the following relational schemas for a library database :

Book (Title, Author, Catalog_no, Publisher, Year, Price)

Collection(Title, Author, Catalog_no)

with the following functional dependencies :

I. Title, Author → Catalog_no

II. Catalog_no → Title, Author, Publisher, Year

III. Publisher, Title, Year → Price

Assume (Author, Title) is the key for both schemas.Which one of the following is true ?

Both Book and Collection are in BCNF.

Both Book and Collection are in 3NF.

Book is in 2NF and Collection in 3NF.

Both Book and Collection are in 2NF.

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 23

Specialization Lattice stands for

An entity type can participate as a subclass in only one specialization.

An entity type can participate as a subclass in more than one specialization.

An entity type that can participate in one specialization.

An entity type that can participate in one generalization.

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 24

Match the following :

$\begin{array}{clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{Timeout ordering protocol} & \text{i.} & \text{Wait for graph} \\ \text{b.} & \text{Deadlock prevention} & \text{ii.} & \text{Roll back} \\ \text{c.} & \text{Deadlock detection} & \text{iii.} & \text{Wait-die scheme} \\ \text{d.} & \text{Deadlock recovery} & \text{iv.} & \text{Thomas Write Rule} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 25

Consider the schema

R = {S, T, U, V}

and the dependencies

S → T, T → U, U → V and V → S

If R = (R₁ and R₂ ) be a decomposition such that R₁ ∩ R₂ = φ then the decomposition is

not in 2NF

in 2NF but not in 3NF

in 3NF but not in 2NF

in both 2NF and 3NF

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 26

Which one of the following is not a Client-Server application ?

Internet chat

Web browser

E-mail

Ping

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 27

Which of the following concurrency protocol ensures both conflict serializability and freedom from deadlock : I. 2-phase locking II. Time phase ordering

Both I & II

II only

I only

Neither I nor II

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 28

Match the following :

$\begin{array}{cIcI} & \textbf{List – I} & & \textbf{List – II} \\ \text{a.} & \text{Expert systems}& \text{i.} & \text{Pragmatics} \\ \text{b.} & \text{Planning}& \text{ii.} & \text{Resolution} \\ \text{c.} & \text{Prolog}& \text{iii.} & \text{means-end analysis} \\ \text{d.} & \text{Natural language processing}& \text{iv.} & \text{Explanation facility} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 29

STRIPS addresses the problem of efficiently representing and implementation of a planner. It is not related to which one of the following ?

SHAKEY

SRI

NLP

None of these

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 30

Slots and facets are used in

Semantic Networks

Frames

Rules

All of these

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 31

Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ?

A^* algorithm

AO^* algorithm

Greedy best first search algorithm

Iterative A^* algorithm

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 32

________predicate calculus allows quantified variables to refer to objects in the domain of discourse and not to predicates or functions.

Zero-order

First-order

Second-order

High-order

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 33

________ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution.

Best first search

Goal stack planning

Alpha-beta pruning procedure

Min-max search

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 34

Consider a uniprocessor system where new processes arrive at an average of five processes per minute and each process needs an average of 6 seconds of service time. What will be the CPU utilization ?

80 %

50 %

60 %

30 %

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 35

Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is :

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

The number of page faults in LRU and optimal page replacement algorithms are respectively (without including initial page faults to fill available page frames with pages) :

9 and 6

10 and 7

9 and 7

10 and 6

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 36

Which of the following statements is not true about disk-arm scheduling algorithms ?

SSTF (shortest seek time first) algorithm increases performance of FCFS.

The number of requests for disk service are not influenced by file allocation method.

Caching the directories and index blocks in main memory can also help in reducing disk arm movements.

SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 37

_________ maintains the list of free disk blocks in the Unix file system.

I-node

Boot block

Super block

File allocation table

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 38

A part of Windows 2000 operating system that is not portable is

Device Management

Virtual Memory Management

Processor Management

User Interface

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 39

Match the following with reference to Unix shell scripts :

$\begin{array}{clcl} & \textbf{List – I} & & \textbf{List – II} \\ \text{a.} & \text{\$?} & \text{i.} & \text{File name of the current script} \\ \text{b.} & \text{\$# } & \text{ii.} & \text{List of arguments} \\ \text{c.} & \text{\$0} & \text{iii.} & \text{The number of arguments} \\ \text{d.} & \text{\$*} & \text{iv.} & \text{Exit status of last command} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 40

The advantage of _______ is that it can reference memory without paying the price of having a full memory address in the instruction.

Direct addressing

Indexed addressing

Register addressing

Register Indirect addressing

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 41

The reverse polish notation equivalent to the infix expression

((A + B) * C + D)/(E + F + G)

A B + C * D + EF + G + /

A B + C D * + E F + G + /

A B + C * D + E F G + +/

A B + C * D + E + F G + /

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 42

The output of a sequential circuit depends on

present input only

past input only

both present and past input

past output only

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 43

A byte addressable computer has a memory capacity of 2^m Kbytes and can perform 2ⁿ operations. An instruction involving 3 operands and one operator needs a maximum of

3m bits

m + n bits

3m + n bits

3m + n + 30 bits

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 44

Which of the following flip-flops is free from race condition ?

T flip-flop

SR flip-flop

Master-slave JK flip-flop

None of the above

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 45

One of the main features that distinguish microprocessor from micro-computers is

words are usually larger in microprocessors.

words are shorter in microprocessors.

microprocessor does not contain I/O devices.

None of the above.

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 46

The output generated by the LINUX command :

$ seq 1 2 10

will be

1 2 10

1 2 3 4 5 6 7 8 9 10

1 3 5 7 9

1 5 10

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 47

All the classes necessary for windows programming are available in the module :

win.txt

win.main

win.std

MFC

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 48

Windows 32 API supports

16-bit Windows

32-bit Windows

64-bit Windows

All of the above

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 49

Superficially the term “objectoriented”, means that, we organize software as a

collection of continuous objects that incorporates both data structure and behaviour.

collection of discrete objects that incorporates both discrete structure and behaviour.

collection of discrete objects that incorporates both data structure and behaviour.

collection of objects that incorporates both discrete data structure and behaviour.

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 50

The “part-whole”, or “a-part-of”, relationship in which objects representing the components of something associated with an object representing the entire assembly is called as

Association

Aggregation

Encapsulation

Generalisation

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 51

The pure object oriented programming language with extensive metadata available and modifiable at run time is

Small talk

C++

Java

Eiffel

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 52

Match the following interfaces of Java. Servlet package :

$\begin{array}{clcl} & \textbf{List – I} && \textbf{List – II}\\ \text{a.}& \text{Servlet config} & \text{i} & \text{Enables Servlets to log events} \\ \text{b.}& \text{Servlet Context} & \text{ii.} & \text{Read data from a client} \\ \text{c.} & \text{Servlet Request} & \text{iii.} & \text{Write data to a client } \\ \text{d.} & \text{Servlet Response } & \text{iv.} & \text{To get initialization parameters}\\ \end{array}$

Codes :

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

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

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

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

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 53

The syntax of capturing events method for document object is

CaptureEvents()

CaptureEvents(Orgs eventType)

CaptureEvents(eventType)

CaptureEvents(eventVal)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 54

Linking to another place in the same or another webpage require two A (Anchor) tags, the first with the ________ attribute and the second with the _________ attribute.

NAME & LINK

LINK & HREF

HREF & NAME

TARGET & VALUE

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 55

Given an image of size 1024 × 1024 pixels in which intensity of each pixel is an 8-bit quality. It requires _______ of storage space if the image is not compressed.

one Terabyte

one Megabyte

8 Megabytes

8 Terabytes

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 56

Match the following cryptographic algorithms with their design issues :

$\begin{array} {cIcI} & \textbf{List-I} & & \textbf{List-II} \\ \text{a.} & \text{DES} & \text{i.} & \text{Message Digest} \\ \text{b.} & \text{AES} & \text{ii.} & \text{Public key} \\ \text{c.} & \text{RSA} & \text{iii.} & \text{56-bit key} \\ \text{d.} & \text{SHA-1} & \text{iv.} & \text{128-bit key} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 57

Consider a code with five valid code words of length ten :

0000000000, 0000011111,

1111100000, 1110000011,

1111111111

Hamming distance of the code is

5

10

8

9

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 58

Which of the following special cases does not require reformulation of the problem in order to obtain a solution ?

Alternate optimality

Infeasibility

Unboundedness

All of the above

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 59

The given maximization assignment problem can be converted into a minimization problem by

subtracting each entry in a column from the maximum value in that column.

subtracting each entry in the table from the maximum value in that table.

adding each entry in a column from the maximum value in that column.

adding maximum value of the table to each entry in the table.

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 60

The initial basic feasible solution of the following transportion problem :

is given as

5
		8
	7
2	2	10

then the minimum cost is

76

78

80

82

Correct Answer : MTA

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 61

Given the following equalities :

E₁: $ n^{K+\in} + n^{K} \lg n = \theta (n^{K+\in})$ ) for all fixed $K$ and $∈, K \geq 0$ and $∈ > 0$.

E₂ : $ n^{3}2^{n}+6n^{2}3^{n}=O (n^{3}2^{n})$

Which of the following is true ?

E₁ is correct and E₂ is correct.

E₁ is correct and E₂ is not correct.

E₁ is not correct and E₂ is correct.

E₁ is not correct and E₂ is not correct.

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 62

Consider the fractional knapsack instance n = 4, (p₁ , p₂ , p₃ , p₄ ) = (10, 10, 12, 18), (w₁ , w₂ , w₃ , w₄) = (2, 4, 6, 9) and M = 15. The maximum profit is given by

(Assume p and w denotes profit and weight of objects respectively)

40

38

32

30

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 63

The solution of the recurrence relation of $T(n) = 3T(floor(\frac n 4)) + n$ is

$O(n^2) $

$O(n \ lg \ n) $

$O(n) $

$O(l \ g \ n)$

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 64

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n $\leq$ m, the expected number of collisions involving a particular key K is

less than 1

less than $lg \ n$

greater than 1

greater than $lg \ n$

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 65

Given the following statements :

S₁: The subgraph-isomorphism problem takes two graphs G₁ and G₂ and asks whether G₁ is a subgraph of G₂ .

S₂ : The set-partition problem takes as input a set S of numbers and asks whether the numbers can be partitioned into two sets A and $\bar A$ = S – A such that

$\sum_{x \in A} x = \sum_{x \in \overline{A}} x $

Which of the following is true ?

S₁ is NP problem and S₂ is P problem.

S₁ is NP problem and S₂ is NP problem.

S₁ is P problem and S₂ is P problem.

S₁ is P problem and S₂ is NP problem.

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 66

Suppose that the splits at every level of quicksort are in the proportion (1–𝛼) to 𝛼, where $0 < 𝛼 ≤ \frac 1 2$ is a constant. The minimum depth of a leaf in the recursion tree is approximately given by

$-\frac{lgn}{lg(1-\alpha)}$

$-\frac{lg(1-\alpha)}{lgn}$

$-\frac{lgn}{lg\alpha}$

$-\frac{lg\alpha}{lgn}$

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 67

Ten signals, each requiring 3000 Hz, are multiplexed on to a single channel using FDM. How much minimum bandwidth is required for the multiplexed channel ? Assume that the guard bands are 300 Hz wide.

30,000

32,700

33,000

None of the above

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 68

A terminal multiplexer has six 1200 bps terminals and ‘n’ 300 bps terminals connected to it. If the outgoing line is 9600 bps, what is the value of n ?

4

8

16

28

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 69

Which of the following is used in the options field of IPv4 ?

Strict source routing

Loose source routing

time stamp

All of the above

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 70

Which layers of the OSI reference model are host-to-host layers ?

Transport, Session, Presentation, Application

Network, Transport, Session, Presentation

Data-link, Network, Transport, Session

Physical, Data-link, Network, Transport

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 71

A network on the Internet has a subnet mask of 255.255.240.0. What is the maximum number of hosts it can handle ?

1024

2048

4096

8192

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 72

Four bits are used for packed sequence numbering in a sliding window protocol used in a computer network. What is the maximum window size ?

4

8

15

16

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 73

Given the following two grammars :

G₁ : S → AB | aaB

A → a | Aa

B → b

G₂ : S → a S b S | b S a S | λ

Which statement is correct ?

G₁ is unambiguous and G₂ is unambiguous.

G₁ is unambiguous and G₂ is ambiguous.

G₁ is ambiguous and G₂ is unambiguous.

G₁ is ambiguous and G₂ is ambiguous.

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 74

Match the following :

$\begin{array}{clcl} & \textbf{List – I} & & \textbf{List – II} \\ \text{a.} & \text{Chomsky Normal form} & \text{i.} & S \rightarrow b S S \mid a S \mid c \\ \text{b.} & \text{Greibach Normal form} & \text{ii.} & S \rightarrow a S b \mid ab \\ \text{c.} & \text{S-grammar} & \text{iii.} & S \rightarrow AS \mid a \\ & & & A \rightarrow SA \mid b \\ \text{d.} & \text{LL grammar} & \text{iv.} & S \rightarrow a B S B \\ & & & B \rightarrow b \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 75

Given the following two languages :

L₁ = {aⁿ bⁿ | n $\geq$ 1} ∪ {a}

L₂ = {w C w^R | w ∈ {a, b}* }

Which statement is correct ?

Both L₁ and L₂ are not deterministic.

L₁ is not deterministic and L₂ is deterministic.

L₁ is deterministic and L₂ is not deterministic.

Both L₁ and L₂ are deterministic.

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

UGC NET CSE - June 2014 | PAPER - III