Retired on October 1, 2003.

Taught last course during the spring semester, 2011.

A program which produces the correct answers, but damages the stack, is not a perfect program.

Click here to download a Word file which contains a simple program written in the MIPS-IV assembly language and a very detailed explanation of the program.

2011 Click here to download a Word file which contains the first targil.

2011 Click here to download a Word file which contains the second targil.

=======================================================================

Click here to download a simple 8086 programming segment with a full trace, written in Word 2000.

Click here to download the corrected version of the moed alef examination.

89-530-01 2008: Click here to download the first exercise (corrected a second time), written in Word XP.

Click here to download the first exercise written in Word XP.

Click here to download the second exercise, written in Word 2000.

Click here to download the third exercise, written in Word 2000.

Click here to download an explanation of page 174 (as a Word file).  

Click here to download a floating-point program which finds a good approximation for the unique maximal point for a continuous function which has no local minima in the interior of a given interval. Click here to download the file Mivne2.doc, a Word XP file. It discusses the I-type (Immediate) instructions.
Click here to download a Word XP file which contains description of the Load and Store instructions, with examples. Descriptions of the eight Branch instructions come next. Then comes a complete assembler language program, followed by several pages of detailed explanation of the program.

Click here to download a file about floating point. The file (25 pages long) has been adapted from the Hoveret of Mavo L'mahshevim". About 60% has been adapted to Word XP, and the rest deals with topics other than floating point.

Algorithms 1

Click here to download a Word 2000 file which contains an explanation of ordered hashing.
Click here to download a Word 2000 file which contains most of the calculations for multiplying polynomials P(x) and Q(x), each of degree at most three, using the iterative (not recursive) FFT algorithm.

Courses 2003:  Introduction to Computers
SGSG0:

Bar-Ilan University , Department of Computer Science

Prof. Joseph B. Muskat

Room: 123
Office Hours: By appointment
Phone: 972-3-531-8716
Email: muskat@cs.biu.ac.il