NTANET (Based on NTAUGC) Computer Science (PaperII): Questions 719  722 of 2104
Access detailed explanations (illustrated with images and videos) to 2104 questions. Access all new questions we will add tracking exampattern 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
Appeared in Year: 2013
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 PaperIII)
Choices
Choice (4)  Response  

a. 
 
b. 
 
c. 
 
d. 

Question number: 720
» Discrete Structures » Graph » Walks, Paths, Trails, Graphs, Cycles and Circuits
Appeared in Year: 2013
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
Appeared in Year: 2013
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
Appeared in Year: 2013
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) QuickFix model  (iv) Project planning 
Choices
Choice (4)  Response  

 
a. 
 
b. 
 
c. 
 
d. 
