Match List I with List II
| List I | List II |
|---|---|
| A. Digital Signature | I. Asymmetric encryption algorithm. |
| B. Hash Function | II. Confirms authenticity and integrity. |
| C. AES | III. Produces a fixed-size digest. |
| D. RSA | IV. Symmetric encryption algorithm. |
Choose the correct answer from the options given below:
Previous 10 Questions — UGC NET Computer Science 26 June 2025 (Paper II)
Nearest first
1
2
3
4
5
6
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)
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)
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)
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)
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)
Match List I and List II
List I
List II
A. Equivalence Partitioning
I. Measures independent …
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
2
3
4
5
6
7
8
9
10
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)
Maintaining a graph in memory by means of its adjacency matrix is known as
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
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)
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)
Which of the following trees are height balanced?
A. Binary Search Tree
B. AVL Tree
C. Red-Black Tree
D…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Let P denote “She is intelligent” and Q denote “She is happy.”
Given statements:
(a) If she is intelligent, the…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
The process followed in order to find difficult, unknown and hidden information about a software system is called:
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
When developing a dynamic programming algorithm, the sequence of steps followed is:
A. Construct an optimal s…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
The packet sent by a node to the source to inform it of congestion is called:
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
In a pack of 42 cards, 3 cards are chosen one after the other without replacement.
Find the number of ways this can…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
