4 credits (3-0-2) Pre-requisites: COL106 OR Equivalent Overlap with: COL334, ELL789 Students will be exposed to common network algorithms and protocols, including physical layer modulation… Read More »COL 672: Computer Networks
4 credits (3-0-2) Pre-requisites: COL106 OR Equivalent Overlap with: COL333, COL770, ELL789 Problem solving, search techniques, control strategies, game playing (minimax), reasoning, knowledge representation through… Read More »COL 671: Principles of Artificial Intelligence:
4 credits (3-0-2) Pre-requisites: COL106 OR Equivalent Overlap with: COL331 EEL405, MTL358 Primary UNIX abstractions: threads, address spaces, filesystem, devices, interprocess communication; Introduction to hardware… Read More »COL633: Resource Management in Computer Systems
4 credits (3-0-2) Pre-requisites: COL106 OR Equivalent Overlap with: COL362, MTL710 Data models (ER, relational models, constraints, normalization), declarative querying (relational algebra, datalog, SQL), query… Read More »COL632: Introduction to Database Systems
8 credits (0-0-16) Pre-requisites: COD492 The student(s) who work on a project are expected to work towards the goals and milestones set in COD492. At… Read More »COD494 B.Tech Project Part-II
6 credits (0-0-12) Pre-requisites: EC 100 This course is a BTP- Part I (core) for all CS students. The student(s) are expected to work on… Read More »COD492 B.Tech Project Part-I
3 credits (2-0-2) Pre-requisites: COL106, COL351, COL331 Overlaps with: COL730, MTL765 Concurrency, Consistency of state and memory, Parallel architecture, Latency and throughput, Models of parallel… Read More »COL380 Introduction to Parallel & Distributed Programming
4 credits (3-0-2) Pre-requisites: COL106 Overlaps with: MTL710 Data models (ER, relational models, constraints, normalization), declarative querying (relational algebra, datalog, SQL), query processing/optimization (basics of… Read More »COL362 Introduction to Database Management Systems
3 credits (3-0-0) Pre-requisites: COL202 Overlaps with: MTL383 Regular Languages, Finite Automata, equivalence, minimization, Myhill-Nerode Theorem, introduction to non-determinism, Context free grammars, Pushdown automata, equivalence… Read More »COL352 Introduction to Automata & Theory of Computation
4 credits (3-1-0) Pre-requisites: COL106 Overlaps with: MTL342 Checking 2-edge, 2-node and strong connectivity using DFS, Strongly connected components. Greedy algorithms, minimum spanning trees (Prim/Kruskal),… Read More »COL351 Analysis and Design of Algorithms
