Answer:
The last line i.e "rotation, then translation " is the correct answer .
Explanation:
Missing information :
In this question some information is missing The triangles are congruent by the SSS and HL. This line is missing in the given question .
The triangles that are the exactly similar sides and the angles.is known as congruent triangles .In the congruent triangle One's three sides are exactly similar in way of measuring to someone else's three sides also each of the three angles has almost the same angle as another.
- In the congruent triangles firstly the reflection will applied then after the translation process is applied in the SSS and HL.
- The other options are incorrect because they are not used for the mapping of RST into AWWX that's why these are incorrect option .
Answer:
a. 255.255.255.0 (class C)
b. 255.255.255.224
Explanation:
Here, we want to give the implied subnet mask of the given classful IPV4 address
We proceed as follows;
Given IPv4 address: 200.200.200.200
Classes
Class A : 0.0.0.0 to 127.255.255.255
Class B: 128.0.0.0 to 191.255.255.255
Class C: 192.0.0.0 to 223.255.255.255
Class D: 224.0.0.0 to 239.255.255.255
so 200.200.200.200 belongs to Class C and it's subnet mask is 255.255.255.0
In CIDR(Classless Inter Domain Routing)
subnet /27 bits means 27 1s and 5 0s. so subnet
i.e 11111111.11111111.11111111.11100000 which in dotted decimal format is 255.255.255.224 .
Answer:
The correct option is D: Control Bus
Explanation:
A control bus is usually used by the Central Processing Unit to communicate with all the devices that are connected or contained within a computer. This connections are usually done via physical connections such as printed circuits or cables. It is also called a Computer bus and helps in coordinating activities between the connected devices.
Answer:
A Red Black Tree is a type of self-balancing(BST) in this tree ,each node is red or black colored. The red black tree meets all the properties of the binary search tree, but some additional properties have been added to a Red Black Tree.
A Red-Black tree's height is O(Logn) where (n is the tree's amount of nodes).
In a red-black tree with black height k
The maximum number of internal nodes is .
The smallest possible number is .