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!
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
Given a raw message 'BBBUUUUBBBUUBBBBBUU' (without single quote). Run the run-length encoding algorithm for that message, what is the output?
0%
0%
0%
0%
View this question
Which the sorting technique always makes recursive calls to sort pieces that are about half the size of the original array?
0%
0%
0%
100%
View this question
The best technique when the amount of data is not well known is ……
0%
0%
0%
0%
View this question
Does a higher or lower Flesch Index Score indicate simpler text?
100%
0%
View this question
Which of the following Sorting algorithms have complexity of O( n ) in best case ?
0%
0%
0%
100%
View this question
Quick sort algorithm is an example of
0%
0%
0%
0%
View this question
Apply Kruskal's Minimum Spanning Tree (MST) to the following graph:
Select false statement:
0%
100%
0%
View this question
The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table of length 10 using open addressing with hash function h(k) = k mod 10 and linear probing. What is the resultant hash table?
0%
0%
0%
0%
View this question
Which of the following algorithms can be used to detect cycle of a graph?
0%
0%
0%
0%
View this question