(1)
Transfer 5 blocks of information from tape 2 beginning at block 1 into store blocks 10 onwards.
(2)
Read blocks 5, 4 and 3 of tape 1 to store blocks 3, 2 and 1 respectively.
(3)
Four blocks of information are stored on tape 1 in blocks 1 onwards. Transfer each half word into a separate full word location in the store starting from store; location 100.
(4)
Information is stored in blocks 1-5 inclusive in the store. Write blocks 1 and 2 into blocks 4 and 5 of tape 1, block 3 into block 7 of tape 1 and blocks 4 and 5 into blocks 1 and 2 of tape 1 respectively. The write operations should be performed in the order given.
(5)
Read block 5 of tape 1 into store locations starting at 1: Write this block back to the same block on tape 1 but reverse the order of the words in the block.
(6)
Write 10 blocks from A1 to the 10 sections from that whose number is held in B1, on the tape whose number is held in B2 as a half word address (use substitution register B121).
(7)
Tapes 1 and 2 are stationed at unknown positions P1 and P2. Reposition the tapes at sections [(P1+P2)/2]. (The square brackets indicate that the integral part of the expression is required.) Transfer 100 blocks from tape 1 sections [(Pl+P2)/2]-i, where i goes from 1 to 100, to tape 2 sections [(Pl+P2)/2]+j, where j goes from 0 to 99.
(1)
Search for word 173 of section 7 of tape 6.
(2)
Using a buffer in blocks six and seven of the store write 750 words from A3 to the beginning of tape two, preceded by a '7' marker and followed by a '1' marker.
(3)
As (2) but precede information by a '3' marker and follow it by a '4' marker.
(4a)
Search for word 6, section 4 of tape 3, where a marker is located.
(4b)
Set up a buffer for reading from tape 3 in the first available block after A6.
(4c)
Read 100 words to A1, Assume first string has more than 100 words.
(4d)
Read to A2 until a marker of order ≥3 is encountered.
(4e)
Read not more than 200 words to A4, stopping if a marker ≥4 is encountered.
(5)
Place a '3' marker at word 3 of block 100 of tape 4 without any further alteration of the tape. A marker already exists at this point. The string following the '3' marker is entirely contained in block 100.
(6)
Transfer the first and fourth strings of information on tape 3 to consecutive store locations beginning at A2 (set up a two block buffer at some convenient point).
(7)
Read the record preceding the present position of tape 6 to store locations ending with 315.
(8)
Read the first 700 words from tape one, which has been written by fixed block transfers.
(9)
The following three operations are to be performed consecutively on tape one.
a. Read the first string from tape one to locations starting with 1300:
b. Write 160 words from A7 onwards to tape 1 preceded by a '7' marker and followed by a '3' marker. The '7' marker should go in the fourth word of section 100. Leave the remaining 350 words of section 10 as they are.
c. Read the second string from tape one to store locations beginning at 1400:
(10)
Write a subroutine to read the next string from tape 4 into locations starting from the address held in B5. Assume that other tapes may be in use for variable length operations. The read buffer for tape 4 has been set up by the main program. The link is in B90.
Numbers (11) and (12) are two parts of the same problem.
(11)
There are 100 strings of non-zero floating-point numbers stored consecutively from main store location 1600: and there are floating-point zeros between the strings and after the last one. Store these strings as variable length records on tape 3 starting at the 200th word of section 26. Place '7' markers between the records and at both ends. Store the locations of the markers, excluding the first one, in the full words from 1500: in the form required by the word search instruction. Exit to the address stored in half word 1.4.
(12)
Suppose that the first half word of each of the 100 strings is a keyword which uniquely identifies that string. Write a subroutine to search through the 100 strings on tape 3 for the string whose keyword is contained in B10 and to place that string - keyword included - in consecutive locations beginning at the address contained in half word A3/2. If no string with that keyword is found exit to b90 with b127 odd. If the search is successful exit to b90 with b127 even. Assume that tape 3 is already selected and aligned on the marker at the beginning of the 100 strings. Leave the alignment on exit in A/3. The read buffer has been set up. B90 is even on entry.
(1)
(2)
(3)
(4)
(5)
(6)
(7)
(1)
(2)
(3)
(4a)
(4b)
(4c)
(4d)
(4e)
(5)
(6)
(7)
(8)
(9a)
(9b)
(9c)
(10)
(11)
(12)
