Based on the description of the problem being solved, I'd guess they would have used "FARGO", a sort of report generation language, which probably had some predefined way to "AND" those criteria together and print out 10 matches. FARGO may have morphed into RPG by 1962, but the idea would have been similar.
So my theory is that the program runs through the 3000 records on tape and matches (ranks) them against the customer's input. It could keep track of the current top 10 matches as it goes through. Then it can print them out at the end. (I'd expect some pseudo-randomness so customers don't get the same results.)
Of course, they could do something simple, such as having a small number of pre-computed lists and just print one based on the customer's input.
We can probably assume each gift was assigned a single gender too (and possibly a single age category). Would that have helped as they could then pre-sort the tape for speed? I assume a seek is faster than a read, but don’t know enough about the architecture!