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

» Data and File Structures » Trees & Graphs

Edit

Appeared in Year: 2014

MCQ▾

Question

Convert the following infix expression into its equivalent post fix expression

(December Paper II)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 881

» Software Engineering » Software Design » Detailed Design

Edit

Appeared in Year: 2017

Match List-Ⅰ List-Ⅱ▾

Question

Match the terms related to Software Configuration Management (SCM) in List – I with the descriptions in List – II. (January Paper III)

List-Ⅰ (Software Configuration Management) List-Ⅱ (Descriptions)

(A)

Variant

(i)

An instance of a system that differs, in some way, from other instances.

(B)

Version

(ii)

An instance of a system that is distributed to customers.

(C)

Release

(iii)

An instance of a system which is functionally identical to other instances, but designed for different hardware/software configurations.

Choices

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

a.

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

b.

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

c.

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

d.

All of the above

Question number: 882

» Networks, Virtualization, & Cloud Computing » Network Fundamentals » Local Area Networks (LAN)

Edit

Appeared in Year: 2014

MCQ▾

Question

The minimum frame length for Mbps Ethernet is ________ bytes and maximum is ________ bytes. (June paper II)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 883

» Software Engineering » Software Design » System Design

Edit

Appeared in Year: 2014

MCQ▾

Question

Which one of the following is used to compute cyclomatic complexity? (December Paper II)

Choices

Choice (4) Response

a.

b.

, where E is the number of flow graph edges and N is the number of flow graph nodes.

c.

, where P is the number of predicate nodes in the flow graph G.

d.

, where P is the number of predicate nodes in the flow graph G.

Developed by: