1) Write a function reverse(A) which takes a matrix A of arbitrary dimensions as input and returns a matrix B consisting of the columns of A in reverse order. Thus for example, if
A = 1 2 3 then B = 3 2 1
4 5 6 6 5 4
7 8 9 9 8 7
Write a main program to call reverse(A) for the matrix A = magic(5). Print to the screen both A and reverse(A).
2) Write a program which accepts an input k from the keyboard, and which prints out the smallest fibonacci number that is at least as large as k. The program should also print out its position in the fibonacci sequence. Here is a sample of input and output:
Enter k>0: 100
144 is the smallest fibonacci number greater than or equal to 100.
It is the 12th fibonacci number.
Let the following relational tables be given: R = (A, B, C) and S = (D, E, F) where A, B, C, D, E, and F are the attributes (columns). Write the SQL statements that will express each of the queries given below:
Where We ve Been Where We re Going
Back in February (that s 1998, but it almost seems longer), Dr. GUI set off to start a set of columns on the Active Template Library (ATL).
SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations on high performance machines. The library is written in C and is callable from either C or Fortran. The library routines will perform an LU decomposition with partial pivoting and triangular system solves through forward and back substitution. The LU factorization routines can handle non-square matrices but the triangular solves are performed only for square matrices. The matrix columns may be preordered (before factorization) either through library or user supplied routines. This preordering for sparsity is completely separate from the factorization. Working precision iterative refinement subroutines are provided for improved backward stability. Routines are also provided to equilibrate the system, estimate the condition number, calculate the relative backward error, and estimate error bounds for the refined solutions.
Code was successfully implemented within ALtera FPGA with Quartus 6.0. It presents two polish own female names: ULA and ALA whose are scrolling on the 4-columns crystal LED. When you press the switch it will turn from ULA into ALA and continue scrolling.
BugTrack is a basic, yet fully functional web based Bug Tracking system that you may use as a framework to create an expanded system or use as is . Great for small teams working on software projects.
Features include:
- Search by Project, Assigned Person, Priority, Status
- Sorting by any of the columns (Bug Name, Project, Priority, Assigned Person, Status)
- Login Authentication
- Administration of Users
- Administration of Priorities
- Administration of Projects
- Administration of Statuse
Good Luck and Thanks trying this system...
This is program with source code to convert ascii text files to the maxicode barcode standard.
The input file consists of two columns. The first column represents a code and the second column is a string enclosed in quotes. The
codes for the first column are as follows: PM, SM, CC, MO, SC, and PC.
This control is another extension to the now standard and widely used ListView control. I have included some of the more common features: shaded columns, column sorting (with data type), but the real addition is the FILTERBAR features of the header. This implementation eliminates all of the work of dealing with the filter messages and item filtering by incorporating it into the control. This could have been implemented as delegates, but we create controls to do the work for us, don t we? I would like to thank Carlos H. Perez since a lot of the implementation came from examples he set with his ListViewEx control.
This is our version of tetris, with "guidelines" as an option. These will allow you to easily se where the pieces will fall, be highlighing the columns that the falling piece is at the given moment.
Enjoy!
Computes all eigenvalues and eigenvectors of a real symmetric matrix a,
! which is of size n by n, stored in a physical np by np array.
! On output, elements of a above the diagonal are destroyed.
! d returns the eigenvalues of a in its first n elements.
! v is a matrix with the same logical and physical dimensions as a,
! whose columns contain, on output, the normalized eigenvectors of a.
! nrot returns the number of Jacobi rotations that were required.
! Please notice that the eigenvalues are not ordered on output.
! If the sorting is desired, the addintioal routine "eigsrt"
! can be invoked to reorder the output of jacobi.
