Test Difficulty Level: Medium

Syllabus of Test

Computer Science: Questions on the Desing and Analysis of Algorithms

Sample Question from this online test:

Question: The Hamiltonian- path-problem can be solved in polynomial time on

Option A: directed acyclic graph

Option B: undirected acyclic graph

Option C: directed uncyclic graph

Option D: undirected uncyclic graph

To answer, click the "Start This Test" button below.

Start this Test