Resources for Lab Session 5 (Modular Programming)

A modular program build from sources of Laboratory 5 is compressed here

An explanation of the Gauss-Jordan method used to obtain the matrix inverse (or reciprocal) is given here

Problem 3.2 solution is this. Explanations are given here

For problem 3.3 see: http://en.wikipedia.org/wiki/Greatest_common_divisor_of_two_polynomials
and Polynomials = HowTo: Euclidean Algorithms for polynomials

For Problem 3.5: code to complete look for the todo remarks in the code. Set operations for sets represented as bits on long long integers. With the constants defined in the provided code the sets can have at most 640 elements.

For Problem 3.6: code to complete look for the todo remarks in the code. To understand the solution read this

For problem 3.7 see: