Computer Science

This course focuses on designing, evaluating, and deploying usable, effective, and enjoyable technologies in a range of contexts. It provides an introduction to the key areas, approaches, and developments in the field. Topics include principles of design, techniques for prototyping and implementing user interfaces, and methods for evaluating interfaces with or without user involvement.

This course introduces students to basic probability theory and statistical inference. Topics include basic concepts of probability, conditional probability, independence, random variables, joint and marginal distributions, mean and variance, some common probability distributions, sampling distributions, estimation, and hypothesis testing based on a normal population.

This course covers compiler construction: the main phases in a compiler like scanning, parsing, static-semantic analysis, and code generation; compiler formalisms like context-free grammars and attribute grammars; compiler tools like parser generators and static aspect-oriented programming; program representations like abstract syntax trees and intermediate code; and run-time systems that handle programs during execution. Lab course includes implementation of a small compiler. The course makes use of the compiler generation tool JastAdd.

The course gives an overview of a wide range of topics and also provides technical details of some topics. Topics included in the course are security terminology, cryptography, digital certificates, email security, DNS architecture and security, web session security, web application security, remote and local authentication, Internet anonymity, operating system security, Transport Layer Security (TLS) and organizational aspects.

This course provides an introduction to the design techniques that are used to find efficient algorithmic solutions for given problems. The techniques covered include greedy, divide-and-conquer, dynamic programming, and adjusting flows in networks. Students will extend their skills in algorithm analysis. It also provides an introduction to the concepts of computational complexity and reductions between problems.