Paper 3 has been removed from NET from 2018 (Notification) now paper 2 and 3 syllabus is included in paper 2. Practice both paper 2 and 3 from past papers.
CBSE NET ComputerScience June2012 Solved Paper III
Download PDF of This Page (Size: 189K) ↧
 Secrets to easily score in UGC PaperIGet India's number 1 postal course with thoursands of UGC NET PaperI questions Examrace CBSEUGC PaperI Postal Course

Consider the following pseudocode segment: K: = 0 for i1: = l to n for i2: = 1 to i1: For im: = 1 to im–1 K: = K + 1 The value of K after the execution of this code shall be

C (n + m – 1, m)

C (n – m + 1, m)

C (n + m – 1, n)

C (n – m + 1, n)
Answer: a


In Delta Rule for error minimization

Weights are adjusted w. r. To change in the output

Weights are adjusted w. r. To difference between desired output and actual output

Weights are adjusted w. r. To difference between input and output

None of the above
Answer: b


The concept of pipelining is most effective in improving performance if the tasks being performed in different stages:

require different amount of time

require about the same amount of time

require different amount of time with time difference between any two tasks being same

require different amount with time difference between any two tasks being different
Answer: b


What is Granularity?

The size of database

The size of data item

The size of record

The size of file
Answer: b


Suppose that a given application is run on a 64processor machine and that 70 percent of the application can be parallelized. Then the expected performance improvement using Amdahl's law is

4.22

3.22

3.32

3.52
Answer: b


Match the following:

OLAP 1 Regression

OLTP 2 Data Warehouse

Decision Tree 3 RDBMS

Neural Network 4 Classification
1 2 2 4

2 3 1 4

2 3 4 1

3 2 1 4

3 2 4 1
Answer: b


Which level of Abstraction describes what data are stored in the Database?

Physical level

View level

Abstraction level

Logical level
Answer: d


The problem that occurs when one transaction updates a database item and then the transaction fails for some reason is ________.

Temporary Select Problem

Temporary Modify Problem

Dirty Read Problem

None
Answer: c


In an image compression system 16384 bits are used to represent 256 × 256 image with 256 gray levels. What is the compression ratio for this system?

1

2

4

8
Answer: b


X. 25 is ________ Network.

Connection Oriented Network

Connection less Network

Either Connection Oriented or Connection Less

Neither Connection Oriented nor Connection Less
Answer: a


Which of the following can be used for clustering of data?

Single layer perception

Multilayer perception

Self organizing map

Radial basis function
Answer: c


Which of the following is scheme to deal with deadlock?

Time out

Time in

Both A & (B)

None of the above
Answer: a


If the pixels of an image are shuffled then the parameter that may change is

Histogram

Mean

Entropy

Covariance
Answer: d


The common property of functional language and logical programming language:

Both are declarative

Both are based on lcalculus

Both are procedural

Both are functional
Answer: a


Given the following statements:

The power of deterministic finite state machine and nondeterministic finite state machine are same.

The power of deterministic pushdown automaton and nondeterministic pushdown automaton are same.
Which of the above is the correct statement (s)?

Both 1 and 2

Only 1

Only 2

Neither 1 nor 2
Answer: b


Consider a schema R (A, B, C, D) and functional dependencies A → B and C → D. Then the decomposition R1 (A, B) and R2 (C, D) is

Dependency preserving but not lossless join

Dependency preserving and lossless join

Lossless Join but not dependency preserving

Lossless Join
Answer: a


The quantiser in an imagecompression system is a

lossy element which exploits the psychovisual redundancy

lossless element which exploits the psychovisual redundancy

lossy element which exploits the statistical redundancy

lossless element which exploits the statistical redundancy
Answer: a


Data Warehouse provides

Transaction Responsiveness

Storage, Functionality Responsiveness to queries

Demand and Supply Responsiveness

None of the above
Answer: b


A * algorithm uses f = g + h to estimate the cost of getting from the initial state to the goal state, where g is a measure of the cost of getting from initial state to the current node and the function h is an estimate of the cost of getting from the current node to the goal state. To find a path involving the fewest number of steps, we should set

g = 1

g = 0

h = 0

h = 1
Answer: a


The transform which possesses the hghest ‘energy compaction’ property is

Slant transform

Cosine transforms

Fourier transforms

KarhunenLoeve transforms
Answer: d


The _______ memory allocation function modifies the previous allocated space.

calloc ()

free ()

malloc ()

realloc ()
Answer: d


Which is not the correct statement (s)?

Every context sensitive language is recursive.

There is a recursive language that is not context sensitive.

1 is true, 2 is false.

1 is true and 2 is true.

1 is false, 2 is false.

1 is false and 2 is true.
Answer: b



The mechanism that binds code and data together and keeps them secure from outside world is known as

Abstraction

Inheritance

Encapsulation

Polymorphism
Answer: c


Identify the addressing modes of below instructions and match them:

ADI 1. Immediate addressing

STA 2. Direct addressing

CMA 3. Implied addressing

SUB 4. Register addressing

a – 1, b – 2, c – 3, d – 4

a – 2, b – 1, c – 4, d – 3

a – 3, b – 2, c – 1, d – 4

a – 4, b – 3, c – 2, d – 1
Answer: a



Which one of the following is not a Greibach Normal form grammar?

S → a  bA  aA  bB A → a B → b

S → a  aA  AB A → a B → b

S → a  A  aA
A → a

1 and 2

1 and 3

2 and 3

1, 2 and 3
Answer: c


Which of the following IP address class is a multicast address?

Class A

Class B

Class C

Class D
Answer: d


While unit testing a module, it is found that for a set of test data, maximum 90% of the code alone were tested with a probability of success 0.9. The reliability of the module is

atleast greater than 0.9

equal to 0.9

atmost 0.81

atleast 1/0.81
Answer: c


The upper bound of computing time of m coloring decision problem is

O (nm)

O (nm)

O (nmn)

O (nmmn)
Answer: c


Which one of the following statements is incorrect?

The number of regions corresponds to the cyclomatic complexity.

Cyclometric complexity for a flow graph G is V G = N – E + 2, where E is the number of edges and N is the number of nodes in the flow graph.

Cyclometric complexity for a flow graph G is V G = E – N + 2, where E is the number of edges & N is the number of nodes in the flow graph.

Cyclometric complexity for a flow graph G is V G = P + 1, where P is the number of predicate nodes contained in the flow graph G.
Answer: c


Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shortest path from source vertex s to u has weight 53 and shortest path from s to v has weight 65. Which statement is always true?

Weight (u, v) < 12

Weight (u, v) = 12

Weight (u, v) > 12

Weight (u, v) > 12
Answer: c


Consider the regular expression (a + b) (a + b) … (a + b) (ntimes). The minimum number of states in finite automaton that recognizes the language represented by this regular expression contains

n states

n + 1 states

n + 2 states

2n states
Answer: b


Number of binary trees formed with 5 nodes is

32

36

120

42
Answer: d


Are we building the right product? This statement refers to

Verification

Validation

Testing

Software quality assurance
Answer: b


The following postfix expression is evaluated using a stack 823^/23 * + 51 * – The top two elements of the stack after first * is evaluated

6, 1

5, 7

3, 2

1, 5
Answer: a


The following CFG S → aB  bA, A → a  as  bAA, B → b  bs  aBB Generates strings of terminals that have

Odd number of a's and odd number of b's

Even number of a's and even number of b's

Equal number of a's and b's

Not equal number of a's and b's
Answer: c


Consider the following pseudocode: If (A > B) and (C > D) then A = A + 1 B = B + 1 Endif the cyclomatic complexity of the pseudocode is

2

3

4

5
Answer: b


Which layer of OSI reference model uses the ICMP (Internet Control Message Protocol)?

Transport layer

Data link layer

Network layer

Application layer
Answer: d
Answer: c


Which diagram provides a formal graphic notation for modelling objects, classes and their relationships to one another?

Object diagram

Class diagram

Instance diagram

Analysis diagram
Answer: a


A computer system supports 32 bit virtual address as well as 32 bit physical addresses. Since the virtual address space is of same size as that of physical address space, if we want to get rid of virtual memory, which one of the followng is true?

Efficient implementation of multiuser support is no longer possible.

The processor cache can be made more efficient.

Hardware support for memory management is not needed.

CPU scheduling can be made more efficient.
Answer: c


The feasible region represented by the constraints x1 – x2 < 1, x1 + x2 > 3, x1 > 0, x2 > 0 of the objective function Max Z = 3 × 1 + 2 × 2 is

A polygon

Unbounded feasible region

A point

None of these
Answer: b


The colour of an object is largely determined by its diffuse reflection coefficient. If Kd = (0.8, 0.4, 0), then what shall be the colour of the object, if the light used is blue and magenta?

White and Red

Red and Blue

Black and White

Black and Red
Answer: d


If an instruction takes ‘i’ microseconds and a page fault takes an additional ‘j’ microseconds. The effective instruction time, if on the average a page fault occurs every k instructions, is

1 + j/k

1 + j * k

(i + j)/k

(i + j) * k
Answer: a


How many relations are there on a set with n elements that are symmetric and a set with n elements that are reflexive and symmetric?

2n (n + 1)/2 and 2n. 3n (n–1)/2

3n (n–1)/2 and 2n (n–1)

2n (n + 1)/2 and 3n (n–1)/2

2n (n + 1)/2 and 2n (n–1)/2
Answer: d


The strategy used to reduce the number of tree branches and the number of static evaluations applied in case of a game tree is

Minmax strategy

Alphabeta pruning strategy

Constraint satisfaction strategy

Static max strategy
Answer: b


Match the following:

Regular Grammar 1 Pushdown automaton

Context free Grammar 2 Linear bounded automaton

Unrestricted Grammar 3 Deterministic finite automaton

Context Sensitive Grammar 4 Turing machine
1 2 3 4

3 1 2 4

3 1 4 2

3 2 1 4

3 2 4 1
Answer: b


What is the size (in terms of bits) of Header length field in IPV4 header?

2

4

8

16
Answer: b


Match the following with respect to java. Util. * class methods:
ListI ListII 
Bit Set

Calendar

Time zone

Random

Time zone getTimezone ()

int hashcode ()

int nextInt ()

Void setID (String tzName)
 A
 B
 C
 D

 2
 1
 4
 3

 3
 4
 1
 2

 4
 3
 2
 1

 2
 1
 3
 4
Answer: a


______ is sometimes said to be object oriented, because the only way to manipulate kernel objects is by invoking methods on their handles.

Windows NT

Windows XP

Windows VISTA

Windows 95/98
Answer: a


A user level process in Unix traps the signal sent on a Ctrl + C input and has a signal handling routine that saves appropriate files before terminating the process. When a Ctrl + C input is given to this process, what is the mode in which the signal handling routine executes?

User mode

Kernel mode

Superuser mode

Privileged mode
Answer: b


A CPU generally handles an interrupt by executing an interrupt service routine

As soon as an interrupt is raised

By checking the interrupt register at the end of fetch cycle

By checking the interrupt register after finishing the executing the current instruction

By checking the interrupt register at fixed time intervals
Answer: c


Radio signals generally propagate according to the following mechanisms:

Modulation, Amplification, Scattering

Reflection, Diffraction, Scattering

Amplification, Diffraction, Modulation

Reflection, Amplification, Diffraction
Answer: b


Identify the devices given below with their IC numbers:
ListI ListII 
USART

Micro controller

Interrupt controller

DMA controller

8251

8051

8259

8257
 A
 B
 C
 D

 1
 2
 3
 4

 2
 1
 4
 3

 3
 4
 1
 2

 4
 1
 2
 3
Answer: a


The optimal solution of the following assignment problem using Hungarian method is A 8 26 17 11 B 13 28 4 26 C 38 19 18 15 D 19 26 24 10

1 2 3 4

1 3 2 4

1 3 4 2

1 4 2 3
Answer: b


If a and b are the end points of a line, then which one of the following is true?

If both end points are left, right, above or below the window, the line is invisible.

If both end points are left, right, above or below the window, the line is completely visible.

If both end points are left, right, above or below the window, the line is trivially visible.

If both end points are left, right, above or below the window, the line is trivially invisible.
Answer: d


Match the following with link quality measurement and handoff initiation:
ListI ListII 
NetworkedControlled Handoff (NCHO)

MobileAssisted Handoff (MAHO)

Forward Handoff

Hard Handoff

MS connect to BS

Process via channel the target BS

First Generation Analog Cellular System

Second Generation Digital Cellular System
 A
 B
 C
 D

 3
 4
 2
 1

 2
 3
 1
 4

 2
 1
 4
 3

 4
 3
 1
 2
Answer: a


Consider the methods used by processes P1 and P2 for accessing their critical sections. The initial values of shared Boolean variables S1 and S2 are randomly assigned, P1 P2 While (S1 = = S2); while (S1 = = S2); Critical section critical section S1 = S2; S1 = S2; Which one of the following statements describes the properties achieved?

Mutual exclusion but not progress

Progress but not mutual exclusion

Neither mutual exclusion nor progress

Both mutual exclusion and progress
Answer: a


If the period of a signal is 1000 ms, then what is its frequency in kilohertz?

10–3 KHz

10–2 KHz

10–1 KHz

1 KHz
Answer: a


Let a * H and b * H be two cosets of H.

Either a * H and b * H are disjoint

a * H and b * H are identical
Then.

only 1 is true

only 2 is true

1 or 2 is true

1 and 2 is false
Answer: c


HTML is defined using SGML – an _______ standard, information processingtext and office systems (SGML) for text information processing.

ISO – 8878

ISO – 8879

ISO – 8880

ISO – 8881
Answer: b


What is the meaning of ‘Hibernate’ in Windows XP/Windows 7?

Restart the computers in safe mode.

Restart the computers in normal mode.

Shutdown the computer terminating all the running applications.

Shutdown the computer without closing the running applications.
Answer: d


Assume that we have constructor functions for both base class and derived class. Now consider the declaration in main (). Base * P = New Derived; in what sequence will the constructor be called?

Derived class constructor followed by Base class constructor.

Base class constructor followed by derived class constructor.

Base class constructor will not be called.

Derived class constructor will not be called.
Answer: b


Which one of the following options is not a shell in UNIX system?

Bourne Shell

C Shell

Net Shell

Korn Shell
Answer: c


In which file the compiler manage the various objects, which are used in windows programming?

Control File

Binary File

Text File

Obj File
Answer: c


On a disk with 1000 cylinders (0 to 999) find the number of tracks, the disk arm must move to satisfy all the requests in the disk queue. Assume the last request service was at track 345 and the head is moving toward track 0. The queue in FIFO order contains requests for the following tracks: 123, 874, 692, 475, 105, 376 (Assume SCAN algorithm)

2013

1219

1967

1507
Answer: b


Halftoning is defined as

A technique to obtain increased visual resolution using multiple intensity levels.

A technique for using minimum number of intensity levels to obtain increased visual resolution.

A technique to obtain increased visual resolution using maximum number of intensity levels.

A technique for using appropriate number intensity levels to obtain increased visual resolution.
Answer: b
