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

» Discrete Mathematics » Number System

Edit

Appeared in Year: 2013

MCQ▾

Question

The relation “divides” on a set of positive integers is ________. (June Paper II)

Choices

Choice (4) Response

a.

Symmetric and transitive

b.

Anti symmetric and transitive

c.

Symmetric only

d.

Transitive only

Question number: 569

» Software Engineering » Software Design » Function Oriented Design

Edit

Appeared in Year: 2013

MCQ▾

Question

While estimating the cost of software, Lines Of Code (LOC) and Function Points (FP) are used to Measure which one of the following? (June Paper II)

Choices

Choice (4) Response

a.

Length of code

b.

Size of software

c.

Functionality of software

d.

All of the above

Question number: 570

» Programming in C and C Plus Plus » Programming in C » Structured Data Types in C-Arrays, Struct, Union, String, and Pointers

Edit

Appeared in Year: 2013

MCQ▾

Question

How many values can be held by an ? (June Paper II)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 571

» Discrete Structures » Graph » Spanning Trees

Edit

Appeared in Year: 2013

MCQ▾

Question

How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components? (June Paper II)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 572

» Discrete Structures » Graph » Spanning Trees

Edit

Appeared in Year: 2013

MCQ▾

Question

Which of the following connected simple graph has exactly one spanning tree? (June Paper II)

Choices

Choice (4) Response

a.

Complete graph

b.

Hamiltonian graph

c.

Euler graph

d.

None of the above

Question number: 573

» Data and File Structures » Priority Queues and Heaps

Edit

Appeared in Year: 2013

MCQ▾

Question

The time complexity to build a heap with a list of n numbers is (June Paper II)

Choices

Choice (4) Response

a.

b.

c.

d.

Developed by: