Student ID:  
Password:  
Login

ID  User  Problem  Result  Time  Score  % 

1  A bdullah Bahosain  3200  
2  S aMer Ali  2250  
3  H asan AlHamsh  900 
Select a problem:
Dijkstra
Breadth First Search (BFS)
Depth First Search (DFS)
Minimum Spanning Tree (MST)
Topological Sort
Activity Selection
Graph Coloring
Quick Sort
Merge Sort
Selection Sort
Insert Sort
Knapsack

Problem
Solve
Status
Standings
#include <iostream>
using namespace std;
int main(){
// your code goes here
return 0;
}
Submit

Rank  Username  Points 

1  Abdullah Bahosain  3200 
2  SaMer Ali  2250 
3  Hasan AlHamsh  900 
Points  Why? 

Select a quiz:
Greedy Algorithms
Dynamic Programming
Graph Theory
Sorting Algorithms

Greedy Algorithms
5 / 3 / 2016
+300
This is the first quiz, you will have two hours to answer the questions. Make sure you save your answers.
1
Bottomup dynamic programming algorithms search through all possible solutions of the problem.
2
Bottomup dynamic programming algorithms search through all possible solutions of the problem.
3
Bottomup dynamic programming algorithms search through all possible solutions of the problem.
Last submission: 2 seconds ago
Submit
