Virtual University

Knapsack Problem: Dynamic Programming Approach (V-U)

Kruskal''s Algorithm (V-U)

Minimum Spanning Trees (V-U)

Adding String and Numbers to JavaScript (V-U)

Model of Computation (V-U)

AJAX Case Study (V-U)

Plane-sweep Algorithm its analysis and Comparison to Brute-force Algorithim (V-U)

AJAX Introduction (V-U)

Precedence Constraint Graph ,Topological Sort (V-U)

AJAX Receiving Response-a (V-U)

Prim''s Algorithm (V-U)

AJAX Receiving Response-b (V-U)

Quick sort (V-U)

AJAX Sending Request-a (V-U)

Comparison Operators (V-U)

Radix sort (V-U)

Conditional Statements (V-U)

Reductions ,NP-Completeness (V-U)

Shortest Paths (V-U)

CSS – Attribute Selector (V-U)

Sieve Technique (V-U)

CSS – Dimension (V-U)

Strong Components and DFS (V-U)

CSS – Display (V-U)

The Iteration and Recursion Tree Methods for Solving Recurrence Relations (V-U)