Assignment #5
•	Assuming that you have finished lab 10, we need to preprocess the graph and check for the passwords.
•	For the given the graph there is a file called lock.dat. For each node there will be a password.
•	Read lock.dat into an array.
•	Read the key.dat which gives the passwords available for our traversal.
•	Check each room to see if it is accessible, if it is not accessible, delete all the edges that go to that room.
•	See the board for explanation and algorithm
•	Bring the algorithm page and data files (three) to the lab
Assignment #6
•	Our implementation of Strassen’s method is going to be poor in terms of computation. But probably more readable.
•	We make several simplifying assumptions
•	Both matrices are square
•	Number of rows (columns) is 2^j, j > 0
•	Winograd’s method accepts 8 parameters a11, a12, a21, a22, b11, b12,  b21, b22 and calculates c11, c12, c21, c22.
•	The actual operator *(const T& m) calls Winograd’s method.
•	if size == 2
•	result = winograd(*this(1,1),.....,m(1,1),...,m(2,2))
•	else
•	change the matrix *this and m to 2 by 2
•	SMatrix<T> a11(n/2,n/2), .....
•	make_2X2(*this, a11, a12,a21,a22);
•	make_2X2(m,b11,....);
•	result = winograd(a11,a12,.....,b22);
•	real_result = unmake_2X2(result)