If tan A + cot A = 4, find the value of tan^2A + cot^2A
If tan A + cot A = 4, find the value of tan^2A + cot^2A
If tan A + cot A = 4, find the value of tan^2A + cot^2A
If a relation is in BCNF, then it is also in
Akilesh Kharvi ? Dec 8 '2016 at 22:17
Answer:3 NF
Explanation:
Normalization is a process that “improves” a database design by generating relations that are of higher normal forms.
there are four normal form
->1 NF
->2 NF
->3 NF
->BCNF
The production line of a chip manufacturing unit wants to simulate the probability of a chip being manufactured defective. Common sense says that the probability of a chip being defective does not depend on whether or not the previous chip was defective. Hence. the probability distribution. appropriate for the situation. is l
Akilesh Kharvi ? Dec 8 '2016 at 22:15
Answer: binomial
Explanation:
probability of a chip being defective does not depend on whether or not the previous chip was defective.
the individual trials are independent of each other so it is binomial distribution
For the Binomial model to be
applied the following four criteria must be satisfied
• the trial is carried out a fixed number of times n.
• the outcomes of each trial can be classified into two ‘types’ conveniently named ‘success’ or ‘failure’.
• the probability p of success remains constant for each trial.
• the individual trials are independent of each other.
The data structure useful for the breadth first search of a graph is
Akilesh Kharvi ? Dec 8 '2016 at 22:11
Answer: queue
Explanation:
BFS starts visiting vertices of a graph at an arbitrary vertex by marking it as
visited.
• It visits graph’s vertices by across to all the neighbors of the last visited vertex
• Instead of a stack, BFS uses a queue
Merge sort uses
Akilesh Kharvi ? Dec 8 '2016 at 22:9
Answer: divide and conquer methodology
Explanation:
In computer science, merge sort (also commonly spelled mergesort) is an O(n log n) comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Mergesort is a divide and conquer algorithm that was invented by John von Neumann in 1945.
Reference: https://en.wikipedia.org/wiki/Merge_sort