A more advanced study of the complex discrete data structures explored in COS 310. Algorithms manipulating these structures are implemented in C++. Their run times are empirically and analytically established and compared against a background of computational complexity theory and time-space tradeoff. Introduction to the basic mathematical, theoretical subjects and tools needed for other courses. The course covers different topics such as: discrete mathematics, Boolean algebra, number theory, finite automata and others.
Prerequisite: COS 511. The major tools for network security and Web security is presented as techniques of programming under network and web environments. Topics such as network security architectures; policy and legal issues; security assessment and incident handling; and tools used for network security are presented.