TECHTRIX2025 BUGHUNT SET3

TECHTRIX2025 BUGHUNT SET3

University

20 Qs

quiz-placeholder

Similar activities

Teoria General de Sistemas Repaso

Teoria General de Sistemas Repaso

University

16 Qs

INTRODUCCION WORD OFIMATICA I

INTRODUCCION WORD OFIMATICA I

University

20 Qs

Quiz 1 sistem instalasi pemadam kebakaran

Quiz 1 sistem instalasi pemadam kebakaran

University

15 Qs

Bases moleculares y cromosómicas de la herencia

Bases moleculares y cromosómicas de la herencia

University

20 Qs

Questionnaire Design

Questionnaire Design

University

17 Qs

QUIZ ON INDEPENDANCEDAY

QUIZ ON INDEPENDANCEDAY

KG - University

15 Qs

Anong kwentong Raikan mo?

Anong kwentong Raikan mo?

KG - Professional Development

16 Qs

Batboy

Batboy

KG - University

15 Qs

TECHTRIX2025 BUGHUNT SET3

TECHTRIX2025 BUGHUNT SET3

Assessment

Quiz

Other

University

Practice Problem

Medium

Created by

Sarmistha Moharer

Used 1+ times

FREE Resource

AI

Enhance your content in a minute

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

20 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What will be the output of the following code in Python? x = 5 y = 2 print(x ** y)

10

25

7

52

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following is the correct way to declare a constant in Java?

const int x = 10;

final int x = 10;

static int x = 10;

int const x = 10;

3.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Find the missing number: 3, 6, 12, 24, __?

36

48

30

42

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

In a certain code, “APPLE” is written as “BQQMF”. How is “ORANGE” written?

PSBOHF

PSBOHE

PSBOHG

PSBOHH

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

In programming, what does the term "recursion" refer to?

A loop that runs indefinitely

A function that calls itself

A type of data structure

A method to optimize code

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which data structure is used to implement a FIFO (First-In-First-Out) queue?

Stack

Linked List

Array

Priority Queue

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the time complexity of searching for an element in a balanced binary search tree (BST) with `n` nodes?

O(1)

O(log n)

O(n)

O(n log 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?