This course is intended to be accessible to all first-year undergraduates and those in other years. It is not about the technical details of AI systems, but rather is about what AI is, what it does and doesn't do, and what it should and shouldn't do, what its role and impact are on society. The topics covered in this course will be: History of AI, historical AI Categories of current AI systems Practice in use of current AI systems Ethical considerations in the design and use of AI systems Understanding the social context of AI (socio-technical systems)

This course provides an introduction to computer systems and explores computer architecture, operating systems, and networks from a programmer's perspective. The course also introduces advanced programming and debugging tools. Topics include hardware instruction sets, machine language and C language program representations, linking/loading, operating systems (process management, scheduling, memory management, interprocess communication, and file systems), network programming (socket programming and web protocols), and common security attacks and solutions.

Topics in discrete math aimed at applications in Computer Science. Fundamental principles: set theory, induction, relations, functions. Boolean algebra. Techniques of counting: permutations, combinations, recurrences, algorithms to generate them. Introduction to graphs and trees.

Topics in discrete math aimed at applications in Computer Science. Fundamental principles: set theory, induction, relations, functions. Boolean algebra. Techniques of counting: permutations, combinations, recurrences, algorithms to generate them. Introduction to graphs and trees.

Introduction to the design and analysis of algorithms. Asymptotic analysis of time complexity. Proofs of correctness. Algorithms and advanced data structures for searching and sorting lists, graph algorithms, numeric algorithms, and string algorithms. Polynomial time computation and NP-completeness.

This course introduces students to the World Wide Web, languages and techniques used for web programming, data transfer over the Internet, and the tools available in the web environment.

Floating point arithmetic. Numerical linear algebra: elimination with partial pivoting and scaling. Poly- nomial and piecewise interpolation. Least squares approximation. Numerical integration. Roots of nonlinear equations. Ordinary differential equations. Laboratory exercises using software packages available at computer center.

Floating point arithmetic. Numerical linear algebra: elimination with partial pivoting and scaling. Poly- nomial and piecewise interpolation. Least squares approximation. Numerical integration. Roots of nonlinear equations. Ordinary differential equations. Laboratory exercises using software packages available at computer center.

This course focuses on the graphical human-machine interface, covering the principles of windowing systems, graphical interface design and implementation, and processing graphical data. There is an emphasis on medium-scale programming projects with graphical user interfaces using a high-level procedural programming language and concepts such as object-oriented design.

Topics include: Euclid's algorithm, unique factorization moduli arithmetic, Fermat's and Euler's theorems, Chinese remainder theorem, RSA public key encryption, Pollard rho factoring, pseudo primes, error correcting codes, Hamming codes, polynomial rings and quotient rings, field extensions, finite fields and BCH codes.