As already correctly stated in the comments and in the preceding answer, this problem has not an univocal interpretation. However, maybe some considerations could be helpful to indicate the probable interpretation that who conceived the problem had in mind.
First, after some search, I found that this question is reported in the book "Discrete Mathematics with Ducks". In particular, the problem is cited in the first section of the book, entitled "Counting and proofs" , which deals with very basic preliminaries of mathematics. This might suggest that the solution is basic as well.
Second, the problem in the book has two additional parts. In the first of these, it is stated: "(Still about the library) Of course, not every combination is realistically possible, as the library does not hold materials in every type for every discipline. If the library has six types of material for each discipline, how many possible ways are there to fill in a line on the form?". In the second of these it is stated: " (And more about the library) More realistically, some disciplines use materials in more differing forms than others. Let's look at just a few disciplines. The Dance holdings are in videotape, DVD, current journals, bound journals, and books. The Math holdings are in books, current journals, databases, bound journals, videotapes, and microfilm. The Computer Science holdings are in books, databases, and DVDs. Ancient Studies holdings are just bound journals, videotapes, microfilm, and microfiche. How many possible ways are there to fill in a line?". Both these additional parts clearly refer to the simple combination between material and discipline. This seems to exclude interpretations where the two variables are considered "isolated", i.e. without considering which type of material is coupled with which discipline.
Lastly, this first section of the book cites several times the "product principle", explained as follows: "The number of elements in the Cartesian product of a finite number of finite sets $A×B×...×N$ is the product of their sizes $|A| \cdot |B| \cdot... \cdot |N|$". This is the classical rule of product, a fundamental principle of counting that is described in the book together with other basic counting principles (e.g. the rule of sum, the inclusion-exclusion principle, and the pigeonhole principle), and that hinges on the simple multiplication between two sizes. Accordingly, many other problems in the same section of the book that contains the OP are based on a single multiplication. For instance, few words before the OP, the book reports this other problem: " The Supreme Bruno is any patty-with-a-vegetable burger plus a condiment (choose from Worcestershire sauce, wasabi sauce, or mustard); you can also have cheese, or not. How many Supreme Brunos could be ordered?".
With these considerations in mind, it seems reasonable to hypothesize that the question described in the OP was created to have a very basic solution corresponding to the simplest interpretation, i.e. $15 \cdot 8 =120$ combinations.