Crowdly

Додати до Chrome

Університети
lms-hcm.fpt.edu.vn
CSD201 - Trương Thị Mỹ Ngọc

CSD201 - Trương Thị Mỹ Ngọc

Шукаєте відповіді та рішення тестів для CSD201 - Trương Thị Mỹ Ngọc? Перегляньте нашу велику колекцію перевірених відповідей для CSD201 - Trương Thị Mỹ Ngọc в lms-hcm.fpt.edu.vn.

Отримайте миттєвий доступ до точних відповідей та детальних пояснень для питань вашого курсу. Наша платформа, створена спільнотою, допомагає студентам досягати успіху!

Given a raw message 'BBBUUUUBBBUUBBBBBUU' (without single quote). Run the run-length encoding algorithm for that message, what is the output?

Переглянути це питання

Which the sorting technique always makes recursive calls to sort pieces that are about half the size of the original array?

Переглянути це питання

In your benchmarking of the DictionaryBST structure, you probably found that the time to find words did not significantly increase as the Dictionary got larger. Which of the following is the most likely reason for this behavior?

log( n ) is sufficiently small and grows sufficiently slowly that other factors (e.g. memory use) had a bigger effect on the running time than the size to find the word in the dictionary.

100%

The running time to find an element in a balanced BST is O(1) so we would not expect the running time to get larger as the dictionary got bigger.

We were measuring the best case performance of the dictionary, which does not change as the dictionary size grows.

Переглянути це питання

The best technique when the amount of data is not well known is ……

Переглянути це питання

Does a higher or lower Flesch Index Score indicate simpler text?

The higher the Flesch Index Score, the simpler the text and the easier it is to read.

100%

The lower the Flesch Index Score, the simpler the text and the easier it is to read.

Переглянути це питання

Which of the following Sorting algorithms have complexity of O( n ) in best case ?

Переглянути це питання

Quick sort

algorithm is an example of

Improved binary search

Divide and conquer

Dynamic Programming

Greedy approach

Переглянути це питання

Apply Kruskal's Minimum Spanning Tree (MST) to the following graph:

Select false statement:

bc is not added to MST because it forms a cycle with ac and ac.

cf is the latest edge added to MST.

100%

The algorithm have consideration to edges be, de and cd but does not add them to MST.

Переглянути це питання

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?