Aspire Faculty ID #14708 · Topic: UGC NET Computer Science 26 June 2025 (Paper II) · Just now
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:

Solution

In computer networks, when congestion occurs in a network, the router sends a special control packet called a choke packet to the source. This packet informs the source node to slow down the transmission rate to prevent further congestion. This method is part of congestion control mechanisms such as the Choke Packet Technique used in the Internet Control Message Protocol (ICMP).

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

Nearest first
1
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)
2
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)
3
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)
4
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)
5
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)
6
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)
7
Maintaining a graph in memory by means of its adjacency matrix is known as
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
8
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)
9
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)
10
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)

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

Ascending by ID
1
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)
2
The transformation of data from main memory to cache memory is referred as:
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
3
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)
4
Consider the following table defining the sample inputs and corresponding target values for a perceptron model. …
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
5
Arrange the following in the increasing order of coupling from lowest coupling to highest coupling. A. Common Coupling …
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
6
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)
7
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)
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
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)
10
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)
Ask Your Question or Put Your Review.

loading...