Profile
Student ID:
Password:
Login
Status
ID User Problem Result Time Score %
1 A bdullah Bahosain 3200
2 S aMer Ali 2250
3 H asan Al-Hamsh 900
Problems
Extra Algorithms
In this area, you will have the chance to read about and implement algorithms to well-known problems that were not discussed in class, but that are very closely related to the topics we have covered.

Notes:
- If you don't understand the explanation provided for a particular algorithm, you can read about it online ... there are plenty of resources!
- For each algorithm you implement correctly, you can receive up to XX points.
- You may still receive some points if your algorithm provides correct answers for some test-cases and wrong answers for others.
- The amount of possible points you can collect for a certain problem will start decreasing after 14 days from posting the problem online.
- If you are not happy with the points you have received for a particular problem, you can fix your code and re-submit it again at any time. But keep an eye on the maximum number of points you can get.
More Exercises
In this area, you can flex your muscles with some programming exercises that require some thinking and analysis. These exercises require applying or extending the basic ideas covered in class with some effort from your side.

Notes:
- If you don't understand the explanation provided for a particular algorithm, you can read about it online ... there are plenty of resources!
- For each exercise you solve correctly, you can receive up to XX points.
- You may still receive some points if your algorithm provides correct answers for some test-cases and wrong answers for others.
- If you are not happy with the points you have received for a particular problem, you can fix your code and re-submit it again at any time.
Algorithm Contests
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
ID Verdict Runtime Memory Time Language Score %
5147 in queue... 1273 ms 1543 KB 2016-2-14 19:13:25 C++14 43.9%
5147 Time Limit Exceeded 1273 ms 1543 KB 2016-2-14 19:13:25 Java 43.9%
5147 Memory Limit Exceeded 1273 ms 1543 KB 2016-2-14 19:13:25 Java 43.9%
5147 Compilation Error 1273 ms 1543 KB 2016-2-14 19:13:25 Java 43.9%
5147 Runtime Error - - 2016-2-14 19:13:25 43.9%
5147 Internal Error 1273 ms 1543 KB 2016-2-14 19:13:25 Java 43.9%
7 12 ms 153 KB 2016-2-14 19:13:25 Java 0%
17 Accepted 12 ms 153 KB 2016-2-14 19:13:25 Java 100%
Rank Submission ID Username Score
Scoreboard
Rank Username Points
1 Abdullah Bahosain 3200
2 SaMer Ali 2250
3 Hasan Al-Hamsh 900
±
Points Why?
Quizzes
For each topic we cover in class, there will be a quiz that tests your basic understanding of the topic.

Notes:
- Quizzes are open-book. However, you are expected to solve them on your own without any help from anyone.
- For each quiz, you can collect up to XX points depending on the number of questions you solve correctly.
- For each quiz, you have 2 days to submit your answers. You will be able to see your grade and the correct answers after the deadline.
- Make sure to review the material before taking the quiz!
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
Bottom-up dynamic programming algorithms search through all possible solutions of the problem.

2
Bottom-up dynamic programming algorithms search through all possible solutions of the problem.


3
Bottom-up dynamic programming algorithms search through all possible solutions of the problem.
MST:
Shortest Path:
Last submission: 2 seconds ago
Submit