Computer Science Course Web

CS3151: Data Structures and Discrete Math I

An integrated approach to the study of data structures, algorithm analysis, and discrete mathematics. Topics include: induction and recursion, time and space complexity, and big-O notation, propositional logic, proof techniques, sorting, mathematical properties of data structures, including lists.

The course covers fundamental concepts of computer networks. Topics include: OSI model; LAN/WAN architecture & design; network services and protocols such as TCP/IP, IPv6, mobile IP; DNS, ICMP, telnet, ftp, etc; distributed object systems; and collaboration technology and groupware. Students are expected to complete a project that covers the essentials of set-up, configuration and administration of multi-protocol servers and clients.

Pre-requisites: CS3151 and CS3211

View the Department Course Profile