See course topics and exam details
How to use this practice pack
This eight-question pack builds on Nablio’s short lessons on row operations and matrix and vector fundamentals. Practise matrix products, row reduction, determinants, inverses, parameter-dependent systems and dot products. Each question includes a hint and an explained solution.
- Try the question before opening its hint or solution. Show the method, not just the answer.
- Mark the first step you could not justify: dimensions, operation, sign, condition, or interpretation.
- Use the diagnosis link after that question, then close the answer and retry.
Allow about 80 minutes for a first attempt at all eight questions, or split them into two sessions at your own pace. The suggested times are flexible. Set aside extra time to read the solutions and retry missed steps.
All entries, variables and parameters are real. In row-operation notation, is the current row ; means “replace by.” A system is consistent if it has at least one solution. A square matrix is singular if it has no inverse. The notation transposes a row into a column when used that way.
1. Check the dimensions before calculating
6 min · optional Nablio estimate
Let
- State whether , , , and are defined. Give the dimensions of every defined result.
- Compute , and . Explain why both products existing does not make their sum possible.
Show a hint · 1
To add matrices, match both dimensions. For a product, match the inner dimensions; the outer dimensions give the result’s size. Compute one entry by pairing a row of the first factor with a column of the second.
Show the full solution · 1
is , is , and is . Thus is undefined. The products , , and have sizes , , and , respectively. The sum is undefined because its two terms have different sizes.
For example, the top-left entry of is . Continuing row by column gives
For the vector product, the two row calculations are and . Hence
A product can be defined in each order without having the same dimensions in those orders. Matrix multiplication is not an entry-by-entry operation.
Check the result and conditions
All entries are real and no parameter restriction is needed. Independently check the last entry of : . Also check that every reported result has the size predicted before calculation.
Common errors
Do not add differently sized matrices, multiply matching positions entry by entry, or assume . Here the dimensions alone prevent that equality.
Choose what to review
If the dimensions or row-by-column pairing were difficult, revisit multiplication, determinants and inverses. Then redo just one row of each product without looking at the answer.
2. Choose a useful first pivot
9 min · optional Nablio estimate
Solve the following system by row reduction. Show your row operations, give the number of solutions, and check the result in all three original equations.
Show a hint · 2
The first equation has coefficient zero for . Swap in a row with an -coefficient of 1 rather than dividing by that zero. Keep the variable order throughout.
Show the full solution · 2
The augmented matrix is
First use , then :
Use , then :
The last row gives . The second gives . The first then gives . There is a pivot in each variable column and no contradiction, so the solution is unique:
Check the result and conditions
Substitution gives , , and . All three equations hold. Every row operation used is reversible; no division by zero occurred.
Common errors
The missing in the first equation needs a zero entry. Operate on the constant column too. After a swap, row labels refer to the current rows, not their original positions.
Choose what to review
If an operation changed your answer, review why permitted row operations are reversible. If you reached echelon form but could not finish, revisit solving and checking a system.
3. Keep the determinant’s sign and scale
10 min · optional Nablio estimate
Let
- Choose an efficient row or column for cofactor expansion and compute .
- Independently reduce to an upper-triangular matrix using this sequence: swap rows 1 and 2; multiply the new row 1 by ; replace row 3 by row 3 minus twice the current row 1; then add one third of the current row 2 to row 3. Recover from the triangular determinant.
- Explain why row operations that preserve a system’s solutions need not preserve a determinant.
Show a hint · 3
Row 1 has two zeros. Its only nonzero entry is in position , whose cofactor sign is negative. For the second method, write a running multiplier relating the current determinant to the original determinant.
Show the full solution · 3
Expanding along row 1 requires one minor:
The minor is , so .
For row reduction, the swap multiplies the determinant by . Scaling the new first row by multiplies it by . Adding a multiple of another row does not change it. After the swap and scaling, the matrix is
The operation makes row 3 equal to . Then gives
Consequently,
so . The first method is shorter here because the zeros remove two cofactor terms.
For a system, the same reversible operation is applied to an entire augmented row and preserves the shared solutions. A determinant is a scalar attached to a square coefficient matrix; swaps and nonzero row scalings change that scalar in the stated ways. Preserving solutions and preserving a determinant are different claims.
Check the result and conditions
The two methods agree on . Since it is nonzero, is invertible. The factor scales one row, not the entire matrix; it therefore contributes one factor of , not three.
Common errors
Watch the negative cofactor sign at position , the subtraction in , and the direction of the final multiplier: , so multiply by to recover the original.
Choose what to review
If “same solutions” led you to keep the determinant unchanged, revisit what row operations preserve, then redo this question with a two-column log of operation and determinant multiplier. For the nonzero-determinant/inverse connection, use the matrix fundamentals lesson.
4. Build a 3×3 inverse from the identity
12 min · optional Nablio estimate
Let
- Find by reducing . Do not use an entrywise reciprocal or a two-by-two inverse formula.
- Write the elementary matrix for your first operation . Explain what and represent.
- Use the inverse to solve , then check the solution.
Show a hint · 4
After , use . A pivot of 3 appears in the third column. Apply every operation to both halves of the augmented matrix. An elementary matrix is the identity after one elementary row operation.
Show the full solution · 4
Start with . We display the left block and right block separately so every entry stays readable. Each stated operation acts on both blocks.
After , followed by , the blocks are
Now divide row 3 by 3. Use the resulting row 3 to clear the third entry of row 2 with . This gives
Finally use . The left block is now , and the right block is the inverse:
For the first operation alone, applying to gives
Left multiplication by performs that row operation: is the new left block and is the new right block. One operation does not yet give the inverse. The full sequence sends to and sends to .
Now compute
Check the result and conditions
Writing , direct multiplication gives , so both inverse identities hold. Also, , and the row reduction never divides by zero. The forward check is , since the three row results are , , and .
Common errors
Changing only the left block loses the inverse calculation. Also distinguish , which performs a row operation, from , which generally has a different effect. The inverse belongs to the matrix and can be reused for a different right-hand side.
Choose what to review
If the meaning of an inverse is unclear, revisit the introductory inverse example. If a block went out of sync, return to whole-row operations, then repeat this three-by-three construction.
5. Use Cramer’s rule for one unknown
8 min · optional Nablio estimate
For the system
use Cramer’s rule to find . First check that the rule applies. Then recover and from the simpler equations and verify all three values.
Show a hint · 5
With variable order , replace column 2 of the coefficient matrix with the constants. Keep the other columns in place. The denominator is the determinant of the original coefficient matrix.
Show the full solution · 5
The coefficient matrix and its replacement for are
Expand each determinant along row 2, where the third entry is zero. For the original matrix,
Because , the system has a unique solution and Cramer’s rule applies. For the replacement matrix,
Therefore . The second equation gives , and the third gives .
Finding just the requested determinant and then substituting avoids two unnecessary replacement determinants. For a large system, elimination is usually more efficient than computing a determinant for every unknown.
Check the result and conditions
The original left sides are , , and . The denominator is 5, so no zero division is hidden. If the original determinant had been zero, these quotients would not classify consistency; row reduction would be needed.
Common errors
Replace a column, not a row; use the constants in their original equation order. A negative replacement determinant is allowed. It is the original nonzero determinant that permits division.
Choose what to review
If you replaced the wrong entries, review the difference between coefficients and constants. If the determinant condition was missed, revisit when an inverse exists, then redo the first two steps here.
6. Split parameter cases before dividing
13 min · optional Nablio estimate
For every real value of , classify this system as having one solution, no solution, or infinitely many solutions. Give every solution in the cases where solutions exist.
Also determine when its coefficient matrix is singular. Your argument must handle every value excluded by a division or cancellation.
Show a hint · 6
Subtract the first equation from each of the other two. Factor , then keep and separate. A cancelled factor can still mark a case with a different solution set.
Show the full solution · 6
The operations and give the equivalent triangular system
Let denote the coefficient matrix of the original system. Only row additions were used, so its determinant is the product of these diagonal coefficients:
Case 1: . Both factors are nonzero. The last equation gives . The second then gives
Finally,
This is the unique solution because all three pivots are nonzero.
Case 2: . The last reduced equation becomes . There is no solution. In the original system, the first and third equations have the same left side but constants 2 and 1, which confirms the contradiction.
Case 3: . The last reduced equation is , while the second is . Set , with ; then and . Every solution is
The coefficient matrix is singular exactly at and . These two singular cases have different consistency outcomes.
Check the result and conditions
For , substitute the formulas into the reduced equations: and ; the chosen gives . Reversing the row additions verifies the original system. At , the family gives original left sides for every real . Substituting into the generic formulas produces only , one member of that family, and misses the others.
Common errors
Do not cancel without recording , or divide by before checking . A zero determinant does not by itself mean “no solution.” A zero row must be read together with its augmented entry and the remaining equations.
Choose what to review
If the exceptional cases were lost, revisit reading final rows and free variables. Then redo this question by listing the excluded values before writing any fractions.
7. Separate a dot product, a length and an angle
8 min · optional Nablio estimate
Let , , and , where .
- Find , , and . Determine the angle between and .
- Find the distance between the points with coordinates and .
- Find every for which is orthogonal to .
- The zero vector has dot product zero with . Does the angle formula assign it an angle of with ? Explain.
Show a hint · 7
Distance uses , not the difference of lengths. An angle formula divides by both lengths, so check whether either is zero before using it.
Show the full solution · 7
The dot product is a scalar:
The lengths are
Both vectors are nonzero, so the angle formula applies:
With , this gives , or .
For distance, , giving
For the parameter condition,
It vanishes exactly when . The vector is nonzero, so the perpendicular-angle interpretation is valid too.
Algebraically, the zero vector is orthogonal to every vector under the definition “dot product equals zero.” However, it has no direction, and the angle formula would divide by its zero length. The angle with the zero vector is undefined; it is not assigned by that formula.
Check the result and conditions
At , the dot product is . Also, , which agrees with the zero dot product. Square roots denote nonnegative lengths; the angle calculation requires both vectors to be nonzero.
Common errors
A dot product returns a number, not a vector. Do not write , forget the square root in a norm, or infer an angle for a zero vector from its dot product.
Choose what to review
If a scalar and a vector got mixed up, revisit dot products and orthogonality. Then label each requested answer here as a scalar, length, angle, or parameter before calculating.
8. A singular system can still have a useful solution
14 min · optional Nablio estimate
Let
where , and let .
- Without a full cofactor expansion, show that is singular. Explain why neither an inverse nor ordinary Cramer quotients can solve .
- Find the values of for which the system is consistent, then give every solution.
- In the consistent case, find the solution that is orthogonal to . Check both conditions and explain why this extra condition selects exactly one solution.
- Does that one selected solution make invertible? Explain.
Show a hint · 8
The third coefficient row is the sum of the first two. Apply to the augmented matrix, understood as two successive row additions. Once you have a family, impose its dot product with equal to zero.
Show the full solution · 8
Subtracting row 1 and then row 2 from row 3 makes a zero coefficient row. Row additions preserve the determinant, and a matrix with a zero row has determinant zero. Thus , so does not exist and Cramer quotients would have zero denominator.
On the augmented matrix, the same operations give the final row
If , this is a contradiction and there is no solution. If , the remaining equations are and . Let , with . Then
Every real gives a solution. The additional orthogonality condition is
It vanishes exactly when , selecting
The extra condition selects one member because the equation has one solution. It does not change the original matrix or its determinant. The original system with still has infinitely many solutions, and is still singular.
Check the result and conditions
The three row results at are , , and . Its dot product with is . As a further check, ; changing by a real amount changes the solution by that amount times without changing the right-hand side. However, the dot product with changes by three times that amount.
Common errors
Do not conclude “no solution” from singularity alone, stop after finding one convenient solution, or say the extra condition creates an inverse. Also, check the constant row: coefficient dependence requires the same relation among the constants for consistency.
Choose what to review
If the consistency test or family was missing, return to contradictions and free variables. If the family was correct but the extra condition was not, revisit the dot-product test for orthogonality, then redo only part 3.
Turn your attempt into a study plan
- Questions 1 or 4: if the operation or result’s shape was unclear, return to matrix multiplication and the meaning of an inverse. Redo a row-by-column check.
- Questions 2, 6 or 8: if a contradiction or free variable was missed, use reading a reduced system. State the whole solution set, including the allowed parameter values.
- Questions 3 or 5: if the sign, factor or Cramer column was wrong, compare the worked steps in this pack with the determinant/inverse connection. The existing lesson supplies the foundation; the longer determinant and Cramer methods are taught here.
- Questions 7 or 8: if orthogonality or the type of answer was unclear, use dot products and orthogonality, then check a proposed answer directly.
For your next attempt, select one question with an arithmetic error and one with a reasoning error. Explain aloud why each operation is allowed and why all parameter cases have been covered. Use your assigned course practice to extend beyond this sample.
What to work on with a tutor
Bring your attempt and circle the first uncertain line. A tutor can check your row-operation notation, ask you to justify a determinant method, trace the same operations through both inverse blocks, and help you separate parameter cases before dividing. For the final questions, the tutor can ask you to verify both the system and the dot-product condition, then give you a new original problem to solve independently.
See Concordia MATH 204 tutoring for course context and individual help. Use your instructor’s current outline to decide which topics to prioritize.
Practice questions, not official exam questions.
Course topics and exam information
Concordia Fall 2026: scope and assessment arrangements
The official Concordia MATH 204 Fall 2026 outline, checked October 4, 2026, places reading week on October 10–16 and schedules a common midterm for all sections on Sunday, November 1, from 10:00 to 11:30. It identifies weeks 1–6 as the midterm material. Check your instructor’s announcements for updates and the room.
This pack samples those weeks: systems, matrix operations, inverses and elementary matrices, determinants, Cramer’s rule, and elementary vectors, norms, dot products, distance and orthogonality. Geometry of linear systems, cross products, vector spaces and eigenvalues are later topics in that outline and are outside this core pack.
For McGill MATH 133, choose questions that match your current course outline.
Course outline
The Concordia MATH 204 Fall 2026 outline supports the dates and scope above (reading week: page 1; midterm: page 2; topic schedule: page 3).
Ready to practise without hints? For Concordia MATH 204, try the eight-question midterm practice mock, with a question-only paper and separate worked solutions.
Useful for
Concordia MATH 204: systems, inverses, determinants, vectors and orthogonality. Also useful for overlapping topics in McGill MATH 133.
Work on the step you’re missing.
Tell us the subject and your preferred time. Nablio confirms the details by text or email.
Request a lesson