Aspire Faculty ID #18804 · Topic: UGC NET Computer Science Sep 2022 (Paper II) · Just now
UGC NET Computer Science Sep 2022 (Paper II)

A good software requirement specification does NOT have the characteristic

Solution

A good SRS means Software Requirement Specification.

A good SRS should have characteristics like:

Completeness

Consistency

Clarity

Correctness

Verifiability

Modifiability

Traceability

Now check the options:

Completeness is a characteristic of good SRS because all requirements should be included.

Consistency is a characteristic of good SRS because requirements should not conflict with each other.

Clarity is a characteristic of good SRS because requirements should be clearly written and easily understood.

Reliability is mainly a software quality characteristic, not a direct characteristic of SRS.

Therefore, a good SRS does NOT have Reliability as its main SRS characteristic.

Previous 10 Questions — UGC NET Computer Science Sep 2022 (Paper II)

Nearest first
1
Consider the following in Boolean Algebra$X:a\lor(b\land(a\lor c))=(a\lor b)\land(a\lor c)$$Y:a\land(b\lor(a\land c))=(…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
2
Consider the following statements about Context Free Language (CFL):Statement I: CFL is closed under homomorphism.State…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
3
Consider the following statements:Statement I: LALR parser is more powerful than canonical LR Parser.Statement II: SLR …
Topic: UGC NET Computer Science Sep 2022 (Paper II)
4
A top down approach to programming calls for:Statement I: Working from the general to the specific.Statement II: Postpo…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
5
Consider the following statements:Statement I: Composite attributes cannot be divided into smaller subparts.Statement I…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
6
Consider the following statements:Statement I: Conservative 2 PL is a deadlock-free protocol.Statement II: Thomas's wri…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
7
Consider the following statements of approximation algorithm:Statement I: Vertex-cover is a polynomial time 2-approxima…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
8
Consider the following:List IList II(A) Stack algorithm(I) Deadlock(B) Elevator algorithm(II) Disk scheduling(C) Priori…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
9
Consider the following algorithms and their running times:List IList II(A) Breadth First Search(I) $\theta(V+E)$(B) Rab…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
10
Match List I with List II:List IList II(A) Physical layer(I) Routing of the signals, divide the outgoing message into p…
Topic: UGC NET Computer Science Sep 2022 (Paper II)

Next 10 Questions — UGC NET Computer Science Sep 2022 (Paper II)

Ascending by ID
Ask Your Question or Put Your Review.

loading...