MIND SWEEPER

MIND SWEEPER

Professional Development

50 Qs

quiz-placeholder

Similar activities

Q-700

Q-700

Professional Development

50 Qs

SQL Fundamentals_Amr

SQL Fundamentals_Amr

Professional Development

50 Qs

Exam for Selection of NCC Cadets for 2020-23

Exam for Selection of NCC Cadets for 2020-23

Professional Development

52 Qs

Most Influential People in the World

Most Influential People in the World

4th Grade - Professional Development

45 Qs

The Ultimate Bible Trivia

The Ultimate Bible Trivia

KG - Professional Development

50 Qs

ITIL4_Bigtest#2

ITIL4_Bigtest#2

Professional Development

45 Qs

KUIZ UMUM

KUIZ UMUM

Professional Development

50 Qs

LATIHAN SOAL SELEKSI SISWA BERPRESTASI

LATIHAN SOAL SELEKSI SISWA BERPRESTASI

Professional Development

50 Qs

MIND SWEEPER

MIND SWEEPER

Assessment

Quiz

Education

Professional Development

Practice Problem

Hard

Created by

codemaker2023 codemaker2023

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...

50 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Is Bitwise & and | are unary operators

True

False

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which bitwise operator is suitable for turning off a particular bit in a number?

&& operator

& operator

|| operator

! operator

3.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

If the two strings are identical, then strcmp() function returns

-1

1

0

Yes

4.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

How will you free the allocated memory ?

free(var-name);

remove(var-name);

delete(var-name);

dalloc(var-name);

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

You want subclasses in any package to have access to members of a superclass. Which is the most restrictive access that accomplishes this objective?

Protected

Public

Private

Transistent

6.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

We can add a row using SQL in a database with which of the following?

ADD

Make

create

Add

insert

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

If the array is already sorted, then the running time for merge sort is

O(1)

O(n*log n)

O(n)

O(n^2)

Create a free account and access millions of resources

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

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?