Previous Year Question Papers for UGC NET August 2024 Computer Science with Solutions

Q1➡ |
Match List I with List – II

List – I
(A) Dijkstra’s Algorithms
(B) Floyd-Warshall Algorithms
(C) Bellman-frod Algorithms
(D) Prim’s Algorithms

List – II
(I) Find the shortest path between all pairs of vertices in a graph with positive or negative edge weights.
(II) Finds the shortest path in a weighted graph with non-negative edge weights.
(III) Sorts elements by repeatedly moving them post neighboring elements that are smaller.
(IV) Determines the strongest connected components in a directed graph.


Choose the correct answer from the options given below:
i ➥ (A)-(II), (B)-(I), (C)-(III), (D)-(IV)
ii ➥ (A)-(II), (B)-(I), (C)-(IV), (D)-(III)
iii ➥(A)-(I), (B)-(II), (C)-(III), (D)-(IV)
iv ➥ (А)-(ІІІ), (B)-(II), (C)-(IV), (D)-(I)
Best Explanation:
Answer:
Explanation: Upload Soon
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line
Q2➡ |

Match List I with List – II
List – I
(A) HTML
(B) DHTML
(C) XML
(D) JAVA
List – II
(1) Allow for dynamic and interactive web pages.
(II) Defines the structure of web pages.
(III) Object-oriented programming language for web applications.
(IV) Used for data storage and transport.

Choose the correct answer from the options given below:
i ➥ (A)-(I), (B)-(III), (C)-(II), (D)-(IV)
ii ➥ (A)-(II), (B)-(III), (C)-(IV), (D)-(I)
iii ➥ (A)-(II), (B)-(I), (C)-(IV), (D)-(III)
iv ➥ (А)-(III), (B)-(I), (C)-(IV), (D)-(II)
Best Explanation:
Answer:
Explanation: Upload Soon
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line
error: Content is protected !!
Open chat
1
Hi,how Can We Help You ?