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

» Discrete Structures » Graph » Hamiltonian and Eulerian Graphs, Planar Graphs

Edit

Appeared in Year: 2013

MCQ▾

Question

A graph is non-planar if and only if it contains a subgraph homomorphic to (December Paper-II)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 592

» 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

A Program contains the following declarations and initial assignments

  1. inti=8,j=5;
  2. doublex=0.005,y=–0.01;
  3. charc=’c’,d=’d’;

Determine the value of the following expressions which involve the use of library functions:

  1. bs(i-2*j);log(exp(x));
  2. toupper(d)

(September Paper-III)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 593

» Networks, Virtualization, & Cloud Computing » Network Security » E-Mail-Architecture

Edit

Appeared in Year: 2013

MCQ▾

Question

A method to provide secure transmission of email is called ________. (September Paper II)

Choices

Choice (4) Response

a.

TLS

b.

SA

c.

IPSec

d.

PGP

Question number: 594

» Software Engineering » Software Design » System Design

Edit

Appeared in Year: 2013

MCQ▾

Question

In ________, modules A and B make use of a common data type, but perhaps perform different operations on it. (September Paper-III)

Choices

Choice (4) Response

a.

Data coupling

b.

Stamp coupling

c.

Control coupling

d.

Content coupling

Question number: 595

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

Edit

Appeared in Year: 2013

MCQ▾

Question

Consider a preemptive priority based scheduling algorithm based on dynamically changing priority. Larger priority number implies higher priority. When the process is waiting for CPU in the ready queue (but not yet started execution), its priority changes at a rate When it starts running, its priority changes at a rate . All the processes are assigned priority value 0 when they enter ready queue. Assume that the following processes want to execute:

Table shows the process is waiting for CPU

Table shows the process is waiting for CPU

Process ID

Arrival Time

Service Time

P1

0

4

P2

1

1

P3

2

2

P4

3

1

The time quantum . When two processes want to join ready queue simultaneously, the process which has not executed recently is given priority. The finish time of processes will respectively be (December Paper-II)

Choices

Choice (4) Response

a.

b.

c.

d.

Developed by: