The students are required to design a special counter with an x input that counts the digits/letters in your student ID as given below. ● When x=1 counter must count forward, ie., if your student ID is 120202015, the counter counts starting from the most significant digit 1 →2 → 0→2-0→... When x=0 counter must count backward, ie, 5 → 1→0→2→0→→ ... starting from wherever the last digit was during the previous count operation. The counter must contain an asynchronous preset or clear input to force the counter to a known initial state. The counter output should be connected to a 7-segment display to demonstrate the correct operation. a) Derive the state diagram, describe the meaning of each state clearly. Specify the type of the sequential circuit (Mealy or Moore), b) Determine the number of state variables to use and assign binary codes to the states in the state diagram, c) Choose the type of the FFs for the implementation. Give the complete state table of the counter, using reverse characteristics tables of the corresponding FFs d) Obtain Boolean functions for state inputs and output(s), e) Draw the corresponding circuit diagram for the student ID counter,

The students are required to design a special counter with an x input that counts the digits/letters in your student ID as given below. ● When x=1 counter must count forward, ie., if your student ID is 120202015, the counter counts starting from the most significant digit 1 →2 → 0→2-0→... When x=0 counter must count backward, ie, 5 → 1→0→2→0→→ ... starting from wherever the last digit was during the previous count operation. The counter must contain an asynchronous preset or clear input to force the counter to a known initial state. The counter output should be connected to a 7-segment display to demonstrate the correct operation. a) Derive the state diagram, describe the meaning of each state clearly. Specify the type of the sequential circuit (Mealy or Moore), b) Determine the number of state variables to use and assign binary codes to the states in the state diagram, c) Choose the type of the FFs for the implementation. Give the complete state table of the counter, using reverse characteristics tables of the corresponding FFs d) Obtain Boolean functions for state inputs and output(s), e) Draw the corresponding circuit diagram for the student ID counter,

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

A Sequence Detector is a circuit which given an input string of bits generates an output 1 whenever the target sequence (pattern) has been detected. There are two types of sequence detectors: Overlapping: The detector allows overlapping, hence the final bits of one sequence can be the start of another sequence. Non-overlapping: The detector does not allow overlapping, hence a new sequence starts only after the previous sequence is completed. Ex: Detect pattern 101 For non-overlapping case: Input :0110101011001 Output:0000100010000 For overlapping case: Input :0110101011001 Output:0000101010000 Design a sequential circuit (overlapping) with an input 'x' the pattern to be detected is 01010 For this circuit: 1. Draw the ASM diagram. 2. Construct the state table. 3. Draw the logic circuit for the datapath and control in logisim.
You need to display your IDs first 7 digits using one seven segment display. The ID is= 202189464 [This is an individual project & you need to work at logisim.] You need to design a combinational circuit where you will provide manual input. For each of your inputs, your IDs one digit will be shown. After solving the K-map, if your IDs 7th digit is an Even Number then you need to implement every boolean function using NAND gate and if your IDs 7th digit is Odd Number then you need to implement every boolean function using NOR gate. Simulate the circuit and upload the screenshot.
Later, the student uses the oscillator to create a single pulse with initial speed vo at at the left end of the string, as shown above. The student wants to quantify the observation that the pulse slows down on the right half of the string. The student comes up with the following equation relating the string’s diameter D at a given point on the string to the speed v of the pulse at that point: v=vo(Do/D) (c) Is the equation consistent with the observation that the pulse slows down on the right half of the string? ____Yes ____No (d) Using frame-by-frame analysis of video of the pulse, the student plots the speed v of the pulse as a function of the string diameter D, as shown below. Are the data in the graph consistent with the student’s equation above? ____Yes ____No
Implement the following Boolean function F(A, B, C, D)= m(1,4, 6, 7, 8,9, 12, 13,15) with: An 8x1 MUX. Assume that the inputs A, B, and C are used for the select lines.
Write a simplified expression for the Boolean function defined by the following Kmap. You need to show your groupings and the the matching Boolean expressions. WX 00 01 11 yz 00 01 1 0 O 10 1 X x 0 x 11 10 0 0 x x 1 x 0 1 4
Write a simplified expression for the Boolean function defined by the following Kmap. You need to show your groupings and the the matching Boolean expressions. WX yz 00 01 11 10 001x0 0 1 01 11 10 O O X 0 1 X O X X O X 1
The function that is not implemented by the karnaugh map shown below is XYI WZ 00 01 11 10 00 X 01 X 1 11 1 1 1 1 10 X X Select one: O a. (W + Y) X O b. None of the above O c. XY + YW O d. (W + X)(W + Y)(X + Y)
Depending on X which is the last digit of your student number, implement the followingfunction F by using one 8-to-1 multiplexer. F(A, B, C, D) = Σm(X-4, X-1, X, X+1, 13, 14, 15) x=8
A DFA is defines as (Q, S, 6, q0, F) where Q (q0, q1, q2, q3, q4, q5), S= (0, 1), F= (q3, 94), and the transilion function & is defined as in table below: q0 (start) q1 q2 q1 q1 93 q2 94 92 q3 (accepting state) q5 q5 94 (accepting state) q5 q5 q5 q5 Show/prove that this DFA is minimal or otherwise?
Given the truth table below, where A,B,C,D are inputs and Y is the output: Truth Table ABCDY 0 0000 0 1 00010 2 0010 1 3 0011 1 4 0 1000 5 0 1011 6 0 110 1 7 0 111 1 8 1000 0 9 10011 1 10 10 1 |1 10111 1 11001 11010 3 1 11100 1 11110 5 a) Generate the Karnaugh Map. Use the space to the right of the truth table. b) Draw the largest loops you can. Use different colored loops preferably. c) Give the minimal logic expression. (Hint: Each loop should correspond to one part of the expression.) Show the parts of the expression that correspond to each loop.
Depending on X which is the last digit of your student number, implement the followingfunction F by using one 8-to-1 multiplexer. F(A, B, C, D) = Σm(2, 5, 6, 7, 13, 14, 15)
Simplify Boolean function using K map. Variables are marked in order of xyz 1 0 1 1 1 0 1 1 Question 89 options: y’+z y’z’ + y z’+y none of teh above