C# Online Test

TestDome skill assessments are used by more than 6,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# online test assesses candidates' knowledge of programming in the C# language and their ability to leverage commonly used parts of the .NET framework's class library.

It's an ideal test for pre-employment screening. A good C# developer needs to be able not only to solve problems using C# but also recognize when to leverage the functionality provided by the .NET framework's class library to write robust and maintainable code.

This online test requires candidates to solve coding problems in C# and find and fix bugs in a C# program.

Recommended Job Roles
.NET Developer
Back-End Developer
C# Developer
Web Developer
Sample Candidate Report

Sample Free Questions

Alert Service


C# Interfaces Inversion of control Refactoring Public

Refactor the AlertService and AlertDAO classes:

  • Create a new interface, named IAlertDAO, that contains the same methods as AlertDAO.
  • AlertDAO should implement the IAlertDAO interface.
  • AlertService should have a constructor that accepts IAlertDAO.
  • The RaiseAlert and GetAlertTime methods should use the object passed through the constructor.

Merge Names


C# Arrays Public

Implement the UniqueNames method. When passed two arrays of names, it will return an array containing the names that appear in either or both arrays. The returned array should have no duplicates.

For example, calling MergeNames.UniqueNames(new string[]{'Ava', 'Emma', 'Olivia'}, new string[]{'Olivia', 'Sophia', 'Emma'}) should return an array containing Ava, Emma, Olivia, and Sophia in any order.

Binary Search Tree


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.

Needle, Driver Exam, Read First Line, Document Store, Paper Strip, Max Sum, Log Patch, Shipping, Chinese Box, Shining Star, Unloading Trucks, Read Write Execute, Procedural Generator, Runner, Segment, Bicycle, Chain Link, Classroom, Crop Ratio, Date Transform, Disposable Wrapper, Document Counter, Veterinarian, Eye of the Storm, Hobbies, Internal Nodes, Log Parser, Node, Paragraph, Platformer, Product Refactoring, Racer, Remove Repetitions, Snapshot, Sort Params, Stack to List, Ship, Unique Product, Unique Numbers, Username, Vectors, Weighted Average, Window Manager, Language Teacher, Book Sale, Friend, Shelf Test, Moving Total, Kilometer Converter, Stories, Hen, Prefix, Adder
C# Stream Strings Exceptions Bug fixing Language Algorithmic thinking Arrays Extension methods Arithmetic Data structures TDD Sorting Random Memory management Field modifiers Linked list Accessibility levels Properties Integer division Regex Destructors OOP Refactoring Queue Dictionary Iteration Lists Tree Serialization XML Recursion Multithreading Synchronization StringBuilder Pass by reference Complexity Stack Inheritance Graphs Test case design Unit testing HashSet Method overriding Dynamic programming Higher order function Interfaces LINQ
Score Distribution
# of candidates
Pricing For Premium Questions