Ultimate Engineering Study Guide - Questions & Answers
You will be given a set of string called T={T1,T2,,Tk} and another string called P. You will have to find the number of occurrences of P in T. And to do that, you will have to build a string matching automaton. The strings will contain only small letters from the English alphabet a to z if the length of the pattern P is m then your automaton will have m+1 state labelled by 0,1,2,,m Each of these states will have 26 state transitions. 1. Create an (m+1)26 tate transition table. (coding) 2. Feed the strings Ti to the automaton and see how many times P occur in Ti for all i (coding) 3. Compute the total time and space complexity for your solution in terms of n,m, kgiven that the maximum length of a string in T (complexity analysis )
This is a subjective question, hence you have to write your answer in the Text-Field given below. A given graph of 7 nodes, has degrees [4,4,4,3,5,7,2}, is this degree set feasible, if yes, then give us a graph, and if no, give us a reason. Marks]
10. Given the following progrien. f(n)= if n0 then 0 efee 2nn+f(n1). Lise induction to prove that f(n)=n(x+1) for all n ( m N is p(n). Fiad a closed foren for 2+7+12+17++(5n+2)=7(3 gde a. Why his the relation wwill foundnely (s per) founded by < afe the rainitul elementeris is poin 9. What is food by the jrinciple of mathemancal induction? What is proof thy well-founded inchichoe? by the kernel relation on f. (6 pto - Partioe oa N {1}={1}{2}={2,3,4}{3}={5,6,7,8,9}{4}={10,11,12,11,14,15,16}
2. Given the last NINE digits. Write out minterms with these numbers as subscripts of mi. You may remove the duplicated terms.Given the NINE numbers are 5, 1, 1, 4, 6, 0, 0, 4, and 2. By removing a duplicated number 1, '4', '0', the minterms are m0 and m4.Then, answer the following SIX questions.(a) Suppose there are FOUR input variables a,b,c, and d, and one output F1. OR the aboveminterms together to obtain a canonical SOP. Write down the canonical SOP of F1.(b) ADD 4 to each subscript of the minterms in (a) to get a new canonical SOP F2. Writedown the canonical SOP of F2.(c) Convert the canonical SOP of F2 obtained in (b) to its equivalent canonical POS.(d) Construct the truth table of the Boolean function of F1 and F2 obtained in (a) and (b).(e) Write out the corresponding K-maps of the Boolean function of F1 and F2.(f) Try to simplify the Boolean function of F1 and F2 by K-map obtained in (e).3. Considering the canonical SOP F1 obtained in Q2, answer the following FOUR questions.(a) MINUS 2 to each subscript of the minterms of F1 to get a new canonical SOP F3 that hasonly THREE input variables a,b, and c. If the corresponding result is less than 0, set it to 0.Simplify F3 by K-map.(b) Draw out the logic diagram of F3 by three basic logic gates.(c) Draw out the logic diagram of F3 by a 3-8 decoder.(d) Draw out the logic diagram of F3 by a 8-to-1 multiplexer.
Hello, I already posted this question but it was not fully answered, and part was incorrect. Please answer whole question as I have a test in a few days and I am really struggling. I will upvote immediately for correct answer, thank you!Create a Python program that processes a text file that contains several arrays.The text file would appear as shown below:*START OF TEXT FILE*A, 1,2,3A, 4,5,6B, 1A, 3,4,4B, 2*END OF TEXT FILE*The rows of the matrices can be interspersed. For example, the file contains an array A, 3, 3 and an array B, 2, 1.There may be blank lines.The program must work for each input file that respects the syntax describedThe program must calculate the information required in the following points. For each point the program creates a text file called respectively 1.txt, 2.txt, 3.txt, 4.txt, 5.txt in which to write the answer.At this point I call A the first matrix. Print all the matrices whose values are included in those of the A matrixFor each square matrix, swap the secondary diagonal with the first columnFor each matrix, calculate the average of all its elementsRearrange the rows of each matrix so that it goes from the highest sum to the lowest sum rowPrint sudoku matrices (even non-square), ie those for which the sum of all rows, and all columns has the same value.