Couse Description
This course aims at enabling students to deal with matrices and functions and using them in programming applications. In addition, it introduces students to ways of dealing with different systems for data structures.
This course includes matrices, functions, pointers, structures and their applications, linked lists, queue, stack, trees, types of sorting (bubble sorting, heap sorting, quick sorting), dealing with files and different search techniques (sequential search, binary search).
Course ID: 313 N COMP
Credit hours | Theory | Practical | Laboratory | Lecture | Studio | Contact hours | Pre-requisite | 3 | 2 | 2 | 4 | Object Oriented Program COMP 222 N |
---|