Preview

ECT114 Week3 Homework

Satisfactory Essays
Open Document
Open Document
1022 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
ECT114 Week3 Homework
ading Summary
These are the automatically computed results of your exam. Grades for essay questions, and comments from your instructor, are in the "Details" section below.
Date Taken:
7/24/2014
Time Spent:
5 h , 44 min , 39 secs
Points Received:
20 / 26 (76.9%)
Number of Attempts:
0

Question Type:
# Of Questions:
# Correct:
Multiple Choice
15
12
Matching
1
1

Grade Details - All Questions

Question 1.
Question :
(TCO 3) Determine the Boolean expression at TP1 with respect to the corresponding inputs.

Student Answer:

Instructor Explanation:
TP1 is the output of an OR gate. The Boolean operator for the OR gate is + and the inputs are A and B. Refer to Chapter 3 of the textbook for more information.

Points Received:
1 of 1 Comments:

Question 2.
Question :
(TCO 3) Determine the Boolean expression at TP2 with respect to the corresponding inputs.

Student Answer:

Instructor Explanation:
TP2 is the output of an AND gate. The Boolean operator for the AND gate is  and the inputs are C and D. Refer to Chapter 3 of the textbook for more information.

Points Received:
1 of 1 Comments:

Question 3.
Question :
(TCO 3) Determine the VHDL assignment statement at Z with respect to the inputs.

Student Answer:

Z <= (A NAND B) AND (C OR D);

Z <= NOT A AND B AND (C OR D);

Z <= NOT (A AND B) AND C OR D;

Z <= NOT A AND B AND C OR D; Instructor Explanation:
TP1 <= (A NAND B); TP2 <= (C OR D); Z <= (A NAND B) AND (C OR D);. Refer to the Week 1 Lecture for additional information on VHDL.

Points Received:
0 of 2 Comments:

Question 4.
Question :
(TCO 3) Determine the Boolean expression at Z with respect to the inputs.

Student Answer:

Instructor Explanation:
Z is the output of a NAND gate. The Boolean operator for the NAND gate is , there should be an inversion bar over the entire expression, and the inputs are (A + B) and (C D). Refer to Chapter 3

You May Also Find These Documents Helpful

  • Satisfactory Essays

    ECT114 week 3 lab

    • 299 Words
    • 2 Pages

    2. Using QUARTUS II software, open a Block Diagram/Schematic file. Insert the logic gate symbol for the following Boolean expressions. Connect and label input and output pins. Paste the schematics into this iLab. (20 points)…

    • 299 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    b. 1 represents a bit that is turned ON. 0 represents a bit that is turned OFF. (pg. 8)…

    • 388 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Bus 210 Week 2 Study Guide

    • 1147 Words
    • 5 Pages

    These are the automatically computed results of your exam. Grades for essay questions, and comments from your instructor, are in the "Details" section below.…

    • 1147 Words
    • 5 Pages
    Satisfactory Essays
  • Good Essays

    Compter Science

    • 819 Words
    • 4 Pages

    truth table construction, subexpression construction using AND and NOT gates, subexpression combination using OR gates, circuit diagram production…

    • 819 Words
    • 4 Pages
    Good Essays
  • Satisfactory Essays

    Nor Gate

    • 1094 Words
    • 5 Pages

    3) NOR GATE Schematic View: Program: * SPICE export from S-Edit 12.00 Tue Sep 15 04:22:22 2009 * Design: NOR…

    • 1094 Words
    • 5 Pages
    Satisfactory Essays
  • Good Essays

    Bearing in mind the key words indicated above the table below was used to add Boolean operators which are words…

    • 291 Words
    • 2 Pages
    Good Essays
  • Good Essays

    My Compromise

    • 4527 Words
    • 19 Pages

    These are the automatically computed results of your exam. Grades for essay questions, and comments from your instructor, are in the "Details" section below.…

    • 4527 Words
    • 19 Pages
    Good Essays
  • Satisfactory Essays

    Storyboard

    • 465 Words
    • 2 Pages

    HOST: This method Is called negation. Where the original proposition giving the value T is negated than the value F is returned. Now we move to the next logical operators considered the binary operators.…

    • 465 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    Boolean is a data type which has two values, usually true and false. With search engines, Boolean is used to get better search results. If ‘AND’ is in the search, it will find all the words either side…

    • 1449 Words
    • 5 Pages
    Good Essays
  • Satisfactory Essays

    A Boolean expression for a logic circuit may be reduced to a simpler form The simplified expression can then be used to implement a circuit equivalent to the original circuit Consider the following example:…

    • 3354 Words
    • 14 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Half Adder

    • 576 Words
    • 3 Pages

    From the minterms in the truth table we get the following Boolean equations for the circuit. Sum = a’b + ab’ or a ⊕ b…

    • 576 Words
    • 3 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Vlsi Sample Codes

    • 325 Words
    • 2 Pages

    The VHDL code implementing this finite-state machine is shown in Example A–1, which includes a schematic of the synthesized circuit. The machine is described with two processes. One process defines the synchronous elements of the design (state registers); the other process defines the combinational part of the design (state assignment case statement). See the discussion under ‘‘wait Statement” in Chapter 6 for more details on using the two processes.…

    • 325 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Ic Number Display

    • 13097 Words
    • 53 Pages

    9 => 0 => A => 6 => B => 1 => C => D => 5 => 7 => 4 => E…

    • 13097 Words
    • 53 Pages
    Satisfactory Essays
  • Good Essays

    nkhjk

    • 2325 Words
    • 14 Pages

    STATE ELIGIBILITY TEST COMPUTER SCIENCE AND APPLICATIONS (SYLLABUS) SUBJECT CODE : 28 PAPER-II 1. Discrete Structures Sets, Relations, Functions, Pigeonhole Principle, Inclusion-Exclusion Principle, Equivalence and Partial Orderings, Elementary Counting Techniques, Probability. Measure(s) for information and Mutual information. Computability: Models of computation-Finite Automata, Pushdown Automata, Non-determinism and NFA, DPDA and PDAs and Languages accepted by these structures.…

    • 2325 Words
    • 14 Pages
    Good Essays
  • Satisfactory Essays

    My First Paper

    • 546 Words
    • 3 Pages

    EEE 365 Digital Electronics Page 1 of 2 EEE 365 Digital Electronics (Credit: 3.0) Introduction to number systems and codes. Analysis and synthesis of digital logic circuits: Basic logic functions, Boolean algebra, combinational logic design, minimization of combinational logic. Implementation of basic static logic gates in TTL, ECL, IIL and CMOS and BiCMOS: DC characteristics, noise margin and power dissipation. Power optimization of basic gates and combinational logic circuits.…

    • 546 Words
    • 3 Pages
    Satisfactory Essays