Purchase Solution

Algorithm Implementation of Edge Triggered

Not what you're looking for?

Ask Custom Question

(See attached file for full problem description)

1. S-R Latch
Given the following NAND implementation of an S-R latch,

Write its truth table.
Qt St Rt Qt+1
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1

2. Gate S-R latch.
Given the following implementation of a gated (clocked) S-R latch and its truth table.

S R C Q Q'
0 0 1 lastQ lastQ'
0 1 1 0 1
1 0 1 1 0
1 1 1 1 1
x x 0 lastQ lastQ'

Draw the Q output in the timing diagram:

** assume NO time delay for transitions

3. Gated D Latch.
Given the following implementation of a gated D latch and its truth table.

CD Q Q'
10 0 1
11 1 0
0 x lastQ lastQ'

Draw the Q output in the timing diagram:

** assume NO time delay for transitions

4. Edge triggered D Flip Flop
Given the following implementation of an edge triggered D flip flop and its truth table.

D Q
0 0
1 1

Draw the Q output in the timing diagram:

** assume NO time delay for transitions

Attachments
Purchase this Solution
Solution Summary

The implementation of an edge triggered D flip flop and its truth tables are determined. The output in the timing diagrams are discussed.

Purchase this Solution
Free BrainMass Quizzes
Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Probability Quiz

Some questions on probability

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

View More Free Quizzes
Related BrainMass Solutions

  • SR flip flop from D Flip flops

    219349 SR flip flop from D Flip flops Show how to build a rising edge triggered SR flip-flop using a rising edge triggered D flip-flop and combinational logic.

  • Algorithm Problem

    Analyze your algorithm. Answers: Just execute one more iteration of the Ford-Fulkerson algorithm. The new edge in E adds a new edge to the residual graph, so look for an augmenting path and update the flow if a path is found.

  • parent array produced by Dijkstra's algorithm

    from G by adding the same positive number, p, to all of the edge weights in the graph.

  • Depth First Numbering

    An edge (u,v) is assigned a direction u->v if u is the current node in algorithm and v is the neighbor being examined for its color white (=> (u->v) is a tree edge) or gray (=> (u->v) is a back edge).

  • Edge connectivity

    But c* cannot be smaller than k since that would imply a cut set of size smaller than k, contradicting the fact that k is the edge connectivity. Therefore c* = k and the algorithm returns the edge connectivity of the graph correctly.

  • Kruskal's algorithm

    72493 Kruskal's algorithm - graphs Suppose that all edge weights in a graph are integers in the range from 1 to |V|. How fast can you make Kruskal's algorithm run? What if the edge weights are integers in the range from 1 to W for some constant W?

  • Prim algorithm

    272209 Prim algorithm Please see the attached file. For the graph in 16.28(a), replicate the trace of Prim's algorithm to create a minimum spanning tree.

  • Proofs for minimum spanning trees

    Here is a divide and conquer algorithm for finding MST of a graph G: Divide V(G) to two arbitrary subsets V1 and V2 so that |V1| = [|V(G)|/2] and there is at least one edge between V1 and V2 in G.

  • Minimal Spanning Tree for a connected weighted graph

    Listing below, indicates the new vertex (add_vertex) and new edge (e) added to minimal spanning tree at the end of each iteration of this loop in steps 15 and 16.

View More Related Solutions