C++ Algorithms and SQL Online Test

TestDome skill assessments are used by more than 5,000 companies and 450,000 individual test takers.

Jobseekers: Get a Certificate

Take a Practice Test

Companies: Try First, Pay Later

Sign Up To Use This Test

The C++ Algorithms and SQL online test assesses candidates' knowledge of SQL queries and evaluates their algorithmic-thinking skills using C++.

It's an ideal test for pre-employment screening. A good developer should be able to work closely with the database layer and solve back-end problems where any improvement to computational complexity would produce a significantly more efficient solution.

This online test requires candidates to design and analyze algorithms using C++ and to write SQL queries that extract, combine, and manipulate data.

Recommended Job Roles
Back-End Developer
C++ Developer
SQL Developer
Sample Candidate Report

Sample Free Questions

Students

3min
  -  
Easy 
  -  
CODE

SQL Aggregation Select Public

Given the following data definition, write a query that returns the number of students whose first name is John. String comparisons should be case sensitive.

TABLE students
   id INTEGER PRIMARY KEY,
   firstName VARCHAR(30) NOT NULL,
   lastName VARCHAR(30) NOT NULL

Enrollment

5min
  -  
Easy  
  -  
CODE

SQL Conditions Update Public

A table containing the students enrolled in a yearly course has incorrect data in records with ids between 20 and 100 (inclusive).

TABLE enrollments
  id INTEGER NOT NULL PRIMARY KEY
  year INTEGER NOT NULL
  studentId INTEGER NOT NULL

Write a query that updates the field 'year' of every faulty record to 2015.

Binary Search Tree

15min
  -  
Easy 
  -  
CODE

C++ Algorithmic thinking Recursion Tree Public

A three-node binary tree.Binary search tree (BST) is a binary tree where the value of each node is larger or equal to the values in all the nodes in that node's left subtree and is smaller than the values in all the nodes in that node's right subtree.

Write a function that, efficiently with respect to time used, checks if a given binary search tree contains a given value.

For example, for the following tree:

  • n1 (Value: 1, Left: null, Right: null)
  • n2 (Value: 2, Left: n1, Right: n3)
  • n3 (Value: 3, Left: null, Right: null)

Call to contains(n2, 3) should return true since a tree with root at n2 contains number 3.

Use Free Questions On a Trial Plan

Premium Questions

The premium question library contains our unique, hand-crafted questions. We offer a refund if you find any of them answered online.

Questions
Delete Orders, Roads, Max Sum, Paper Strip, Friend, Ingredients, ATM Locations, Authors, Autocomplete, Ban Users, Bank Branches, Cheapest Product, Countries, Department Report, Developers, Employee Manager, Veterinarian, Hospital Patients, Index Performance, Menu Items, Merge Stock Index, Movies, Movies Live, Poll, Projects, Rectangles, Restaurant Menu, Retirees, Sales, SMS Messages, Student Activities, Student Max Score, Tasks, Transactions, Youngest Child, Internal Nodes, Moving Total, Platformer, Book Sale, Unique Product, Unique Numbers, Window Manager, Student Rankings, Average Salary, Welfare Organization, Auto Show, Movie Genres, Manager Sales
Skills
SQL Delete Subqueries Conditions Views C++ Algorithmic thinking Vector Graphs Update Constraints Create table Database schema Select Create index Performance tuning Alter table Aggregation Ordering Insert Left join Bug fixing Queue Indexes Union Group by Joins Arrays Tree Unordered set Data structures Linked list Sorting Unordered map SQL CASE CTE
Score Distribution
Loading...
Pricing For Premium Questions