This course introduces the concepts communication model: socket, remote procedure call, remote object invocation, message oriented communication; naming service; clock synchronization, distributed object based system: CORBA, distributed COM; distributed file system, replication, distributed transactions; security management, recovery. The course includes continuous assessment in the form of examinations.
This course introduces the student to the concept of data structures through abstract data structures including lists, sorted lists, stacks, queues and graphs; and implementations including the use of linked lists, arrays, binary search trees, hash tables, trees, and adjacency matrices. It also introduces the student to algorithm design including greedy, divide-and-conquer, random and backtracking algorithms and dynamic programming; and specific algorithms including, for example, resizing arrays, balancing search trees, shortest path, and spanning trees.
ICT 5307: Embedded System Design Summary