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

Which of the following cohesions are better than the Procedural Cohesion?
A. Functional Cohesion
B. Sequential Cohesion
C. Temporal Cohesion
D. Communicational Cohesion
E. Logical Cohesion

Solution

Cohesion (best → worst): Functional → Sequential → Communicational → Procedural → Temporal → Logical → Coincidental Hence, those better than Procedural are: Functional (best) Sequential Communicational ✅ So, A, B, D are better.

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

Nearest first
1
Which of the following is not a requirement elicitation technique?
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
2
int x = 128, y = 110;do {    if (x > y) x = x - y;    else       y = y - x;}…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
3
Match List I with List II List I (Grammar Type) List II (Production Form) A. Type 3 Grammar …
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
4
Which of the following gates do not give output 1 when both inputs are 0?A. NAND gateB. NOR gateC. XOR gateD. XNOR gate
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
5
void main() {    int *i, a = 12, b = 2, c;    c = (a = a + b, b = a / b, a = a * b, b = a - b);&nbs…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
6
Arrange the following types of testing in the order they are usually performed in the Software Development Life Cycle (…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
7
Which of the following is NOT a parent selection technique used in genetic algorithm implementations?
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
8
Identify the correct statement(s) from the following with respect to Spinlock Semaphores:A. The name refers to busy wai…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
9
CB84000D001C001C is the content of a UDP header in hexadecimal format. The source port number is:
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
10
In a Stop-and-Wait system, the bandwidth of the line is 1 Mbps, and 1 bit takes 30 milliseconds to make a round trip. T…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)

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

Ascending by ID
1
Consider the following steps used by a knowledge base designer to represent a world:A. Selects atoms to represent propo…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
2
Only legal pointer operations:A. pointer + number → pointerB. pointer – number → numberC. pointer + pointer → pointerD.…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
3
Which of the following statements are TRUE about encryption techniques?A. In symmetric key cryptography, the secrecy/pr…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
4
Consider the following statements regarding Agent systems:A. Agent system comprises of an agent and an environment on w…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
5
Which of the following algorithms use the Greedy strategy?A. Dijkstra’s algorithmB. Kruskal’s algorithmC. Huffman codin…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
6
List I List II A. Overloading III. Supports compile-time polymorphism B. Early Binding …
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
7
Consider T1(A,B,C,D,E) with FDs { EB→C, D→E, EA→B } and T2(A,B,C,D) with FDs { C→A, A→B, A→D }. Which is TRUE?
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
8
Once a process is executing on the CPU, which events could not occur?A. Issues an I/O request and then placed in the Re…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
9
Let m and n be positive integers.(A) If n ≠ 1, then m < mn.(B) If k is composite, then k = mn where 1 < m, n >…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
10
Right sequence of CPU program to input data:A. Read status registerB. Check flag bitC. Read data registerD. Transfer da…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Ask Your Question or Put Your Review.

loading...