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
.NET Developer
Back-End Developer
C# 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

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