NTANET (Based on NTAUGC) Computer Science (PaperII): Questions 723  726 of 2012
Access detailed explanations (illustrated with images and videos) to 2012 questions. Access all new questions we will add tracking exampattern 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: 723
» 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. 


Question number: 724
» Discrete Structures » Graph » Walks, Paths, Trails, Graphs, Cycles and Circuits
Appeared in Year: 2013
Question
A simple graph G with nvertices is connected if the graph has (September Paper II)
Choices
Choice (4)  Response  

a. 


b.  more than 

c.  less than 

d. 


Question number: 725
» Relational Database Design and SQL » NormalizationINF, 2NF, 3NF, BCNF and 4NF
Appeared in Year: 2013
Question
For a database relation where the domains of include only the atomic values. The functional dependency holds in the following relation (June Paper III)
Choices
Choice (4)  Response  

a.  In not in 

b.  In not in 

c.  In 

d.  In 

Question number: 726
» Discrete Mathematics » Mathematical Logics
Appeared in Year: 2013
Question
Horn clauses are special kinds of propositions which can be described as (June Paper III)
Choices
Choice (4)  Response  

a.  Single or multiple atomic proposition on left side. 

b.  A single atomic proposition on left side or an empty left side 

c.  A single atomic proposition on left side and a single atomic proposition on right side. 

d.  Single atomic proposition on left side. 
