Math 191 Wilkening Spring 2023 Homework 6 due Sat, Mar 11, 2:00 PM (Upload your solutions to Gradescope) 1. (2 points) (I.6.12, page 42, Strang.) The following matrix is singular with rank one: 1 2 1 2 A = 2 2 1 2 = 4 2 4 . Find three linearly independent eigenvectors and […]
Math 191 Wilkening Spring 2023 Homework 5 due Sat, March 4, 2:00 PM (Upload your solutions to Gradescope) Problems 1–8 below are devoted to the simplest and most important application of least squares: Fitting a straight line to data. A line y = C +Dt has n = 2 parameters C and D. We are
Math 191 Wilkening Spring 2023 Homework 3 due Sat, Feb. 11, 2:00 PM (Upload your solutions to Gradescope) 1. (2 points) (I.1.4, page 6, Strang.) Suppose A is the 3 by 3 matrix ones(3,3) of all ones. Find two independent vectors x and y that solve Ax = 0 and Ay = 0. Write that
Math 191 Wilkening Spring 2023 Homework 4 due Sat, Feb. 18, 2:00 PM (Upload your solutions to Gradescope) 1. SupposeV,W andZ arefinitedimensionalvectorspacesandA:V →W andB:W →Z are linear operators. (a) (2 points) Show that if A is surjective (onto W), then nullity(BA) = nullity(A) + nullity(B). (b) (2 points) Show that in general (whether A is
Math 191 Wilkening Spring 2023 Homework 1 due Sat, Jan. 28, 2:00 PM (Upload your solutions to Gradescope) 1. (5 points) Find the “tiny-precision” floating-point number encoded by the bit pattern in part (A) below. In (B) and (C), carry out the tiny-precision floating-point arithmetic and then find the binary representation. The variables x and
Math 191 Wilkening Spring 2023 Homework 7 due Mon, Mar. 20, 11:59 PM (Upload your solutions to Gradescope) 1. (3 points) (Variant of I.8.5, page 68, Strang.) Show that AT has the same (nonzero) singular values as A and conclude that ∥A∥ = ∥AT ∥. Provide a counterexample to demonstrate that ∥Ax∥ need not equal
import java.util.List; import java.util.Set; public class GraphUtils { @SuppressWarnings(“unused”) private static final long serialVersionUID = 3L; * Given a graph, this method returns the smallest number of edges from the src * node to the dest node, or 0 when src = dest, or −1 for any invalid input. * Invalid inputs are defined as:
CIT 593 | Assignment: Dynamic Memory & File I/O | 1 Setting up Codio for this HW: 1) Open the Codio assignment via Coursera 2) From the Codio File-Tree click on: lc4_memory.h and lc4_memory.c 3) Remember to use the Codio “Pre-submission tests” function before submitting the assignment. The goal of this HW is for you
CIT593 HW13 dynamic memory Read More »
Setting up Codio for this HW: 1) Open the Codio assignment via Coursera 2) From the Codio File-Tree, open the “submit” folder and click on: program1.c Assignment Overview: From lecture you have learned that in C an array of characters with a NULL termination is considered a string. An array of characters without a NULL
CIT593 HW11 LC4 Strings in C Read More »
CIT593| Assignment:C-FileI/O–MakingtheLC4Assembler | 1 Setting up Codio for this HW: 1) Open the Codio assignment via Coursera 2) From the Codio File-Tree click on: assembler.c From lecture you’ve learned that C is file-oriented and that working with files represents I/O devices in C. C places files into two categories: “text” and “binary.” In this assignment
CIT593 HW12 LC4 Assembler Read More »