Tech-it-out 3.0

Tech-it-out 3.0

University

30 Qs

quiz-placeholder

Similar activities

Programming Fundamentals Quiz

Programming Fundamentals Quiz

University

28 Qs

LATIHAN SOAL INFORMATIKA KLS 7

LATIHAN SOAL INFORMATIKA KLS 7

7th Grade - University

25 Qs

Form 2 - Information Technology Quiz

Form 2 - Information Technology Quiz

8th Grade - University

25 Qs

Routing Test So Far

Routing Test So Far

University

25 Qs

GROUP2 - QUIZ

GROUP2 - QUIZ

University

25 Qs

Using the Developer Tab in Word

Using the Developer Tab in Word

10th Grade - University

25 Qs

Digital Asset Review

Digital Asset Review

10th Grade - University

26 Qs

Computer Parts and Devices Quiz

Computer Parts and Devices Quiz

2nd Grade - University

27 Qs

Tech-it-out 3.0

Tech-it-out 3.0

Assessment

Quiz

Information Technology (IT)

University

Practice Problem

Hard

Created by

GeeksForGeeks VIIT

Used 3+ times

FREE Resource

AI

Enhance your content in a minute

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

30 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the time complexity of searching an element in a hash table (on average)?

O(1)

O(log n)

O(n)

O(n log n)

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which data structure is best suited for implementing an undo operation?

Queue

Stack

Priority Queue

Hash Map

3.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

If a queue is implemented using an array, how can we make it circular to use all positions?

By shifting all elements on each dequeue

By using a circular linked list

By using modulo arithmetic for front and rear

By keeping one extra space always empty

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following sorting algorithms is in-place and unstable?

Merge Sort

Insertion Sort

Quick Sort

Bubble Sort

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

The number of edges in a complete undirected graph with n vertices is

n(n + 1)/2

n(n − 1)/2

n − 1

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the auxiliary space complexity of recursive binary search?

O(1)

O(n)

O(log n)

O(n log n)

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which traversal method uses a queue in a binary tree?

Inorder

Preorder

Postorder

Level Order

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?