Answer:
Examples of Fact-finding techniques includes:
-
Prototyping
-
Questionnaires
- Research and sites visit
-
Interviews
Explanation:
It is important to note that a database system is a tool that allows users to define, create, maintain, and control access to a collection of logically related data and description of these data, designed to meet the information needs of an organization.
<u>Prototyping
</u>
<em>Advantage:</em> enables testing and understanding of the system in advance before final implementation of solution, while requiring less time for research.
<em>Disadvantage:</em> Training and Development cost consumes resources.
<u>Research and site visit </u>
<em>Advantage :</em> better time management if the problem has been researched upon before.
<em>Disadvantage:</em> appropriate permission is often needed before using research materials.
<u> Questionnaires
</u>
<em>Advantage: </em>This technique is not expensive, and responses can be calculated and analysed quickly.
<em>Disadvantage:</em> There may be Incomplete answers received from users and body language of user cannot be observed.
<u>Interviews</u>
<em>Advantage:</em> The body language of interviewees is been perceived.
<em>
Disadvantage: </em>Interviewing is time consuming and costly.
Answer:
$2.40
Explanation:
the unit electricity bill is kilo watt hour.
The 60-watt light bulb has a 400 hour life expectency means it will consume
60×400/1000 = 24 KWh units of electricity. Let us suppose each unit of electricity costs is 10 cents.
Then 24×10 = 240 cents = $2.40
Answer:
Spoofing
Explanation:
Spoofing that occurs when an intruder computer fools network into believing its IP address is associated with trusted source
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 
.
