Your network contains four Active Directory forests. Each forest contains an Active Directory
Rights Management Services (AD RMS) root cluster.
All of the users in all of the forests must be able to access protected content from any of the
forests.
You need to identify the minimum number of AD RMS trusts required.
How many trusts should you identify?
A.
3
B.
6
C.
12
D.
16
For example, if you have ten AD RMS domains and all of them should be able to exchange information between each other, there must be (10 × 9) 90 trusts configured to achieve this goal. N*(N-1)
N=4
4*(4-1)=12
i’m not sure if this the minimum or the MAX
http://technet.microsoft.com/en-us/library/dd772648%28v=ws.10%29.aspx
3
0
Im not sure about the maths but my method is,
ADRMS trusts are one way. so 2 trusts per two parties.
i think of the Geometry.
if 3, then i imagine a Traingle and connect all 3 points.
if 4, then i imagine a Square and connect all 4 points (careful cuz have to connect all points)
so on..
1
1
Think of the forests named A, B, C, D. They all must have a trust going to and from each other, so we’ll count them out.
1.a -> b
2.b -> a
3.a -> c
4.c -> a
5.a -> d
6.d -> a
7.b -> c
8.c -> b
9.b -> d
10.d -> b
11.c -> d
12.d -> c
3
0
Quickest method I found (almost the exact same as Zuhiar’s), you have 4 domains that need to connect to each other, so that means each one will have 3 others to connect to.
4 domains x 3 connections each = 12
1
0
This is AWESOME !!
0
0
https://technet.microsoft.com/en-us/library/dd772659%28v=ws.10%29.aspx?f=255&MSPPError=-2147217396
The number of AD RMS trusts required to interact between all AD RMS forests can be defined by using the following formula: N*(N-1).
For example, if you have 4 AD RMS forests and all of them should be allowed to exchange information between each other, then – 12 (4X(4-1)) AD RMS trusts will need to be configured to achieve this.
0
0
To much discussion for counting to 12…
0
0
Agreed MadMilkman. Is this a math test or a technology test
guess when some people run out of fingers to count on the math just becomes too much 😉
Formula is N*(N-1) what’s so difficult. 4 AD forests 4x(4-1) = 4 x 3 = 12
1
0
Microsoft is trying to test the theoretical knowledge of trusts. The bulk of testers are going to think a two-way trust between each site counts as one trust so only 6 trusts are needed. However, a two-way trust counts as two individual, one-way trusts so 12 trusts are needed.
0
0
They are also testing that people read the question and don’t just assume there are 3 forests because there were 3 forests in the brain dump they used lol!
0
0
Like people say there are different ways of working it out.
either nx(n-1) … so here it is 4×3=12
or
1 trusts 2,3,4
2 trusts 1,3,4
3 trusts 1,2,4
4 trusts 1,2,3
Again 12 trusts
0
0
Joe, good explanation. Very clear.
0
0
YEAH, SIMPLE FUCKING MULTIPLICATION
WHY DONT YOU GO RAP ABOUT IT
0
0
@BitterSysAdmin
You sir are mean A hole!
Just because PDIDDY is black doesn’t make him a rapper, chicken eatin, crypt, blood, watermelon eatin, grape soda drinkin, crack smokin, drug pushin, living in his grandma’s garage, not payin child support for 9 kids, livin on welfare and food stamps, bike stealin, looting and robbing, black lives matter or black panther rep, in and out of prison, mayo hatin, can’t swim, kind of guy. That is just stereotyping at its worst. Pdiddy was simply saying, “good job” to Joe.
You should apologize!
0
0