Describe what constitutes an ER Model.
Give examples of types of business rules that are not reflected in a Presentation Layer ER diagram.
What is the difference between an inter-entity class relationship and an intra-entity class relationship?
Develop valid deletion rules and incorporate the associated deletion constraints for the EERD in diagram 3 of Exercise 15. Then explain the meaning of the incorporated deletion constraints,...
What is the difference between specialization and generalization? Why is this difference not reflected in ER diagrams?
What is the difference between total specialization and partial specialization and how is each reflected in an ER diagram?
The weak relationship type shown in Figure 5.32 requires further decomposition preparatory to mapping to a logical schema. Develop the final form of the Design-Specific ERD.
The Design-Specific ERD in Figure 5.13a requires further decomposition before it can be mapped to the logical tier. Specify the final form of the Design-Specific ERD that will render this design...
What is required to map a base entity type to a relation schema? Describe how this approach differs for a weak entity type.
Given the Universal Relation Schema URS (A, B, C, D, F, G) and the set of FDs prevailing over URS F {fd1, fd2, fd3, fd4, fd5, fd6}, where: a. Derive a canonical cover of F. b. Derive all the...
Explain functional dependency between two attributes.
Consider the relation schema PATIENT_VISIT (Patient, Hospital, Doctor) and the relation instance given below: In addition, suppose the following semantic rules exist. Each patient may be a patient...
Consider the relation schema ACTIVITY (Stu#, Sport, Cost) and associated relation instance shown below: a. What is the minimal cover of ACTIVITY? b. What, if any, immediate normal form violation...
What is the difference between a loss-join decomposition and a lossless-join decomposition?
Consider relation SUPPLY (S#, Sname, P#, Qty) with supplier names unique such that: F: fd1: S# Sname; fd2: Sname S#; {S#, P#} Qty S# represents a supplier number, Sname represents a supplier name,...
Given the relation schema FLIGHT (Gate#, Flight#, Date, Airport, Aircraft, Pilot) and the constraint set F {fd1, fd2, fd3} where: fd1: {Airport, Flight#, Date} Gate fd2: {Flight#, Date} Aircraft...
Figure 8.1 illustrates how a first normal form violation of ALBUM can be resolved. Suppose that a single album could never have more than four artists. Describe another approach for defining ALBUM...
Is the relation instance SHIRT in Exercise 2 in 5NF? If the answer is yes, explain. If the answer is no, provide a solution.
Given the set of functional dependencies F {fd1, fd2, fd3, fd4, fd5, fd6, fd7, fd8, fd9, fd10} introduced originally in Chapter 7, Exercise 14: fd1: Tenant# {Name, Job, Phone#, Address} fd2: Job ...
Consider the relation instance of the STU-CLASS relation schema. Identify at least one update anomaly, one insertion anomaly, and one deletion anomaly. STU-CLASS (Snum, Sname, Major, Cname, Time...
Given the schema SCHEDULE (Prof, Office, Major, {Book}, Course, Quarter) along with: F: fd1: Prof {Office, Major} and D: mvd: Prof --->> Book a. Identify the primary key of SCHEDULE such that...
What is a join dependency and in what way is it related to a multi-valued dependency?
Discuss the differences between a relation and a table.
Consider the TUTOR, TUTOR_ASSIGNMENT and COURSE relations that appear below. Show the results and the relational algebra expressions for the following four retrieval requests. a. What are the Course...
What is the difference between a Select statement that used Count (*) and a select statement that uses count (Column name)? How does Count (Column name) differ from Count (Distnct column name)?
Consider the following relation instance of the SPORT relation schema. a. What is the minimal cover of functional dependencies that exists in SPORT? b. What is (are) the candidate key(s) of SPORT? c....
Consider the universal relation schema STOCK (Symbol, Company, Exchange, Investor, Date, Price, Broker, Dividend) and the following dependencies set: fd: Symbol {Company, Exchange, Dividend} mvd:...
Consider the instance of the relation SHIRT (Shirt#, Color, Size) where Shirt# is equivalent to a style number (e.g., style number 341 might be a shirt with a button-down collar while style number...
Of what value is the use of parentheses when making use of the rules of operator precedence?
Write an SQL query that makes use of the Model clause to estimate the monthly production of milk in 2011 for each region to be equal to the average of the production of milk for that month during the...
You must have completed Exercise 9 before beginning this exercise, and thus have used the SQL Data Definition Language to create tables for the three relations DRIVER, TICKET_TYPE, and TICKET. Use...
This exercise is based on the data sets associated with Figure 2.25 in Chapter 2. a. Use the SQL Data Definition Language to create a relational schema that consists of the following three relations:...
Consider a 32-bit microprocessor, with a 16-bit external data bus, driven by an 8-MHz input clock. Assume that this microprocessor has a bus cycle whose minimum duration equals four input clock...
What are the differences among sequential access, direct access, and random access?
For a direct-mapped cache, a main memory address is viewed as consisting of three fields. List and define the three fields.
Consider again Example 4.3. How does the answer change if the main memory uses a block transfer capability that has a first-word access time of 30 ns and an access time of 5 ns for each word...
The hypothetical machine of Figure 3.4 also has two I/O instructions: 0011 = Load AC from I/O 0011 = Store AC to I/O In these cases, the 12-bit address identifies a particular I/O device. Show the...
Consider a microprocessor that has a memory read timing as shown in Figure 3.19. After some analysis, a designer determines that the memory falls short of providing read data on time by about 180 ns....
Consider a cache of 4 lines of 16 bytes each. Main memory is divided into blocks of 16 bytes each. That is, block 0 has bytes with addresses 0 through 15, and so on. Now consider a program that...
Consider a disk that rotates at 3600 rpm. The seek time to move the head between adjacent tracks is 2 ms. There are 32 sectors per track, which are stored in linear order from sector 0 through sector...
Suppose the program statement for (i = 1; i
a. Consider a fixed-point representation using decimal digits, in which the implied radix point can be in any position (e.g., to the right of the least significant digit, to the right of the most...
Outline a three-step process that leads to a characterization of the control unit.
Produce a vectorized version of the following program: DO 201 1, N DO 10J 1, M A(I) A(I B(IJ) x C(I,J) 10 CONTINUE D) E AI) 20 CONTINUE
Give several reasons for the choice by designers to move to a multi core organization rather than increase parallelism within a single processor.
Convert the following binary numbers to their decimal equivalents: a. 001100 b. 000011 c. 011100 d. 111100 e. 101010
A multiprocessor with eight processors has 20 attached tape drives. There are a large number of jobs submitted to the system that each require a maximum of four tape drives to complete execution....
What generalizations can you draw about converting a number from one base to a power of that base, e.g., from base 3 to base 9 (32) or from base 2 to base 4 (22) or base 8 (23)?
Convert the following hexadecimal numbers to their decimal equivalents: a. C b. 9F c. D52 d. 67E e. ABCD
Convert the following hexadecimal numbers to their decimal equivalents: a. F.4 b. D3.E c. 1111.1 d. 888.8 e. EBA.C
Convert the following decimal numbers to their hexadecimal equivalents: a. 16 b. 80 c. 2560 d. 3000 e. 62,500
Convert the following decimal numbers to their hexadecimal equivalents: a. 204.125 b. 255.875 c. 631.25 d. 10000.00390625
An alternative form of the S-R latch has the same structure as Figure 20.22 but uses NAND gates instead of NOR gates. a. Redo Table 20.10a and 20.10b for S-R latch implemented with NAND gates. b....
Show the structure of a PLA with three inputs (C, B, A) and four outputs (O0, O1, O2, O3), with the outputs defined as follows: o,-ABC AB + AB O ABC ABC 02-C 03-AB + AB
Design an 8-to-1 multiplexer.
Define predication and predicated execution.
Define control speculation.
What is the purpose of the NaT bit?
Define data speculation.
Suppose that an IA-64 opcode accepts three registers as operands and produces one register as a result. What is the maximum number of different operations that can be defined in one major opcode...
Simplify the following expressions: a. A = S T + V W + R S T b. A = T U V + X Y + Y c. A = F (E + F + G) d. A = (P Q + R + S T)T S e. f. g. A = (B E + C + F) C A D.DE
Assume that a stack register frame is created with size equal to SOF = 48. If the size of the local register group is SOL = 16, a. How many output registers (SOO) are there? b. Which registers are in...
What is the maximum effective number of major opcodes?
The initial Itanium implementation had two M-units and two I-units. Which of the templates in Table 21.3 cannot be paired as two bundles of instructions that could be executed completely in parallel?
In Section 21.3, we introduced the following constructs for predicated execution: where crel is a relation, such as eq, ne, etc.; p1, p2, and p3 are predicate registers; a is either a register or an...
For the predicated program in Section 21.3, which implements the flowchart of Figure 21.4, indicate a. Those instructions that can be executed in parallel b. Those instructions that can be bundled...
List some disadvantages of assembly language compared to high-level languages.
List some advantages of assembly language compared to high-level languages.
What happens if we pit Imp against Dwarf?
Give three examples of social engineering not listed in the text.
(a) What are the advantages of placing security within IT? (b) What are the disadvantages of placing security within IT? (c) What do most IT security analysts recommend about placing or not placing...
(a) What is the most common attack against wireless networks? Why? (b) Which IEEE standard governs WLAN transmission? (c) Which device acts as a relay between wired and wireless networks? (d) What is...
(a) Why do hosts use ARP? (b) Can ARP poisoning be used outside the LAN? Why not? (c) Why do hosts send ARP requests? (d) What is ARP spoofing? (e) How could an attacker use ARP spoofing to...
(a) Distinguish between mandatory access controls and discretionary access controls. (b) What is multilevel security? (c) What are SBU documents? (d) Do they need to be considered in access controls?...
a) How does a SQL injection attack work? b) What is SQL? c) What is error-based inference? d) What is the difference between in-band and out-of-band SQL injection? e) What is blind SQL injection? f)...
a) What different actions do criminal and civil law deal with? b) How do punishments differ in civil and criminal law? c) Who brings lawsuits in civil and criminal cases? d) What is the normal...
Identify some informal queries and update operations that you would expect to apply to the database shown in Figure 1.2.
Specify the following queries in SQL on the database schema of Figure 1.2. (a) Retrieve the names and major departments of all straight-A students (students who have a grade of A in all their...
Show the FP tree that would be made for the data from Exercise 28.14.
Consider the following relation: CAR_SALE(Car#, Date_sold, Salesman#, Commision%, Discount_amt Assume that a car may be sold by multiple salesmen and hence {CAR#, SALESMAN#} is the primary key....
In what normal form is the LOTS relation schema in Figure 15.12(a) with respect to the restrictive interpretations of normal form that take only the primary key into account? Would it be in the same...
Prove that any relation schema with two attributes is in BCNF.
Consider the universal relation R = {A, B, C, D, E, F, G, H, I} and the set of functional dependencies F = { {A, B} -> {C}, {A} -> {D, E}, {B} -> {F}, {F} -> {G, H}, {D} -> {I, J} }. What is the key...
Specify a template dependency for join dependencies.
Can you think of techniques other than an unordered overflow file that can be used to make insertion in an ordered file more efficient?
Modify the data structures for multiple-mode locks and the algorithms for read_lock(X), write_lock(X), and unlock(X) so that upgrading and downgrading of locks are possible.
Consider an application that transmits data at a steady rate (for example, the sender generates an N-bit unit of data every k time units, where k is small and fixed). Also, when such an application...
What is an overlay network? Does it include routers? What are the edges in the overlay network? How is the query-flooding overlay network created and maintained?
This elementary problem begins to explore propagation delay and transmission delay, two central concepts in data networking. Consider two hosts, A and B, connected by a single link of rate R bps....
Consider a short, l0-meter link, over which a sender can transmit at a rate of 150 bits/sec in both directions. Suppose that packets containing data are 100,000 bits long, and packets containing only...
Consider the GBN and SR protocols. Suppose the sequence number space is of size k. What is the largest allowable sender window that will avoid the occurrence of problems such as that in Figure 3.27...
Answer true or false se to the following questions and briefly justify your answer: a. With the SR protocol, it is possible for the sender to receive an ACK for a packet that falls outside of its...
Suppose we have two network entities, A and B. B has a supply of data messages that will be sent to A according to the following conventions. When A gets a request from the layer above to get the...
In Section 3.5.3, we discussed TCP's estimation of RTT. Why do you think T P avoids measuring the SampleRTT for retransmitted segments?
Consider Figure 3.46(b). If in increases beyond R/2, can Out increase beyond R/3 ? Explain. Now consider Figure 3.46(c). If in increases beyond R/2, can Out increase beyond R/4 under the assumption...
Consider Figure 3.58. Assuming TCP Reno is the protocol experiencing the behavior shown above, answer the following questions. In all cases, you should provide a short discussion justifying your...
Recall the macroscopic description of TCP throughput. In the period of time from when the connection's rate varies from W/(2. RTT) to W/RTT, only one packet is lost (at the very end of the period)....
In our discussion of TCP futures in Section 3.7, we noted that to achieve a throughput of 10 Gbps, TCP could only tolerate a segment loss probability of 2 10-)10 (or equivalently, one loss event for...
Repeat Problem 43, but replacing the 10 Mbps link with a 10 Gbps link. Note that in your answer to part c, you will realize that it takes a very long time for the congestion window size to reach its...
What is the difference between a group-shared tree and a source-based tree in the context of multicast routing?