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

» Data and File Structures » Trees & Graphs

Edit

Appeared in Year: 2013

MCQ▾

Question

For any B-tree of minimum degree , every node other than the root must have atleast ________ keys and every node can have at most ________ keys. (December Paper-II)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 651

» Computer Arithmetic » Logic Families » TTL, ECL and C-MOS Gates

Edit

Appeared in Year: 2013

MCQ▾

Question

FAN IN of a component A is defined as (December Paper-II)

Choices

Choice (4) Response

a.

Number of components that can call or pass control to component A.

b.

Number of components related to component A.

c.

Number of components that are called by component A.

d.

Number of components dependent on component A.

Question number: 652

» Data and File Structures » Trees & Graphs

Edit

Appeared in Year: 2013

MCQ▾

Question

A vertex cover of an undirected graph is a subset vertices such that (June Paper III)

Choices

Choice (4) Response

a.

Each pair of vertices in is connected by an edge

b.

If

c.

If

d.

All pairs of vertices in are not connected by an edge

Question number: 653

» Linear Programming Problem » Solving Simple LPPs through These Methods

Edit

Appeared in Year: 2013

MCQ▾

Question

At any iteration of simplex method, if corresponding to any non-basic variable is obtained as zero, the solution under the test is (June Paper III)

Choices

Choice (4) Response

a.

Degenerate solution

b.

Unbounded solution

c.

Alternative solution

d.

Optimal solution

Developed by: