Ne demek istoyusun anlamadım
Answer:
- Transform binary or unary M:N relationship or associative entity with its own key.
Explanation:
Transform binary relation is described as the method through which a decimal can easily be converted into binary while the unary relationship is described as a relationship in which both the two participants occurs from the same entity.
In the given case, 'transform binary or unary M:N relationship' can be created using 'the primary key linked with the relationship plus any non-key aspects of the relationship and the primary keys of the related entities' as it displays the existence of a relationship between the occurrences of a similar set of the entity i.e. associative entity here.
Answer:
okay actually what are you trying to get an answer for
Explanation:
Answer:
Processor
, Video-card , Memory
Explanation:
If you turn on your desktop computer and the monitor remains blank, the problem might either be as a result of Processor not working, Video card bad and memory not sitting well.
if the problem is associated with processor, do the following:
- Check if the power LED light on the motherboard is on or off.
- If the LED light is off, check for motherboard or power supply issues.
- If the LED light is on, check if the processor fan spins when the system is powered on.
Another major cause could be that the Video card is bad first thing to do is Update the drivers, then reseat the Videocard or probably change it.
Lastly memory module is loose, the computer might not display an image. In other words, your computer starts but the screen is black.
Now, you can try resetting the memory modules to fix the "PC turns on but no display" issue. Remove memory module from the memory slot, and then put it back into the slot to get a better connection so that the computer can recognise the memory.
left[0]=a[0];
for(int i=1;i<=n-1;i++)
left[i]=(left[i-1]*a[i])%M;
right[n-1]=a[n-1];
for(int i=n-2;i>=0;i--)
right[i]=(right[i-1]*a[i])%M;
for query q
if(q==0)
return right[1]%M;
if(q==n-1)
return left[n-2]%M;
return (left[q-1]*right[q+1])%M;
