NTA-NET (Based on NTA-UGC) Computer Science (Paper-II): Questions 809 - 813 of 2202

Access detailed explanations (illustrated with images and videos) to 2202 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. Unlimited Access for Unlimited Time!

View Sample Explanation or View Features.

Rs. 550.00 or

How to register?

Question number: 809

» Computer Graphics » Graphic Standard

Edit

Appeared in Year: 2013

MCQ▾

Question

The transformation matrix required for conversion of CMY colour model to RGB colour model is given as: (December paper III)

Choices

Choice (4)Response

a.

b.

c.

d.

Question number: 810

» Programming Languages » Java

Edit

Appeared in Year: 2013

Match List-Ⅰ List-Ⅱ▾

Question

Match the following with respect to programming languages: (December paper III)

List-Ⅰ (Column I)List-Ⅱ (Column II)

(A)

Object Oriented Programming

(i)

PASCAL

(B)

Structured Language

(ii)

JAVA

(C)

Interpreted Programming Language

(iii)

BASIC

(D)

Non-structured Language

(iv)

FORTRAN

Choices

Choice (4)Response
  • (A)
  • (B)
  • (C)
  • (D)

a.

  • (i)
  • (iii)
  • (iv)
  • (ii)

b.

  • (i)
  • (iii)
  • (ii)
  • (iv)

c.

  • (i)
  • (ii)
  • (iv)
  • (iii)

d.

  • (ii)
  • (i)
  • (iii)
  • (iv)

Question number: 811

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

Edit

Appeared in Year: 2013

MCQ▾

Question

Simplest way of deadlock recovery is (December paper III)

Choices

Choice (4)Response

a.

Roll back

b.

Preempt resource

c.

Lock one of the processes

d.

Kill one of the processes

Question number: 812

» System Software and Compilers » Loading, Linking, Relocation, Program Relocatability

Edit

Appeared in Year: 2013

MCQ▾

Question

Which of the following concepts means adding new concepts to a program as it runs? (December paper III)

Choices

Choice (4)Response

a.

Data hiding

b.

Dynamic loading

c.

Dynamic typing

d.

Dynamic binding

Question number: 813

» Analysis and Design of Algorithms » Introduction, Types, & Design of Algorithms

Edit

Appeared in Year: 2013

MCQ▾

Question

Let and be two matrices. The efficient algorithm to multiply the two matrices has the time complexity. (December paper III)

Choices

Choice (4)Response

a.

b.

c.

d.

Developed by: