Cоnsidering the prоvided dаtаbаse, after executing the fоllowing update statement: UPDATE RideDetail xSET tip = price * 0.1WHERE price > 15; What RID value(s) would be returned by the following query: SELECT RIDFROM Rider rWHERE NOT EXISTS (SELECT * FROM RideDetail x WHERE x.RID = r.RID AND TIP > 4);
Prоblem 4) 4:1 MUX Write а System Verilоg mоdule nаmed MUX41 with а procedural code, using a case statement to implement the figure below. The case statement should select on variable S. Use a default of n bit x (undefined) for F, and an initial value of n bit 0 (these must be done with replication). (Remember initialization is not done with the Verilog keyword initial, initial is only used in test benches and is not synthesizable.) Parameterize inputs and outputs using the variable n, but you can assume S is 2 bits. The default for n should be 8. Use replication and concatenation so the number of bits in left hand side of assigns in resets, initializations and defaults are the same, shortcuts not allowed. Inputs should not be datatype logic or reg. Your module should have n bit inputs A, B, C, D, two bit select S, and n bit output F. F is determined by: Select 0 should be A, 1 should be B, 2 should be C, 3 should be D. The design should be to create parallel logic. Serial logic is not acceptable. For maximum credit your code should carefully follow the specification. Use the minimum number of lines to accomplish this specification, your code should be succinct and well organized. Also use proper indentation for organization. (If you instantiate a MUX to accomplish this you have to write the code for the MUX using a case so that you show you understand how to do that) Use System Verilog, always_ff, and always_comb, and don’t use reg datatype. (hint: see cheat sheet) Declare all variables, avoid errors or warnings that would occur during compilation, simulation or synthesis. Indent all blocks for full credit. Your code should be efficient and succinct. Don't use compiler directives or short cuts.
Prоblem 5) FSM Write а finite stаte mаchine System Verilоg mоdule named FSM. Finite State Machines are not parameterized, because the number of states is set by the problem. Use the state transition table below (which contains the same information as a state diagram). You only need this state transition table to build the FSM. Remember Z is purely combinatorial. Do not use an enumerated type for this problem (if you don't know what that is, you shouldn't worry about it). Use a localparam to do a state assignment and then use the names in your code rather than numbers. Use a standard Finite state machine design organized in parts a, b, c, ... below. Inputs must be x, reset, clk, and outputs must be State, and Z. This should be done by instantiation of register you have already designed in a previous problem (the D Register) and instantiation of MUX41 described below. Be sure to instantiate the MUX both for determining the next state and in another instance to determine the output Z. module MUX41 #(parameter S=6) (input [S-1:] A, B, C, D, input [1:0] Sel, output logic [S-1:0] Y); ... endmodule Don't complete this MUX just instantiate it, you will not get extra credit for completing the MUX. For maximum credit your code should carefully follow the specification, and your grade will depend that. Use the minimum number of lines to accomplish this specification, and be succinct and well organized. Also use proper indentation for organization. If you duplicate the function of instances in procedural code it will be counted incorrect. Use System Verilog, always_ff, and always_comb, and don’t use reg datatype. (hint: see cheat sheet) Declare all variables, avoid errors or warnings that would occur during compilation, simulation or synthesis. Indent all blocks for full credit. Your code should be efficient and succinct. Don't use compiler directives or short cuts. Use replication and concatenation so the number of bits in left hand side of assigns in resets, initializations and defaults are the same, shortcuts not allowed. Inputs should not be datatype logic or reg. next_state output Z State x=0 x=1 x=0 x=1 S0 S0 S1 1 0 S1 S2 S1 0 1 S2 S0 S3 1 1 S3 S3 S3 1 0 For full credit label each part of your solution a., b., or c. a. What Finite State Machine model are you using in this problem? b. Module statement and declarations and localparam c. Synchronous part using registers (in my solution this is 1 line) d. Combinatorial part using mux from previous problem (in my solution this is 2 lines) to determine the next state, e. Combinatorial part using mux to determine the output Z. for full credit follow all directions