Code Sprint

Code Sprint

University

25 Qs

quiz-placeholder

Similar activities

Kuis Pemrograman Dasar

Kuis Pemrograman Dasar

University

20 Qs

Algoritma Pemrograman

Algoritma Pemrograman

University

20 Qs

3D Objects - Terms & Transfomations

3D Objects - Terms & Transfomations

6th Grade - Professional Development

20 Qs

คอมพิวเตอร์และสารสนเทศการงานอาชีพ 1

คอมพิวเตอร์และสารสนเทศการงานอาชีพ 1

University

20 Qs

4-2 final QUIZ in ELEC4

4-2 final QUIZ in ELEC4

University

20 Qs

Digital and Analog transmission

Digital and Analog transmission

University

20 Qs

ICT Unit-2

ICT Unit-2

University

20 Qs

Quiz Harian Gdevelop MPK

Quiz Harian Gdevelop MPK

University

20 Qs

Code Sprint

Code Sprint

Assessment

Quiz

Computers

University

Practice Problem

Hard

Created by

codesprint undefined

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

25 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What will be the output of the following python code?

2
3
4
5

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What will be the output of the following Python code?

6
8
9
11

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

Consider the following python code. What will be the output?

91
84
70
100

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What will be the output of the following code?

1 2 3 4
4 3 2 1
1 3 2 4
4 2 3 1

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

An array A consists of n integers in locations A[0], A[1] ....A[n-1]. It is required to shift the elements of the array cyclically to the left by k places, where 1 <= k <= (n-1). An incomplete algorithm for doing this in linear time, without using another array is given below. Complete the algorithm by filling in the blanks. Assume alt the variables are suitably declared (code is in:C++)

i > min; j!= (n+i)mod n; A[j + k]; temp; i + 1 ;
i < min; j!= (n+i)mod n; A[j + k]; temp; i + 1;
i > min; j!= (n+i+k)mod n; A[(j + k)]; temp; i + 1;
i < min; j!= (n+i-k)mod n; A[(j + k)mod n]; temp; i + 1;

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What is the output of the following Java program?

1190
1650
1740
1880

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

Consider the following HTML, CSS code . Where will the red .box be positioned within the .container?

Centered both vertically and horizontally within the .container
Positioned at the top-left corner of the .container
Positioned at 50% from the top and left, but not centered
Positioned outside of the .container

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?

Discover more resources for Computers