NTA-NET (Based on NTA-UGC) Computer Science (Paper-II): Questions 489 - 493 of 2012

Access detailed explanations (illustrated with images and videos) to 2012 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. Subscription can be renewed yearly absolutely FREE! View Sample Explanation or View Features.

Rs. 550.00 or

How to register?

Question number: 489

» Discrete Mathematics » Prepositional Logic

Edit

Appeared in Year: 2012

MCQ▾

Question

Skolmization is the process of (December Paper III)

Choices

Choice (4) Response

a.

bringing all the quantifiers in the beginning of a formula in FDL.

b.

removing all the universal quantifiers.

c.

removing all the existential quantifiers.

d.

All of the above

Question number: 490

» Software Engineering » Coding and Testing » Errors,Faults and Failures

Edit

Appeared in Year: 2012

MCQ▾

Question

A program P calls two subprograms P1 and P2. P1 can fail 50 % times and P2 40 % times. Then P can fail (December Paper III)

Choices

Choice (4) Response

a.

50%

b.

60%

c.

10%

d.

70%

Question number: 491

» Current Trends and Technologies » Mobile Computing » Mobile Computing Applications

Edit

Appeared in Year: 2012

MCQ▾

Question

Which are the classifications of data used in Mobile Applications? (December Paper III)

Choices

Choice (4) Response

a.

Private data, User data, Shared data.

b.

Public data, User data, Virtual data.

c.

Private data, Public data, Shared data.

d.

Public data, Virtual data, User data.

Question number: 492

» Operating Systems with Unix » Basic Concepts » Interrupts,System Calls,Instructions

Edit

Appeared in Year: 2012

MCQ▾

Question

Consider a system having m resources of the same type. These resources are shared by 3 processes A, B and C which have peak demands of 3,4 and 6 respectively. For what value of m deadlock will not occur? (December Paper III)

Choices

Choice (4) Response

a.

7

b.

9

c.

10

d.

13

Question number: 493

» Networks, Virtualization, & Cloud Computing » Data Communication » Multiplexing and Concentration, Switching Techniques, Polling

Edit

Appeared in Year: 2012

MCQ▾

Question

The technique of temporarily delaying outgoing acknowledgements so that they can be hooked onto the next outgoing data frame is known as (December Paper III)

Choices

Choice (4) Response

a.

Bit stuffing

b.

Piggy backing

c.

Pipelining

d.

Broadcasting

Developed by: