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

» Analysis and Design of Algorithms » Analysis of Algorithms

Edit

Appeared in Year: 2015

MCQ▾

Question

Floyd-Warshall algorithm utilizes …………… to solve the all-pairs shortest paths problem on a directed graph in ……………. time. (December)

Choices

Choice (4) Response

a.

Greedy algorithm, θ (V2 lgn)

b.

Dynamic programming, θ (V3)

c.

Greedy algorithm, θ (V3)

d.

Dynamic programming, θ (V2 lgn)

Question number: 49

» Fuzzy Systems » Fuzzy Logic Tools

Edit

Appeared in Year: 2015

MCQ▾

Question

A bell-shaped membership function is specified by three parameters (a, b, c) as follows: (December)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 50

» Computer Graphics » Graphic Standard

Edit

Appeared in Year: 2015

MCQ▾

Question

Which of the following graphic primitives are considered as the basic building blocks of computer graphics?

(1) Points

(2) Lines

(3) Polylines

(4) Polygons (December)

Choices

Choice (4) Response

a.

(1), (2) and (3)

b.

(1) only

c.

(1) and (2)

d.

(1), (2), (3) and (4)

Question number: 51

» System Software and Compilers » Context Free Grammars

Edit

Appeared in Year: 2015

MCQ▾

Question

The context free grammar given by

(December)

Choices

Choice (4) Response

a.

(a + b) (bbb) (a + b) *

b.

(a + b) *bbb

c.

abbb (a + b) *

d.

(a + b) * (bbb) (a + b) *

Question number: 52

» Computer Graphics » Graphic Standard

Edit

Appeared in Year: 2015

MCQ▾

Question

Which raster locations would be chosen by Bresenham’s algorithm when scan converting a line from (1,1) to (8,5)? (December)

Choices

Choice (4) Response

a.

Raster locations will be: Choice A

Table showing the Raster locations

X

Y

1

1

2

2

3

3

4

3

5

4

6

4

7

5

8

6

b.

Raster locations will be: Choice B

Table showing the Raster locations

X

Y

1

1

2

2

3

2

4

3

5

4

6

5

7

6

8

7

c.

Raster locations will be: Choice C

Table showing the Raster locations

X

Y

1

1

2

2

3

2

4

3

5

3

6

4

7

4

8

5

d.

Raster locations will be: Choice D

Table showing the Raster locations

X

Y

1

1

2

2

3

2

4

3

5

5

6

4

7

5

8

5

Developed by: