Main Page > BS Computer Science > Fundamentals of Algorithms
 |
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
Fundamentals of Algorithms
|
Using pseudo language as a base, introduction to algorithms, introduction to matrices and their manipulation, searching and sorting algorithm, graphs and related algorithms, trees and related algorithms. Introduction to concepts of iteration and recursion, tracing and timing. Introduction to order of magnitude and algorithm complexity. |
| Credit hours/ Marks:- 3 |
|
|
