hurry up pleasee C) Itemset 12, Section Two. True/ False Problem Set (1+10-10%)

Question

hurry up pleasee

C) Itemset 12, Section Two. True/ False Problem Set (1+10-10%) For each question, please read the statement and decide whether it is true or J. Ifit is wrong, with false. Jfi is te, mark it with mark it with X.Write your answer on the answer sheet. 10 1) 17 is a prime number. 2) Huffiman encoding is a kind of fixed-length encoding. 3) O(nlogn) is the lower bound for searching. 4) The brute-force approach for traveling salesman problem takes O(n!) time. 5) The multiplication order of matrix makes no difference in the running tim 6) Dijkstra's algorthm is able to solve the problem of shortest paths in the presence of ne ?) The product of two complex numbers can be done with no less than four rea e. ) Some prime numbers can't pass primality test )For any graph, the Depth-first search and Breadth-first search results will be the sin ) The two nodes with the biggest frequencies must be at the bottom of the Hufman will be the same. tree.

Explanation / Answer

Answer is as follows :

1) 17 is prime number because it is only divisible by 1 and 17 itself.

So statement is True.

2) Huffman coding is of Variable length encoding.

So statement is False.

3) O(nlogn) is not lower bound of searchinbg instead it is lower bound of sorting

So statement is False

4) The brute force in Travelling salesman problem takes O(n!),

So Statement is True

5) The different multplication order of matrix makes difference between running time.

So statement is False

6) Dijkstra's Algorithm can't able to solve -ve weight edges.

So statement is False

7) No product of two complex numbers can't be done with less than four real number multiplications.

So statement is False

8) Some prime numbers can't passes primality test,such numbers are known as pseudoprime

So the statement is True.

9) No the result of DFS and BFS can't be same.

So the statement is False

10) No these are on the top of huffman tree.

So the statement is False

if there is any query please ask in comments...

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.