With the successful completion of this course, the students will be able to;
1. define the basic data structure and models, express the differences from each other.
2. define search and sort algorithms, and convert these algorithms into C code.
3. define list and linked list algorithms, write C codes implementing these algorithms.
4. define ques and stacks, write C codes implementing these algorithms.
5.define tree data structures, write C codes implementing these algorithms.
6.define graphs, write C codes implementing these algorithms.
7. define state machines, write C codes implementing these algorithms.
8. define recursive algorithms, write C codes implementing these algorithms.
9. define file structures, write C codes implementing these.
|