| Q 1: | Minimum possible value of reliability is |
| (1) | 10 |
| (2) | 100 |
| (3) | 1 |
| (4) | 0 |
| Correct Answer: 0 | |
| Q 2: | A ............... is developed using historical cost information that relates some software metric to the project cost |
| (1) | Algorithmic cost modeling |
| (2) | Expert judgement |
| (3) | Estimation by analogy |
| (4) | Parkinson's Law |
| Correct Answer: Algorithmic cost modeling | |
| Q 3: | CASE tools are used..... |
| (1) | To maintain |
| (2) | To get routine work in a developemetn project done |
| (3) | To train users of the system |
| (4) | As a productivity tool in systems development |
| Correct Answer: As a productivity tool in systems development | |
| Q 4: | GSM allows a reuse factor of |
| (1) | 1 |
| (2) | 3 |
| (3) | 5 |
| (4) | 7 |
| Correct Answer: 3 | |
| Q 5: | ARQ stands for |
| (1) | Automatic repeat quantization |
| (2) | Automatic repeat request |
| (3) | Automatic retransmission request |
| (4) | Achknowledge repeat request |
| Correct Answer: Automatic repeat request | |
| Q 6: | A and B are the only two stations on an Ethernet. Each has a steady queue of frames to send. Both A and B attempt to transmit a frame, collide, and A wins the first backoff race. At the end of this successful transmission by A, both A and B attempt to transmit and collide. The probability that A wins the second |
| (1) | 0.5 |
| (2) | 0.625 |
| (3) | 0.75 |
| (4) | 1 |
| Correct Answer: 0.625 | |
| Q 7: | In E-R model, Y is the dominant entity and X is subordinate entity |
| (1) | If X is deleted, then Y is also deleted |
| (2) | If Y is deleted, then X is also deleted |
| (3) | If Y is deleted, then X is not deleted |
| (4) | None |
| Correct Answer: If Y is deleted, then X is also deleted | |
| Q 8: | A set of possible data value is called |
| (1) | Attribute |
| (2) | Degree |
| (3) | Tuple |
| (4) | Domain |
| Correct Answer: Domain | |
| Q 9: | A table can be logically connected to another table by defining a |
| (1) | Super key |
| (2) | Candidate key |
| (3) | Primary key |
| (4) | Unique key |
| Correct Answer: Primary key | |
| Q 10: | Consider the following schedules using transactions T1, T2 and T3
Which of the following must be TRUE? |
| (1) | S is conflict serializable as T1 → T2→ T3 |
| (2) | S is conflict serializable as T2→ T1→ T3 |
| (3) | S is conflict serializable as T3→ T1→ T2 |
| (4) | S is conflict serializable as T3 →T2 →T1 |
| Correct Answer: S is conflict serializable as T3→ T1→ T2 | |
