logo

Crowdly

Browser

Add to Chrome

Questions Bank (1573687 total)

Alla kuvattu liukuovi on ripustettu ylänurkistaan kitkattomien liukurullien varaan. Ovea siirretään kiihtyvällä liikkeellä ylänurkkaan kohdistuvalla vaakasuoralla voimalla  F = 493 N.

Oven massa on 52 kg, korkeus 1,9 m ja leveys 2,5 m. Massakeskipiste geometrisessä keskipisteessä. Laske voiman N1 suuruus. Ilmoita tulos yksikössä newton, yhden newtonin tarkkuudella ilman yksikköä. Vastauksessa positiivinen suunta ylöspäin.

 

liukuovi

View this question

In the wait‐die deadlock avoidance scheme, older transactions never wait for younger ones.

✅
❌
View this question

Consider the following schedule. 

   T1            |   T2

-----------+------------

                   | 

                   | lock-S(A)     : request lock and lock was granted

                   | read(A)

  lock-X(A) |                      : T1 requests a lock held by T2

  

Assume that TS(T1) < TS(T2), then under the wound‐wait deadlock scheme

✅
❌
❌
❌
View this question
View this question

Consider the following schedule

| T1                           | T2

+------------------+------------------

| BEGIN                    | 

| READ(A)                | 

| A = A + 50            | 

| WRITE(A)              | 

|                                | BEGIN

|                                | READ(A)

|                               | A = A + 200

|                               | WRITE(A)

|                               | READ(B)

|                               | B = 3 * B

|                               | WRITE(B)

|                               | COMMIT

| READ(B)               | 

| B = 12 * B             | 

| WRITE(B)             | 

| COMMIT               | 

0%
0%
0%
0%
View this question

In validation‐based concurrency control, which phase checks whether a transaction can safely commit without violating serializability?

0%
0%
0%
0%
View this question

Consider the following transaction schedule. Indicate if it is conflict-serializable or not:

|   T1         |   T2         |   T3

+--------+---------+--------

| read(A). |                |        

|                | read(B)  |        

|                |                | read(A)  

|                | read(A)  |        

|                |                | read(C)  

| read(B)  |                |        

|                |                | read(B)  

| read(C)  |                |        

|                | read(C)  |        

| commit  |                 |        

|                | commit  |        

|                |                | commit     

0%
0%
View this question

Optimistic (validation‐based) protocols tend to perform better than locking protocols in environments with low contention.

✅
❌
View this question

Recall that a shared lock may be held by several transactions, while an exclusive lock can be held by only one transaction. Consider two systems

• System A uses shared and exclusive locks.

• System B uses only exclusive locks.

Then,

 

0%
0%
0%
0%
View this question

In strict two‐phase locking (S2PL), when are all locks released?

❌
❌
✅
❌
View this question