Skip to main content
Undergraduate Bulletin College of Arts and Sciences

Course descriptions, prerequisites and more...

Below you will find the list of courses offered through the College's schools, departments, and programs. This list includes important information about each course, including the course description, credit hours, prerequisites, repeatability, and more. Use the filters to narrow your search.

Filters

53 courses found. Showing results 1–10.
  • CSCI-B 351 Introduction to Artificial Intelligence (3 cr.) P: CSCI-C 200 or CSCI-C 211. Two semesters of computer programming or consent of instructor. Introduction to the design, construction, and control of autonomous mobile robots. This course covers basic mechanics, electronics and programming for robotics, as well as the applications of robots in cognitive science. Credit given for only one of COGS-Q 351 or CSCI-B 351.
  • CSCI-B 355 Autonomous Robotics (3 cr.) P: Two semesters of computer programming or consent of instructor. Introduction to the design, construction, and control of autonomous mobile robots. This course covers basic mechanics, electronics and programming for robotics, as well as the applications of robots in cognitive science. Credit given for only one of COGS-Q 360 or CSCI-B 355.
  • CSCI-B 363 CSCI-B 363 Bioinformatics Algorithms (4 cr.) R: One programming class or equivalent programming experience in C/C++, Java or Python . The course will introduce algorithms for addressing real-world biological questions. For each topic, we will start with an important biological question and gradually present algorithms to answer this question. The course will also discuss the strategies to formulate an appropriate computation problem from a biological question to motivate algorithmic thinking.
  • CSCI-B 365 Introduction to Data Analysis and Mining (3 cr.) R: Basic programming skills (CSCI-C 200, CSCI-C-211 or INFO-I 210) . The course objective is to study computational aspects of discovering patterns and relationships in large data. This course is designed to introduce fundamental concepts of data mining and provide hands-on experience in data collection, preprocessing, analysis, clustering and prediction.
  • CSCI-B 392 Competitive Programming (2 cr.) P: CSCI-C 343. This course focuses on training students to prepare for programming contests (such as the ACM International Collegiate Programming Contest). The students will learn to design time and space efficient algorithms to solve challenging contest problems, and produce bug-free code under the pressure of time in contest. May be repeated for a maximum of 6 credit hours.
  • CSCI-B 401 Fundamentals of Computing Theory (3 cr.) P: CSCI-C 212 and CSCI-C 241. Fundamentals of formal language theory, computation models and computability, the limits of computability and feasibility, and program verification.
  • CSCI-B 403 Introduction to Algorithm Design and Analysis (3 cr.) P: CSCI-C 241, CSCI-C 343 and MATH-M 216 or MATH-M 212. Algorithm design methodology. General methods for analysis of algorithms. Analysis of the performance of specific algorithms, such as those for searching and sorting. Credit give for only one of CSCI-B 403 or CSCI-B 503.
  • CSCI-B 430 Security for Networked Systems (3 cr.) P: CSCI-C 231. This course is an extensive survey of network security. The course materials cover threats to information confidentiality, integrity, and availability in different internet layers, and defense mechanisms that control these threats. The course also provides a necessary foundation on network security, such as cryptographic, primitives/protocols, authentication, authorization and access control technologies; and hands-on experiences through programming assignments and course projects. Credit given for only one of CSCI-B 430, INFO-I 430, or INFO-I 520.
  • CSCI-B 433 Systems & Protocol Security & Information Assurance (3 cr.) P: CSCI-C 231 and CSCI-C 291. This class covers the fundamentals of computer security by looking at how things can go wrong, and how people can abuse the system. This is a matter of creative cheating; to find loopholes and exploit them. After students learn how to attack the system, it is possible to propose ways to make the system secure. Students will gain a basic overview of existing security problems and be exposed to methods that can be used to secure against such problems. The course should be taken by any one designing, selecting, or using applications in which security or privacy plays a role. Credit given for only one of CSCI-B 433, INFO-I 433, or INFO-I 533.
  • CSCI-B 441 Digital Design (4 cr.) P: CSCI-C 335. Lab fee. Organization and logic design of digital systems. Course presents a structured design philosophy, emphasizing hardwired and microprogrammed control. Boolean algebra, hardware building blocks, circuit synthesis, microprogramming. In the laboratory, students build, study, and debug a working minicomputer from elementary hardware components. Lecture and laboratory. Credit given for only one of CSCI-B 441 or CSCI-B 541.