a- Define Mealy and Moore machines? b- Desian a se detectorof ANINE onts a " as Whenever the bit pattern "0100" appears in the input stream, it outputs z = 1; at all other times, z = 0. Overlapping occurrences of the pattern are also detected.

NAND2TETRIS HARDWARE SIMULATOR HiLoMux - This has one 8-bit input bus, in, and one 4-bit output bus, out. Alsopresent is a sel input, which is used to select what appears on out. Ifsel is false, then out should contain the lower 4-bits of in (i.e. in[0],in[1], in[2], in[3]). If sel is true, then out should contain theupper 4-bits of in (i.e. in[4] mapped to out[0], in[5], mapped toout[1], etc.). In other words, the HiLoMux can be used to select anibble from a byte please use the skeleton program below CHIP HiLoMux{    IN in[8], sel;    OUT out[4]; PARTS:     }

The determination to make a context switch is based on which of the following? (Select all that apply.) O illegal operation O reboot timer O system call

Answer the following questions regarding execution of loops. Assume that the code below is executed on an MSP430 (ie, an int has a size of two bytes). a. In the following code segment, how many times does the loop iterate? What are the values of kk, mm, and inVal at the end of the first and last loops? (You can specify the values in either hex or decimal, whichever you prefer.) unsigned int inVal, out, kk = 0x0001, mm = 0x1000; char count = 1; // ... while (kk != 0) { inVal _// (mm + kk) / kk; mm /= 2; kk = kk << 1; } //...

4. Convert the following infix expression into postfix ones: i. (A + B) * (D / E) ii. (A+B^D)/(D- F) + G iii. A* (B+ D)/ E-F* (G + H/ K)

In Linux code: Write egrep/grep reg expressions and or full cmd line for the following: To display lines that do not begin with a digit character. Do not use -v To display lines that end with an alphabet

Question 12 vish    .Write a program in mips assembly that takes an input from a user and converts it to postfix notation and then solve it Example: ((1-3)+5) corresponds to 13-5+ in postfix notation. Only handle inputs containing numbers 0-9 and operators +,-.  Full explain this question and text typing work only     We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line

Implement the function (in C or C++) with the following prototype: /** Implement a function which rotates a word left by n-bits, and returns that rotated value. Assume 0 <= n < w Examples: when x = 0x12345678 and w = 32: n=4 -> 0x23456781 n=20 -> 0x67812345 */ unsigned rotate_left(unsigned x, int n); The function should follow the bit-level integer coding rules above. Be careful of the case n = 0.

The stream manipulators dec, oct and hex affect only the next integer output operation T/F

Help with this. Solve the Heads-or-Tails problem in C or C++. Read the H-or-T data from either a file or from STDIN. Reportthe result and related statistics to STDOUT. Report any errors to STDERR:a. In an effort to find something to do during self-quarantine, your friend flips a coin many times andcarefully records the result of each flip in a character vector using either H or T. Write a functionprogram called longestRun that reads these characters from a file and then analyzes them to find thelargest number of consecutive heads or tails. It must return/display two values: (1) the numbercorresponding to how many max consecutive heads or tails were thrown in a row and (2) thecharacter H or T depending upon whether it was Heads or Tails that was thrown the most times. Inthe event of a tie for the longest run, return the character B for both     the text file is  HTHHTTTHHTHHHTHTHTHHHHHTTHHHHHHHHHHHHTTTTTTTTTH