Join WhatsApp Icon IPMAT WhatsApp Group
Instructions

There are four questions on Information-E below. Answer this question based on this information.
Information-E
A security door opens for some badges and not for others. Every badge has three attributes, with permitted values as given below.

image


The door's rule has the following characteristics.
• The rule carries at most one condition per attribute.
• A condition names a single permitted value for that attribute.
• An attribute carrying no condition is unrestricted.
• The door opens only for those badges that satisfy every condition in the rule.
For example, one possible rule is "green and solid", which would open for every green badge with a solid border, of any shape. Another possible rule is "triangle", which would open for every triangular badge, irrespective of its colour and border.
Two badges have been tested with the present rule. The attributes of the badges and the corresponding results are given below.

image
Question 42

This is the first question based on Information-E.
How many rules are possible?

Badge 2 (circle, green, dashed) opens, so each attribute's condition is either absent or matches it, namely circle or none, green or none, dashed or none, giving $$2 \times 2 \times 2 = 8$$ rules. Badge 1 (circle, red, solid) does not open, so the rule must contain green or dashed. This removes the empty rule and the rule "circle" alone, leaving $$8 - 2 = 6$$ rules.

Was this solution helpful?

Get AI Help

Over 8000+ registered students have benefitted from Cracku's IPMAT Course

Crack IPMAT 2026 with Cracku

Ask AI