S
  1. study help
  2. subject categories
  3. computer science
  4. programming
  5. march 2021
  6. 04

Programming Questions and Answers March 04, 2021

Expert-verified solutions to help you succeed

3Design a 4bit bidirectional shift register. If the input is given as shown below, write the output in a table. RIGHTILEFT CLK (right) (left) (right) (left) 25
3Design a 4-bit bi-directional shift register. If the input is given as shown below, write the output in a

What happens when the CX register value is 0 before a LOOP instruction is executed The loop is skipped and execution continues with the next instruction The loop body is executed once The loop executes indefinitely O The program crashes Check O O
What happens when the CX register value is 0 before a LOOP instruction is executed? The loop is skipped and

Draw the process hierarchy that results from the code segment given below. Assume that all calls to fork() will be successful. int main() int pid pid fork() if (pid 0) fork() else pid fork() if (pid 0) fork()
Draw the process hierarchy that results from the code segment given below. Assume that all calls to fork ()

2. Consider the traveling salesman problem shown below, where city 1 is the home city. 12 8 15 5 13 9 13 16 Starting with 1254361 as the initial trial solution, apply the basic tabu search algorithm by hand to this problem for three iterations.
2. Consider the traveling salesman problem shown below, where city 1 is the home city. 12 8 15 5 13 9 13 16

Use method of distance functions (Euclidean Metric) to find the optimum for following multiobjective optimization problem Max f(x15)(x23) Min f2X1X2 X 0 X0 demand levels 1 1
Use method of distance functions (Euclidean Metric) to find the optimum for following multiobjective

Write a Java thread class named (INFO), where it prints the current thread info followed by starts sleeping for x milliseconds, then sleeps for a Random time of 010 seconds, and finally prints the current thread info followed by ends Sleeping like the example below In the main program, define an array of size 12 of type INFO. Using loops, start
Write a Java thread class named (INFO), where it: prints the current thread info followed by

2) Table shows the density (p) of N2 as a function of pressure (P) at T200 K. 6.0 14.0 17.0 0.3825 0.9685 1.2257 P (atm) p (molliter) 3,2 0.1995 9.0 0.5895 12,0 0.8108 19.0 1.4159 21.0 1.6281 (a) Using these data, build a mscript to estimate the virial coefficients of the virial equation of state given by, Z 1 Bp Cp Dp (biii) Indicate as axis
2) Table shows the density (p) of N_2 as a function of pressure (P) at T=200 K. 6.0 14.0 17.0 0.3825 0.9685

Find a numerical approximation to the intersection between two functions x 1.984ln(x) starting from x0 2.400 at k 0 by forming a convergent Fixed Point Iteration, other than Newtons method. Demonstrate that the fixed point convergence criterion is satisfied near x 0. Tabulate for k 0 to 3 iterations. k 0123 xk Activate Windows Go to Settings
Find a numerical approximation to the intersection between two functions x = 1.984/ln(x) starting from x_0 =

14. Determine the Q waveform relative to the clock if the signals shown in Figure 783 are applied to the inputs of the JK flipflop. Assume that Q is initially LOW. CLK J K PRE CLR FIGURE 783 PRE C K CLR Q
14. Determine the Q waveform relative to the clock if the signals shown in Figure 7-83 are applied to the

Draw three arrow diagrams according to the following specifications Use set F b, c, d, e, f, g) as your domain. It will map to set J 1, 3, 5, 7, 9, 11. Draw an arrow diagram demonstrating a function that is not onto. Draw an arrow diagram demonstrating a function that has an inverse. Draw an arrow diagram showing a relation that is not a
Draw three arrow diagrams according to the following specifications: Use set F = {b, c, d, e, f, g) as your

(a) Draw a binary tree with 10 nodes labeled 0, 1,..., 9 in such a way that the inorder and postorder traversals of the tree yield the following lists 4, 1,6,3,9,2,5,7,0,8 (inorder) and 6, 1,4,9, 0, 7, 5, 8, 2, 3 (postorder). (b) Give an example of two permutations of the same n labels 0, 1,...,n 1 that cannot be inorder and postorder traversal
(a) Draw a binary tree with 10 nodes labeled 0, 1,..., 9 in such a way that the inorder and postorder

1. Consider the following bruteforce algorithm for evaluating a polynomial. Algorithm Brute Force Polynomial Evaluation (P0..n, x) Computes the value of polynomial P at a given point by the highest to lowest term bruteforce algorithm Input An array P0..n of the coefficients of a polynomial of degree n, stored from the lowest to the highest and a
1. Consider the following brute-force algorithm for evaluating a polynomial. Algorithm Brute ForcePolynomial

A register file has 16 registers each having 16 bits. The registers RF0 to RF15 contain positive or negative integers. Design an HLSM which will find the sum of absolute values of the 16 integers stored in RF0 to RF15. The negative numbers are in 2s complement form. The sum is going to be stored in a separate SUM register. Upon reset, the HLSM
A register file has 16 registers each having 16 bits. The registers RF[0] to RF[15] contain positive or

The state transition diagram for an HLSM is given below. The output C (32 bit) comes from a register of the same name (Creg). A and B are 8bit local storage registers reset (C(AB)) So A2 64 6 0 S3 (A7B) B A2 (A76) (A76) a(AB) ((())() (S) A B3 S2 (A7B) (Cy(AB)) (A76) (47(AB)) (A7B) (CY(AB)) (CY(AB)) C C B (a) Create a datapath for this HLSM. Show
The state transition diagram for an HLSM is given below. The output C (32 bit) comes from a register of the

Suppose you are working as a software engineer for a navigation system company. Your company has recently signed a contract with a transportation company to develop a navigation system for their drivers. One of the key requirements of the system is to calculate the shortest route between two locations. You are tasked with applying Dijkstras
Suppose you are working as a software engineer for a navigation system company. Your company has recently

Write the output of the following code if the value of n is 3 int n, a 1, b 2, k 1, c cin n cout cout 1 while(k
Write the output of the following code if the value of n is 3: int n, a = 1, b = 2, k = 1, c; cin ></a></div> </h2> </h2> </div> </div> <div class=

1.1 Use t notation to determine the running time of the following program lines. (8) 1. for (int i0 i
1.1 Use t - notation to determine the running time of the following program lines. (8) 1. for (int i=0; i

1. Write the first four terms of the following sequence en floor(n2) 2, for all integers n 0. Answer
1. Write the first four terms of the following sequence: en = floor(n/2) * 2, for all integers n 0. Answer:

Write a C + + function that receive three numbers ( entered by the user ) and return the average.

Consider condition1 True condition2 False condition3 True Which of the following statements are True O (condition1 and condition2) and condition3 O (condition1 or condition2) or condition3 Onot(condition 1) or condition2 not(condition 1) and condition2 condition1 and condition3 O not condition2
Consider: condition1 = True condition2= False condition3= True Which of the following statements are True? O

List the Output that will display as a result of executing the program code shown below. whatzOutput(10) public void whatzOutput(int n) System.out.print(n ) if (n 0) if ((n 2) 1) whatzOutput(n3) else whatzOutput(n2)
List the Output that will display as a result of executing the program code shown below. whatzOutput(10);

1. (20 points) Write a C function which removes the last element from a linked list. Assume that you have only the first pointer (no last pointer) which points to the beginning of the list. Your code should work whether the linked list is empty, contains one or more nodes. The function prototype is given below, first points to the first element of
1. (20 points) Write a C++ function which removes the last element from a linked list. Assume that you have

A project schedule is given in the table below Activity Preceding Activity Estimate in Months Start 0 D 4 6 7 8. A F. E G B H C End Start Start D, A D F.E F G H C, B (7) 0 (25) PVFY (1H) 335 a. Sketch the network. b. Find out the critical path by calculating ES, EF, LS, LF and show it in table. c. Find out the project completion time. d. Find out
A project schedule is given in the table below: Activity Preceding Activity Estimate in Months Start 0 D 4 6

2. (25) For a given transfer function of a system G(s) 100 (s (K1)s35)) (s2)(s 4s5) K0 a) Find the differential equation between the input and the output of the system b) Find the unit step response of the system. c) Check the stability of the system. I
2. (25) For a given transfer function of a system G (s) = 100 (s + (K+1)s+35)) (s+2)(s +4s+5) K=0 a) Find the

2. Write down the steps of shortest path algorithm and show the shortest path on the following graph with proper calculation. The symbols of the following Figure 2.1 means the traditional meaning of the network graph. 1 4 2 b d Fig2.1 1 10
2. Write down the steps of shortest path algorithm and show the shortest path on the following graph with

Write F in the logic diagram below as a sum of product. A B C D
Write F in the logic diagram below as a sum of product. A B C D

Calculate the number of processes created when the following program is run int main( void ) for(int i 0 i 3 i ) if (fork() 0) execl( binyes, binyes, NULL) else fork() return 0
Calculate the number of processes created when the following program is run? int main(void) { for(int i = 0;

Which of the following expressions represents the MOST simplified expression of the expression YABCAB C(BC AC) A. Y AC BC B. YABC BC C. Y BC D. Y ABC B
Which of the following expressions represents the MOST simplified expression of the expression Y=ABC[AB+ C(BC

For the Karnaugh map below, 1. write the SOP standard form of function F(x,y,w,z) 2. draw the truth table of function F(x,y,w,z) 3. write the simplified expression of function F(x,y,w,z) 4. draw the simplest possible logic circuit of function F(x,y,w,z) WX 00 01 11 10 00 1 yz 01 1 11 1 1 10 1 1
For the Karnaugh map below, 1. write the SOP standard form of function F(x,y,w,z) 2. draw the truth table of

2. Consider the following recursive algorithm ALGORITHM Q(n) Input A positive integer n if n 1 return 1 else return Q(n1) 2n1 Set up a recurrence relation for the algorithms basic operation and solve it. Finally, analyze the time complexity of this algorithm by applying the analysis framework. (20 points)
2. Consider the following recursive algorithm ALGORITHM Q(n) //Input: A positive integer n if n = 1 return 1

Suppose that one source file defines a variable i outside of any function int i Also suppose that another file has a function f that needs to access i void f(void) extern int i What kind of scope does i have In the first file, 1 has file scope. In the second file, i has block scope. 1 has file scope in both files 1 has block scope in both files
Suppose that one source file defines a variable i outside of any function int i; Also suppose that another

What is the value of the following Haskell expression let x 3 y 2 z 1 in let y 1 in x let x 5 in x y z
What is the value of the following Haskell expression? let x = 3 y = 2 z = 1 in let y = 1 in x +let x = 5 in

What is the value of the following Haskell expression let f x x 1 g x x 2 in f (let f x x x in g( f 3) ) 1 .
What is the value of the following Haskell expression? let f x = x +1 g x = x *2 in f (let f x = x * x in g(

What is the value of the following Haskell expression let tk n (xxs) n 0 lotherwise x ( tk (n1) xs) in tk 3 15,2,3,4,0,11
What is the value of the following Haskell expression? let tk n (x:xs) n ==0= [] lotherwise = x : ( tk (n-1)

. Assume the following function definition exists, where even returns true if an integer is even otherwise returns false nmap f nmap f (xxs ) (f x ) (nmap f xs ) What is the output of the following expression nmap even 1,2, 3, 4, 5, 6
. Assume the following function definition exists, where even returns true if an integer is even otherwise

The following MIPS program contains two programming mistakes. The code is well formed, and all instructions are valid MIPS instructions. Can you identify the mistakes and discuss which actions much be taken to correct them .data str .word 0x00000001 0x00000002 0x00000003 .text j main sum sll a1, a1, 2 li v0, 0 loop addi al, a1, 4 add t0, a0, al lw
The following MIPS program contains two programming mistakes. The code is well- formed, and all instructions

what is the output of the following C# code: using system; class Example { char[]xyz={'M','N','O','P'}; public system.Collections.IEnumerator GetEnumerator() { foreach(char ch in xyz) yeild return ch; } } class program { static void main(string[]args) { Example mc=new Example(); foreach(char ch in mc) Console.Write(ch+""); } }

Consider the function below to reverse the substring of S from position i to j. If S were defined as a string abcdefg then reverseString (S, 0, len (S) 1 ) reverseString (S, 3, 4) Function in pseudocode reverseString (S, int i, int j) if (i
Consider the function below to reverse the substring of S from position i to j. If S were defined as a string

Fill in the following blanks to conditionally store a value only if the input value has not changed during our computations. TryAgain s2, 8(s0) andi s2, s2, 12374 ori s2, s2, 4453 add Sa0, s2, Szero jal Normalize add 52, S00, Szero s2, (550) beq s2, Szero, End
Fill in the following blanks to conditionally store a value only if the input value has not changed during

How many times will the loop execute start Declartions num price 10 num totalPrice 0 num inventoryLeft 0 output selling item totalPrice totalPrice price inventoryLeft inventoryLeft 1 B endwhile output Total price totalPrice stop
How many times will the loop execute? start Declartions num price = 10 num totalPrice = 0 num inventoryLeft 0

Convert the following lines of C to MIPS assembly if (a b) ( d else d c C Presume the value a is stored in 50, b is stored in s1, and c is stored in s2. At the end, store the output variable d to 24 bytes after the memory address stored in t0. Presume that all values are signed. I
Convert the following lines of C to MIPS assembly: if (a < b) ( d = else { d = c; + C; Presume the value a is

Create a deno program that will be a game (almost like a lottery). The program will choose 6 numbers at random, the numbers should be between a predefined minimum and maximum. Next for each of the 6 numbers give the user 4 chances to guess each number. Once the user guesses the number correctly then move on to the next number. Depending on the
Create a deno program that will be a game (almost like a lottery). The program will choose 6 numbers at

Consider the graphs K and L below for which the vertices of K have been labelled. Suppose an edge e is added to K to create a new graph K that is isomorphic to L. K L R U S (a) List the two vertices of K that are incident to e. (b) Explain why K is isomorphic to L.
Consider the graphs K and L below for which the vertices of K have been labelled. Suppose an edge e is added

Consider the binary code C 010110, 100010, 101001. (a) Show that C is single bit error correcting. (b) Suppose the word a 001001 is received. Does a have a single bit error and if so what is the corresponding valid code word (c) Is it possible to include another word in the binary code and still have it be single bit error correcting
Consider the binary code C = {010110, 100010, 101001}. (a) Show that C is single bit error correcting. (b)

Will the following code compile If yes, what will be output of the program Otherwise, explain why it does not compile. public class ClassA public int x public static void value(int v) x V public static void main (String args) ClassA.value (2) System.out.println (ClassA.X) ClassA obj new ClassA() obj.value (3) System.out.println(obj.x)
Will the following code compile? If yes, what will be output of the program? Otherwise, explain why it does

What is the purpose of the slidingwindow function in the given code To find the maximum element in each sliding window. To calculate the sum of the elements within each sliding window. To reverse the order of the elements in the input list. To calculate the average of the elements in the input list.,def sliding window(nums, k) result windowsum
What is the purpose of the sliding window function in the given code? To find the maximum element in eachdef sliding window(nums, k): result = [] window_sum - sum(nums[:k]) result.append(window_sum) for i in range

4. Let binary data is111001010011,using matlab program to find the FSK code let the bit period is 0.000001 and the carrier frequency of information as 1bit rat 8 and the carrier frequency of information as 0bit rat2 and the amplitude of carrier signal 2. 5. Let binary data is 01101001,using matlab program to find the ASK code let the bit period is
4. Let binary data is[111001010011],using matlab program to find the FSK code let the bit period is 0.000001

What is the output of the following program Explain your answer. class InvalidValueException extends Exception public InvalidValueException () super (Invalid value exception) class MyClass private double price public void set Price (double price) throws InvalidValueException if(price 0) throw new InvalidValueException() this.price price
What is the output of the following program? Explain your answer. class InvalidValueException extends} public class MainClass { public static void main (String[] args) { } try{ MyClass m = = new MyClass(); m.

Calculate the chromatic polynomial of the following wheel graph Solution Sketch. Use the deletioncontraction formula. You should get k(k2) (k2).
Calculate the chromatic polynomial of the following wheel graph: | Solution Sketch. Use the

3. Find an approximate solution for the double integral 1.5 1 L L 20 drdy I ery combining at least 2 different methods. Then, compute the percent relative error considering that the true value is 1.7582.
3. Find an approximate solution for the double integral 1.5 1 = L L 20 drdy I ery combining at least 2

3. a) Determine the Fourier transform of the following periodic signal for W
3. a) Determine the Fourier transform of the following periodic signal for - < W

2. Solve the linear differential equations (a) (b) (c) dy dx dy 3y dx X X dy Y dx Xx Y 2 2x, x 0 x 2 3x, y (3) 4
2. Solve the linear differential equations: (a) (b) (c) dy dx dy 3y dx X + X dy Y + dx Xx Y - 2 = = = 2x, x ></a></div> </h2> </h2> </div> </div> <div class=

6. Find the family of orthogonal trajectories of the following curve family (a) x 2y K (b) x Ky 1 (c) 2x 3y K
6. Find the family of orthogonal trajectories of the following curve family: (a) x + 2y = K (b) x Ky = 1 (c)

The Register described in the below VHDL Code entity shiftreg is port ( clock, Sin in stdlogic Sout out stdlogic) end shiftreg architecture behav of shiftreg is signal temp stdlogicvector (7 down to 0) begin process (Clock) begin if (clockevent and clock1) then for i in 0 to 6 loop Select one O a. O b. O c. O d. end behav temp (i1)
The Register described in the below VHDL Code: entity shift_reg is port ( clock, Sin: in std_logic; Sout: out

Given the function f(x) ex (a) Construct a piecewise linear f(x)using the nodes x xo, x, x 0,12 1. (b) Write a python program to plot the results in (a). interpolantapproximation q(x) to,Given the function f(x) ex (a) Construct a piecewise linear interpolantapproximation q(x) to f(x)using the nodes x xo, x, x 0,12 1. (b) Write a python
Given the function f(x) = ex; (a) Construct a piecewise linear interpolant/approximation q(x) to f(x)using

2) A red black tree has 8 nodes. When we follow the tree in Preorder and Postorder order, the following results are obtained. Preorder 20 10 Postorder 10 40 50 30 Preorder XYZ becomes as follows. Z 30 60 40 90 70 60 70 50 X Postorder XYZ becomes as follows. 90 20 Z a) Draw the tree that satisfies these properties. Show which nodes are red and
2) A red black tree has 8 nodes. When we follow the tree in Preorder and Postorder order, the following

Consider an 8level 64x64 image with gray values (0,1, ..., 7). The normalized gray values are (0, 17,27,..., 1). k 0 1 2 3 4 5 6 7 0 17 27 37 47 57 67 1 nk 790 1023 850 656 329 245 122 81 a) Plot the normalized histogram. b) Calculate and plot the transformation for histogram equalization. c) Plot the histogram of the equalized image.
Consider an 8-level 64x64 image with gray values (0,1, ..., 7). The normalized gray values are (0, 1/7,2/7,

4. The following sorting algorithm, called BadSort() is a modified version of StoogeSort() from the 2nd edition of CLRS, which seems to have been left out of the 3rd edition. BadSort(A.p.r) pre p r 1. if ApAr 2. ( 3. if p 1r 4. return 5. 6. 7. 8. 9. Ap Ar (swap) else q (rp1)3 BadSort (A, p, r q) BadSort(A, p q, r) BadSort(A, p, r q) a. Use
4. The following sorting algorithm, called BadSort() is a modified version of StoogeSort() from the 2nd

What is the relationship between the Student class and the Teacher class (2 Puan) class Person String name class Student extends Person int studentId www wwww Course course class Course String courseName Teacher teacher class Teacher extends Person String subject
What is the relationship between the Student class and the Teacher class? (2 Puan) class Person { String

1. Given an array A1..n of distinct integers, the number of pairs (i, j) with i j and Ai Aj is called the reversals of A, denoted Rev(A). a. Determine Rev (A) for A (5, 7, 10, 4, 6, 9, 8, 3) by listing all reversed pairs and count ing them. b. What array with integers from the set 1, 2, ,n has the highest Rev (A) How many does it have c. Design a
1. Given an array A[1..n] of distinct integers, the number of pairs (i, j) with i < j and A[i] ></a></div> </h2> </h2> </div> </div> <div class=

Consider the following network 5 2 3 2 5 E F m 7 (a) Execute Dijkstras shortest path algorithm to find the shortest path from node B to all other nodes. (10 points) (b) Now suppose the link cost for one of the links changes but all costs remain nonnegative. For each change in link cost listed below, state whether it is possible for the route at
Consider the following network: 5 2 3 2 5 E F m 7 (a) Execute Dijkstra's shortest path algorithm to find the

1. (a) Determine the asymptotic upper bound for the number of times the statement yy 1 is executed in each of the following algorithms. (b) (c) (i) (ii) i1 while (i2n) (i) else (ii) i2 while (i 0. For each of the following sums, determine its order of growth using the O(g(n)) notation with the simplest possible function g(n). 2n 2n 2n 3 32 33
1. (a) (b) (c) Determine the asymptotic upper bound for the number of times the statement

Write a program in assembly language that asks user to enter a positive number and calculates factorial for that number. Store result in BX. Input 04H Output 18H as In Decimal 4321 24 In Hexadecimal 24 18H
Write a program in assembly language that asks user to enter a positive number and calculates factorial for

Write some Python code that, given any list of integers (list), finds the second largest element. Finally, your code should print the value, in the format shown below. You do not need to include any comments in your code. Note You are NOT allowed to use the builtin sort() method to sort the list. list 4, 2, 17, 6, 9, 11, 24, 5, 1 secondBiggest
Write some Python code that, given any list of integers (list), finds the second largest element. Finally,

Select the appropriate answer according to the given code below. Identify where a integer is changed into a floatingpoint data type. 1 2 3 Ainput(please enter the name) Binput(please enter the age) Cint (B) Dfloat (C) 4 O line numbers 3 line numbers 4 line numbers 3,4 Non of the above.
Select the appropriate answer according to the given code below. - Identify where a integer is changed into a

Suppose we had an analog light sensor that output a varying voltage between 05V depending on the intensity of the light hitting it (0dark, 5 bright). If we wanted to use this sensor to turn on a LED at dusk (suppose the output of the sensor is 1V at dusk), how could we use a comparatorop amp to turn the LED onoff (suppose the LED requires 10V to
Suppose we had an analog light sensor that output a varying voltage between 0-5V depending on the intensity

If 10 is inserted into the following AVL tree, draw the resulting tree. 6 8 14 20
If 10 is inserted into the following AVL tree, draw the resulting tree. 6 8 14 20

Given the following graph 1. 2. 3. 4. 5. 2 a 5 C b 3 e Give example of simple cycle Give example of simple Path Does vertex (a) is adjacent to (c) Give an example of Parallel edge How much the indegree and outdegree of vertex (d)
Given the following graph: 1. 2. 3. 4. 5. 2 a 5 C b 3 e Give example of simple cycle? Give example of simple

Given the following directed graph 3 1 6 4 2 7 5 1. Build the Adjacency List for the graph (3 Marks) 2. How much the Sum of In And OutDegrees in the graph, and there is a relation between them (2 Marks)
Given the following directed graph: 3 1 6 4 2 7 5 1. Build the Adjacency List for the graph? (3 Marks) 2. How

54. Let C be a binary (15,10) cyclic code generated by 8(x) (x1)(x1) and C be another binary (15,10) cyclic code generated by h(x) (x1)(xx1). (1) Is (11011 00101 00000) C C (ii) What is the generator polynomial for the code C C C (iii) How many cyclic subspaces are contained in C
54. Let C be a binary (15,10) cyclic code generated by 8(x) = (x+1)(x++1) and C be another binary (15,10)

Find the output generated from the input string 10010 for the finitestate machine with the shown state diagram in (Fig. Q4). Start So 52 0,0 1,1 0,0 0,0 Fig. Q4 1 0,0 3 1,1 01.0
Find the output generated from the input string 10010 for the finite-state machine with the shown state

A signal with a max frequency of 250 Hz is to be sampled. What is the Nyquist rate Q2 A signal made of the sum of 2 sine waves at frequencies 500 Hz and 1000 Hz is sampled at 1700 Hz. Show the frequencies components of the sampled signal that are visible in the range 0850 Hz. 100 0 x(f) 100 200 300 400 500 600 700 800 Frequency (Hz)
A signal with a max frequency of 250 Hz is to be sampled. What is the Nyquist rate ? Q2 - A signal made of

Convert the following to Chomsky Normal Form. (a) S M MaMa bMb e (b) S M M N N ANbbe
Convert the following to Chomsky Normal Form. (a) S ></a></div> </h2> </h2> </div> </div> <div class=

A still is operated at 18 kNm and steam is blown continuously into it. Draw T,xy diagram of the system, what are the temperatures that give us highest purity of the MVC and LVC. What are the health impact of the system and how to reduce its risk. Vapor pressure (KNm) Temp(K),Water Temp(k), chlorobenzene 13.3 324.9 343.6 6.7 311.7 326.9 4.0 303.1
A still is operated at 18 kN/m and steam is blown continuously into it. Draw T,x-y diagram of the system,

Draw the arrays dimensions and contents of the following initialized twodimensional arrays 1) 2) int arr1 new int 3 4 arr1 0 15 arrl 0 2 10 arrl 1 27 arri 0 3 9 arrl 2 32 char arr2 new char 4 arr2 0 new char a) arr2 1 new char (b, e, d, e) arr2 3 new char (f. g. h
Draw the array's dimensions and contents of the following initialized two-dimensional arrays: 1) 2) int [][]

3. (a) Show and explain clearly what the following array looks like in each step of the partition algorithm. 15 20 12 7 13 23 11 6 (10 Marks) (b) Continuing from your answer in part (a), show each step in the quicksort algorithm when applied to the array in part (a). (8 Marks) (c) Given an array A with n elements, write an algorithm in pseudocode
3. (a) Show and explain clearly what the following array looks like in each step of the partition algorithm.

2. Implement the following state diagram by using D flipflop for the first bit and JK flipflop for the second bit (i.e. if states are AB, then A is D and B is JK flipflop). Draw your circuit. 10 00 00 10 01 01 00 11 01 11 10 11
2. Implement the following state diagram by using D flip-flop for the first bit and JK flip-flop for the

3. Design 3bit FSM which follows a Gray code sequence. It has 8 states (from 000 to 111) and no input. It starts from state 000 and follows 3bit Gray code sequence. When it reaches the end of the cycle it returns to state 000. Implement this FSM with T flipflops. Draw the circuit. 3bit Gray code sequence 000 001 011 010 110 111 101 100
3. Design 3-bit FSM which follows a Gray code sequence. It has 8 states (from 000 to 111) and no input. It

CLO3 Diagram below represents a given updon counter, if the input is 1 counter works as down counter, and when input is 0 counter works as up counter. 0 1 0 3 0 0 1 1 0 2 We wish to implement this counter, how many D flip flops are required a. 4 b. 3 OC. 2 Od. 1 Activate Windo Go to Settings to ac
[CLO-3] Diagram below represents a given up/don counter, if the input is 1 counter works as down counter, and

3) Consider the following code segment and then answer the questions that follow int myArray(1,3,8,30,2,0,5,7,100,44) int x x myArray0 for (int i1i myArray.length i) if (myArrayix) x myArrayi System.out.println(xx) 3.2 Describe in one sentence only what the above code segment does. Write the answer in the box provided. (0.5 point) 3.3 Write in
3) Consider the following code segment and then answer the questions that follow: int

Write the following functions according to their order of growth from the lowest to the highest. Prove the accuracy of your ordering g1(n) 5n g2(n) Vn g3(n) n3(n) g4(n) (n2) g5(n) (n)n
Write the following functions according to their order of growth from the lowest to the highest. Prove the

Using the P(x) 0.90 P(y) 0.05 P(zx,y) 0.25 P(zx, y)0.85 P(zx,y) 0.85 P(zx, y)0.85 What is the probability of P(xz) Bayesian network with the following conditional probability Activ Go to,Y Z X
Using the P(x) = 0.90 P(y) = 0.05 P(z|x,y) = 0.25 P(z|x, y)=0.85 P(z|-x,y) = 0.85 P(z|-x, y)=0.85 What is theY Z X

1. Determine the values of the following expressions 40 a) 3i 10 i20 P2 b) B log 2 4 i1 2. Find the big O complexities a) T(n) log(nn) b) T(n) 3n 2
1. Determine the values of the following expressions: 40 a) = 3i 10 i-20 P2 b) B= log 2 4 i=1 2. Find the

For the given circuit below a) write the state equation b) derive the state table c) draw the state diagram (3 marks) Clock D Cik A
For the given circuit below: a) write the state equation b) derive the state table c) draw the state diagram

3. What is the runtime T(n) and complexity of the following code segment int x 0 for (int i0 i
3. What is the run-time [T(n)] and complexity of the following code segment? int x = 0; for (int i = 0; i

5. If a given Qin logn) algorithm runs in 60 ms for an input of size 32, what would the expected run time be for an input size of 64 6. Find the run time function T(n) and complexity of the following code segment for (i 1 i
5. If a given Qin logn) algorithm runs in 60 ms for an input of size 32, what would the expected run- time be

Write a PHP Form Handler process.php which will receive the data of the following form at the server side Feedback Form Please fill out this form to help me improve My site. Name Email Address Things you liked on My Site Submit Your Entries site design Contents Ease of use Clear Your Entries
Write a PHP Form Handler

Consider the infix expression given as 9( (3 4) 8) 4 Evaluate the expression.
Consider the infix expression given as 9-( (3* 4)+8) / 4 Evaluate the expression.

Identify the error in the following C code block and justify double Grade 0.0 double Bounes 0.0 cout
Identify the error in the following C++ code block and justify: double Grade = 0.0; double Bounes = 0.0; cout

Which of the following is true according to the BZYX Company ER diagram BZYX COMPANY (ERD) EmplD CellPhone Number OfficePhone Number (0) EMPLOYEE H Serves Sign Up Refers ReferringParty ReferredParty OH CUSTOMER O A. A customer cannot be referred by another customer B. A customer can be referred by at most one customer OC. A customer must be
Which of the following is true according to the BZYX Company ER diagram? BZYX COMPANY (ERD) EmplD CellPhone

Consider the C function below double fact (long i) if (i1 i0) return i else return ifact (i1) a) Assuming that n characterizes the input size, in terms of n, what is the number S of recursive calls Also give the asymptotic upper bound (0)). b) How would you modify (i.e., rewrite) the function fact so as to eliminate the redundant recursive
Consider the C function below! double fact (long i) { if (i==1 || i==0) return i; else return i*fact (i-1); }

1. Write the order of execution of following Real Time tasks using Earliest Deadline Scheduling Algorithm. BT Burst Time D Deadline PPeriod Task T1 T2 T3 BT D P 1 2 3 Yantnizi girin 940 6 8 P468
1. Write the order of execution of following Real Time tasks using Earliest Deadline Scheduling Algorithm.

What is the output of the following code (2 Points) class A public int x1 public class App public static void m1(A a, int var) a.x var 1 var public static void main(String args) A al new A() A a2 new A() int var 5 mi(al, var) System.out.println(a1.x var)
What is the output of the following code: * (2 Points) class A { public int x=1; } public class App{ public

What is the output of the following code (2 Points) public class Main public static void main(String args) ClassSuper a new ClassSub( 5 ) class ClassSuper public ClassSuper( String s) System.out.print(ClassSuper ) class ClassSub extends ClassSuper public ClassSub( Strings) super(s) System.out.print(ClassSub s) public ClassSub(int
What is the output of the following code? * (2 Points) public class Main { public static void main(String[]

Write java code to find minimum spanning tree of any graph. Your program should accept any graph from users and find the minimum spanning tree and its total cost Test cases At least select one random test case and compare youre solution against the result
Write java code to find minimum spanning tree of any graph. Your program should accept any graph from users

Consider the following code class A class B extends A class C extends B Which of the following statements return true for the object A a new B() (2 Points),Consider the following code class A class B extends A class C extends B Which of the following statements return true for the object A a new B() (2 Points)
Consider the following code: class A { } class B extends A{} class C extends B {} Which of the following

7. Complete the code below. Suppose upon mouse up on a canvas, a rectangle will move 5 pixels to the right. 1234567890123453222222222 Canvas Example Mouse Event Your browser does not support canvas.. 19 123E 24 569 26 var myCanvas document.getElementById(gameCanvas) var myContext myCanvas.getContext(2d) var x 100 (i).addEventListener((ii),
7. Complete the code below. Suppose upon mouse up on a canvas, a rectangle will move 5 pixels to the right.

1. An unpipelined processor has a cycle time of 35 ns. What is the cycle time of a pipelined version of the processor with 5 evenly divided pipeline stages, if each pipeline latch has a latency of 1 ns What if the processor is divided into 70 stages Show your work (5 marks) 2. Calculate the latency if an unpipelined processor has a cycle time of
1. An unpipelined processor has a cycle time of 35 ns. What is the cycle time of a pipelined version of the

How many loops are there in the control system,R(s) E (s) Controller B(s) G.(s) Z(s) Sensor H(s) Actuator Go(s) U(s) Process G(s) Y(s)
How many loops are there in the control system?R(s) E (s) Controller B(s) G.(s) Z(s) Sensor H(s) Actuator Go(s) U(s) Process G(s) Y(s)

Solve the following recurrence relations a) Xn 7xn110xn2, x02, x13 b) Xn 2xn1Xn23xn3, X02, x11, x24 c) Xn Xn12n, X05 d) Suppose that an and bn are both solutions to a recurrence relation of the form Xnaxn1xn2. Prove that for any constants c and d, candbn is also a solution to the same recurrence relation.
Solve the following recurrence relations a) Xn = 7xn-1-10xn-2, x0=2, x1=3 b) Xn = 2xn-1+Xn-2-3xn-3, X0=2,