Building on the knowledge gained in chapter 1, this chapter explains the next form of black-box testing, based on the boundary values of each equivalence partition.

Aprenderá vocabulario relacionado con la escritura académica; anticipará e inferirá el tema de la lectura sobre los escritores optimistas; generará ideas mediante torbellino de ideas (brainstorming); aprenderá a desarrollar la estructura básica de un párrafo y de todo el texto íntegro; aprenderá a obtener información de artículos de periódicos y cómo citar las fuentes que consulte; aprenderá a preparar el borrador de un párrafo de desarrollo, introductorio y de cierre o conclusión; repasará el funcionamiento básico de la oración simple: el predicado; aprenderá a segmentar oraciones mediante la técnica de combinación de oraciones; pondrá en práctica el desarrollo de textos expositivos.

This chapter is about the geometric structure of equilibria in two-player games in strategic form. It shows how to quickly identify equilibria with qualitative “best-response diagrams”.

This chapter provides a more detailed description of the background of black-box and white-box testing. it then discusses a number of more advanced issues, covering testing with: more complex data types and data structures, more complex specifications, and more complex code. The chapter ends with an overview of some more advanced forms of white-box testing: condition coverage, decision coverage, decision-condition coverage, multiple condition coverage, and modified condition/decision coverage.

This chapter considers game trees, the second main way for defining a non-cooperative game in addition to the strategic form. In a game tree, players move sequentially and (in the case of perfect information studied in this chapter) are aware of the previous moves of the other players. In contrast, in a strategic-form game players move simultaneously. In this “dynamic” setting, a play means a specific run of the game given by a sequence of actions of the players.

Test automation is used to make software testing must be reliable, fast, and repeatable. This chapter usesan exemplar test framework (TestNG) to demonstrate typical automation features. The handling of timeouts and exceptiomns is examined. A mode advanced look at inheritance testing is presented. The chapter ends with a further look at examining different types of application: web-based, desktop, and mobile.

Aprenderá vocabulario relacionado con el consumo o comercio electrónico; anticipará e inferirá el tema del consumo tanto tradicional como digital; aprenderá a trabajar con mapas de aspectos comunes (diagrama de Venn); aprenderá a desarrollar la estructura de un texto expositivo de comparación y contraste; aprenderá cómo integrar fuentes originales dentro de un texto; aprenderá a preparar el borrador de un párrafo introductorio con tesis, otro de cierre y otro de conclusión, que integran un texto expositivo de comparación y contraste sobre el tema del consumo digital; repasará el funcionamiento básico de la oración compuesta; aprenderá a combinar oraciones compuestas mediante la técnica de combinación de oraciones; pondrá en práctica el desarrollo de textos expositivos de comparación y contraste.

Combinatorial game theory is about perfect-information two-player games, such as Checkers, Go, Chess, or Nim, which are analyzed using their rules. It tries to answer who will win in a game position (assuming optimal play on both sides), and to quantify who is ahead and by how much. The topic has a rich mathematical theory that relates to discrete mathematics, algebra, and (not touched here) computational complexity, and highly original ideas specific to these games.

As an introduction to white-box testing, the first technique presented shows how to identify lines of code that have not been executed during testing, and how to develop additional tests to ensure that they produce the correct results when executed.