Quiz on Recursion and Algorithms

Quiz on Recursion and Algorithms

University

15 Qs

quiz-placeholder

Similar activities

Quiz de Programação em C

Quiz de Programação em C

University

17 Qs

DSA (Quiz 4) - Trees

DSA (Quiz 4) - Trees

University

20 Qs

QUIZ Oficina de introdução a BD

QUIZ Oficina de introdução a BD

University

16 Qs

Quiz Kelas 7

Quiz Kelas 7

7th Grade - University

15 Qs

Buổi 4

Buổi 4

University

13 Qs

Quizzi bài 29 Tin học 10

Quizzi bài 29 Tin học 10

10th Grade - University

10 Qs

Quiz Pemrograman Python

Quiz Pemrograman Python

10th Grade - University

15 Qs

Quick Sort

Quick Sort

University

10 Qs

Quiz on Recursion and Algorithms

Quiz on Recursion and Algorithms

Assessment

Quiz

Information Technology (IT)

University

Easy

Created by

adi wibowo

Used 4+ times

FREE Resource

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Apa itu rekursi?

Sebuah cara untuk mengoptimalkan penggunaan memori

Proses mendefinisikan objek dalam istilah dirinya sendiri

Metode pengurutan data

Jenis algoritma iteratif

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Apa dua bagian dari fungsi rekursif?

Input dan Output

Dasar dan Rekurensi

Fungsi dan Variabel

Loop dan Kondisi

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Apa kompleksitas relasi rekurensi untuk masalah Tower of Hanoi?

T(n) = 2T(n-1) + 1

T(n) = T(n-1) + T(n-2)

T(n) = T(n-1) * 2

T(n) = T(n-1) + 1

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Mega sedang mencoba menghitung faktorial dari sebuah angka menggunakan algoritma sederhana. Apa kompleksitas waktu dari algoritma faktorial yang digunakan Mega?

O(n!)

O(n^2)

O(1)

O(n)

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Apa yang dianalisis oleh Teorema Master?

Relasi rekursi

Algoritma pengurutan

Struktur data

Algoritma graf

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Apa base case untuk urutan Fibonacci dalam definisi rekursif?

F(0) = 1 dan F(1) = 0

F(0) = 1 dan F(1) = 1

F(0) = 0 dan F(1) = 2

F(0) = 0 dan F(1) = 1

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the complexity of the Fibonacci algorithm using recursion?

O(n^2)

O(2^n)

O(n log n)

O(n)

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?