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.

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

What is the tightest Big-O running time to calculate the Flesch readability score for the BasicDocument class, where n is the length of the document?

O(n^2)

O(n^3)

O( n )

O(1)

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

Which of the following Sorting algorithms use Divide and Conquer strategy?

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

Select incorrect statement about restrictions need to be imposed on the prospective codes:

Each codeword may be corresponds to one or many symbols.

There should not be any unused short codewords either as stand-alone encodings or as prefixes for longer codewords.

The length of the codeword for a given symbol A should not exceed the length of the codeword of a less probable symbol B.

Decoding should not require any look ahead.

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

Consider the list of eight integers below: 6, 4, 9, 10, 8, 3, 7, 5

What is the list after it has just been partitioned by the first step of quicksort and a pivot value is chosen as the first element of the list? (sorting from smallest to largest). Assume that selecting largest element of the array is ignored.

3, 4, 6, 5, 8, 10, 7, 9

3, 4, 5, 6, 8, 10, 7, 9

3, 4, 5, 6, 7, 8, 10, 9

3, 4, 5, 6, 8, 7, 9, 10

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

Which of the following algorithms in graphs can be implemented by extending Depth First Search algorithm?

All of the others.

Cycle detection.

100%

The Chinese Postman Tour

Finding the shortest path (Dijkstra algorithm)

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

Select correct statement:

The bubble sort always ends up comparing every item with every other item.

A copy is three times as fast as a swap.

In a particular sorting situation, if swaps take much longer than comparisons, the selection sort is about twice as fast as the bubble sort.

If there are N items, the bubble sort makes exactly N*N comparisons.

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

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?

100%

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

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.

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

Which of the following data structures does not suitable for implementing Huffman algorithm?

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

Encoding the string "aaabbccddddddeee" with Huffman. Please indicate the size of the output string?