Bob and Linda are both driving to a conference in Tampa. Bob lives in Sarasota, FL and his drive will be approximately 50 miles in distance and one hour in time driving. Linda lives in Miami, FL and her drive will be approximately 300 miles in distance and four hours in time driving.  Based only on the information above, what basic measure of risk indicates who is facing more risk, Bob or Linda? 

What is the most important objective that any successful risk management program must aim to achieve? 

Patricia is a 60 year old / female / who lives in Bismark, North Dakota – and she wants to apply for a life insurance policy. The life insurance company decides to perform a statistical probability analysis to determine the likelihood (frequency) that a 60 year old / female / who lives in Bismark, North Dakota will die within any given year.  Why does the life insurance company decide to perform the more time consuming statistical probability analysis; versus using the much more simple theoretical (A priori) probability analysis? 

George works for a large company, and part of his job is to monitor assets. George is particularly concerned that the company fleet of cars, along with the rising fuel prices are having an adverse effect during tight economic markets. If George’s concerns were categorized as causes of loss according to the quadrants of risk, his concern most directly relates to which one of the following types of risks?

Consider the following Boolean function: T(n, o, p, q) = Σ m(0, 1, 4, 5, 6, 7, 12, 13) Draw the proper truth table for this Boolean function. What should the output be in your Truth table and the corresponding square in your K-map at each minterm location? Draw and fill the proper k-map(s) (with all the labels).  Show the proper grouping in your k-map(s) to find the optimal (minimal) PoS Boolean expression. Write the resulting optimal (minimal) PoS Boolean expression. Draw the optimal PoS 2-level circuit and state the name of the 2-level circuit. Redraw the logic circuit as a 2-level logic circuit using NOR gates only. Write the Boolean expression of a 2-level logic circuit using NOR gates only.  

Design a counter that starts at 10 then counts to 8 then counts to 14 then counts to 0 then counts to 5 then counts to 2 and then counts to 3. Once it reaches 3 the counter returns to 10 and continues counting in the same manner. Additionally, it must be implemented using D-flipflops, and answer the following:  Draw the transition graph for the counter Draw the proper truth table for the present state and next state Draw and fill the proper k-map(s) with all the labels for the next state. Show the proper grouping in your k-map(s) and find the optimal (minimal) SoPs for the next state. Draw the proper truth table for the logic to be connected to each flip flop Draw and fill the proper k-map(s) with all the labels for the logic to be connected to each flip flop. Show the proper grouping in your k-map(s) and find the optimal (minimal) SoPs for the logic to be connected to each flip flop. Draw the logic design of the counter and show the output points where you would check the count. What is the trigger in your design for the counter to go to the next value? Explain. What machine did you just implement?

Identify the bone marking highlighted in blue labeled “A”

Design a counter that starts at 7 then counts to 6 then counts to 1 then counts to 3 then counts to 0 then counts to 4 and then counts to 2. Once it reaches 2 the counter returns to 7 and continues counting in the same manner. Additionally, it must be implemented using T-flipflops, and answer the following:  Draw the transition graph for the counter Draw the proper truth table for the present state and next state Draw and fill the proper k-map(s) with all the labels for the next state. Show the proper grouping in your k-map(s) and find the optimal (minimal) SoPs for the next state. Draw the proper truth table for the logic to be connected to each flip flop Draw and fill the proper k-map(s) with all the labels for the logic to be connected to each flip flop. Show the proper grouping in your k-map(s) and find the optimal (minimal) SoPs for the logic to be connected to each flip flop. Draw the logic design of the counter and show the points where you would check the count. What is the trigger in your design for the counter to go to the next value? Explain. What machine did you just implement?

If possible, it is best to limit a résumé to a single page.

Identify the entire bone labeled ‘3’