MIND SWEEPER

MIND SWEEPER

Professional Development

50 Qs

quiz-placeholder

Similar activities

Steering System C3 vol 2

Steering System C3 vol 2

University - Professional Development

50 Qs

Software Engineering Overview By Dr Sinthia White

Software Engineering Overview By Dr Sinthia White

Professional Development

47 Qs

OHS Staff Induction

OHS Staff Induction

Professional Development

54 Qs

VVM- C. V. Raman

VVM- C. V. Raman

6th Grade - Professional Development

46 Qs

Advance Studies in English Education

Advance Studies in English Education

Professional Development

50 Qs

Summer TTACSCOL Quiz Part A

Summer TTACSCOL Quiz Part A

Professional Development

50 Qs

Health Support Services Final Review

Health Support Services Final Review

9th Grade - Professional Development

55 Qs

Epidemics

Epidemics

Professional Development

50 Qs

MIND SWEEPER

MIND SWEEPER

Assessment

Quiz

Education

Professional Development

Hard

Created by

codemaker2023 codemaker2023

Used 1+ times

FREE Resource

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
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?