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

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 Java and to write SQL queries that extract, combine, and manipulate data.

Recommended Job Roles
Back-End Developer
Java Developer
SQL Developer
Web Developer
Sample Candidate Report

Sample Free Questions

Students

3min
  -  
Easy  
  -  
CODE

SQL Aggregation 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

Java Algorithmic thinking Data structures 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
Utilities, Runner, Movies, Index Performance, Poll, Rectangles, Document Store, Needle, Log Parser, Driver Exam, Crop Ratio, Programmer Teacher, Retirees, Chicken, Authors, Countries, Employee Manager, Merge Stock Index, Paragraph, Username, Chain Link, Hobbies, Read First Line, Node, Cheapest Product, Shipping, Movies Live, Racer, ATM Locations, Department Report, Developers, Delete Orders, Restaurant Menu, Roads, Sales, Snapshot, Student Activities, Transactions, Projects, Date Transform, Segment, Youngest Child, Internal Nodes, Moving Total, Entry, Unique Numbers, Remove Repetitions, Max Sum, Unique Name, Friend, Paper Strip, Stories, Train, Platformer, Tasks, Weighted Average, Ingredients, Autocomplete, Test Results, Bank Branches, Hospital Patients, Menu Items, Ban Users, Product, Unloading Trucks, Shelf, Rare, Stack to List, Read Write Execute, Shining Star, SMS Messages, Document Counter, Snow Storm
Skills
Java OOP Bug fixing Memory management SQL Aggregation Subqueries Indexes Conditions Language Stream Strings Serialization Exceptions Insertion Joins Union Data structures Arrays Iteration Arithmetic Multithreading Constraints Database schema Delete Update Views Algorithmic thinking Searching Graphs Dynamic programming Performance tuning Refactoring Sorting Test case design TDD
Score Distribution
Loading...
Pricing For Premium Questions