Search & Sort Methods
Binary & Hexadecimals
HTML & CSS
Computing Systems
Riddles
100

This sort proceed through the array of values, finding the smallest unsorted element, and swapping the "current" element with it. The current element marks the boundary between sorted (beginning of the list) and unsorted data (end of the list)?

What is a Selection Sort


100

What is 3 in Binary Code?

0011

100

tells the web browser what type of HTML the page uses?

What is DOCTYPE

100

What are the  main hardware components of a home computer?

Keyboard, mouse, CPU, monitor, printer, speakers.

100

What's the antonym of 'synonym'?

Antonym

200

This sort iteratively puts the smallest unsorted element into its correct place, changing the location of other elements in the array while doing so. Starting with the last array element, it compares successive pairs of elements, swapping whenever the element is smaller than the one below it?

What is a Bubble Sort

200

What is 9 in Binary Code?

1001

200

The set of markup symbols or codes placed in a file intended for display on a web browser?

What is HTML

200

Uses your internet to upload and save your data to an online space?

What is Cloud Storage

200

Who is the sister-in-law of your dad's only brother?

Your mother

300

In this sort each successive element in the array to be sorted is inserted into its proper place with respect to the other, already sorted elements. Initially, the sorted portion of the list contains only one element, say array[0]. The next element, array[1], is added to the sorted portion with respect to array[0]. This technique continues until the whole list is sorted?

What is a Insertion Sort

300

What is 15 in Hexadecimals?

F

300

a rule describing how to format a particular portion of a web page?

What is Style

300

Where information not being used by the CPU is stored?

What is Long Term Memory

300

Before Mount Everest was discovered, which was the tallest mountain in the world?

It was still Mount Everest

400

This sort is another "divide and conquer" algorithm, inherently recursive. Works by selecting a pivot value, then recursively sorting the left and right sub-arrays. The sub-arrays are sorted in the same manner?

What is a Quick Sort

400

What is 12 in Hexadecimals?

C

400

What does CSS stand for?

Cascading Style Sheets

400

A group of computers that are connected together in order to share resources quickly and efficiently?

What is a Network

400

What is lighter than a feather, but not possible to hold for even a few minutes?

One's breath

500

In this sort we first take the root element off the heap, and put it in place. Then, we re-heap the remaining elements (putting the next-largest element onto the root position), and repeat until no further elements exist on the heap?

What is a Heap Sort

500

What is 16 in Hexadecimals?

10

500

instructions that tell a web browser how to display the web page?

What are tags

500

What does a server do?

Provides a certain service and manages resources.

500

Divide 100 by half and add 50

250

M
e
n
u