Programming Questions and Answers May 25, 2018

The algorithm below determines q, r EN such that y q2 r and r 2, where y, z N. DIVIDE(y, z) 1 ry 2 q 0 3 4 5 6 7 8 9 10 11 12 while wy do w 2w while w z do q2q w2 W if w

Design a 12 wide rectangular, Class U, prestressed beam. Simplysupported, span length 30 Material Properties o Concrete design strength fc 5000 psi o Concrete strength at prestress transfer fci 4000 psi o Prestressing strands diameter, 270 ksi, lowrelaxation Loads o Selfweight (150 lbft3) Assume 12 x 28 section WD 350 lbft o Superimposed

Consider the code segments below and give the O estimates for each segment. Be sure to explain how you arrived at your estimates. (a) 12 pts. (a) (b) Sum 0 for (i 0 i

What is the process capacity in customers per hour If the process is operating at capacity, what is the average amount of time between customers completing the process and leaving the store,Alice A 3 mincust Andy A 3 mincust Customers computer file customer Bob B 2 mincust Dave D 4 mincust Charlie C 3 mincust Erin E 3 mincust

The following algorithm computes yz, where y, z N. MULTI(y, z) 1 x 0 2 3 4 5 6 7 while 20 do if 2 2 1 then rry y2.y z 22 return r Determine how many times the addition will be performed (instruction on line 4) in the optimistic, the average and pessimistic case.

For the following pairs of functions g(n) and f(n), indicate whether g(n) is O, o, 2 or of f(n). Justify your answer using rigorous arguments (simply stating the answers will result in minimal points awarded.) (a) 12 pts. g(n) n and f(n) (log n) (b) 13 pts. g(n) n and f(n) n.

The following algorithm (function) yz, where y, z E N. MULT(y, z) 1 if z 0 2 3 4 5 then return 0 else if odd(2) then return MULT(2 y, 22) y else return MULT(2y, 22) What is the computational complexity of the above algorithm

The data is the string S1..n and the pattern P0.. m 1, where 1

What is the computational complexity of the algorithm,G(n) 1 2 32 if n 0 V n 1 then return 3.n else return G(n1)2 G(n2),What is the computational complexity of the algorithm,G(n) 1 2 32 if n 0 V n 1 then return 3.n else return G(n1)2 G(n2)

Determine the computational complexity of the recursive function generator function. using a,G(n) 1 2 3 if n 1 then return n else return 5 G(n1)6 G(n2)

Binary classification error 05 points (graded) Report the test error by running runsvmonevsrestonMNIST. Error 1.0 Submit You have used 3 of 20 attempts Save,One vs. Rest SVM 55 points (graded) Use the sklearn package and build the SVM model on your local machine. Use randomstate 0, values for other parameters. Available Functions You have access

Input data of the algorithm sorted, nelement array A and value v. The following algo rithm gives the index p such that v Ap or NIL if v A. We assume it was invoked with parameters BINARY SEARCH (A, 1, n, v). BINARYSEARCH(A, p, r, v) 1 if p

Find majority element in an array Input L1,..., n as input list containing n real numbers Output True or False. If true, also returning the majority element 1 c 0, v L1 2 for i1,2,..., n do 3 if c 0 then 4 5 6 v Li end if if v Li then c c 1 7 8 9 10 11 end for 12 Future steps else cc1 end if,We want to check if there is an element occurs

o Suppose we have a ClubMember table created by CREATE TABLE ClubMember ( id INT PRIMARY KEY, name VARCHAR(40) NOT NULL, registerTime DATETIME NOT NULL ) INSERT INTO ClubMember VALUES (1, David, (2, Jessica, (3, Andy, (4, Jenny, (5, Bill, 2020528 1625), 2020528 1710), 202011 1111), 20191230), 2020527 1045) and we would like to ask the following

Suppose you had to fill in the rightmost column of the following truthtable p...............SKANG(p.g).....SKANG(r, SKANG(p.g)) T....T....T T.....T.....F T.....F.....T T.....F.....F F.....T.....I F.....T.....F F.....F......T F.....F......F a) FTFTFTFT b) FTFTFTFF c) TTTFFFFF d) FTTTTTFF PA

4 Log Server Suppose you are responsible for building a log server that will receive a large number of logs. Each log will have a log ID and timestamp. We want to keep track of these logs, but due to storage limitations, we can only return up to m logs from the last hour when requested. Problem Statement Complete the following functions record

Be sure to show all of your work when completing these questions. This is an individual assignment. Question 1 (1.3 points) ABC D E F G R (A, B, C, D, E,F, G) Key A, B F1 A, B C, D, E, F, G F2 A D F3 E G Please normalize to 3NF

Translate the following code from Java to MIPS if (w 200) x y z else z y

1. Remove all the back edges from the graph so it becomes a DAG. Perform a depthfirst search recording the start and finish times. Using those finish times, provide the topological order that is produced. Provide one breadthfirst topological order for that graph. C,F I C D H A B E K J G

Translate the following code from Java to MIPS while (x 0) 1 x x W x 2

Translate the following code from Java to MIPS for (x0 x

5. Translate the following code from MIPS to binary addi t3, zero, 16 bne t3, s4, else sw t3, 12 (s0) j overelse else sub t3, s4, t2 overelse

Consider the FSM (Finite State Machine) shown below. Start A B C a) How many states does it have b) What is the input alphabet of the FSM a) Describe the set of strings accepted by the FSM.

We are given the following Java code. public void init (int array) for (int i0 i array.length i) arrayi 1 for (int j 0 j

What is the output of the following segment of code ArrayBoundedStack stack1 new ArrayBoundedStack () ArrayBoundedStack stack2 new ArrayBounded Stack () ArrayBoundedStack stack3 new ArrayBoundedStack () for (int i 5 i 17 i) stack1.push(i) while (Istack1.isEmpty()) stack2.push(stack 1.top() 2) stack1.pop() for (int j 8j 20 j) stack 1.push(j)

Use MATLAB to make the following calculations, using the values x 58i, y 67i. a) u x y b) v xy C) w xy d) z et e) r f) s xy y

What is the value of i after this for loop int i for(i 10 i 0 i),What is the value of i after this for loop int i for(i 10 i 0 i)

What value will be assigned to grade when score equals 90 if (score 60) grade D if (score 70) grade C if (score 80) grade B if (score 90) grade A

3. Consider the following algorithm. First, explain what exactly it computes. Then, use the 5 steps in the General Plan to analyze the time efficiency of the algorithm. Algorithm 2 P(n) A pseudocode of an algorithm whose time efficiency is of interest Data a positive integer n Result to be explained by you. if n 1 then return else return P(n1)

Given an array 84, 77, 33, 39, 29 and a gap value of 2 What is the array after shell sort with a gap value of 2 Ex 1, 2, 3 (comma between values)

Write code that reads in a number R from the user, and displays a figure with (2R1)rows of characters as the following pattern. Note that it has (2R1) columns For instance, if the user enters a 4 for R, your program should display Activate Windows Go to Settings to activate

Find the time complexity of the below function. Make sure you describe how you calculate the time complexity line by line. Function 1 Void function(int n) Int count 0 For (int in2 i

Alice uses the GGH cryptosystem with private basis (58, 53, 68), V1 and public basis v (110, 112, 35), v3 (10, 119, 123) W (324850, 1625176, 2734951), w2 (165782, 829409, 1395775), W3 (485054,2426708, 4083804). (a) Compute the determinant of Alices lattice and the Hadamard ratio of the private and public bases. (b) Bob sends Alice the

2) Mannings equation can be used to compute the velocity of water in a rectangular open channel n 0.0 where U velocity (ms), S channel slope, n roughness coefficient, B channel width (m), and H water depth (m). The following data are available for five channels 0.020 0.015 0.030 0.022 U S B 0.0001 10 0.0002 8 0.0010 20 0.0007 24 0.0003 15 S BH

For the following Truth Table a. Determine the UnSimplified SOP Boolean expression for the Output. b. Determine the UnSimplified SOP Boolean expression for the Output. c. Simplify the SOP expression using a Karnaugh Map d. Draw the simplified logic circuit. 4 0 0 0 0 Inputs BC 00 01 10 11 0 0 1 1 1 1 11 0 1 10 Output 1 1 0 1 0 0 0 1

Please follow directions and code in Java

A sentence is a sequence of words with two possible structures Name1 and Name2 Verb Object.. Name1 or Name2 Verb object. Where Namel and Name2 can be any word from the text file names.txt, Verb can be any verb from verbs.txt, and object is any line from things.txt. Example of acceptable sentences Amari and Riley will bake 1 suit Riley or Jilali

C++ I need help! Create a 4 x 4 crossword puzzle picturedbelow. The words present in your crossword puzzle shouldbe toy fly fun son {'f', 'k', 's','a'} {'l', 'u', 'o','w'} {'y', 'o', 'n', 'a'} {'x', 't', 'o', 'y'} ==================== menu should be like this===================== Enter 1. select the word to search (this shoulddisplay 1.toy 2. fly

CrossWord Puzzle XXTh f 1 y X KJO k u 0 t SOHO 0 W a a y Enter 1. Select the Word to Search. Enter 2. Enter the Word to Search. Your Choice 1 1. toy 2. fly 3. fun 4. son Select the Word to Search toy

Whats the output of the following code snippet public static void main (String args) double division 5.010 System.out.println(division division) division 0.5

a) Consider the following NFAE over (a, b) 91 q3 Convert this NFAE into DFA.,b) Build NFA for L((ba) U (ab) ) over a, b).,a) Consider the following NFAE over (a, b) 91 q3 Convert this NFAE into DFA.,b) Build NFA for L((ba) U (ab) ) over (a, b).

Consider the equation X AX where A 0 1 0 0 0 0 1 0 0 0 0 1 1 0 0 0 Using Matlab or Octave, find the eigenvalues and eigenvectors of A. Use these results to write the general solution of X AX. . Determine the solution with initial condition X (0) 0 0 0 You can use Matlab or Octave to help with this calculation. Use Matlab or Octave to plot the

Compute the number of operations or basic steps executed for the following code as a function of n. Assume for this problem that all the operations found in this code are considered basic operations. Show all your work to get credit x 0 for (i1i 0) print(2) for (j1 j

Compute the big O time complexity (worst case) of the following code. Assume that for this problem that the print statement is the basic operation. Show all your work to get credit, including a table of steps to n (as seen in class), and then all the summations and all your work to compute the time complexity. for (i1i

Assume that all the graphs in the fol lowing problems are simple, with no selfloops or multiple edges (in the same direction) between any two vertices. (a) Show that the total number of edges for a connected undirected graph with n vertices is bounded between n 1 and (2), i.e., n1m (2) (b) Show that the total number of edges for a strongly

Consider the following AVL tree. 5 10 15 12 19 After inserting 13 into the tree and balancing where necessary, what will be the resulting keyvalue of the root node Activate W Go to Setting

(a) Simplify the Boolean function (i). (b) Write the truth table of the Boolean function of question 1(a) (c) Draw the simplified Boolean function in question 1(a) using OR NOT gate. (d) Draw the simplified Boolean function in question 1(a) using AND NOT gate. (2 points) (1 point) (1 point) (1 point),(x x.y x.y). (x x. y x. y) x. y yz

(a) Write down and simplify the following Boolean function f(x1, x2, x3) (1,2,3,4,5,6,7) (2 points) (2 points) (b) Write down and simplify the following Boolean function f(x1, x2, x3, x4) II(1,3,5,7,13,15)

Graph this program fragment if (xy) If (a

What will be the value of the stack pointer after the following instructions execute mov sp, 6800 push ax push bx push cx

for (i for(j Consider the following algorithm, where the input is an integer n. 0 i

Consider INSERTION SORT algorithm that takes an array of size n and sorts this array in nondecreasing order as follows. Algorithm INSERTIONSORT Input An array A1..n of n elements. Output A1..n sorted in nondecreasing order. 1. for i 2 to n 2. x 3. 4. 5. 6. 7. Ai j i 1 while (j 0) and (Aj x) Aj1 Aj j j 1 end while Aj 1 x 8. 9. end for 1. (5

questions int sum 0 for (int i else Given the code segment below and that n and x are the input, answer the following 1 i n i i 2) sum x is an integer value provided by the user if(x 5) for (int i 1 i

Write a quick description for each of the following commands below 1. cat file.txt grep found results.txt 2. results.txt file.txt 3. mv file.txt Foldermyfile.txt 4. chmod 744 myfile.txt 5. .myfile.txt 6. read MYVAR 7. echo MYVAR 8. echo txt 9. chown BOBBY myfile.txt MYVARBOBBY 10.

The Fibonacci numbers are a famous sequence defined as Fo 0 F 1 Fn2 Fn Fn1 For example, the first few terms of the Fibonacci sequence are 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ... Show by induction that (a) Fn O(3). (b) F2n 2(2).

Given the following digital data stream 10011011000 00011101111 (a) Draw a diagram showing the data stream if unipolar signaling is being used to transmit the data. (b) Draw a diagram showing the data stream if bipolar AMI signaling is being used to transmit the data. (c) Draw a diagram showing the data stream in if B8ZS signaling is being used to

Write a method, no more than 20 lines, whose bigO running time is O(lg n). Call the method public void hw3( int n). Explain why its running time is O(lg n).

Prove the following using the original definitions of O, N, 0, 0, and w. (a) 3n50n 4n 9 0() (b) 1000n (n) (c) 10n 7n w(n) (d) 78n o() (e) n 3n10 O(n)

The knearest neighbor decision rule is one of the simplest decision rules to implement and has a good performance in practice. Answer the following questions. (a) Suppose the Bayes error rate for a c 3 category classification problem is 5. What are the bounds on the error rate of a nearestneighbor classifier trained with an infinitely large

Prove that for all integers n0, i1 by mathematical induction. Divide your proof into the three required parts Induction Base, Induction Hypothesis, and Induction Steps.

Consider the following algorithm for (i 2 i

4. Let T be an arbitrary rooted tree, where each vertex is labeled with a positive integer. A subset S of the nodes of T is heapordered if it satisfies two properties S contains a node that is an ancestor of every other node in S. For any node v in S, the label of v is larger than the labels of any ancestor of v in S. A heapordered subset of

What is the time complexity T(n) of the nested loops below For simplicity, you may assume that n is a power of 2. That is, n 2k for some positive integer k. Give some justification for your answer. for (i 1 i

7) Time Complexity of a loop if the loop variables is reduced increased by a sqrt amount as follows Fun(int array A of size n) for (int i n i2 i sqrt(i)) here sqrt means square root int a i Exact Asymptotic

Find the time complexity of the following in terms of asymptotic notations 1. for (i0 i Ni) for (j0 j 0) for (int j 0 j 0 i)

Describe what kind of strings the following automaton accepts n 0 1 s1 0 s2

This problem concerns the NFA given by the following transition table q0 ql q2 0 q0 0 1 q0, q1 q1, q2 Convert this NFA to a DFA using the method described in class. Specify the DFA by its transition diagram.

Let G be a graph with vertices V a, b, c, d, e, f and edges E a, d, a, e, b,c, b,d, b, f, c, f, d, e. Find an adjacency matrix, an incidence matrix and the matrix for all the walks of length two for G.

For the following summations, (a) Write a for loop (In C, Java, or Python) that will evaluate the summation while reducing round off errors. (b) Evaluate the summation by running the loop in (a).,14) 100 i1 1

4. Consider the numbers r 2k for k Z in Matlab. Write Matlab code to find (a) the smallest k such that 1x1 in Matlab (b) the smallest k such that 1x 1 in Matlab (c) the smallest k such that x0 in Matlab (d) the smallest k such that yx in Matlab where y x(12ka) and ka is the answer from (a) (e) the largest k such that x

3. Let f(x) (1x)3 1. We want to compute y f(x) for x 104. (a) Compute y in Matlab in the straightforward way. Find the relative error using vpa. Which operation causes the large relative error (b) Find a better algorithm which approximates y using a Taylor polynomial pn (x). Find the relative error using vpa. What value of n do you need (c)

In the following questions, let decimal numbers D 328 and D 589. 1. Calculate D D with 10s complement method. 2. Calculate D D in BCD format. 3. Calculate D D in BCD format. 4. Discuss two application examples for any one of the following codes Gray code, ASCII code, error detection code, error correction code. You can search online or use

Which of the following is true a.update(a b) will change the dictionary to a a b, A b a.update(a b)) will change the dictionary to a b a, A a a.update(a b) has the same effect as a.get(a) b a.update (a b) has the same effect as aa b aa a.get(a) will return True,Which of the following is true a.update (a b) will change the dictionary to a a b,

An AVL tree is constructed by inserting the following numbers in this order 1, 7, 2, 6, 3, 5, 4. The in, pre and postorder traversals of the resulting tree are O Inorder 1, 2, 3, 4, 5, 6, 7 Preorder 4, 2, 1, 3, 6, 5, 7 Postorder 1, 3, 2, 5, 7, 6, 4 Inorder 5, 1, 3, 4, 6, 7, 2 Preorder 6, 1, 5, 3, 4, 7, 2 Postorder 5, 4, 3, 1, 2, 7, 6 Inorder 1, 2,

Select all the strings that are legal according to regular expression . . (eE) (e) fFd D ( ( ) ) 0123456789 0 OD None of the given alternatives are legal. 0.e0 0.0

Consider the following class definitions in a Java program class A class B extends A Select which of the following statements would result in a compilation error. O Aa new A0 Aa new B() OBbnew AO O All of the above statements should compile successfully. OB b new BO

Within the database environment, a data model represents data structures and their attributes, relations, constraints, and transformations with the purpose of supporting a specific problem domain. Define problem domain in the context of data models. O a blueprint containing all necessary instructions for building a database that will meet all

What is the difference between the knowledge.graph and a featured snippet O They are the same thing O The Knowledge Graph is usergenerated and featured snippets come directly from Wikipedia O The Knowledge Graph is a result with a factual answer backed by sourcing, featured snippets are generated from wellwritten web content The Knowledge Graph is

((ab) (a b) (b a)) is a regular expression of language with strings of even lengths O all strings over a,b O odd lengths eveneven

(ab)a is the regular expression for a language O with strings ending with a starting and ending with a O that always has b in middle with strings ending with b

the parameters Write a userdefined function called funfinal which receives n and q to calculate the following quantities W sin(g) sin(q) sin(q) ...(1) sin (q), 1 i n Z (1)1 cos(q1) (1) n2 cos(qn2) ...(1) 2n cos(q2), n1 i 2n b) (10 Pts) Write another script to ask the user enter the values of q and n and to call the function funfinal, c) (10

Write a leftlinear grammar rule for the diagram below. A aab B

2. Provide the state diagram of a DFA that is equivalent to the NFA below a b

What are the (n.M.d) parameters of the following 11ary code (1, T2, 3, 4, 5,0) (Z1) 20123 6x4 25 0, 3x23x3 4 9x50 n M d Enter only positive integers without any decimal points, symbols, punctuation or spaces.

3) A loop where the loop variables is incremented decremented by a constant amount k, as follows Fun(int array A of size n) Here k is a positive integer constant for (int i 1 i

4. Let f(x) 2x2 I 2x e where 0 x 2. (a) Find the limit of f(x) when a tends to 0. (b) Show that it is not good to use the above expression to evaluate f(x) as 0 by using computer. (c) Show that 1 f(x) 2x2 1020 (d) Using MATLAB, compute the values of f(x) by using (1) and (2) for x 105, 106,..., Show your result by using the command semilogx(x,

Transmission Impairment is a major consideration in sending data across a medium. What are some of the causes Mark all that apply Material Noise Level Attenuation Volume Distortion

The number of recursive calls that a method goes through before returning is called O 1. activation stack frame. 2. the depth of recursion. 3. order of growth efficiency. 4. combinatorial recursive count. 5. None of these is correct.

31. What is the value of each of these sums of terms of a geometric progression 8 3) 3.2 j0 8 c) (3) j2 8 b) 2 jl 8 d) 2 (3) j0

Select the function that is (nlogn) O O 1) 5n17logn 2) 6nlognn.1 2 3) 23nloglogn 3nlogn 4) 2lognn

Identify the common reasons a kernel panics, References to memory addresses that contain key codes CPU failure or unhandeled bugs Operator error None of These File or directory permission problems Corrupted nard disk sectors

7. In a cache system we have the following attributes 256 MB of physical memory space 4 MB of cache 256KB per cache line Determine number of lines in cache, b) Determine the number of address bits out of the processor. c) Determine the number of bits needed for the block offset section of the address. d) If our cache is 4way set associative, how

es CA Qu. 54 Identify what is true about script kiddies. Identify what is true about script kiddies. Check All That Apply are amateur computer hackers with little programming expertise illegally gain access to computer systems using programs (scripts) that others have written have the skill or experience to write their own programs are usually

(c) int a,b,c,d, count 0 0 a 30 a) for (a for (ba3 b 30 b) for (cb6 c 30 c) if (c20) for (dc2 d 30 d) printf(d d d d , a,b,c,d) count 1 printf (countd , count) What will be the count above

C 1. Implement the function catrevers, the function should take the first string and concatenate it to the reversed second string and return the second updated string. For example, if the first string is Final and the second string is Exam, then the resulting string should be maxEFinal Write a main function to test your code. mmmmmmm 2. make

Candy Shop Jack loves candies and he goes to the market to buy some. There are K different flavours of candies available in the market and he wants to buy candies of all flavours. Also, there are N types of candy combos available in the market. Each candy combo having some cost C contains candies of one or more flavours. Help Jack to buy candy

Brian has a corrupted file that tries to load when his computer is booting up. To solve this problem, he restarts the computer, then presses F8 to display the Advanced Boot Options menu. Which solution is Brian using Safe Mode Control Panel Windows Backup Help System

1. A Boolean function F(A,B,C) (AB) (AC) (BC) (i) (ii) By using the Kmap, show which OR term is the redundant term. Implement the function using a single 7400 chip (7400 chip has 4 units of 2input NAND gates).

A binary linear cyclic code Ccyc(n, k) has code length n 7 and generator poly nomial g(x) 1 X X X4. (a) Find the code rate, the generator and parity check matrices of the code in systematic form, and its Hamming distance. (b) If all the information symbols are 1s, what is the corresponding code vector (c) Find the syndrome corresponding to an

b) What is the value of the largest 6bit binary number. Express your result using decimals. 2 marks c) Given the function F(a,b,c) II (2,3,6), indicate what is the corresponding canonical productofsum expression 2 marks d) Given the function F(a,b,c) (0,2,6,7). Draw the schematic of a circuit realizing this function by using multiplexer. Make

Given the following class, how would you make it immutable, Rewrite it by making the necessary changes. public class Movie ( (b) public String title public String director public int runTime public Movie (String title, String director, int runTime) this.title title this.director director this.runTime runTime public int calculateExtendedRuntime

(b) Consider the class below that represents Voucher with two attributes amount and store. Your task is to write the an equals() method, that returns true if two instances of the Voucher have the same amount and store. public class Voucher private int amount private String store public Voucher(int amount, String store) this.amount amount