Aspire Faculty ID #14529 · Topic: UGC NET Computer Science 26 June 2025 (Paper II) · Just now
UGC NET Computer Science 26 June 2025 (Paper II)

Match List I and List II
List I List II
A. Equivalence Partitioning I. Measures independent paths in code
B. Boundary Value Analysis II. Divides input into valid/invalid sets
C. Cyclomatic Complexity III. Focuses on limits of input ranges
D. Decision Table Testing IV. In which a number of combinations of actions are tested under varying sets of conditions

Choose the correct answer from the options given below:

Solution

Technique Description Matching Statement
A. Equivalence Partitioning Divides the input domain into valid and invalid partitions. II – Divides input into valid/invalid sets
B. Boundary Value Analysis Tests the boundaries of input ranges (min/max limits). III – Focuses on limits of input ranges
C. Cyclomatic Complexity Measures the number of independent paths through the source code. I – Measures independent paths in code
D. Decision Table Testing Used to test combinations of conditions and corresponding actions. IV – Tests combinations of actions under varying conditions

Next 10 Questions — UGC NET Computer Science 26 June 2025 (Paper II)

Ascending by ID
1
Which of the following are controlled-access protocols? A. Reservation B. Polling C. TDMA D. Token Passing E. CSMA…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
2
What would be the equivalent pointer expression for referring the array element ar[m][n][o]? *(*(*(ar) + m + n) + o)…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
3
Which of the following is not a valid property over two fuzzy relations $\tilde R$ and $\tilde S$ for performing $\lamb…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
4
Which of the following belongs to McCall’s Quality Factors? A. Maintainability B. Usability C. Integrity…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
5
Match List I with List II List I List II A. Count to infinity problem I. Mobile Adhoc Networ…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
6
Match List I with List II List I List II A. Digital Signature I. Asymmetric encryption algor…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
7
Arrange the following parsers in increasing order of their power (least → most): LR(0) LR(1) LALR(1) LL(0) S…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
8
Maintaining a graph in memory by means of its adjacency matrix is known as
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
9
Consider the following interrupt protection levels in Linux, and arrange them in the increasing order of their prioriti…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
10
Consider relation R(A, B, C, D, E) with the following functional dependencies: C → F, E → A, EC → D, A → B. Wh…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Ask Your Question or Put Your Review.

loading...