Parauga meklēšana

Parauga meklēšana

University

5 Qs

quiz-placeholder

Similar activities

C++ klases(2)

C++ klases(2)

University

8 Qs

UI design

UI design

University

10 Qs

Session 4

Session 4

University

6 Qs

DB Environment

DB Environment

University

10 Qs

Meklēšanas algoritmi (1)

Meklēšanas algoritmi (1)

University

10 Qs

Rastrgrafika un vektorgrafika

Rastrgrafika un vektorgrafika

7th Grade - University

10 Qs

UAS AlStrukDat

UAS AlStrukDat

University

10 Qs

Datorgrafikas tests 4. klasei PD_3

Datorgrafikas tests 4. klasei PD_3

4th Grade - University

10 Qs

Parauga meklēšana

Parauga meklēšana

Assessment

Quiz

Computers

University

Hard

Created by

Vija Vagale

Used 6+ times

FREE Resource

5 questions

Show all answers

1.

MULTIPLE SELECT QUESTION

45 sec • 1 pt

Parauga meklēšanai tekstā izmanto algoritmus

Algorithms are used to search for a pattern in the text

Šella

Shell

Burbulīti

Bubble

Naive

Kabin-Karp

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Kurā algoritmā meklējamā parauga simboli tiek salīdzināti ar dotā teksta simboliem no parauga beigām?

Which algorithm compares the symbols of the pattern to be searched with the symbols of the given text from the end of the pattern?

Naive

Knuth-Morris-Pratt

Rabin-Karp

Boyer-Morre

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Kurā algoritmā meklējamajam paraugam un dotā teksta daļai tiek piekartoti skaitļi un tad šie skaitļi tiek salīdzināti savā starpā.

In which algorithm, numbers are calculated for the sample to be searched and to the given text part, and then these numbers are compared with each other.

Naive

Knuth-Morris-Pratt

Rabin-Karp

Boyer-Morre

4.

MULTIPLE SELECT QUESTION

30 sec • 1 pt

Kuros algoritmos tiek izmantotas nobīžu funkcijas (par cik simboliem var pārbīdīt)?

Which algorithms use shift functions (how many symbols can be shifted)?

Naive

Knuth-Morris-Pratt

Rabin-Karp

Boyer-Moore

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Kurā algoritmā tiek izmantots algoritms "Naiva jeb tiešā meklēšana"?

Which algorithm uses the "Naive or direct search" algorithm?

Knuth-Morris-Pratt

Rabin-Karp

Boyer-Moore