HIM 511
Data Communications and Telecommunications Networking
2 Unit(s) (LH 30)
Course Description
At the end of the course, the students should be able to:
1. describe the general concept and evolution of telecommunications network;
2. describe transmission facilities, data encoding and data transmission techniques;
3. explain the convergence of computers and telecommunications, its transmission links, and
procedures;
4. discuss logical and physical communication networks;
5. evaluate the performance of telecommunication systems;
6. appreciate network topologies and hardware;
7. address server operating systems;
8. explain policy issues association with distributed networks;
9. expound data structure in programming languages- debate basic structures for data
representation (atomic, simple, complex) and storage allocation; and
10. discuss organisation methods, programming exercises involving implementation of different
data structures.
Course Outline
General concept, evolution, telecommunications network, transmission facilities, data encoding,
data transmission techniques, convergence of computers and telecommunications, transmission
links and procedures: links, switched and leased line. Connections, point- to- point and multipoint
broadcast, and asynchronous and synchronous transmission. Logical and physical communication
networks, network evolution. Integrated digital network, customer interface, ISDN services and
access, broadband ISDN, PABX, wireless communications. Cost modeling and analysis of
telecommunication systems. Performance evaluation of telecommunication systems.
Local and wide area computer networking including network topologies and hardware, packet
switching, client/server architectures network protocols, and network server and applications.
Address server operating systems. Management, security authentication, and policy issues
association with distributed network. Data structure in programming languages, basic structures
fir data representation atomic, simple complex, storage allocation: static, dynamic, linear data
structures: strings, stack. Linear list, and many others: graph, sorting and searching algorithms,
file structure: organisation methods, programming exercises involving implementation of different
data structures.