ACSL Knowledge
USACO Knowledge
NVComputing Trivia
Programming Trivia
Brainrot
100

In ACSL problems, this is the basic building block of any program, which contains a sequence of instructions execute by the computer.

Function

100
What is USACO's mascot?

Cow

100
Name all the Captain's names.

Arthur, Armaan, Steven, Kundan

100

Who was the first computer programmer?

Ada Lovelace

100

What is the most brainrotted state? 

Ohio

200

In ACSL contests, this type of problem often requires you to convert a number from one base to another. 

Base Conversion

200

Has Neuqua ever produced a USACO Camper?

No :(

200

When was NVComputing first founded?

2017

200

Who created the first computer?

Charles Babbage

200

Sticking out your ___ for the rizzler!

Gyatt

300

This ACSL concept is used to break down a problem in smaller instances of the same problem, which is effect for problems involving trees and graphs.

Recursion

300

When was USACO founded?

1992
300

Traditionally, NVComputing Team has had four captains each year. Which year did we have five captains instead?

2023

300

What is the most widely used programming language?

JavaScript

300

What is Ning Ning?

The mak mae

400

This type of data structure is linear collection of element where the insertion and removal of elements occur at opposite ends, following the "First In, First Out" principle.

Queue

400

This data structure can be used to store a collection of unique values that can be accessed in constant time.

Set

400

How long has Mr. Koos been teaching at Neuqua for?

27 years; Since Neuqua Valley was founded

400

This high-level programming language was developed by Guido van Rossum in the late 1980.

Python

400

What is called when you have to give a portion of your food to your friend?

Fanum tax

500

275x = 3607

8
500

In a problem where you need to find the shortest path in a graph using unweighted edges, which graph traversal method would you use?

Breadth-First Search (BFS)

500

Who is the oldest captain?

Arthur

500

This type of algorithm is often used to find an item in a sorted list by repeatedly dividing the search interval in half.

Binary Search

500

What must a queen never do?

Cry
M
e
n
u