Code Clash: Two-Team Programming Quiz

Froggy Jumps

Played 0

Create copy

About this activity

Two-team tech duel

Created by

Rayan Alamri

Oman

Download the paper version to play

Top 10 results

There are still no results for this game. Be the first to stay in the ranking! Log in to identify yourself.

Make your own free game from our game creator

Compete against your friends to see who gets the best score in this game

Make challenge

pizza

Lorelay Tyana

Romania

(258)

joc despre pizza
Ethos, Pathos, and Logos Quiz

Kristine Vester

United States

(131)

Test your knowledge of ethos, pathos, and logos with these 10 questions on examples of persuasive techniques.
The Integumentary System

Breanna Nesbitt

United States

(58)

Functions and Structures of the skin
Phlebotomy Order of Draw Quiz

Pamela Chapman

United States

(59)

Test your knowledge of the order of draw in Phlebotomy with these 10 questions!
Bill of Rights Game - The Constitutionalist

Doni The Don

United States

(89)

Test your knowledge on the Bill of Rights. A fun way to test your knowledge and focus on where you need to improve.


Froggy Jumps Code Clash: Two-Team Programming QuizOnline version Two-team tech duel by Rayan Alamri 1 Which sorting algorithm is stable and divides the list to merge sorted parts? a Merge sort b Heap sort c Quick sort 2 What is the primary purpose of a hash table in programming? a Uses fixed memory b Average O(1) lookups c Maintains order 3 Which algorithm finds the shortest path in graphs with non-negative weights? a Kruskal’s algorithm b Bellman-Ford c Dijkstra’s algorithm 4 Which paradigm focuses on pure functions and avoids side effects? a Functional programming b Object-oriented programming c Imperative programming 5 In Git, which command creates a new branch? a git merge b git branch c git checkout 6 What best defines a deadlock in concurrent systems? a One process starves others b Resource free and unlocked c Mutual waiting with circular dependency 7 In a balanced BST, what is the typical time complexity for insert/search? a O(n^2) b O(log n) c O(1) 8 What is the time complexity of searching a randomly ordered unsorted array? a O(log n) b O(1) c O(n)

Froggy Jumps

Code Clash: Two-Team Programming QuizOnline version

Two-team tech duel

by Rayan Alamri

Which sorting algorithm is stable and divides the list to merge sorted parts?

Merge sort

Heap sort

Quick sort

What is the primary purpose of a hash table in programming?

Uses fixed memory

Average O(1) lookups

Maintains order

Which algorithm finds the shortest path in graphs with non-negative weights?

Kruskal’s algorithm

Bellman-Ford

Dijkstra’s algorithm

Which paradigm focuses on pure functions and avoids side effects?

Functional programming

Object-oriented programming

Imperative programming

In Git, which command creates a new branch?

git merge

git branch

git checkout

What best defines a deadlock in concurrent systems?

One process starves others

Resource free and unlocked

Mutual waiting with circular dependency

In a balanced BST, what is the typical time complexity for insert/search?

O(n^2)

O(log n)

O(1)

What is the time complexity of searching a randomly ordered unsorted array?

O(log n)

O(1)

O(n)

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.

Code Clash: Two-Team Programming Quiz

Froggy Jumps

About this activity

Created by

Download the paper version to play

Top Games

Froggy Jumps

pizza

Froggy Jumps

Ethos, Pathos, and Logos Quiz

Froggy Jumps

The Integumentary System

Froggy Jumps

Phlebotomy Order of Draw Quiz

Froggy Jumps

Bill of Rights Game - The Constitutionalist

Froggy Jumps

Code Clash: Two-Team Programming QuizOnline version

by Rayan Alamri

Which sorting algorithm is stable and divides the list to merge sorted parts?

What is the primary purpose of a hash table in programming?

Which algorithm finds the shortest path in graphs with non-negative weights?

Which paradigm focuses on pure functions and avoids side effects?

In Git, which command creates a new branch?

What best defines a deadlock in concurrent systems?

In a balanced BST, what is the typical time complexity for insert/search?

What is the time complexity of searching a randomly ordered unsorted array?

		%
	Anonymous	%
		%
		%