Software engineering

Software engineering

University

15 Qs

quiz-placeholder

Similar activities

Session 1

Session 1

University

16 Qs

VUA TIẾNG VIỆT

VUA TIẾNG VIỆT

University

20 Qs

Deret huruf

Deret huruf

University

10 Qs

Diode

Diode

University

11 Qs

CPFRS1

CPFRS1

University

16 Qs

world stroke day

world stroke day

University

10 Qs

Jet engine components

Jet engine components

University

16 Qs

Alphabet sound

Alphabet sound

University

15 Qs

Software engineering

Software engineering

Assessment

Quiz

Education

University

Hard

Created by

Anitha E

Used 1+ times

FREE Resource

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the first step of requirement elicitation ?

Identifying Stakeholder

Identifying Stakeholder

Requirements Gathering

All of the mentioned

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Arrange the tasks involved in requirements elicitation in an appropriate manner.

i. Consolidation

ii. Prioritization

iii. Requirements Gathering

iv. Evaluation

iii, i, ii, iv

iii, iv, ii, i

iii, ii, iv, i

ii, iii, iv, i

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Requirements elicitation is a cyclic process

True

False

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How many Scenarios are there in elicitation activities ?

1

2

3

4

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate(decision) nodes in the flow graph will be

4,5

5,4

3,1

13,8

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Cyclomatic complexity of a flow graph G with n vertices and e edges is

V(G)=e+n-2

V(G)=e-n+2

V(G)=e+n+2

V(G)=e-n-2

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which one of the following statements is incorrect ?

The number of regions corresponds to the cyclomatic complexity.

Cyclometric complexity for a flow graph G is V(G) = N – E + 2, where E is the number of edges and N is the number of nodes in the flow graph.

Cyclometric complexity for a flow graph G is V(G) = E – N + 2, where E is the number of edges & N is the number of nodes in the flow graph.

Cyclometric complexity for a flow graph G is V(G) = P + 1, where P is the number of predicate nodes contained in the flow graph G.

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?