(Solved) : 01330g Consider Language B 3j J 3i 1 J 1 Two Shortest Strings Language Q38815584 . . .

01330G. Consider the language {a b i 3j or j 3i, i >= 1, j>= 1}. a. What are the two shortest strings in the above language

01330G. Consider the language {a’ b’ i 3j or j 3i, i >= 1, j>= 1}. a. What are the two shortest strings in the above language? Show transcribed image text 01330G. Consider the language {a’ b’ i 3j or j 3i, i >= 1, j>= 1}. a. What are the two shortest strings in the above language?

Expert Answer


Answer to 01330G. Consider the language {a’ b’ i 3j or j 3i, i >= 1, j>= 1}. a. What are the two shortest strings in the above lan…

(Solved) : Suppose Following B Tree K 2 Maximum Number Keys Node 3 Keys Single Characters Show Tree Q38844475 . . .

a. Suppose I have the following B-Tree with K=2 (so the maximumnumber of keys in a node is 3), with keys as single characters:Show the tree that results from inserting a “P” into tree  DHL А ВС EF G I JK M N O

b. Suppose I had inserted the numbers 1-7 into a Fibonacci Heap.Recall that insert just adds each node to the rootlist at the toplevel, so I’d have just a linked list of the numbers 1-7: Recallthat in doing the extract-min operation, we consolidate the heap.Show the result of the Fibonacci heap after extracting the min andconsolidation. You may want to show intermediate steps as well- themore you show of how the algorithm works, the more partial credit Ican give you if something goes wrong.

adds each node to the rootlist at the top level, sc numbers 1-7: Min 4 7 1 2 3 5 6 that in doing the extract-min operation, w

DHL А ВС EF G I JK M N O adds each node to the rootlist at the top level, sc numbers 1-7: Min 4 7 1 2 3 5 6 that in doing the extract-min operation, we consolidate th Show transcribed image text DHL А ВС EF G I JK M N O
adds each node to the rootlist at the top level, sc numbers 1-7: Min 4 7 1 2 3 5 6 that in doing the extract-min operation, we consolidate th

Expert Answer


Answer to a. Suppose I have the following B-Tree with K=2 (so the maximum number of keys in a node is 3), with keys as single char…

(Solved) : Create Single Dimension Array Getting Array Elements Array Size User B Find Number Whethe Q38832490 . . .

a. Create a single dimension array getting array elements and array size from user. b. Find each number whether it is prime na. Create a single dimension array getting array elements and array size from user. b. Find each number whether it is prime number or not. c. Create a second array storing only prime numbers found from (b) above. d. Show this array on output window Show transcribed image text a. Create a single dimension array getting array elements and array size from user. b. Find each number whether it is prime number or not. c. Create a second array storing only prime numbers found from (b) above. d. Show this array on output window

Expert Answer


Answer to a. Create a single dimension array getting array elements and array size from user. b. Find each number whether it is pr…

(Solved) : 1 10 Points Following Circle True Statement Correct Otherwise Circle False True False Lin Q38802797 . . .

1. [10 points] For each of the following, circle TRUE if the statement is correct. Otherwise, circle FALSE (a)TRUE FALSE If A

1. [10 points] For each of the following, circle TRUE if the statement is correct. Otherwise, circle FALSE (a)TRUE FALSE If A LIN) for some NFAN, then A is nonregular. (b)TRUE FALSE- C-(xtvil x.yE (0,1) and xy s context free language. (c)TRUE FALSE – If A is a context-free language, then A is recognized by an NFA. (d)TRUE FALSE A language I. has a CFG if and only if L is recognized by a PDA (e)TRUE FALSE If a language A is not regular, then it must be infinite. (OTRUE FALSE A regular expression for the language (0″1″ In>0) is 0*1* (g)TRUE FALSE-NP is closed under ncatenation. (h) TRUE FALSE For any k> 1, there is no language that is decided by a TM with k tapes, but is undecidable by any TM having k-1 (or less) tapes. Boolean formula with two (i) TRUE FALSE DOUBLE-SAT <p> is satisfying assignments . DOUBLE-SAT is NP-Complete.. (k) TRUE FALSE 3″- O(2″) 1/7 Show transcribed image text 1. [10 points] For each of the following, circle TRUE if the statement is correct. Otherwise, circle FALSE (a)TRUE FALSE If A LIN) for some NFAN, then A is nonregular. (b)TRUE FALSE- C-(xtvil x.yE (0,1) and xy s context free language. (c)TRUE FALSE – If A is a context-free language, then A is recognized by an NFA. (d)TRUE FALSE A language I. has a CFG if and only if L is recognized by a PDA (e)TRUE FALSE If a language A is not regular, then it must be infinite. (OTRUE FALSE A regular expression for the language (0″1″ In>0) is 0*1* (g)TRUE FALSE-NP is closed under ncatenation. (h) TRUE FALSE For any k> 1, there is no language that is decided by a TM with k tapes, but is undecidable by any TM having k-1 (or less) tapes. Boolean formula with two (i) TRUE FALSE DOUBLE-SAT is satisfying assignments . DOUBLE-SAT is NP-Complete.. (k) TRUE FALSE 3″- O(2″) 1/7

Expert Answer


Answer to 1. [10 points] For each of the following, circle TRUE if the statement is correct. Otherwise, circle FALSE (a)TRUE FALSE…

(Solved) : 1 5 Points Consider Single Cycle Computer Shown Page 5 Assignment Suppose Circuit Elements Q38820122 . . .

1. (5 points) Consider the single-cycle computer shown on page 5 of this assignment. Suppose the circuit elements take the fo1. (5 points) Consider the single-cycle computer shown on page 5 of this assignment. Suppose the circuit elements take the following times: Instr mem: 200ps, Register read: 30ps, Register write: 30ps, ALU and all adders: 50ps, Data memory: 200ps, Main Control Unit: 10ps, ALU Control Unit: 5ps, Shift Left Units: 5ps Assume that PC and MUXes don’t take any time. Compute the minimum execution time for each instruction type below: R-format: ps. LW ps SW ps. Branch ps Jump: ps. Show transcribed image text 1. (5 points) Consider the single-cycle computer shown on page 5 of this assignment. Suppose the circuit elements take the following times: Instr mem: 200ps, Register read: 30ps, Register write: 30ps, ALU and all adders: 50ps, Data memory: 200ps, Main Control Unit: 10ps, ALU Control Unit: 5ps, Shift Left Units: 5ps Assume that PC and MUXes don’t take any time. Compute the minimum execution time for each instruction type below: R-format: ps. LW ps SW ps. Branch ps Jump: ps.

Expert Answer


Answer to 1. (5 points) Consider the single-cycle computer shown on page 5 of this assignment. Suppose the circuit elements take t…

(Solved) : 1 20 Points Minority Function M Generated Combinational Logic Circuit Output Equal 1 Input Q38804349 . . .

Need help with this digital logic problem please show work forall parts thanks[1] [20 points] A minority function, M, is generated in a combinational logic circuit when the output is equal to 1 if the in

[1] [20 points] A minority function, M, is generated in a combinational logic circuit when the output is equal to 1 if the inputs have more 0’s than 1’s; otherwise the output is [a] Represent M using a 3-variable Karnaugh map. Make all labels clear on the map. [b] Write a minimal sum-of- products expression for M. [c] Write a minimal product-of-su ms expression for M. [d] Realize M using NAND gates. Show transcribed image text [1] [20 points] A minority function, M, is generated in a combinational logic circuit when the output is equal to 1 if the inputs have more 0’s than 1’s; otherwise the output is [a] Represent M using a 3-variable Karnaugh map. Make all labels clear on the map. [b] Write a minimal sum-of- products expression for M. [c] Write a minimal product-of-su ms expression for M. [d] Realize M using NAND gates.

Expert Answer


Answer to [1] [20 points] A minority function, M, is generated in a combinational logic circuit when the output is equal to 1 if t…

(Solved) : 1 10 Pts Draw Finite State Machine Circless Arcs Accepting Strings Contain Pattern 110 Tes Q38848710 . . .

1. [10 pts] Draw a Finite State Machine (circless and arcs) accepting strings that contain the pattern 110. Test your FSM for

1. [10 pts] Draw a Finite State Machine (circless and arcs) accepting strings that contain the pattern 110. Test your FSM for below cases. Rejects: 1000111 Accepts: 10011000 Show transcribed image text 1. [10 pts] Draw a Finite State Machine (circless and arcs) accepting strings that contain the pattern 110. Test your FSM for below cases. Rejects: 1000111 Accepts: 10011000

Expert Answer


Answer to 1. [10 pts] Draw a Finite State Machine (circless and arcs) accepting strings that contain the pattern 110. Test your FS…

(Solved) : 1 20 Points Minority Function M Generated Combinational Logic Circuit Output Equal 1 Input Q38805666 . . .

Need help with this digital logic problem please show work forall parts thanks[1] [20 points] A minority function, M, is generated in a combinational logic circuit when the output is equal to 1 if the in

[1] [20 points] A minority function, M, is generated in a combinational logic circuit when the output is equal to 1 if the inputs have more 0’s than 1’s; otherwise the output is [a] Represent M using a 3-variable Karnaugh map. Make all labels clear on the map. [b] Write a minimal sum-of- products expression for M. [c] Write a minimal product-of-su ms expression for M. [d] Realize M using NAND gates. Show transcribed image text [1] [20 points] A minority function, M, is generated in a combinational logic circuit when the output is equal to 1 if the inputs have more 0’s than 1’s; otherwise the output is [a] Represent M using a 3-variable Karnaugh map. Make all labels clear on the map. [b] Write a minimal sum-of- products expression for M. [c] Write a minimal product-of-su ms expression for M. [d] Realize M using NAND gates.

Expert Answer


Answer to [1] [20 points] A minority function, M, is generated in a combinational logic circuit when the output is equal to 1 if t…

(Solved) : 1 20 Points Write X86 64 Procedure Function Called Sum Following Passed Two Parameters Ar Q38813008 . . .

1. [20 points] Write an x86-64 procedure/function called sum that does the following: a. It is passed two parameters, array a

1. [20 points] Write an x86-64 procedure/function called sum that does the following: a. It is passed two parameters, array and size, by the procedure/function that calls it. The first parameter is a pointer to the beginning of an array of integers (4-byte values), and the second parameter is the number of elements in the array. sum() returns a 4-byte value. AC-language prototype for the function would be: int sum(int *array, int size); consider the C-language declarations to determine whether the values in the array are signed or unsigned. b. sum() computes the sum of the elements in the array, calls printf to print the value, and also returns the sum result to sum0’s caller. Make sure that your sum() function does both! c. if overflow occurs while summing the values, print “Overflow”, rather than a number. You can assume that there are 2 string literals already defined: printf sumVal to be used when a valid sum is to be printed and printf Overflow when overflow occurs containing the sum. printf Overflow does not require a 2″ parameter. sumVal requires a 2″” parameter printf operand of type: d. the addresss of the array elements must be referenced with an “Imm(Base Reg, Index Reg, Scale)”. e. Be sure to do the proper stack set up work at the beginning and end of the procedure/function, and be sure to save and restore the values of any callee save registers that you modify. Since sum() calls printf), note that caller saved registers will also have to be considered. Also, be sure to leave the stack in the appropriate state for the return instruction Show transcribed image text 1. [20 points] Write an x86-64 procedure/function called sum that does the following: a. It is passed two parameters, array and size, by the procedure/function that calls it. The first parameter is a pointer to the beginning of an array of integers (4-byte values), and the second parameter is the number of elements in the array. sum() returns a 4-byte value. AC-language prototype for the function would be: int sum(int *array, int size); consider the C-language declarations to determine whether the values in the array are signed or unsigned. b. sum() computes the sum of the elements in the array, calls printf to print the value, and also returns the sum result to sum0’s caller. Make sure that your sum() function does both! c. if overflow occurs while summing the values, print “Overflow”, rather than a number. You can assume that there are 2 string literals already defined: printf sumVal to be used when a valid sum is to be printed and printf Overflow when overflow occurs containing the sum. printf Overflow does not require a 2″ parameter. sumVal requires a 2″” parameter printf operand of type: d. the addresss of the array elements must be referenced with an “Imm(Base Reg, Index Reg, Scale)”. e. Be sure to do the proper stack set up work at the beginning and end of the procedure/function, and be sure to save and restore the values of any callee save registers that you modify. Since sum() calls printf), note that caller saved registers will also have to be considered. Also, be sure to leave the stack in the appropriate state for the return instruction

Expert Answer


Answer to 1. [20 points] Write an x86-64 procedure/function called sum that does the following: a. It is passed two parameters, ar…

(Solved) : 1 2 Pts Distinguishes Embedoded System Compared Computing Systems 2 2pts Whet Differences Q38848477 . . .

1. (2 pts.) What distinguishes an embedoded system compared to other computing systems? 2.(2pts.) Whet are the differences be

1. (2 pts.) What distinguishes an embedoded system compared to other computing systems? 2.(2pts.) Whet are the differences between a central processing unit and microcontroller? 4. (1 pt.) What is the size of data bus (in number of bits) for the Arm Cortex M4 MCU? 5. (4 pts.) Fill in the numbers in designated base for the following Arm Cortex M4 MCU memory design: Lowest Memory Address (hex): Number of Addressable Memory Locations (decimal): Highest Memory Address (hex) Storage Capacity (in bit count) of Each Addressable Memory Location (decimal): Show transcribed image text 1. (2 pts.) What distinguishes an embedoded system compared to other computing systems? 2.(2pts.) Whet are the differences between a central processing unit and microcontroller? 4. (1 pt.) What is the size of data bus (in number of bits) for the Arm Cortex M4 MCU? 5. (4 pts.) Fill in the numbers in designated base for the following Arm Cortex M4 MCU memory design: Lowest Memory Address (hex): Number of Addressable Memory Locations (decimal): Highest Memory Address (hex) Storage Capacity (in bit count) of Each Addressable Memory Location (decimal):

Expert Answer


Answer to 1. (2 pts.) What distinguishes an embedoded system compared to other computing systems? 2.(2pts.) Whet are the differenc…

About

We are the best freelance writing portal. Looking for online writing, editing or proofreading jobs? We have plenty of writing assignments to handle.