Blog

What are the roots of the quadratic equation   y = x – 17x + 42 

Identify the type of central conflict in each of the following texts. Choose the BEST matches.  (Hint: Who or what is the antagonist in each story?)

If a poem uses the term “red tape” to represent excessive official procedure, they are utilizing which specific device?

“Do Not Go Gentle into That Good Night,”  the villanelle written by Dylan Thomas that we read for class, uses urgent imperatives and the repetition of “Rage, rage against the dying of the light.” Given the understanding we have acquired from readings and class lectures/discussion (from the very beginning of class), which best describes the tone of the speaker?

Select all that apply. What organs or organ systems store glycogen?

Choose the best answer. Blood glucose is needed and cannot be a “0” value as:

Submit solutions by Gradescope. MEE 340, Summer 2026, Midterm 2, Online-1.pdf

Design a counter that starts at 1 then counts to 7 then counts to 2 then counts to 0 then counts to 4 then counts to 5 then counts to 3 and then counts to 6. Once it reaches 6 the counter returns to 1 and continues counting in the same manner. Additionally, it must be implemented using S R-flipflops, and answer the following:  Draw the transition graph for the counter. Draw the proper truth table for the present state and next state (make sure the first row of the “present state” start at 000 the next row 001 and so on until the last row is 111 all rows must be written). 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 (make sure the first row of the “present state” start at 000 the next row 001 and so on until the last row is 111 all rows must be written). 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. When does the counter go to the next value in the count?  Explain. What machine did you just implement?

Optional (Extra credit) Which of our modules introduces the basic structure of ROM?

Design a counter that starts at 6 then counts to 3 then counts to 1 then counts to 2 then counts to 4 then counts to 5 then counts to 7 and then counts to 0. Once it reaches 0 the counter returns to 6 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 (make sure the first row of the “present state” start at 000 the next row 001 and so on until the last row is 111 all rows must be written). 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 (make sure the first row of the “present state” start at 000 the next row 001 and so on until the last row is 111 all rows must be written). 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. When does the counter go to the next value in the count?  Explain. What machine did you just implement?