Aspire Faculty ID #14530 · Topic: UGC NET Computer Science 26 June 2025 (Paper II) · Just now
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/CA Choose the correct answer from the options given below:

Solution

Protocol Type Explanation
A. Reservation Controlled Access Stations reserve the channel for transmission before sending data.
B. Polling Controlled Access A central controller polls each station to determine if it has data to send.
C. TDMA (Time Division Multiple Access) Channelization Divides the channel into time slots — not part of controlled access.
D. Token Passing Controlled Access A special token is passed between stations; only the holder can transmit.
E. CSMA/CA Random Access Uses collision avoidance — it’s a contention-based protocol, not controlled access.

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

Nearest first

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

Ascending by ID
1
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)
2
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)
3
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)
4
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)
5
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)
6
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)
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
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)
9
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)
10
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)
Ask Your Question or Put Your Review.

loading...