A professor has 24 text books on computer science and is concerned about their coverage of the topics (P) compilers, (Q) data structures and (R) operating systems. The following data gives the number of books that contain material on these topics: $n\left(P\right)=8$, $n\left(Q\right)=13$, $n\left(R\right)=13$, $n\left(P\cap Q\right)=3$, $n\left(P\cap R\right)=3$, $n\left(Q\cap R\right)=6$, $n\left(P\cap Q\cap R\right)=2$, where $n\left(X\right)$ is the cardinality of the set $X$. Then the number of text books that have no material on compilers is

Set Theory — Preparation

This question tests your understanding of Set Theory, a key topic in the Quantitative Aptitude section. The detailed solution above uses a step-by-step approach to show the reasoning, and where available, a shortcut that helps you solve similar questions in under 90 seconds during the actual exam.

A set is a well-defined collection of objects. Set theory covers types of sets (finite, infinite, empty, singleton, equal and equivalent sets), subsets and power sets, and operations on sets such as union, intersection, difference and complement. It also covers De Morgan's laws and the cardinality formula n(A union B) = n(A) + n(B) - n(A intersection B). In entrance exams, the most common questions are word problems about people who like one, two or three activities, solved with Venn diagrams and the cardinality formula. Questions also ask for the number of subsets of a set (2^n for a set with n elements) and test set notation and properties. Practise the set theory questions below. Each comes with a step-by-step solution and a Venn diagram where it helps.