3- Intended Learning Outcome :-

a- Knowledge and Understanding :-

Students who complete the course will have the ability to :-

a1- explain clearly concepts and methods for some fundamental combinatorial optimization problems, including traveling salesman problem and minimum spanning tree problem.

a2- implement methods and computational algorithms to solve problems on combinatorial and network optimization over discrete domains.

a3- manipulate techniques in coding theory for error minimization across network channels.

a4- formulate and analyze real-world problems in framework of combinatorial optimization and graph/network models.

a5- understand the fundamental concepts of network optimization.

b. Intellectual Skills :-

Students who complete the course will have the ability to :-

b1- To recognize internetworking concepts, architecture and protocols.

b2- To compare between alternative computer networks design approaches.

b3- To analyze network protocols designs.

c-Professional Skills :-

Knowledge of the concepts and material presented in this course will provide the students with practical know-how to :-

c1- Design Network flow algorithms.

c2- Solve the Max-Flow Problem.

c3- Solve Min-Cost Flow Problem.

c4- Work effectively as an individual and as a member of a team. 

c5- Work in stressful environment and within constraints.

d-General Skills :-

Knowledge of the concepts and material presented in this course will provide the students with the capability to :-

d1- Be capable of applying both traditional and new concepts and skills.

d2- Work within and contribute to a team, apply management.

d3- Discuss various network architectures and protocols.

d4- Elaborate on differences of protocols and architectures.

d5- Quantify the values of protocol parameters and indicate their advantages and disadvantages.