4 credits (3-0-2) Pre-requisites: COL334 OR Equivalent Radio signal propagation, advanced modulation and coding, medium access techniques, self-configurable networks, mesh networks, cognitive radio and dynamic… Read More »COL768 Wireless Networks
4 credits (3-0-2) Pre-requisites: COL106 OR Equivalent Introduction to declarative programming paradigms. The functional style of programming, paradigms of developments of functional programs, use of… Read More »COL765 Intro. To Logic and Functional Programming
4 credits (3-0-2) Pre-requisites: COL362 OR Equivalent Review of Relational Model, Algebra and SQL, File structures, Constraints and Triggers, System Aspects of SQL, Data Storage,… Read More »COL762 Database Implementation
4 credits (3-0-2) Pre-requisites: COL362 OR Equivalent Storage and file structures, advanced query processing and optimization for single server databases, distributed data management (including distributed… Read More »COL760 Advanced Data Management
3 credits (3-0-0) Pre-requisites: COL351 MTL106 OR Equivalent Overlaps with: MTL730 Part 1: Foundations: Perfect secrecy and its limitations, computational security, pseudorandom generators and one… Read More »COL759 Cryptography & Computer Security
4 credits (3-0-2) Pre-requisites: COL351 OR Equivalent Advanced data structures: self-adjustment, persistence and multidimensional trees. Randomized algorithms: Use of probabilistic inequalities in analysis, Geometric algorithms:… Read More »COL758 Advanced Algorithms
4 credits (3-0-2) Pre-requisites: COL351 OR Equivalent The RAM model and its limitations, Introduction to alternate algorithmic models Parallel models like PRAM and Interconnection networks;… Read More »COL757 Model Centric Algorithm Design
3 credits (3-0-0) Pre-requisites: COL351 OR Equivalent Overlaps with: MTL103, MTL704 Linear programming: introduction, geometry, duality, sensitivity analysis. Simplex method, Large scale optimization, network simplex.… Read More »COL756 Mathematical Programming
3 credits (3-0-0) Pre-requisites: COL351 OR Equivalent NP-hardness and approximation algorithms. Different kinds of approximability. Greedy algorithm and local search with applications in facility location,… Read More »COL754 Approximation Algorithms
3 credits (3-0-0) Pre-requisites: COL352, COL705 OR Equivalent Modeling computation (Finite state machines, Non-determinism, Turing machines, class P etc.), NP and NP-completeness, Diagonalization (Time hierarchy… Read More »COL753 Complexity Theory
