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

» Programming in C and C Plus Plus » Programming in C » Elements of C-Tokens, Identifiers, Data Types in C

Edit

Appeared in Year: 2013

MCQ▾

Question

Consider the following two function declarations:

Which of the following is true? (September Paper-III)

Choices

Choice (4) Response

a.

(i), (ii) are identical.

b.

The first is a correct declaration and the second is wrong.

c.

(i), (ii) are different ways of declaring pointer to a function.

d.

The first declaration is a function returning a pointer to an integer and the second is a pointer to function returning integer.

Question number: 655

» Computer Graphics » Storage Devices, Input Tools, Authoring Tools

Edit

Appeared in Year: 2013

MCQ▾

Question

Which of the following graphics devices are known as active graphics devices?

(i) Alphanumeric devices

(ii) Thumb wheels

(iii) Digitizers

(iv) Joystics (September Paper-III)

Choices

Choice (4) Response

a.

(i), (ii), (iii) and (iv)

b.

(i) and (ii)

c.

(iii) and (iv)

d.

(i), (ii) and (iii)

Question number: 656

» Linear Programming Problem » LPP Standard Form, LPP in Canonical Form

Edit

Appeared in Year: 2013

MCQ▾

Question

A basic feasible solution to a m-origin, n-destination transportation problem is said to be ________ if the number of positive allocations are less than . (June Paper III)

Choices

Choice (4) Response

a.

Degenerate

b.

Non-degenerate

c.

Unbounded

d.

Unbalanced

Question number: 657

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

Edit

Appeared in Year: 2013

MCQ▾

Question

A job has four pages and the main memory has two page frames only. The job needs to process its pages in following order:

Assuming that a page interrupt occurs when a new page is brought in the main memory, irrespective of whether the page is swapped out or not. The number of page interrupts in FIFO and LRU page replacement algorithms are (June Paper III)

Choices

Choice (4) Response

a.

9 and 7

b.

7 and 6

c.

9 and 8

d.

8 and 6

Developed by: