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

Maintaining a graph in memory by means of its adjacency matrix is known as

Solution

  • An adjacency matrix represents a graph using a 2D array (matrix).
  • This type of storage uses sequential memory allocation — rows and columns are stored in contiguous memory.
  • Hence, this method is called a Sequential Representation of a graph.
← Previous Next →

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

Nearest first
1
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)
 2
Match List I with List II List I List II A. Digital Signature I. Asymmetric encryption algor…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
 3
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)
 4
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)
 5
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)
 6
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)
 7
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)
 8
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
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)
 2
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)
 3
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)
 4
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)
 5
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)
 6
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)
 7
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)
 8
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)
 9
The transformation of data from main memory to cache memory is referred as:
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
 10
Match List I with List II: List I List II A. Address Space I. Associative Mappi…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Ask Your Question or Put Your Review.

loading...