For what reason that UL scheduling is handled based on channel groups?
A. 
To save resource to send BSR
B. 
ENB cannot identify each bearer separate
C. 
Admission control is done per logical channel group so scheduling needs to work in the same way
D. 
To save UE battery power
2.
In DL scheduling, MCS is defined based on reported CQI. It is a procedure to select how much data rate the UE can get which is again only depending on the CQI.
A. 
True
B. 
False
3.
Frequency diversity and frequency selective scheduling methods can use the same method for PDSCH resource allocationtypes.
A. 
True
B. 
False
4.
Wideband CQI is better than subband CQI since eNB can learn the whole bandwidth.
A. 
True
B. 
False
5.
The worst resource allocation type resource utilization is PDSCH resource allocation type 2.
A. 
True
B. 
False
6.
What factor does not help to define the number of RBs to be allocated to a UE?
A. 
UE capability
B. 
Data in buffer to be sent to the UE
C. 
CQI reported by the UE
D. 
DL PDSCH power that equals to -10log(Pb+1)
7.
Frequency selective scheduling may result in not fully used resources.
A. 
True
B. 
False
8.
If UE has some data in its buffer but there is no UL resource assigned. Scheduling Request (SR) must be sent.
A. 
True
B. 
False
9.
MCS selection in both UL and DL is based on CQI reported by a UE.
A. 
True
B. 
False
10.
If the Min-GBR of non-GBR services is greater than the PBR, the service rate may not reach the Min-GBR.
The quiz below is designed to test your understanding of the introduction to end-user computing we completed this past week. What is a computer? This quiz tests your understanding of everyday computing, Legal Matters in IT,...
Questions: 30 | Attempts: 5176 | Last updated: Mar 22, 2022
Sample Question
The keyboard, mouse, and tower case are examples of:
If you are a software developer, one of the things that you need to be conversant with is the topic of soft computing and artificial neural networks. The introduction of these techniques has helped greatly in easing work and...
Questions: 10 | Attempts: 3501 | Last updated: May 27, 2022