Quiz on Recursion and Algorithms

Quiz on Recursion and Algorithms

University

15 Qs

quiz-placeholder

Similar activities

Quiz sobre Integração de Sistemas de Informação

Quiz sobre Integração de Sistemas de Informação

University

15 Qs

Web Application - PHP Repetition

Web Application - PHP Repetition

University

15 Qs

QUiS Arsikom 2

QUiS Arsikom 2

University

10 Qs

ICDL K4_ Xử lý văn bản P1_5*

ICDL K4_ Xử lý văn bản P1_5*

5th Grade - University

16 Qs

Mid Exam

Mid Exam

12th Grade - University

20 Qs

Tin 9 Bài 8. Hàm SUMIF

Tin 9 Bài 8. Hàm SUMIF

9th Grade - University

10 Qs

FINALS summative test in TRENDS

FINALS summative test in TRENDS

12th Grade - University

20 Qs

Quis SIG

Quis SIG

University

20 Qs

Quiz on Recursion and Algorithms

Quiz on Recursion and Algorithms

Assessment

Quiz

Information Technology (IT)

University

Practice Problem

Easy

Created by

adi wibowo

Used 4+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

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)

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

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?