1. Sketch logic diagram to implement F 2. Draw the truth table of function F 3. Use Boolean Algebra to simplify the function 4. What is minimum number of basic gates (AND, OR and NOT) needed to implement F.

Which of the following statements accurately represents the best method of logic circuit simplification? a. Actual circuit trial and error evaluation and waveform analysis b. Boolean algebra and actual circuit trial and error evaluation c. Karnaugh mapping and circuit waveform analysis d. Karnaugh mapping and Boolean algebra

Required information A fan is to run only when all of the following conditions are met: • Input A is OFF. • Input B is ON or input C is ON, or both B and Care ON. Inputs D and E are both ON. . One or more of inputs F, G, or H are ON. Note: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Identify the correct gate logic diagram for the given control system. Multiple Choice K

2. Answer the questions about the ladder logic program shown below. Timer_1.DN TON Timer Preset Accum a.) At 23 seconds after the program is started, what are the following values? i. Timer_1.ACC ii. Counter_1.ACC b.) How many seconds after the program starts will PB1 turn on? Timer_1.DN 36 Counter_1.DN ㅋㅌ Timer 1 (EN) 5000 (DN) CTU Counter Counter_1 CU Preset (DN) Accum 8 04 PB1