Downloads
 Overview |
 Search Downloads |
 Up |
| Category: CS502 - Fundamentals of Algorithms |
|
|
Please register or login to download files from this category.Files:
 Fall 2010_CS502_5_SOL |
|
Question# 1 (7.5+7.5)
a) Elaborate the three algorithms Dijkstra‘s, Bellman Ford and Floyd Warshall Algorithms on the following basis:
I. Complexity of algorithms
II. Domain of Applications with examples
III. .... |
|
 2011-04-02 00:43:10  46.64 KB  4 |
| Fall 2010_CS502_4_SOL |
|
Question# 1
a) Give the adjacency matrix and adjacency list for the following graph. Fig 1.1 (2.5+2.5)
b) Apply the BFS and DFS on the following graph and show values in queue/stack stepwise on the following graph Take node 1 as source node. fig1.1 (7.5+7.5)
|
|
| 2011-04-02 00:41:50 576.91 KB 5 |
| Fall 2010_CS502_3_SOL |
|
Question# 1 (10)
Compute the Huffman encoding for the following frequencies of the characters;
which are found in the particular written paper; “How to apply the greedy strategy
for the optimization problems?” Your target is to draw the binary tree or proper
table format to produce Huffman Codes for the given frequencies so that the whole
file can be zipped to reduce the actual space covered by the .... |
|
| 2011-04-02 00:40:42 726.52 KB 1 |
| Fall 2010_CS502_2_SOL |
|
Question# 1 (10)
Perform radix sort step wise on the following data and briefly describe the worst
case complexity and big O notation at end.
Input data
55141,65545,56125,65126,22111,11225,31121,56814,11252,23541
Question# 2 (10)
Use the following dynamic programming based recurrence edit distance to find the possible edit
scripts while converting “ACTUAL “to “VIRTUAL”.
|
|
| 2011-04-02 00:39:02 297.74 KB 5 |
 cs 502 fall 2011 final by M. Abrar |
|
| 2011-02-11 21:42:31 46 KB 12 |
| Mid Past Papers QA CS502 Fundamentals of Algorithms |
|
Questions and answer from past papers of CS502 Fundamentals of Algorithms. Prepare Virtual University (VU) mid exam and get success. |
|
| 2010-11-29 22:05:37 11.27 MB 45 |
| Spring 2010 CS502 All Assignments with Solutions |
|
| 2010-11-11 14:07:40 3.48 MB 15 |
 Solution Spring 2010_CS502_1 |
|
Solution Spring 2010_CS502_1 |
|
| 2010-08-10 11:12:16 187.8 KB 12 |
| Past Papers QA CS502 Fundamentals of Algorithms Version:1.0 |
|
Past Papers QA CS502 Fundamentals of Algorithms has solved and unsolved past papers Questions. |
|
| 2010-08-05 22:18:14 616.33 KB 33 |
| Glossary CS502 - Fundamentals of Algorithms |
|
acyclic graph : a graph that contains no cycles |
|
| 2010-08-02 14:23:24 179.99 KB 7 |
| FAQs CS502 - Fundamentals of Algorithms |
|
Question: what is the proper defination of thita used in the lectures?Question: what is the proper defination of thita used in the lectures? |
|
| 2010-08-02 13:09:02 115.39 KB 8 |
| CS502-Fundamentals of Algorithms |
|
VU Course Contents CS502-Fundamentals of Algorithms |
|
| 2010-07-24 08:36:40 6.41 MB 7 |