Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Algorithm Design Techniques Dynamic Programming
Match the following :
|
P. Matrix multiplication |
1.Greedy method |
|
Q. Huffman Coding |
2. Dynamic programming |
|
R. Biconnected Components |
3. Divide & Conquer |
|
S. Reliability Design |
4. Depth First Traversal |
1
P – 1, Q – 2, R – 3, S – 4
2
P – 3, Q – 2, R – 4, S – 1
3
P – 3, Q – 1, R – 4, S – 2
4
P – 4, Q – 1, R – 2, S – 3