Yes–no question in the context of "Binomial distribution"

An interrogative word or question word is a function word used to ask a question, such as what, which, when, where, who, whom, whose, why, whether and how. They are sometimes called wh-words, because in English most of them start with wh- (compare Five Ws). Most may be used in both direct (Where is he going?) and in indirect questions (I wonder where he is going). In English and various other languages the same forms are also used as relative pronouns in certain relative clauses (The country where he was born) and certain adverb clauses (I go where he goes). It can also be used as a modal, since question words are more likely to appear in modal sentences, like (Why was he walking?)

A particular type of interrogative word is the interrogative particle, which serves to convert a statement into a yes–no question, without having any other meaning. Examples include est-ce que in French, ли li in Russian, czy in Polish, чи chy in Ukrainian, ĉu in Esperanto, āyā آیا in Persian, কি ki in Bengali, 嗎/吗 ma in Mandarin Chinese, mı/mi/mu/mü in Turkish, pa in Ladin, か ka in Japanese, 까 kka in Korean, ko/kö in Finnish, Kasi (or "Ka" for short) in Tumbuka, tat in Catalan, (да) ли (da) li in Serbo-Croatian and al and ote in Basque. "Is it true that..." and "... right?" would be a similar construct in English. Such particles contrast with other interrogative words, which form what are called wh-questions rather than yes–no questions.

In computability theory and computational complexity theory, a decision problem is a computational problem that can be posed as a yes–no question on a set of input values. An example of a decision problem is deciding whether a given natural number is prime. Another example is the problem, "given two numbers x and y, does x evenly divide y?"

A decision procedure for a decision problem is an algorithmic method that answers the yes-no question on all inputs, and a decision problem is called decidable if there is a decision procedure for it. For example, the decision problem "given two numbers x and y, does x evenly divide y?" is decidable since there is a decision procedure called long division that gives the steps for determining whether x evenly divides y and the correct answer, YES or NO, accordingly. Some of the most important problems in mathematics are undecidable, e.g. the halting problem.