ITCC104: FINAL EXAMINATION

ITCC104: FINAL EXAMINATION

University

76 Qs

quiz-placeholder

Similar activities

Summary LITE WEEK 1-5 REVIEWER

Summary LITE WEEK 1-5 REVIEWER

University

80 Qs

GEC Summative Test

GEC Summative Test

University

80 Qs

Word Tip

Word Tip

University

74 Qs

Linux and macOS Quiz

Linux and macOS Quiz

University

74 Qs

Kiến thức về Hệ thống Thông tin

Kiến thức về Hệ thống Thông tin

University

80 Qs

Cuestionario sobre Eventos

Cuestionario sobre Eventos

University

72 Qs

Information Systems Fundamentals Practice Questions 1

Information Systems Fundamentals Practice Questions 1

University

78 Qs

Introducción al Módulo y Conceptos Básicos de Excel

Introducción al Módulo y Conceptos Básicos de Excel

University

71 Qs

ITCC104: FINAL EXAMINATION

ITCC104: FINAL EXAMINATION

Assessment

Quiz

Information Technology (IT)

University

Practice Problem

Medium

Created by

ZPPSU VLs

Used 5+ times

FREE Resource

AI

Enhance your content in a minute

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

76 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Why is Bubble Sort called “Bubble” Sort?

It uses a heap-like structure.

It divides the array in half repeatedly.

Larger values the top as they swap

It selects the minimum value and moves it to the front.

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What makes Insertion Sort efficient for nearly sorted arrays?

It always runs in O(n²) time regardless of input.

It uses a binary tree to store values.

It performs fewer comparisons and shifts when data is nearly sorted

It divides the array using pivot elements.

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How does Selection Sort differ from Bubble Sort in process?

Bubble Sort selects the smallest item directly.

Selection Sort finds the smallest and swaps it once per pass

Bubble Sort only works on even-sized arrays.
d. Selection Sort only works with strings.

Selection Sort only works with strings.

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What does the divide-and-conquer approach mean in Merge Sort?

It swaps values from left to right.

It places maximum values at the end.

It breaks the array into parts, sorts them, and merges

It deletes half of the data in each step.

5.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Which characteristic best explains why Heap Sort is not a stable algorithm?

The rearrangement in heap structure changes equal elements' order

It merges elements too quickly.

It sorts elements without comparison.

It adds new values during the sorting process.

6.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

How does Quick Sort choose where to divide the list?

Based on the largest value in the array

It picks a pivot and partitions around it

It uses the mean of the array

It randomly swaps elements

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In what situation would Merge Sort be preferred over Quick Sort?

When the data is small

When stability is not important

When consistent performance is needed in worst-case scenarios

When memory usage is a major concern

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?