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

List I (RAID Levels) List II (Description)
A. RAID Level 2 IV. Also known as Memory style error correcting code organization
B. RAID Level 3 III. Bit interleaved parity
C. RAID Level 5 I. Block interleaved distribution parity
D. RAID Level 6 II. Also known as P+Q redundancy scheme

Choose the correct answer from the options given below:

Solution

 A→III, B→IV, C→I, D→II

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

Nearest first
1
List I List II A. Circular Queue III. Dijkstra algorithm B. Priority Queue II. CPU Scheduling C. Double Ended Que…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
2
The write operation in I/O operation does the following -
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
3
Match List I with List II List I (Operations on Fuzzy Sets) List II (Description) A. Intersection IV. $\min(\mu_A…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
4
Considering the following statements:A. Data transformation is involved in Data mining process.B. Online database is us…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
5
Arrange the process of virtualization in cloud environments.A. Hypervisor installed on physical serverB. Virtual machin…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
6
Given that η refers to learning rate and xi refers to the i-th input to the neuron, which of the followings most suitab…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
7
The longest common subsequence of $\{1,2,3,2,4,1,2\}$ and $\{2,4,3,1,2,1\}$ is
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
8
Match List I with List II List I List II A. Clustered Page Table III. Useful for sparse address spaces. B. Hie…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
9
Consider the following three relations:Employee(eid, eName), Comp(cid, cName), Own(eid, cid).Which of the following rel…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
10
The correct sequence of constructing Huffman tree isA. Repeat until root formedB. Create leaf nodesC. Build priority qu…
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
int i, j;for(i = 1; i < 5; i += 2)    for(j = 1; j < i; j += 2)        printf("%d",…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
2
The computer needs to process each instruction with the following sequence of steps:A. Calculate the effective addressB…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
3
Consider the following DFA that generates set of strings over Σ = {a, b, c}.Identify the best description of the langua…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
4
Which of the following are examples of data encoding schemes?A. Non-Return to Zero (NRZ)B. Manchester EncodingC. Amplit…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
5
Consider the operators used in C programming given below:A. &&B. +=C. >>D. >=E. ?:Choose among the fol…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
6
List I (Projection Type) List II (Description) A. Oblique Projection IV. When the angle between the projectors and th…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
7
Which of the following statements are true?A. In the write-through policy, only the cache is updatedB. In the write-bac…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
8
Consider the following table about processes, their burst time and arrival time ProcessBurst TimeArrival Time P190 P2…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
9
The right sequence of suboperations that are performed in arithmetic pipeline is –A. Align the mantissasB. Add or subtr…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
10
Consider the Boolean expression A(x, y, z) = x (y′ + z′). Which of the following is the complete sum-of-products form o…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Ask Your Question or Put Your Review.

loading...