NTA-NET (Based on NTA-UGC) Computer Science (Paper-II): Questions 719 - 722 of 2104

Access detailed explanations (illustrated with images and videos) to 2104 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: 719

» Networks, Virtualization, & Cloud Computing » Internetworking » Gateways

Edit

Appeared in Year: 2013

MCQ▾

Question

Suppose a file of characters is to be sent over a line at . Assume that the data is sent in frames. Each frame consists of characters and an overhead of 48 bits per frame. Using synchronous transmission, the total overhead time is ________. (September Paper-III)

Choices

Choice (4)Response

a.

b.

c.

d.

Question number: 720

» Discrete Structures » Graph » Walks, Paths, Trails, Graphs, Cycles and Circuits

Edit

Appeared in Year: 2013

MCQ▾

Question

Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so that the graph is not connected is (September Paper II)

Choices

Choice (4)Response

a.

2451

b.

4950

c.

4851

d.

9900

Question number: 721

» Discrete Mathematics » Prepositional Logic

Edit

Appeared in Year: 2013

MCQ▾

Question

The quantification denotes the proposition “There exists a unique such that is true”, express the quantification using universal and existential quantifications and logical operators: (September Paper II)

Choices

Choice (4)Response

a.

b.

c.

d.

Question number: 722

» Software Engineering » Coding and Testing » Testing Level Metrics

Edit

Appeared in Year: 2013

Match List-Ⅰ List-Ⅱ▾

Question

Match the following: (June Paper III)

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

(A)

Watson- Felix model

(i)

Failure intensity

(B)

Putnam resource allocation model

(ii)

Cost estimation

(C)

Logarithmetic- Poisson Model

(iii)

Maintenance

(D)

Quick-Fix model

(iv)

Project planning

Choices

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

a.

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

b.

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

c.

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

d.

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

Developed by: