Microsoft 98-380 Introduction to Programming Using Block-Based Languages (Touch Develop) 02 31Oct2024 - Practice Quiz

Study path

The free lane is only the front row

Keep the free practice test in view while the left rail shows everything else waiting behind it.

Free practice for Microsoft 98-380 Introduction to Programming Using Block-Based Languages (Touch Develop)

Answered

Wrong

Progress

Accuracy

Preview progress0/30

Ready score12%

This free quiz stays in the main area. The rail on the left shows the bigger study system waiting behind premium access.

Unlocked now

Free practice test

Unlocked

Start answering and the free lane begins filling up immediately

Instant explanations

Unlocked

Every answered free question now shows the explanation directly after you check it

Progress snapshot

Unlocked

Questions answered, wrong-answer rate, and readiness update live while you practice

Waiting to unlock

Detailed dashboard

Locked

Readiness trend, progress bars, wrong-answer review, and weak-domain coverage

Wrong-answer recovery

Locked

Auto-queue every miss for targeted recovery instead of losing it after one attempt

Flashcards

Locked

Quick recall decks for facts, terms, formulas, and repeated weak spots

Mind maps

Locked

Visual topic maps so harder objectives stop feeling scattered

Video courses

Locked

Guided topic walkthroughs for sections that still feel slow or confusing

4,300+ premium practice tests

Locked

The rest of the Certbie catalog stays visibly locked beside the free lane

13,900+ quiz sets

Locked

More depth across major vendors and long-tail niche certification tracks

Exam simulations

Locked

Longer timed practice sessions designed to feel much closer to the paid prep flow

Open Dashboard & Progress See Everything in Premium

Question 1 of 30

In a programming class, students are tasked with implementing a sorting algorithm to arrange a list of integers in ascending order. They decide to compare two algorithms: Bubble Sort and Selection Sort. The initial list of integers is [64, 34, 25, 12, 22, 11, 90]. After applying Bubble Sort, the students observe that the algorithm performs a total of 21 comparisons and 11 swaps. Meanwhile, they also analyze the performance of Selection Sort on the same list. How many comparisons does Selection Sort make in the worst-case scenario for a list of size $n$?

$\frac{n(n-1)}{2}$

$n^2$

$n(n-1)$

$n(n+1)$

Preparing for Microsoft 98-380 Introduction to Programming Using Block-Based Languages (Touch Develop)? Now land the interview.

73% of qualified candidates get rejected because of weak resumes. Build an ATS-optimized, recruiter-ready resume in under 5 minutes - free to start.

Build My Resume Free