Answer:
11. There are four main alignments: left, right, center, and justified
12. Symmetrical balance occurs when equal weights are on equal sides of a composition, balanced around a fulcrum or axis in the center.
13. Asymmetrical balance results from unequal visual weight on each side of the composition.
14. White space
15. Most modern TVs are 16:9, which causes letterboxing when viewing 21:9 content, and pillarboxing when viewing 4:3 content such as older films or TV broadcasts, unless the content is cropped or stretched to fill the entire display. The Napoléon (1927 film) was released in 4:1 aspect ratio.
16. ??? im sorry idk
17. The Rule of Thirds is the process of dividing an image into thirds, using two horizontal and two vertical lines.
Explanation:
Answer:
False
Explanation:
Diversification involves increasing the reach of a particular software to meet the needs of different people. When a particular software is developed to provide multiple services for different individuals, it can be categorized as diversification but when the software is improved upon to meet the same users within a specific domain, the software can not be said to be diverse.
From our scenario, the operating system software is improved upon to handle the continuous changes in computer, this does not make the operating system software diverse, it just becomes better.
Answer:
Question is incomplete.
Assuming the below info to complete the question
You have a collection of n lockboxes and m gold keys. Each key unlocks at most one box. Without a matching key, the only way to open a box is to smash it with a hammer. Your baby brother has locked all your keys inside the boxes! Luckily, you know which keys (if any) are inside each box.
Detailed answer is written in explanation field.
Explanation:
We have to find the reachability using the directed graph G = (V, E)
In this V are boxes are considered to be non empty and it may contain key.
Edges E will have keys .
G will have directed edge b1b2 if in-case box b1 will have key to box b2 and box b1 contains one key in it.
Suppose if a key opens empty box or doesn’t contain useful key means can’t open anything , then it doesn’t belongs to any edge.
Now, If baby brother has chosen box B, then we have to estimate for other boxes reachability from B in Graph G.
If and only if all other boxes have directed path from box B then just by smashing box B we can get the key to box b1 till last box and we can unlock those.
After first search from B we can start marking all other vertex of graph G.
So algorithm will be O ( V +E ) = O (n+m) time.
I have annotated the errors in the picture.
<em />
<em>Hope this helps :)</em>
