C++ Finall!!!!

C++ Finall!!!!

University

15 Qs

quiz-placeholder

Similar activities

02 - Graph Algorithm

02 - Graph Algorithm

University

12 Qs

BFS and DFS - Data Structures

BFS and DFS - Data Structures

University

15 Qs

DSA Quiz 4 Set 1

DSA Quiz 4 Set 1

University

10 Qs

Knowledge Knockout[Quiz Round](2nd-4th years)

Knowledge Knockout[Quiz Round](2nd-4th years)

University

15 Qs

CSE440-002-Uninformed Search

CSE440-002-Uninformed Search

University

10 Qs

AI & Expert systems-Unit 1

AI & Expert systems-Unit 1

University

10 Qs

Kuis Susulan ASD

Kuis Susulan ASD

University

10 Qs

Artificial Intelligence 1

Artificial Intelligence 1

University

10 Qs

C++ Finall!!!!

C++ Finall!!!!

Assessment

Quiz

Computers

University

Hard

Created by

Faiz Maulana

Used 1+ times

FREE Resource

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

45 sec • 5 pts

Media Image

Fungsi rekursif Tersebut memiliki kekurangan utama apa?

Salah base case

Stack overflow

Waktu eksekusi eksponensial

Tidak bisa di-compile

2.

MULTIPLE CHOICE QUESTION

30 sec • 5 pts

Manakah pernyataan tentang function overloading yang benar?

Hanya bisa dilakukan jika return type berbeda

Hanya parameter yang membedakan

Nama fungsi harus berbeda

Tidak bisa dilakukan dalam C++

3.

MULTIPLE CHOICE QUESTION

45 sec • 5 pts

Media Image

Output dari kode tersebut

1

2

3

Error

4.

MULTIPLE CHOICE QUESTION

45 sec • 5 pts

Media Image

Fungsi berikut memiliki masalah besar pada...?

Return type tidak sesuai

Sintaks salah

Tidak ada masalah

Alamat array lokal dikembalikan

5.

MULTIPLE CHOICE QUESTION

30 sec • 5 pts

Bagaimana kompleksitas waktu pencarian elemen dalam unordered_map di C++ (rata-rata kasus)?

O(n)

O(log n)

O(1)

O(n log n)

6.

MULTIPLE CHOICE QUESTION

30 sec • 5 pts

Dalam implementasi linked list, operasi penghapusan di tengah list memerlukan...?

Pointer ke elemen akhir

Alamat node sebelumnya

Alamat node terakhir

Iterator dari awal

7.

MULTIPLE CHOICE QUESTION

30 sec • 5 pts

Manakah contoh kasus klasik DP berbasis tabulasi?

Tower of Hanoi

LCS (Longest Common Subsequence)

DFS traversal

Sorting

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?