Advanced Networks Design

Catalog description

Basic concepts of graph theory will be discussed with emphasis on simple undirected graphs. Graph theoretic concepts will be applied to real life examples like computer networks, electrical networks, wireless networks and social networks. These concepts will be applied to determine strong ties of a social network, strongly connected components of a telecommunication or computer network, etc. Shortest path algorithms will be studied and applied to routing in networks. This course will also help students learn concepts of task scheduling and traffic scheduling using matching algorithms. Finally, special topics like planarity for VLSI design, random graphs for wireless sensor network design and intrinsically hard (NP complete) problems will be discussed. Classroom Hours- Laboratory and/or Studio Hours- Course Credits: 3-0-3 Prerequisite Course(s): Corequisite: CSCI 651