NTA-NET (Based on NTA-UGC) Computer Science (Paper-II): Questions 743 - 748 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: 743

» Software Engineering » System Development Life Cycle » Water Fall Model

Edit

Appeared in Year: 2013

MCQ▾

Question

Working software is not available until late in the process in (September Paper II)

Choices

Choice (4) Response

a.

Waterfall model

b.

Prototyping model

c.

Incremental model

d.

Evolutionary Development model

Question number: 744

» Computer Graphics » Graphic Standard

Edit

Appeared in Year: 2013

MCQ▾

Question

If black lines interleaved with white lines can be distinguished across one inch, the resolution is (June Paper III)

Choices

Choice (4) Response

a.

line-pairs per inch

b.

line-pairs per inch

c.

lines per inch

d.

lines per inch

Question number: 745

» Analysis and Design of Algorithms » Analysis of Algorithms

Edit

Appeared in Year: 2013

MCQ▾

Question

Given two sorted list of size respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (December Paper-II)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 746

» Data and File Structures » Linked Lists

Edit

Appeared in Year: 2013

MCQ▾

Question

Linked Lists are not suitable for ________. (September Paper II)

Choices

Choice (4) Response

a.

Binary Search

b.

Polynomial Manipulation

c.

Insertion

d.

Radix Sort

Question number: 747

» Microprocessor » Dynamic Programming

Edit

Appeared in Year: 2013

MCQ▾

Question

Which of the following electronic component is not found in IC’s? (September Paper-III)

Choices

Choice (4) Response

a.

Diode

b.

Resistor

c.

Transistor

d.

Inductor

Question number: 748

» Operating Systems with Unix » Scheduling » Deadlock and Scheduling Algorithms

Edit

Appeared in Year: 2013

MCQ▾

Question

Suppose and are two semaphores initialized to 1. and are two processes which are sharing resources.

Table show P1 and P2 are two processes

Table show P1 and P2 are two processes

P1 has statements

P2 has statements

Wait (S);

Wait (Q);

Wait (Q);

Wait (S);

Critical-

Critical-

Section 1;

Section 2;

signal (s);

signal (Q);

signal (Q);

signal (s);

Their execution may sometimes lead to an undesirable situation called (June Paper III)

Choices

Choice (4) Response

a.

Starvation

b.

Race condition

c.

Multithreading

d.

Deadlock

Developed by: