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

» Networks, Virtualization, & Cloud Computing » Network Fundamentals » Inter Networks

Edit

Appeared in Year: 2013

MCQ▾

Question

The ________ measures the relative strengths of two signals or a signal at two different points. (June Paper III)

Choices

Choice (4) Response

a.

attenuation

b.

frequency

c.

decibel

d.

throughput

Question number: 600

» Relational Database Design and SQL » Fundamentals of Database » Keys

Edit

Appeared in Year: 2013

MCQ▾

Question

________ constraints ensure that a value that appears in one relation for a given set of attributes also appears for a certain set of attributes in another relation. (September Paper-III)

Choices

Choice (4) Response

a.

Logical Integrity

b.

Referential Integrity

c.

Domain Integrity

d.

Data Integrity

Question number: 601

» Computer Arithmetic » Logic Families » Flip-Flops-Types, Race Condition and Comparison

Edit

Appeared in Year: 2013

MCQ▾

Question

The power dissipation of a flip-flop is . The power dissipation of a digital system with 4 flip- flops is given by (September Paper-III)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 602

» Discrete Structures » Graph » Tree and Rooted Tree

Edit

Appeared in Year: 2013

MCQ▾

Question

The amortized time complexity to perform ________ operation (s) in Splay trees is (September Paper II)

Choices

Choice (4) Response

a.

Search

b.

Search and Insert

c.

Search and Delete

d.

Search, Insert and Delete

Question number: 603

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

Edit

Appeared in Year: 2013

MCQ▾

Question

Consider the following set of processes with the length of CPU burst time in milliseconds (ms):

Table shows the set of processes

Table shows the set of processes

Process

A

B

C

D

E

Burst time

6

1

2

1

5

Priority

3

1

3

4

2

Assume that processes are stored in ready queue in following order:

Using round robin scheduling with time slice of 1 ms, the average turn around time is (September Paper-III)

Choices

Choice (4) Response

a.

b.

c.

d.

Developed by: