Crowdly
Add to Chrome
CSD201 - Trương Thị Mỹ Ngọc
Looking for CSD201 - Trương Thị Mỹ Ngọc test answers and solutions? Browse our comprehensive collection of verified answers for CSD201 - Trương Thị Mỹ Ngọc at lms-hcm.fpt.edu.vn.
Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!
Select incorrect statement about restrictions need to be imposed on the prospective codes:
0%
0%
0%
0%
View this question
Which of the following data structures are the most suites for handling the minimum (maximum) weighted distances?
0%
0%
0%
0%
View this question
You want to place 1000 elements in a hash table using linear probing, and you would like an average numbers of trials for successful search two elements. How big does the array of hash table need to be?
0%
0%
100%
0%
View this question
Given codeword set:
a = 11, b = 101, f = 100, e = 0
Encoded string “1110011000101” will be decoded to _______
0%
0%
100%
0%
View this question
Which of the following algorithms in graphs can be implemented by extending Depth First Search algorithm?
0%
100%
0%
0%
View this question
Use Dijkstra’s algorithm to find shortest paths from vertex A to others in the following graph:
Which vertex is chosen in iteration 4 of the algorithm?
0%
0%
100%
0%
View this question
Select correct statement:
0%
0%
0%
0%
View this question
Which of the following data structures does not suitable for implementing Huffman algorithm?
0%
100%
0%
0%
View this question
Encoding the string "aaabbccddddddeee" with Huffman. Please indicate the size of the output string?
0%
0%
0%
0%
View this question
Suppose that you place 180 elements in a hash table with an array size of 200. What is the load factor?
0%
100%
0%
0%
View this question