Search Header Logo

SDA 1: Complexity, sorting and searching algorithms

Authored by Dimitar Seykov

Mathematics, Computers, Science

University

Used 12+ times

SDA 1: Complexity, sorting and searching algorithms
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

14 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Test question, select "Blue"!

Blue

Green

Yellow

Red

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Какво е сложност на алгоритъм?

Брой стъпки

Функция на нарастването

Колко е труден за имплементиране

Времето за изпълнение на програмата, измерено в секунди

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Коя от следните двойки е сгрешена?

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Кой от полиномите има асимптотично най-малка сложност? ("C" е константа)

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

True

False

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Кой от изброените алгоритми за сравнение не разчита на директни сравнения?

Merge Sort

Insertion Sort

Quick Sort

Counting Sort

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Кой от алгоритмите за сортиране НЕ Е стабилен?

Merge Sort

Bubble Sort

Quick Sort

Selection Sort

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Microsoft

Continue with Microsoft

or continue with

Facebook

Facebook

Apple

Apple

Others

Others

Already have an account?