Responsive Course Table<\/title>\n <style>\n body {\n font-family: Arial, sans-serif;\n }\n h2 {\n text-align: center;\n }\n .table-container {\n overflow-x: auto;\n margin: 20px;\n }\n table {\n width: 100%;\n border-collapse: collapse;\n margin-bottom: 20px;\n }\n th, td {\n border: 1px solid #ddd;\n padding: 8px;\n text-align: left;\n vertical-align: top;\n }\n th {\n background-color: #f2f2f2;\n }\n td a {\n color: #007BFF;\n text-decoration: none;\n }\n td a:hover {\n text-decoration: underline;\n }\n .code-col {\n width: 10%;\n }\n .course-name-col {\n width: 20%;\n }\n .credit-col {\n width: 10%;\n }\n .topics-col {\n width: 40%;\n text-align: justify;\n }\n .template-col {\n width: 20%;\n }\n @media screen and (max-width: 768px) {\n table, thead, tbody, th, td, tr {\n display: block;\n }\n thead tr {\n display: none;\n }\n tr {\n margin-bottom: 15px;\n }\n td {\n text-align: right;\n padding-left: 50%;\n position: relative;\n }\n td::before {\n content: attr(data-label);\n position: absolute;\n left: 0;\n width: 50%;\n padding-left: 15px;\n font-weight: bold;\n text-align: left;\n white-space: nowrap;\n }\n .code-col, .course-name-col, .credit-col, .topics-col, .template-col {\n width: 100%;\n }\n }\n <\/style>\n<h6>Core Course:<\/h6>\n<div class=\"table-container\">\n<table>\n<thead>\n<tr>\n<th class=\"code-col\">Code<\/th>\n<th class=\"course-name-col\">Course Name<\/th>\n<th class=\"credit-col\">No. of Credit<\/th>\n<th class=\"topics-col\">Brief List of Topics<\/th>\n<th class=\"template-col\">Detailed Course Template<\/th>\n<\/tr>\n<\/thead>\n<tbody>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS110<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">DISCRETE MATHEMATICAL STRUCTURES<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">3<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">Topics include sets, relations, functions, logic and proofs, mathematical induction, combinatorics and basic graph theory.<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\">–<\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS201<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">DATA STRUCTURES<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">4<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">This course introduces the basics of data structures and algorithms. Topics span across basic data structures (e.g., arrays, stacks, linked lists, queues, heaps, etc.), algorithm analysis (e.g., asymptotic analysis, master theorem, etc.), search Trees (e.g., AVL Trees, redblack trees, etc.), sorting (e.g., quick sort, linear time sorting, order statistics, etc.), hashing (e.g., dictionaries, tries, etc.) and Graphs (e.g., graph data structures, graph traversal algorithms such as BFS and DFS, minimum spanning Tree, shortest path algorithms, etc.)<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/open?id=1eH9DtnPSLZZG0K1W--3VnBEG0dA5JnzG\">Click here to view<\/a><\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS202<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">PROGRAMMING PARADIGMS AND PRAGMATICS<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">4<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">Introduction: Motivation to study concepts of programming languages and introduction to major language families Compiler Design: Introduction to Regular Expressions, Syntax Analysis, Lexical Analysis. Implementation using Lex\/Yacc. Foundations: Covers fundamental semantic issues of variables with emphasis on Names, Binding,Scope, Lifetime and Type Checking , Core Design Constructs: Covers issues that lie at the core of most programming languages: Data Types, Control Flow, Subroutines, Abstraction & Object Orientation, Alternative Programming Models:Introduction to Functional and Logic Programming Languages, Concurrency: Basic introduction to the fundamentals of Concurrency including communication, synchronization, creation and implementation of threads.<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/open?id=1QI3KDG9mmfTPUZVqgXJHc1W-cGqGLK2N\">Click here to view<\/a><\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS203<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">DIGITAL LOGIC DESIGN<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">4<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">Digital System: Introduction to digital logic and digital system, digital logic states, number systems,Boolean algebra and logic minimization: Boolean functions, expressions, minimizations of Boolean functions, K maps, QM method, two level and multiple level logic. Combinational logic design: Basic components: adder, multiplexer, decoder, ROMs, programmable logic, Introduction to HDL and FPGA. Arithmetic circuits. Synchronous sequential logic design: Flip-flops and latches, finite state machines \u2013 mealy and moore, state assignment and state minimizations. Counters, registers, and memories. Top down approach of digital design: Data path-control path design, register transfer level design, pipelining and parallelism. Case studies. Advanced issues in digital design: Parallelism, IP blocks and reuse,timing issues, faults and testing. Technology aspects: FPGA and ASICs, logic mapping and binding, introduction to logic synthesis and EDA tools<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/file\/d\/1OI40eTfUN7AONTx-sqFeClQpAAwfe4hH\/view?usp=drive_link\">Click here to view<\/a><\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS302<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">ANALYSIS AND DESIGN OF ALGORITHMS<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">3<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">This course goes deep into the design and analysis of algorithms. Topics include: advanced data structures (e.g., interval and range trees, segment trees, splay trees), divide and conquer techniques (e.g., karatsuba integer multiplication algorithm, mergesort, strassen\u2019s matrix multiplication algorithm, fast fourier transform, etc.), dynamic programming (e.g., longest increasing subsequence, knapsack problem, matrix chain multiplication, bellman-Ford and Floyd-Warshall algorithms, etc.), greedy algorithms (e.g., minimum spanning trees, huffman coding, etc.), network flows (e.g., ford-fulkerson algorithm, bipartite matching, etc.), NP-completeness reductions and miscellaneous algorithms (e.g., number-theoretic algorithms, euclid’s algorithm, modular arithmetic, etc.)<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/open?id=1rYRb9CSGsrVquYAH2qBBgSSi2z-CDCtL\">Click here to view<\/a><\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS306<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">THEORY OF COMPUTATION<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">3<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">This course provides an introduction to the foundations of theoretical computer science. Topics include automata theory (finite automata, regular expressions, context-free grammars, and pushdown automata), computability theory (Turing machines, decidability, and the halting problem), and complexity theory (time and space complexity, P vs NP, and NP-completeness).<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/open?id=1t4lh5ik2VRYp7DC-D_XECfa6yog-vpSN\">Click here to view<\/a><\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS307<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">COMPUTER ORGANIZATION AND ARCHITECTURE<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">4<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">Introduction: Computer Organization and computer architecture, review of fundamentals of digital logic design. Arithmetic Logic Unit: Arithmetic operations on binary numbers, ALU design, floating point arithmetic. Processor Design: Introduction to instruction set architecture, addressing modes and formats, instruction set encoding, instruction execution cycle. Pipeline design: Pipeline processor, hazard detection, hazard avoidance and hazard resolution techniques, data hazards and pipeline interlock, data forwarding, branch hazards, branch prediction, control hazards. Memory design: Memory organization, Virtual memory, Cache memory, memory level parallelism, cache coherence, shared memory multiprocessors, multithreaded processors. Input\/output devices and interaction: Input output devices, interrupt handling, storage and I\/O devices, performance considerations. Advanced architectural techniques: Instruction level parallelism, static and dynamic branch prediction, code scheduling, out of order execution, speculative execution, hardware multithreading, VLIW processor, software pipelining, memory system prospective: Memory hierarchy, cache memory, memory level parallelism, multiple memory banks, advanced cache memory designs. Parallel and multi core processors: Flynn\u2019s taxonomy, review of contemporary processors and multicore architectures. Review of advances in computer architecture and special topics: RISC\/CISC debate, power awareness, real world case studies. Introduction to research papers in computer architecture and case studies. Current research areas and course summary. Laboratory Experiments: 1. Design and implementation of a functional unit of a single cycle processor. 2. Design and implementation of a functional unit of a pipelined processor. 3. Design and implementation of a functional unit of a multicore processor. 4. Case study on a given processor architecture and their code optimizations. System prospective: Input\/output devices, DMA, busses and interconnect system on chip, multi processors.<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/open?id=11GilHe0p7D2Gk4fv850y_1qtClP-4xk4\">Click here to view<\/a><\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS301<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">DATABASES<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">4<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">This course covers some of the fundamental topics relating to Database Systems including relational model, SQL queries, ER models, functional dependency theory, normalization, file structures, index structures, query processing algorithms, query optimization, transaction processing and some trend topics (e.g., Data Warehousing, Deductive databases, etc.).<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/open?id=1dCRzMZXmhSPF38fTlDE8k1eFbVTWJs81\">Click here to view<\/a><\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS303<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">OPERATING SYSTEMS<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">4<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">This course covers some of the fundamental topics relating to Operating Systems. Topics include processes (process concept, multithreading and Scheduling), synchronization techniques, memory management techniques, file systems, Input\/output implementation and management.<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/open?id=16MIWWPS8IDxnwXISw8OWCthG2Je__VQ-\">Click here to view<\/a><\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS304<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">COMPUTER NETWORKS<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">4<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">This course covers some of the fundamental topics relating to computer networks. Topics include: introduction to protocol layering, TCP\/IP architecture, circuit switching, packet switching, access networks, physical media, roles of different layers, data link layer (address resolution protocol, Wireless LAN’s, error detection and correction, etc.), network layer (routing versus forwarding, routing in the Internet, Internet Protocol, multicast routing, etc.), transport layer (TCP\/IP, UDP, principles of reliable data transfer, connection-oriented transport TCP, flow control and congestion control), application layer (world wide web, file transfer protocol, socket programming, etc.), network security, wireless and mobile networks.<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/open?id=1lNGbJo3QGcqslaU9Ezkgzf0waqKRasyt\">Click here to view<\/a><\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS305<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">SOFTWARE ENGINEERING<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">4<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">Topics include software processes (software development lifecycle), software process models and activities, modeling (requirements, design concepts and modeling), design and implementation (Object-oriented design using UML), implementation issues and use of design patterns, software testing (regression testing, Integration testing, test generation), software management (estimation techniques, Configuration management)<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/open?id=1NJX8HIvx-Rd7V2cLyqvYa8cex2bppZ0_\">Click here to view<\/a><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"2\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-7902\" aria-expanded=\"false\">PG Courses (catalog)<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-7902\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"2\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-7902\" tabindex=\"0\" hidden=\"hidden\"><!DOCTYPE html>\n<html lang=\"en\">\n<head>\n <meta charset=\"UTF-8\">\n <meta name=\"viewport\" content=\"width=device-width, initial-scale=1.0\">\n <style>\n body {\n font-family: Arial, sans-serif;\n margin: 0;\n padding: 0;\n box-sizing: border-box;\n }\n table {\n width: 100%;\n border-collapse: collapse;\n margin: 20px 0;\n }\n th, td {\n padding: 12px;\n text-align: left;\n border: 1px solid #ddd;\n vertical-align: top;\n }\n th {\n background-color: #f2f2f2;\n }\n h6 {\n font-size: 16px;\n margin: 10px 0;\n }\n a {\n color: #3498db;\n text-decoration: none;\n }\n a:hover {\n text-decoration: underline;\n }\n @media (max-width: 768px) {\n th, td {\n padding: 8px;\n }\n }\n @media (max-width: 480px) {\n th, td {\n display: block;\n width: 100%;\n box-sizing: border-box;\n text-align: justify;\n }\n th {\n background-color: transparent;\n padding-top: 10px;\n }\n td {\n padding-top: 0;\n }\n }\n <\/style>\n\n<h6>Core Course:<\/h6>\n<table>\n<thead>\n<tr>\n<th><strong>Code <\/strong><\/th>\n<th><strong>Course Name <\/strong><\/th>\n<th><strong>No. of Credit<\/strong><\/th>\n<th><strong>Curently Offerings(Yes\/No)<\/strong><\/th>\n<th><strong>Brief Description<\/strong><\/th>\n<th><strong>Course Template<\/strong><\/th>\n<\/tr>\n<\/thead>\n<tbody>\n<tr>\n<td>CS526<\/td>\n<td>Mathematical Foundations of Computer Science<\/td>\n<td>3<\/td>\n<td>–<\/td>\n<td>–<\/td>\n<td><a href=\"http:\/\/172.26.1.205\/courses#overlay-context=courses\" target=\"_blank\" rel=\"noopener\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS527<\/td>\n<td>Computer Systems<\/td>\n<td>3<\/td>\n<td>–<\/td>\n<td>–<\/td>\n<td><a href=\"http:\/\/172.26.1.205\/courses#overlay-context=courses\" target=\"_blank\" rel=\"noopener\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS509<\/td>\n<td>PG Software Lab<\/td>\n<td>3<\/td>\n<td><\/td>\n<td>–<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=17hSZxVT91jzkbjnasli0K0dwbkK935cm\" target=\"_blank\" rel=\"noopener\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS506<\/td>\n<td>Data Structure and Algorithms<\/td>\n<td>3<\/td>\n<td>–<\/td>\n<td>–<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=16nVwLsE6G4rUzh5ZAmyQcqJRPKbRSpeh\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS500<\/td>\n<td>PG Seminar in Computer Science<\/td>\n<td>–<\/td>\n<td>–<\/td>\n<td>–<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h6>Elective Course:<\/h6>\n<table>\n<tbody>\n<tr>\n<th>Code<\/th>\n<th>Course Name<\/th>\n<th>No. of Credit<\/th>\n<th>Curently Offerings(Yes\/No)<\/th>\n<th>Brief Description<\/th>\n<th><strong>Course Template<\/strong><\/th>\n<\/tr>\n<tr>\n<td>CS500 <\/td>\n<td>PG SEMINAR IN COMPUTER SCIENCE<\/td>\n<td><\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS501<\/td>\n<td>COMPUTATIONAL COMPLEXITY<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS502<\/td>\n<td>COMPUTATIONAL GEOMETRY<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS503<\/td>\n<td>MACHINE LEARNING<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td><\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1mWyVwCdAKtkYoru1vWzGF56EnF_d6Kj0\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS504<\/td>\n<td>ARTIFICIAL NEURAL NETWORK<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td><a href=\"http:\/\/172.26.1.205\/courses#overlay-context=courses\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS505<\/td>\n<td>DIGITAL IMAGING SYSTEMS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS506<\/td>\n<td>DATA STRUCTURES AND ALGORITHMS<\/td>\n<td>3<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=16nVwLsE6G4rUzh5ZAmyQcqJRPKbRSpeh\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS507<\/td>\n<td>MULTIMEDIA SYSTEMS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td>CS508<\/td>\n<td>FOUNDATIONS OF COMPUTER SCIENCE<\/td>\n<td>3<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1TqkQInSTMaMRKprKHREQ9txqEMDXZz0r\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS509<\/td>\n<td>PG SOFTWARE LAB<\/td>\n<td>3<\/td>\n<td>–<\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=17hSZxVT91jzkbjnasli0K0dwbkK935cm\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS510<\/td>\n<td>ADVANCED COMPUTER ARCHITECTURE<\/td>\n<td>4<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1xqb1CgybqMxcpgPQ88XB3eKl8sJo3Muu\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS511<\/td>\n<td>REAL TIME SYSTEMS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS512<\/td>\n<td>ARTIFICIAL INTELLIGENCE<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS513<\/td>\n<td>ALGORITHMS IN BIOINFORMATICS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS514<\/td>\n<td>COMPUTER SYSTEM SECURITY<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS515<\/td>\n<td>COMPUTER GRAPHICS<\/td>\n<td><\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS516<\/td>\n<td>WIRELESS AD-HOC NETWORKS<\/td>\n<td>4<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=10HY8pOhoUAX8VtXw0ImfYFhwLuLe-Hg1\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS517<\/td>\n<td>DIGITAL IMAGE PROCESSING & ANALYSIS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS518<\/td>\n<td>COMPUTER VISION<\/td>\n<td>4<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1K3twcEnBhWnGlO7ivT0ms5JXTWVu7lfT\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS519<\/td>\n<td>SYSTEM LEVEL DESIGN AND MODELLING<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS520<\/td>\n<td>DATABASE SYSTEM IMPLEMENTATION<\/td>\n<td>4<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1DKVMHMh6TDtWMZgWKfA5LQXq_dOucVGJ\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS521<\/td>\n<td>FUNDAMENTALS OF DATA SCIENCES<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS522<\/td>\n<td>SOCIAL NETWORKS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS523<\/td>\n<td>APPLIED CRYPTOGRAPHY<\/td>\n<td>4<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1RSV4MIAttRk2wkGeBuavjl12QTB9Wmdk\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS 524<\/td>\n<td>DATA MINING<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS 525<\/td>\n<td>post-quantum crypto<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS 526<\/td>\n<td>Mathematical Foundations of Computer Science<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS 527<\/td>\n<td>Computer Systems<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS 528<\/td>\n<td>Big Data Tools<\/td>\n<td><\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS 529<\/td>\n<td>Applied Artificial Intelligence<\/td>\n<td>4<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1BRzOYgBeNBSCozxDi-tWnHYUfl6r3lzZ\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS 530<\/td>\n<td>Multi Agent Systems<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS 532<\/td>\n<td>Security Analytics<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS 533<\/td>\n<td>Reinforcement Learning<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS 534<\/td>\n<td>Low Power Design<\/td>\n<td>3<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1Be44pa9NJVqSMhd6Cc-TWAdOfCE4yonq\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS 535<\/td>\n<td>Intro. to Game Theory and Mechanism Design<\/td>\n<td>4<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1pjS8QgG185PVdyK4tUuCFzf7CoCrSucC\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS 536<\/td>\n<td>GRAPH THEORY<\/td>\n<td>3<\/td>\n<td>–<\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1RZbi4VL8_uGuECWutRfhxNi0um7zpsCm\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS537<\/td>\n<td>Synthesis of Digital Systems<\/td>\n<td>4<\/td>\n<td>–<\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1OhKZqg8org7NxCgcw3_9IXGJPRVVNx5u\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS600<\/td>\n<td>INDEPENDENT STUDY<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS601<\/td>\n<td>APPROXIMATIONAL ALGORITHMS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS602<\/td>\n<td>RANDOMIZED ALGORITHMS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS603<\/td>\n<td>COMBINATORIAL OPTIMIZATIONS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS604<\/td>\n<td>ADVANCED OPERATING SYSTEMS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS605<\/td>\n<td>CONSTRAINT PROGRAMMING<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS606<\/td>\n<td>ADVANCED SOFTWARE ARCHITECTURE<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS607<\/td>\n<td>ADVANCED TOPICS IN CONTEMPRORY COMPUTING PLATFORMS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS608<\/td>\n<td>ADVANCED TOPICS IN INTERNET TECHNOLOGIES<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS609<\/td>\n<td>NETWORK SCIENCE<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS610<\/td>\n<td>ALGORITHMS EXEMPLIFIED<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS612<\/td>\n<td>ADVANCED MACHINE LEARNING<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1-2IvdcRZHovDCMZfpO5oqFDPLTj7H8Kf\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS613<\/td>\n<td>GAME THEORY IN WIRELESS NETWORKS<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS615<\/td>\n<td>BIOMEDICAL IMAGE PROCESSING & ANALYSIS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS616<\/td>\n<td>ADVANCED COMPUTER VISION<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS617<\/td>\n<td>AFFECTIVE COMPUTING & INTERACTION<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS618<\/td>\n<td>ARTIFICIAL NEURAL NETWORKS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS619<\/td>\n<td>ADVANCED ALGORITHMS<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS620<\/td>\n<td>INTRODUCTION TO SPATIAL COMPUTING<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS621<\/td>\n<td>PROBABILISTIC GRAPHICAL MODELS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS622<\/td>\n<td>ADVANCED IMAGE PROCESSING<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1Ne8BK502-v_n5z-5PB4nL36jsDcIOjXY\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS698<\/td>\n<td>M.TECH. PROJECT \u2013I<\/td>\n<td>12<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS699<\/td>\n<td>M.TECH. PROJECT-II<\/td>\n<td><\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS 724<\/td>\n<td>ADVANCED DATA MINING<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1XGIkv9ua-u0NJwYt2KN_RfYwmTKX9Q-P\">Click here to View<\/a><\/td>\n<\/tr>\n<\/tbody>\n<\/table><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"3\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-7903\" aria-expanded=\"false\">PG Courses (AI)<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-7903\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"3\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-7903\" tabindex=\"0\" hidden=\"hidden\"><!DOCTYPE html>\n<html lang=\"en\">\n<head>\n <meta charset=\"UTF-8\">\n <meta name=\"viewport\" content=\"width=device-width, initial-scale=1.0\">\n <title>Programme Structure<\/title>\n <style>\n body {\n font-family: Arial, sans-serif;\n margin: 20px;\n padding: 0;\n line-height: 1.6;\n }\n .container {\n max-width: 1200px;\n margin: 0 auto;\n padding: 15px;\n }\n h2 {\n text-align: center;\n margin-bottom: 20px;\n }\n .section {\n margin-bottom: 40px;\n }\n table {\n width: 100%;\n border-collapse: collapse;\n margin-bottom: 20px;\n }\n table, th, td {\n border: 1px solid #ddd;\n }\n th, td {\n padding: 10px;\n text-align: left;\n }\n th {\n background-color: #f4f4f4;\n }\n @media screen and (max-width: 768px) {\n table, tbody, th, td, tr {\n display: block;\n }\n td {\n text-align: right;\n padding-left: 50%;\n position: relative;\n }\n td::before {\n content: attr(data-label);\n position: absolute;\n left: 10px;\n width: 50%;\n padding-right: 10px;\n white-space: nowrap;\n text-align: left;\n }\n }\n <\/style>\n<\/head>\n<tbody>\n<tr>\n<td colspan=\"2\">Programme structure\n\n<strong>Overall Structure of the Program<\/strong>\n<ul>\n \t<li><strong>Specialization Core<\/strong> (20\/22 credits):\n<ul>\n \t<li>CSE Core 14 credits\u00a0\u00a0+ at least 2 courses from Appendix A (i.e list of AI program core courses.<\/li>\n<\/ul>\n<\/li>\n \t<li><strong>Elective Course credits <\/strong>(11 or more credits)\n<ul>\n \t<li><strong>Specialization electives<\/strong>:\u00a0At least 3 other courses from Appendix B (i.e.\u00a0 list of AI program electives.<\/li>\n \t<li><strong>Department\/Open Elective<\/strong>: One additional course i.e. 3\/4 additional credits (any PG elective course). Even non-CSE PG course can be considered but with due approval from CSE RPEC and CSE HoD.<\/li>\n<\/ul>\n<\/li>\n \t<li><strong>MTech\u00a0Project <\/strong>(30 credits) :\n<ul>\n \t<li>One can register for the MTech project component only after successfully completing at least 21 course credits<\/li>\n \t<li><strong>MTech Project: <\/strong>Student interested in obtaining this specialization <strong>must undertake a MTech project in the area of Artificial Intelligence (or its allied areas, refer item 14)<\/strong><\/li>\n<\/ul>\n<\/li>\n<\/ul>\nStudents will\u00a0 be encouraged to take up interdisciplinary projects for fulfilling their MTP requirements. Relevance of this project with the theme of specialization would be decided by the steering committee of this specialization.\n<ul>\n \t<li>For the summer short semester, registration in non credited summer project or doing internship in an Industry is a mandatory component for the degree completion.<\/li>\n<\/ul>\n<em>Max number of credits one can register in a semester = 24\u00a0 <\/em>\n\n<strong>Semester I <\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>Sno <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CS506<\/td>\n<td>Data Structures and Algorithms<\/td>\n<td>3-1-2-6-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CS526<\/td>\n<td>Mathematics for Computer Science<\/td>\n<td>3-1-0-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>3<\/td>\n<td>CS527<\/td>\n<td>Computer Systems<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>4<\/td>\n<td>CS509<\/td>\n<td>PG Software Lab<\/td>\n<td>0-0-6-6-3<\/td>\n<td>3 or 4<\/td>\n<\/tr>\n<tr>\n<td>5<\/td>\n<td>XXXXX<\/td>\n<td>Elective I<\/td>\n<td>——<\/td>\n<td>3 or 4<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<strong>Semester II <\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>S.no <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CSXXX<\/td>\n<td>AI Program core I<\/td>\n<td>——<\/td>\n<td>3 or 4<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CSXXX<\/td>\n<td>AI Program core II<\/td>\n<td>——<\/td>\n<td>3 or 4<\/td>\n<\/tr>\n<tr>\n<td>3<\/td>\n<td>CSXXX<\/td>\n<td>Elective II<\/td>\n<td>——<\/td>\n<td>3 or 4<\/td>\n<\/tr>\n<tr>\n<td>4<\/td>\n<td>CSXXX<\/td>\n<td>Elective III<\/td>\n<td>——<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>5<\/td>\n<td>XXXXX<\/td>\n<td>Elective IV<\/td>\n<td>——<\/td>\n<td>3 or 4<\/td>\n<\/tr>\n<tr>\n<td>6<\/td>\n<td>CS500<\/td>\n<td>PG Seminar in Compute Science<\/td>\n<td>—–<\/td>\n<td>0 (S\/U)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<strong>Semester III<\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>S.no <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CS551<\/td>\n<td>Colloquium Series<\/td>\n<td>—–<\/td>\n<td>\u00a00 (S\/U)<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CS699<\/td>\n<td>PROJECT-I<\/td>\n<td>0-0-28-14-14<\/td>\n<td>14<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<strong>Semester IV <\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>S.no <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CS555<\/td>\n<td>PG Seminar-2 (Topics specific to one\u2019s research project)<\/td>\n<td>—–<\/td>\n<td>0 (S\/U)<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CS799<\/td>\n<td>Project-2<\/td>\n<td>0-0-32-16-16<\/td>\n<td>16<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n <\/td>\n<\/tr>\n<tr>\n<td>Area of Research for Internship\/ Project :\n\n <\/td>\n<td>Core topics in Artificial Intelligence (AI), Machine Learning (ML) and Data Mining (DM). Applications of AI\/ML\/DM in areas such as Internet of Things, Computer Vision and Image processing are also included.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<strong>Appendix A- List of AI Program Core <\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>S.no <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CS503<\/td>\n<td>Machine Learning<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CS512<\/td>\n<td>Artificial Intelligence<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>3<\/td>\n<td>CS521<\/td>\n<td>Fundamentals of Data Sciences<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>4<\/td>\n<td>CS524<\/td>\n<td>Data Mining<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>5<\/td>\n<td>CS504<\/td>\n<td>Artificial Neural Networks (Deep Learning)<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>6<\/td>\n<td>CS533<\/td>\n<td>Reinforcement learning<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<strong>Appendix B- List of AI Program Electives (at least 3 other courses from this list) <\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>S.no <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CS503<\/td>\n<td>Machine Learning<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CS504<\/td>\n<td>Artificial Neural Networks<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>3<\/td>\n<td>CS507<\/td>\n<td>Multimedia System<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>4<\/td>\n<td>CS512<\/td>\n<td>Artificial Intelligence<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>5<\/td>\n<td>CS512<\/td>\n<td>Artificial Intelligence<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>6<\/td>\n<td>CS517<\/td>\n<td>Digital Image Processing and Analysis<\/td>\n<td>2-1-2-4-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>7<\/td>\n<td>CS518<\/td>\n<td>Computer Vision<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>8<\/td>\n<td>CS521<\/td>\n<td>Fundamentals of Data Science<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>9<\/td>\n<td>CS522<\/td>\n<td>Social Computing and Networks<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>10<\/td>\n<td>CS524<\/td>\n<td>Data Mining<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>11<\/td>\n<td>CS530<\/td>\n<td>Autonomous MultiAgent Systems<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>12<\/td>\n<td>CS532<\/td>\n<td>Security Analytics<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>13<\/td>\n<td>CS533<\/td>\n<td>Reinforcement Learning<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>14<\/td>\n<td>CS535<\/td>\n<td>Introduction To Game Theory And Mechanism Design<\/td>\n<td>3-1-0-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>15<\/td>\n<td>CS539<\/td>\n<td>Internet of Things<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>16<\/td>\n<td>CS545<\/td>\n<td>Computer Graphics Lab<\/td>\n<td>0-0-2-1-1<\/td>\n<td>1<\/td>\n<\/tr>\n<tr>\n<td>17<\/td>\n<td>CS612<\/td>\n<td>Advanced Machine Learning<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>18<\/td>\n<td>CS615<\/td>\n<td>Biomedical Image Processing & Analysis<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>19<\/td>\n<td>CS616<\/td>\n<td>Advanced Computer Vision<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>20<\/td>\n<td>CS617<\/td>\n<td>Affective Computing and Interaction<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>21<\/td>\n<td>CS621<\/td>\n<td>Probabilistic Graphical Models<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>22<\/td>\n<td>CS623<\/td>\n<td>Multimedia Surveillance Systems<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>23<\/td>\n<td>CS720<\/td>\n<td>Advanced Spatial Computing<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>24<\/td>\n<td>CS724<\/td>\n<td>Advanced Data Mining<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>25<\/td>\n<td>CS546<\/td>\n<td>INTRODUCTION TO CYBER PHYSICAL SYSTEMS<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<\/tbody>\n<\/table><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"4\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-7904\" aria-expanded=\"false\">PG Courses (CSE)<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-7904\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"4\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-7904\" tabindex=\"0\" hidden=\"hidden\"><!DOCTYPE html>\n<html lang=\"en\">\n<head>\n <meta charset=\"UTF-8\">\n <meta name=\"viewport\" content=\"width=device-width, initial-scale=1.0\">\n <title>Programme Structure<\/title>\n <style>\n body {\n font-family: Arial, sans-serif;\n margin: 20px;\n padding: 0;\n line-height: 1.6;\n }\n .container {\n max-width: 1200px;\n margin: 0 auto;\n padding: 15px;\n }\n h2 {\n text-align: center;\n margin-bottom: 20px;\n }\n .section {\n margin-bottom: 40px;\n }\n table {\n width: 100%;\n border-collapse: collapse;\n margin-bottom: 20px;\n }\n table, th, td {\n border: 1px solid #ddd;\n }\n th, td {\n padding: 10px;\n text-align: left;\n }\n th {\n background-color: #f4f4f4;\n }\n @media screen and (max-width: 768px) {\n table, tbody, th, td, tr {\n display: block;\n }\n td {\n text-align: right;\n padding-left: 50%;\n position: relative;\n }\n td::before {\n content: attr(data-label);\n position: absolute;\n left: 10px;\n width: 50%;\n padding-right: 10px;\n white-space: nowrap;\n text-align: left;\n }\n }\n <\/style>\n<\/head>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td colspan=\"2\">Programme structure\u00a0 ( <strong>Overall Structure of the Program)<\/strong>\n\nSummary details of the Program Structure:\n<ul>\n \t<li><strong>Core Courses credits : 14 credits <\/strong><\/li>\n \t<li><strong>Elective course credits: 16 credits or more <\/strong>as per following conditions:\n<ul>\n \t<li>Any PG course offered in the CSE department.<\/li>\n \t<li>Atmost one non-CSE PG course (with due approval from CSE RPEC and CSE HoD) can be considered.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<ul>\n \t<li><strong>30<\/strong><strong> credits<\/strong> for the <strong>Project work <\/strong>course.\n<ul>\n \t<li>Project should be taken in CSE domain. One can register for the MTech project component only after successfully completing at least 21 course credits<\/li>\n \t<li>For the summer short semester, registration in non credited summer project or doing internship in an Industry is mandatory component for the degree completion<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<strong>Semester I <\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>Sno <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CS506<\/td>\n<td>Data Structures and Algorithms<\/td>\n<td>3-1-2-6-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CS526<\/td>\n<td>Mathematics for Computer Science<\/td>\n<td>3-1-0-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>3<\/td>\n<td>CS527<\/td>\n<td>Computer Systems<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>4<\/td>\n<td>CS509<\/td>\n<td>PG Software Lab<\/td>\n<td>0-0-6-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<strong>Semester II <\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>S.no <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CSXXX<\/td>\n<td>Elective I<\/td>\n<td>——<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CSXXX<\/td>\n<td>Elective II<\/td>\n<td>——<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>3<\/td>\n<td>CSXXX<\/td>\n<td>Elective III<\/td>\n<td>——<\/td>\n<td>3 or 4<\/td>\n<\/tr>\n<tr>\n<td>4<\/td>\n<td>CSXXX<\/td>\n<td>Elective IV<\/td>\n<td>——<\/td>\n<td>3 or 4<\/td>\n<\/tr>\n<tr>\n<td>5<\/td>\n<td>XXXX<\/td>\n<td>Elective V<\/td>\n<td>——<\/td>\n<td>3 or 4<\/td>\n<\/tr>\n<tr>\n<td>6<\/td>\n<td>CS500<\/td>\n<td>PG Seminar-1<\/td>\n<td>——<\/td>\n<td>0 (S\/U)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n \n\n<strong>Semester III <\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>S.no <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CS551<\/td>\n<td>Colloquium Series<\/td>\n<td>——<\/td>\n<td>0 (S\/U)<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CS699<\/td>\n<td>Project-1<\/td>\n<td>0-0-28-14-14<\/td>\n<td>14<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<strong>Semester IV <\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>S.no <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CS555<\/td>\n<td>PG Seminar-2<\/td>\n<td>——<\/td>\n<td>0 (S\/U)<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CS799<\/td>\n<td>Project-2 (Topics specific to one\u2019s research project)<\/td>\n<td>0-0-32-16-16<\/td>\n<td>16<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n <\/td>\n<\/tr>\n<tr>\n<td>Area of Research for Internship\/ Project :<\/td>\n<td>Project should done in one of the core topics in computer science and engineering domain. These topics largely span across theory, systems and applications branches of CSE.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<strong>Appendix A: List of CSE Electives**<\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>S.no <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CS503<\/td>\n<td>Machine Learning<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CS504<\/td>\n<td>Artificial Neural Networks<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>3<\/td>\n<td>CS505<\/td>\n<td>Digital Imaging Systems<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>4<\/td>\n<td>CS507<\/td>\n<td>Multimedia System<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>5<\/td>\n<td>CS510<\/td>\n<td>Advanced Computer Architecture<\/td>\n<td>3-1-0-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>6<\/td>\n<td>CS511<\/td>\n<td>Real Time Systems<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>7<\/td>\n<td>CS512<\/td>\n<td>Artificial Intelligence<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>8<\/td>\n<td>CS515<\/td>\n<td>Computer Graphics<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>9<\/td>\n<td>CS516<\/td>\n<td>Wireless Ad-Hoc Networks<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>10<\/td>\n<td>CS517<\/td>\n<td>Digital Image Processing and Analysis<\/td>\n<td>2-1-2-4-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>11<\/td>\n<td>CS518<\/td>\n<td>Computer Vision<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>12<\/td>\n<td>CS519<\/td>\n<td>System Level Design And Modelling<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>13<\/td>\n<td>CS520<\/td>\n<td>Database System Implementatio<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>14<\/td>\n<td>CS521<\/td>\n<td>Fundamentals of Data Science<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>15<\/td>\n<td>CS522<\/td>\n<td>Social Computing and Networks<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>16<\/td>\n<td>CS523<\/td>\n<td>Applied Cryptography<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>17<\/td>\n<td>CS524<\/td>\n<td>Data Mining<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>18<\/td>\n<td>CS525<\/td>\n<td>Post-Quantum Crypto<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>19<\/td>\n<td>CS530<\/td>\n<td>Autonomous MultiAgent Systems<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>20<\/td>\n<td>CS533<\/td>\n<td>Reinforcement Learning<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>21<\/td>\n<td>CS535<\/td>\n<td>Introduction To Game Theory And Mechanism Design<\/td>\n<td>3-1-0-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>22<\/td>\n<td>CS539<\/td>\n<td>Internet of Things<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>23<\/td>\n<td>CS540<\/td>\n<td>Cryptocurrencies and Blockchain Technology<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>24<\/td>\n<td>CS545<\/td>\n<td>Computer Graphics Lab<\/td>\n<td>0-0-2-1-1<\/td>\n<td>1<\/td>\n<\/tr>\n<tr>\n<td>25<\/td>\n<td>CS601<\/td>\n<td>Approximation Algorithms<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>26<\/td>\n<td>CS602<\/td>\n<td>Randomized Algorithms<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>27<\/td>\n<td>CS603<\/td>\n<td>Combinatorial Optimizations<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>28<\/td>\n<td>CS604<\/td>\n<td>Advanced Operating Systems<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>29<\/td>\n<td>CS606<\/td>\n<td>Advanced Software Architecture<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>30<\/td>\n<td>CS607<\/td>\n<td>Contemporary Computing Platforms<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>31<\/td>\n<td>CS608<\/td>\n<td>Topics in Internet Technologies<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>32<\/td>\n<td>CS612<\/td>\n<td>Advanced Machine Learning<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>33<\/td>\n<td>CS615<\/td>\n<td>Biomedical Image Processing & Analysis<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>34<\/td>\n<td>CS616<\/td>\n<td>Advanced Computer Vision<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>35<\/td>\n<td>CS617<\/td>\n<td>Affective Computing and Interaction<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>36<\/td>\n<td>CS620<\/td>\n<td>Introduction to Spatial Computing<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>37<\/td>\n<td>CS621<\/td>\n<td>Probabilistic Graphical Models<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>38<\/td>\n<td>CS622<\/td>\n<td>Advanced Image Processing<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>39<\/td>\n<td>CS623<\/td>\n<td>Multimedia Surveillance Systems<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>40<\/td>\n<td>CS701<\/td>\n<td>Special Topics in Complex Networks<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>41<\/td>\n<td>CS702<\/td>\n<td>Special Topics in Social Computing<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>42<\/td>\n<td>CS720<\/td>\n<td>Advanced Spatial Computing<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>43<\/td>\n<td>CS724<\/td>\n<td>Advanced Data Mining<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<\/tbody>\n<\/table><\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-bcffde2 e-flex e-con-boxed e-con e-parent\" data-id=\"bcffde2\" data-element_type=\"container\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"<p>UG Courses (catalog) PG Courses (catalog) PG Courses (AI) PG Courses (CSE) UG Courses (catalog)…<\/p>\n<div class=\"visionwp-site-button\"><a href=\"https:\/\/cse.iitrpr.ac.in\/?page_id=317\" class=\"visionwp-primary-button\">Read More <i class=\"fa fa-long-arrow-right\"><\/i><\/a><\/div>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"elementor_header_footer","meta":{"footnotes":""},"class_list":["post-317","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/cse.iitrpr.ac.in\/index.php?rest_route=\/wp\/v2\/pages\/317","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/cse.iitrpr.ac.in\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/cse.iitrpr.ac.in\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/cse.iitrpr.ac.in\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/cse.iitrpr.ac.in\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=317"}],"version-history":[{"count":70,"href":"https:\/\/cse.iitrpr.ac.in\/index.php?rest_route=\/wp\/v2\/pages\/317\/revisions"}],"predecessor-version":[{"id":2115,"href":"https:\/\/cse.iitrpr.ac.in\/index.php?rest_route=\/wp\/v2\/pages\/317\/revisions\/2115"}],"wp:attachment":[{"href":"https:\/\/cse.iitrpr.ac.in\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=317"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}

\n\n\n \n \n Responsive Course Table<\/title>\n <style>\n body {\n font-family: Arial, sans-serif;\n }\n h2 {\n text-align: center;\n }\n .table-container {\n overflow-x: auto;\n margin: 20px;\n }\n table {\n width: 100%;\n border-collapse: collapse;\n margin-bottom: 20px;\n }\n th, td {\n border: 1px solid #ddd;\n padding: 8px;\n text-align: left;\n vertical-align: top;\n }\n th {\n background-color: #f2f2f2;\n }\n td a {\n color: #007BFF;\n text-decoration: none;\n }\n td a:hover {\n text-decoration: underline;\n }\n .code-col {\n width: 10%;\n }\n .course-name-col {\n width: 20%;\n }\n .credit-col {\n width: 10%;\n }\n .topics-col {\n width: 40%;\n text-align: justify;\n }\n .template-col {\n width: 20%;\n }\n @media screen and (max-width: 768px) {\n table, thead, tbody, th, td, tr {\n display: block;\n }\n thead tr {\n display: none;\n }\n tr {\n margin-bottom: 15px;\n }\n td {\n text-align: right;\n padding-left: 50%;\n position: relative;\n }\n td::before {\n content: attr(data-label);\n position: absolute;\n left: 0;\n width: 50%;\n padding-left: 15px;\n font-weight: bold;\n text-align: left;\n white-space: nowrap;\n }\n .code-col, .course-name-col, .credit-col, .topics-col, .template-col {\n width: 100%;\n }\n }\n <\/style>\n<h6>Core Course:<\/h6>\n<div class=\"table-container\">\n<table>\n<thead>\n<tr>\n<th class=\"code-col\">Code<\/th>\n<th class=\"course-name-col\">Course Name<\/th>\n<th class=\"credit-col\">No. of Credit<\/th>\n<th class=\"topics-col\">Brief List of Topics<\/th>\n<th class=\"template-col\">Detailed Course Template<\/th>\n<\/tr>\n<\/thead>\n<tbody>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS110<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">DISCRETE MATHEMATICAL STRUCTURES<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">3<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">Topics include sets, relations, functions, logic and proofs, mathematical induction, combinatorics and basic graph theory.<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\">–<\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS201<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">DATA STRUCTURES<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">4<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">This course introduces the basics of data structures and algorithms. Topics span across basic data structures (e.g., arrays, stacks, linked lists, queues, heaps, etc.), algorithm analysis (e.g., asymptotic analysis, master theorem, etc.), search Trees (e.g., AVL Trees, redblack trees, etc.), sorting (e.g., quick sort, linear time sorting, order statistics, etc.), hashing (e.g., dictionaries, tries, etc.) and Graphs (e.g., graph data structures, graph traversal algorithms such as BFS and DFS, minimum spanning Tree, shortest path algorithms, etc.)<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/open?id=1eH9DtnPSLZZG0K1W--3VnBEG0dA5JnzG\">Click here to view<\/a><\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS202<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">PROGRAMMING PARADIGMS AND PRAGMATICS<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">4<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">Introduction: Motivation to study concepts of programming languages and introduction to major language families Compiler Design: Introduction to Regular Expressions, Syntax Analysis, Lexical Analysis. Implementation using Lex\/Yacc. Foundations: Covers fundamental semantic issues of variables with emphasis on Names, Binding,Scope, Lifetime and Type Checking , Core Design Constructs: Covers issues that lie at the core of most programming languages: Data Types, Control Flow, Subroutines, Abstraction & Object Orientation, Alternative Programming Models:Introduction to Functional and Logic Programming Languages, Concurrency: Basic introduction to the fundamentals of Concurrency including communication, synchronization, creation and implementation of threads.<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/open?id=1QI3KDG9mmfTPUZVqgXJHc1W-cGqGLK2N\">Click here to view<\/a><\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS203<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">DIGITAL LOGIC DESIGN<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">4<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">Digital System: Introduction to digital logic and digital system, digital logic states, number systems,Boolean algebra and logic minimization: Boolean functions, expressions, minimizations of Boolean functions, K maps, QM method, two level and multiple level logic. Combinational logic design: Basic components: adder, multiplexer, decoder, ROMs, programmable logic, Introduction to HDL and FPGA. Arithmetic circuits. Synchronous sequential logic design: Flip-flops and latches, finite state machines \u2013 mealy and moore, state assignment and state minimizations. Counters, registers, and memories. Top down approach of digital design: Data path-control path design, register transfer level design, pipelining and parallelism. Case studies. Advanced issues in digital design: Parallelism, IP blocks and reuse,timing issues, faults and testing. Technology aspects: FPGA and ASICs, logic mapping and binding, introduction to logic synthesis and EDA tools<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/file\/d\/1OI40eTfUN7AONTx-sqFeClQpAAwfe4hH\/view?usp=drive_link\">Click here to view<\/a><\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS302<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">ANALYSIS AND DESIGN OF ALGORITHMS<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">3<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">This course goes deep into the design and analysis of algorithms. Topics include: advanced data structures (e.g., interval and range trees, segment trees, splay trees), divide and conquer techniques (e.g., karatsuba integer multiplication algorithm, mergesort, strassen\u2019s matrix multiplication algorithm, fast fourier transform, etc.), dynamic programming (e.g., longest increasing subsequence, knapsack problem, matrix chain multiplication, bellman-Ford and Floyd-Warshall algorithms, etc.), greedy algorithms (e.g., minimum spanning trees, huffman coding, etc.), network flows (e.g., ford-fulkerson algorithm, bipartite matching, etc.), NP-completeness reductions and miscellaneous algorithms (e.g., number-theoretic algorithms, euclid’s algorithm, modular arithmetic, etc.)<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/open?id=1rYRb9CSGsrVquYAH2qBBgSSi2z-CDCtL\">Click here to view<\/a><\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS306<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">THEORY OF COMPUTATION<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">3<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">This course provides an introduction to the foundations of theoretical computer science. Topics include automata theory (finite automata, regular expressions, context-free grammars, and pushdown automata), computability theory (Turing machines, decidability, and the halting problem), and complexity theory (time and space complexity, P vs NP, and NP-completeness).<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/open?id=1t4lh5ik2VRYp7DC-D_XECfa6yog-vpSN\">Click here to view<\/a><\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS307<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">COMPUTER ORGANIZATION AND ARCHITECTURE<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">4<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">Introduction: Computer Organization and computer architecture, review of fundamentals of digital logic design. Arithmetic Logic Unit: Arithmetic operations on binary numbers, ALU design, floating point arithmetic. Processor Design: Introduction to instruction set architecture, addressing modes and formats, instruction set encoding, instruction execution cycle. Pipeline design: Pipeline processor, hazard detection, hazard avoidance and hazard resolution techniques, data hazards and pipeline interlock, data forwarding, branch hazards, branch prediction, control hazards. Memory design: Memory organization, Virtual memory, Cache memory, memory level parallelism, cache coherence, shared memory multiprocessors, multithreaded processors. Input\/output devices and interaction: Input output devices, interrupt handling, storage and I\/O devices, performance considerations. Advanced architectural techniques: Instruction level parallelism, static and dynamic branch prediction, code scheduling, out of order execution, speculative execution, hardware multithreading, VLIW processor, software pipelining, memory system prospective: Memory hierarchy, cache memory, memory level parallelism, multiple memory banks, advanced cache memory designs. Parallel and multi core processors: Flynn\u2019s taxonomy, review of contemporary processors and multicore architectures. Review of advances in computer architecture and special topics: RISC\/CISC debate, power awareness, real world case studies. Introduction to research papers in computer architecture and case studies. Current research areas and course summary. Laboratory Experiments: 1. Design and implementation of a functional unit of a single cycle processor. 2. Design and implementation of a functional unit of a pipelined processor. 3. Design and implementation of a functional unit of a multicore processor. 4. Case study on a given processor architecture and their code optimizations. System prospective: Input\/output devices, DMA, busses and interconnect system on chip, multi processors.<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/open?id=11GilHe0p7D2Gk4fv850y_1qtClP-4xk4\">Click here to view<\/a><\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS301<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">DATABASES<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">4<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">This course covers some of the fundamental topics relating to Database Systems including relational model, SQL queries, ER models, functional dependency theory, normalization, file structures, index structures, query processing algorithms, query optimization, transaction processing and some trend topics (e.g., Data Warehousing, Deductive databases, etc.).<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/open?id=1dCRzMZXmhSPF38fTlDE8k1eFbVTWJs81\">Click here to view<\/a><\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS303<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">OPERATING SYSTEMS<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">4<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">This course covers some of the fundamental topics relating to Operating Systems. Topics include processes (process concept, multithreading and Scheduling), synchronization techniques, memory management techniques, file systems, Input\/output implementation and management.<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/open?id=16MIWWPS8IDxnwXISw8OWCthG2Je__VQ-\">Click here to view<\/a><\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS304<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">COMPUTER NETWORKS<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">4<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">This course covers some of the fundamental topics relating to computer networks. Topics include: introduction to protocol layering, TCP\/IP architecture, circuit switching, packet switching, access networks, physical media, roles of different layers, data link layer (address resolution protocol, Wireless LAN’s, error detection and correction, etc.), network layer (routing versus forwarding, routing in the Internet, Internet Protocol, multicast routing, etc.), transport layer (TCP\/IP, UDP, principles of reliable data transfer, connection-oriented transport TCP, flow control and congestion control), application layer (world wide web, file transfer protocol, socket programming, etc.), network security, wireless and mobile networks.<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/open?id=1lNGbJo3QGcqslaU9Ezkgzf0waqKRasyt\">Click here to view<\/a><\/td>\n<\/tr>\n<tr>\n<td class=\"code-col\" data-label=\"Code\">CS305<\/td>\n<td class=\"course-name-col\" data-label=\"Course Name\">SOFTWARE ENGINEERING<\/td>\n<td class=\"credit-col\" data-label=\"No. of Credit\">4<\/td>\n<td class=\"topics-col\" data-label=\"Brief List of Topics\">Topics include software processes (software development lifecycle), software process models and activities, modeling (requirements, design concepts and modeling), design and implementation (Object-oriented design using UML), implementation issues and use of design patterns, software testing (regression testing, Integration testing, test generation), software management (estimation techniques, Configuration management)<\/td>\n<td class=\"template-col\" data-label=\"Detailed Course Template\"><a href=\"https:\/\/drive.google.com\/open?id=1NJX8HIvx-Rd7V2cLyqvYa8cex2bppZ0_\">Click here to view<\/a><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"2\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-7902\" aria-expanded=\"false\">PG Courses (catalog)<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-7902\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"2\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-7902\" tabindex=\"0\" hidden=\"hidden\"><!DOCTYPE html>\n<html lang=\"en\">\n<head>\n <meta charset=\"UTF-8\">\n <meta name=\"viewport\" content=\"width=device-width, initial-scale=1.0\">\n <style>\n body {\n font-family: Arial, sans-serif;\n margin: 0;\n padding: 0;\n box-sizing: border-box;\n }\n table {\n width: 100%;\n border-collapse: collapse;\n margin: 20px 0;\n }\n th, td {\n padding: 12px;\n text-align: left;\n border: 1px solid #ddd;\n vertical-align: top;\n }\n th {\n background-color: #f2f2f2;\n }\n h6 {\n font-size: 16px;\n margin: 10px 0;\n }\n a {\n color: #3498db;\n text-decoration: none;\n }\n a:hover {\n text-decoration: underline;\n }\n @media (max-width: 768px) {\n th, td {\n padding: 8px;\n }\n }\n @media (max-width: 480px) {\n th, td {\n display: block;\n width: 100%;\n box-sizing: border-box;\n text-align: justify;\n }\n th {\n background-color: transparent;\n padding-top: 10px;\n }\n td {\n padding-top: 0;\n }\n }\n <\/style>\n\n<h6>Core Course:<\/h6>\n<table>\n<thead>\n<tr>\n<th><strong>Code <\/strong><\/th>\n<th><strong>Course Name <\/strong><\/th>\n<th><strong>No. of Credit<\/strong><\/th>\n<th><strong>Curently Offerings(Yes\/No)<\/strong><\/th>\n<th><strong>Brief Description<\/strong><\/th>\n<th><strong>Course Template<\/strong><\/th>\n<\/tr>\n<\/thead>\n<tbody>\n<tr>\n<td>CS526<\/td>\n<td>Mathematical Foundations of Computer Science<\/td>\n<td>3<\/td>\n<td>–<\/td>\n<td>–<\/td>\n<td><a href=\"http:\/\/172.26.1.205\/courses#overlay-context=courses\" target=\"_blank\" rel=\"noopener\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS527<\/td>\n<td>Computer Systems<\/td>\n<td>3<\/td>\n<td>–<\/td>\n<td>–<\/td>\n<td><a href=\"http:\/\/172.26.1.205\/courses#overlay-context=courses\" target=\"_blank\" rel=\"noopener\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS509<\/td>\n<td>PG Software Lab<\/td>\n<td>3<\/td>\n<td><\/td>\n<td>–<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=17hSZxVT91jzkbjnasli0K0dwbkK935cm\" target=\"_blank\" rel=\"noopener\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS506<\/td>\n<td>Data Structure and Algorithms<\/td>\n<td>3<\/td>\n<td>–<\/td>\n<td>–<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=16nVwLsE6G4rUzh5ZAmyQcqJRPKbRSpeh\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS500<\/td>\n<td>PG Seminar in Computer Science<\/td>\n<td>–<\/td>\n<td>–<\/td>\n<td>–<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h6>Elective Course:<\/h6>\n<table>\n<tbody>\n<tr>\n<th>Code<\/th>\n<th>Course Name<\/th>\n<th>No. of Credit<\/th>\n<th>Curently Offerings(Yes\/No)<\/th>\n<th>Brief Description<\/th>\n<th><strong>Course Template<\/strong><\/th>\n<\/tr>\n<tr>\n<td>CS500 <\/td>\n<td>PG SEMINAR IN COMPUTER SCIENCE<\/td>\n<td><\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS501<\/td>\n<td>COMPUTATIONAL COMPLEXITY<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS502<\/td>\n<td>COMPUTATIONAL GEOMETRY<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS503<\/td>\n<td>MACHINE LEARNING<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td><\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1mWyVwCdAKtkYoru1vWzGF56EnF_d6Kj0\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS504<\/td>\n<td>ARTIFICIAL NEURAL NETWORK<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td><a href=\"http:\/\/172.26.1.205\/courses#overlay-context=courses\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS505<\/td>\n<td>DIGITAL IMAGING SYSTEMS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS506<\/td>\n<td>DATA STRUCTURES AND ALGORITHMS<\/td>\n<td>3<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=16nVwLsE6G4rUzh5ZAmyQcqJRPKbRSpeh\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS507<\/td>\n<td>MULTIMEDIA SYSTEMS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td>CS508<\/td>\n<td>FOUNDATIONS OF COMPUTER SCIENCE<\/td>\n<td>3<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1TqkQInSTMaMRKprKHREQ9txqEMDXZz0r\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS509<\/td>\n<td>PG SOFTWARE LAB<\/td>\n<td>3<\/td>\n<td>–<\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=17hSZxVT91jzkbjnasli0K0dwbkK935cm\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS510<\/td>\n<td>ADVANCED COMPUTER ARCHITECTURE<\/td>\n<td>4<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1xqb1CgybqMxcpgPQ88XB3eKl8sJo3Muu\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS511<\/td>\n<td>REAL TIME SYSTEMS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS512<\/td>\n<td>ARTIFICIAL INTELLIGENCE<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS513<\/td>\n<td>ALGORITHMS IN BIOINFORMATICS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS514<\/td>\n<td>COMPUTER SYSTEM SECURITY<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS515<\/td>\n<td>COMPUTER GRAPHICS<\/td>\n<td><\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS516<\/td>\n<td>WIRELESS AD-HOC NETWORKS<\/td>\n<td>4<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=10HY8pOhoUAX8VtXw0ImfYFhwLuLe-Hg1\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS517<\/td>\n<td>DIGITAL IMAGE PROCESSING & ANALYSIS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS518<\/td>\n<td>COMPUTER VISION<\/td>\n<td>4<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1K3twcEnBhWnGlO7ivT0ms5JXTWVu7lfT\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS519<\/td>\n<td>SYSTEM LEVEL DESIGN AND MODELLING<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS520<\/td>\n<td>DATABASE SYSTEM IMPLEMENTATION<\/td>\n<td>4<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1DKVMHMh6TDtWMZgWKfA5LQXq_dOucVGJ\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS521<\/td>\n<td>FUNDAMENTALS OF DATA SCIENCES<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS522<\/td>\n<td>SOCIAL NETWORKS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS523<\/td>\n<td>APPLIED CRYPTOGRAPHY<\/td>\n<td>4<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1RSV4MIAttRk2wkGeBuavjl12QTB9Wmdk\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS 524<\/td>\n<td>DATA MINING<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS 525<\/td>\n<td>post-quantum crypto<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS 526<\/td>\n<td>Mathematical Foundations of Computer Science<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS 527<\/td>\n<td>Computer Systems<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS 528<\/td>\n<td>Big Data Tools<\/td>\n<td><\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS 529<\/td>\n<td>Applied Artificial Intelligence<\/td>\n<td>4<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1BRzOYgBeNBSCozxDi-tWnHYUfl6r3lzZ\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS 530<\/td>\n<td>Multi Agent Systems<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS 532<\/td>\n<td>Security Analytics<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS 533<\/td>\n<td>Reinforcement Learning<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS 534<\/td>\n<td>Low Power Design<\/td>\n<td>3<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1Be44pa9NJVqSMhd6Cc-TWAdOfCE4yonq\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS 535<\/td>\n<td>Intro. to Game Theory and Mechanism Design<\/td>\n<td>4<\/td>\n<td><\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1pjS8QgG185PVdyK4tUuCFzf7CoCrSucC\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS 536<\/td>\n<td>GRAPH THEORY<\/td>\n<td>3<\/td>\n<td>–<\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1RZbi4VL8_uGuECWutRfhxNi0um7zpsCm\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS537<\/td>\n<td>Synthesis of Digital Systems<\/td>\n<td>4<\/td>\n<td>–<\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1OhKZqg8org7NxCgcw3_9IXGJPRVVNx5u\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS600<\/td>\n<td>INDEPENDENT STUDY<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS601<\/td>\n<td>APPROXIMATIONAL ALGORITHMS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS602<\/td>\n<td>RANDOMIZED ALGORITHMS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS603<\/td>\n<td>COMBINATORIAL OPTIMIZATIONS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS604<\/td>\n<td>ADVANCED OPERATING SYSTEMS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS605<\/td>\n<td>CONSTRAINT PROGRAMMING<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS606<\/td>\n<td>ADVANCED SOFTWARE ARCHITECTURE<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS607<\/td>\n<td>ADVANCED TOPICS IN CONTEMPRORY COMPUTING PLATFORMS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS608<\/td>\n<td>ADVANCED TOPICS IN INTERNET TECHNOLOGIES<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS609<\/td>\n<td>NETWORK SCIENCE<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS610<\/td>\n<td>ALGORITHMS EXEMPLIFIED<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS612<\/td>\n<td>ADVANCED MACHINE LEARNING<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1-2IvdcRZHovDCMZfpO5oqFDPLTj7H8Kf\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS613<\/td>\n<td>GAME THEORY IN WIRELESS NETWORKS<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS615<\/td>\n<td>BIOMEDICAL IMAGE PROCESSING & ANALYSIS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS616<\/td>\n<td>ADVANCED COMPUTER VISION<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS617<\/td>\n<td>AFFECTIVE COMPUTING & INTERACTION<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS618<\/td>\n<td>ARTIFICIAL NEURAL NETWORKS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS619<\/td>\n<td>ADVANCED ALGORITHMS<\/td>\n<td>3<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS620<\/td>\n<td>INTRODUCTION TO SPATIAL COMPUTING<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS621<\/td>\n<td>PROBABILISTIC GRAPHICAL MODELS<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS622<\/td>\n<td>ADVANCED IMAGE PROCESSING<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1Ne8BK502-v_n5z-5PB4nL36jsDcIOjXY\">Click here to View<\/a><\/td>\n<\/tr>\n<tr>\n<td>CS698<\/td>\n<td>M.TECH. PROJECT \u2013I<\/td>\n<td>12<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS699<\/td>\n<td>M.TECH. PROJECT-II<\/td>\n<td><\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td>Click here to View<\/td>\n<\/tr>\n<tr>\n<td>CS 724<\/td>\n<td>ADVANCED DATA MINING<\/td>\n<td>4<\/td>\n<td>_<\/td>\n<td>_<\/td>\n<td><a href=\"https:\/\/drive.google.com\/open?id=1XGIkv9ua-u0NJwYt2KN_RfYwmTKX9Q-P\">Click here to View<\/a><\/td>\n<\/tr>\n<\/tbody>\n<\/table><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"3\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-7903\" aria-expanded=\"false\">PG Courses (AI)<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-7903\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"3\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-7903\" tabindex=\"0\" hidden=\"hidden\"><!DOCTYPE html>\n<html lang=\"en\">\n<head>\n <meta charset=\"UTF-8\">\n <meta name=\"viewport\" content=\"width=device-width, initial-scale=1.0\">\n <title>Programme Structure<\/title>\n <style>\n body {\n font-family: Arial, sans-serif;\n margin: 20px;\n padding: 0;\n line-height: 1.6;\n }\n .container {\n max-width: 1200px;\n margin: 0 auto;\n padding: 15px;\n }\n h2 {\n text-align: center;\n margin-bottom: 20px;\n }\n .section {\n margin-bottom: 40px;\n }\n table {\n width: 100%;\n border-collapse: collapse;\n margin-bottom: 20px;\n }\n table, th, td {\n border: 1px solid #ddd;\n }\n th, td {\n padding: 10px;\n text-align: left;\n }\n th {\n background-color: #f4f4f4;\n }\n @media screen and (max-width: 768px) {\n table, tbody, th, td, tr {\n display: block;\n }\n td {\n text-align: right;\n padding-left: 50%;\n position: relative;\n }\n td::before {\n content: attr(data-label);\n position: absolute;\n left: 10px;\n width: 50%;\n padding-right: 10px;\n white-space: nowrap;\n text-align: left;\n }\n }\n <\/style>\n<\/head>\n<tbody>\n<tr>\n<td colspan=\"2\">Programme structure\n\n<strong>Overall Structure of the Program<\/strong>\n<ul>\n \t<li><strong>Specialization Core<\/strong> (20\/22 credits):\n<ul>\n \t<li>CSE Core 14 credits\u00a0\u00a0+ at least 2 courses from Appendix A (i.e list of AI program core courses.<\/li>\n<\/ul>\n<\/li>\n \t<li><strong>Elective Course credits <\/strong>(11 or more credits)\n<ul>\n \t<li><strong>Specialization electives<\/strong>:\u00a0At least 3 other courses from Appendix B (i.e.\u00a0 list of AI program electives.<\/li>\n \t<li><strong>Department\/Open Elective<\/strong>: One additional course i.e. 3\/4 additional credits (any PG elective course). Even non-CSE PG course can be considered but with due approval from CSE RPEC and CSE HoD.<\/li>\n<\/ul>\n<\/li>\n \t<li><strong>MTech\u00a0Project <\/strong>(30 credits) :\n<ul>\n \t<li>One can register for the MTech project component only after successfully completing at least 21 course credits<\/li>\n \t<li><strong>MTech Project: <\/strong>Student interested in obtaining this specialization <strong>must undertake a MTech project in the area of Artificial Intelligence (or its allied areas, refer item 14)<\/strong><\/li>\n<\/ul>\n<\/li>\n<\/ul>\nStudents will\u00a0 be encouraged to take up interdisciplinary projects for fulfilling their MTP requirements. Relevance of this project with the theme of specialization would be decided by the steering committee of this specialization.\n<ul>\n \t<li>For the summer short semester, registration in non credited summer project or doing internship in an Industry is a mandatory component for the degree completion.<\/li>\n<\/ul>\n<em>Max number of credits one can register in a semester = 24\u00a0 <\/em>\n\n<strong>Semester I <\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>Sno <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CS506<\/td>\n<td>Data Structures and Algorithms<\/td>\n<td>3-1-2-6-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CS526<\/td>\n<td>Mathematics for Computer Science<\/td>\n<td>3-1-0-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>3<\/td>\n<td>CS527<\/td>\n<td>Computer Systems<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>4<\/td>\n<td>CS509<\/td>\n<td>PG Software Lab<\/td>\n<td>0-0-6-6-3<\/td>\n<td>3 or 4<\/td>\n<\/tr>\n<tr>\n<td>5<\/td>\n<td>XXXXX<\/td>\n<td>Elective I<\/td>\n<td>——<\/td>\n<td>3 or 4<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<strong>Semester II <\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>S.no <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CSXXX<\/td>\n<td>AI Program core I<\/td>\n<td>——<\/td>\n<td>3 or 4<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CSXXX<\/td>\n<td>AI Program core II<\/td>\n<td>——<\/td>\n<td>3 or 4<\/td>\n<\/tr>\n<tr>\n<td>3<\/td>\n<td>CSXXX<\/td>\n<td>Elective II<\/td>\n<td>——<\/td>\n<td>3 or 4<\/td>\n<\/tr>\n<tr>\n<td>4<\/td>\n<td>CSXXX<\/td>\n<td>Elective III<\/td>\n<td>——<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>5<\/td>\n<td>XXXXX<\/td>\n<td>Elective IV<\/td>\n<td>——<\/td>\n<td>3 or 4<\/td>\n<\/tr>\n<tr>\n<td>6<\/td>\n<td>CS500<\/td>\n<td>PG Seminar in Compute Science<\/td>\n<td>—–<\/td>\n<td>0 (S\/U)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<strong>Semester III<\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>S.no <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CS551<\/td>\n<td>Colloquium Series<\/td>\n<td>—–<\/td>\n<td>\u00a00 (S\/U)<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CS699<\/td>\n<td>PROJECT-I<\/td>\n<td>0-0-28-14-14<\/td>\n<td>14<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<strong>Semester IV <\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>S.no <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CS555<\/td>\n<td>PG Seminar-2 (Topics specific to one\u2019s research project)<\/td>\n<td>—–<\/td>\n<td>0 (S\/U)<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CS799<\/td>\n<td>Project-2<\/td>\n<td>0-0-32-16-16<\/td>\n<td>16<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n <\/td>\n<\/tr>\n<tr>\n<td>Area of Research for Internship\/ Project :\n\n <\/td>\n<td>Core topics in Artificial Intelligence (AI), Machine Learning (ML) and Data Mining (DM). Applications of AI\/ML\/DM in areas such as Internet of Things, Computer Vision and Image processing are also included.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<strong>Appendix A- List of AI Program Core <\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>S.no <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CS503<\/td>\n<td>Machine Learning<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CS512<\/td>\n<td>Artificial Intelligence<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>3<\/td>\n<td>CS521<\/td>\n<td>Fundamentals of Data Sciences<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>4<\/td>\n<td>CS524<\/td>\n<td>Data Mining<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>5<\/td>\n<td>CS504<\/td>\n<td>Artificial Neural Networks (Deep Learning)<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>6<\/td>\n<td>CS533<\/td>\n<td>Reinforcement learning<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<strong>Appendix B- List of AI Program Electives (at least 3 other courses from this list) <\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>S.no <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CS503<\/td>\n<td>Machine Learning<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CS504<\/td>\n<td>Artificial Neural Networks<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>3<\/td>\n<td>CS507<\/td>\n<td>Multimedia System<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>4<\/td>\n<td>CS512<\/td>\n<td>Artificial Intelligence<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>5<\/td>\n<td>CS512<\/td>\n<td>Artificial Intelligence<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>6<\/td>\n<td>CS517<\/td>\n<td>Digital Image Processing and Analysis<\/td>\n<td>2-1-2-4-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>7<\/td>\n<td>CS518<\/td>\n<td>Computer Vision<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>8<\/td>\n<td>CS521<\/td>\n<td>Fundamentals of Data Science<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>9<\/td>\n<td>CS522<\/td>\n<td>Social Computing and Networks<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>10<\/td>\n<td>CS524<\/td>\n<td>Data Mining<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>11<\/td>\n<td>CS530<\/td>\n<td>Autonomous MultiAgent Systems<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>12<\/td>\n<td>CS532<\/td>\n<td>Security Analytics<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>13<\/td>\n<td>CS533<\/td>\n<td>Reinforcement Learning<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>14<\/td>\n<td>CS535<\/td>\n<td>Introduction To Game Theory And Mechanism Design<\/td>\n<td>3-1-0-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>15<\/td>\n<td>CS539<\/td>\n<td>Internet of Things<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>16<\/td>\n<td>CS545<\/td>\n<td>Computer Graphics Lab<\/td>\n<td>0-0-2-1-1<\/td>\n<td>1<\/td>\n<\/tr>\n<tr>\n<td>17<\/td>\n<td>CS612<\/td>\n<td>Advanced Machine Learning<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>18<\/td>\n<td>CS615<\/td>\n<td>Biomedical Image Processing & Analysis<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>19<\/td>\n<td>CS616<\/td>\n<td>Advanced Computer Vision<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>20<\/td>\n<td>CS617<\/td>\n<td>Affective Computing and Interaction<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>21<\/td>\n<td>CS621<\/td>\n<td>Probabilistic Graphical Models<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>22<\/td>\n<td>CS623<\/td>\n<td>Multimedia Surveillance Systems<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>23<\/td>\n<td>CS720<\/td>\n<td>Advanced Spatial Computing<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>24<\/td>\n<td>CS724<\/td>\n<td>Advanced Data Mining<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>25<\/td>\n<td>CS546<\/td>\n<td>INTRODUCTION TO CYBER PHYSICAL SYSTEMS<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<\/tbody>\n<\/table><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"4\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-7904\" aria-expanded=\"false\">PG Courses (CSE)<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-7904\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"4\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-7904\" tabindex=\"0\" hidden=\"hidden\"><!DOCTYPE html>\n<html lang=\"en\">\n<head>\n <meta charset=\"UTF-8\">\n <meta name=\"viewport\" content=\"width=device-width, initial-scale=1.0\">\n <title>Programme Structure<\/title>\n <style>\n body {\n font-family: Arial, sans-serif;\n margin: 20px;\n padding: 0;\n line-height: 1.6;\n }\n .container {\n max-width: 1200px;\n margin: 0 auto;\n padding: 15px;\n }\n h2 {\n text-align: center;\n margin-bottom: 20px;\n }\n .section {\n margin-bottom: 40px;\n }\n table {\n width: 100%;\n border-collapse: collapse;\n margin-bottom: 20px;\n }\n table, th, td {\n border: 1px solid #ddd;\n }\n th, td {\n padding: 10px;\n text-align: left;\n }\n th {\n background-color: #f4f4f4;\n }\n @media screen and (max-width: 768px) {\n table, tbody, th, td, tr {\n display: block;\n }\n td {\n text-align: right;\n padding-left: 50%;\n position: relative;\n }\n td::before {\n content: attr(data-label);\n position: absolute;\n left: 10px;\n width: 50%;\n padding-right: 10px;\n white-space: nowrap;\n text-align: left;\n }\n }\n <\/style>\n<\/head>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td colspan=\"2\">Programme structure\u00a0 ( <strong>Overall Structure of the Program)<\/strong>\n\nSummary details of the Program Structure:\n<ul>\n \t<li><strong>Core Courses credits : 14 credits <\/strong><\/li>\n \t<li><strong>Elective course credits: 16 credits or more <\/strong>as per following conditions:\n<ul>\n \t<li>Any PG course offered in the CSE department.<\/li>\n \t<li>Atmost one non-CSE PG course (with due approval from CSE RPEC and CSE HoD) can be considered.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<ul>\n \t<li><strong>30<\/strong><strong> credits<\/strong> for the <strong>Project work <\/strong>course.\n<ul>\n \t<li>Project should be taken in CSE domain. One can register for the MTech project component only after successfully completing at least 21 course credits<\/li>\n \t<li>For the summer short semester, registration in non credited summer project or doing internship in an Industry is mandatory component for the degree completion<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<strong>Semester I <\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>Sno <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CS506<\/td>\n<td>Data Structures and Algorithms<\/td>\n<td>3-1-2-6-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CS526<\/td>\n<td>Mathematics for Computer Science<\/td>\n<td>3-1-0-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>3<\/td>\n<td>CS527<\/td>\n<td>Computer Systems<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>4<\/td>\n<td>CS509<\/td>\n<td>PG Software Lab<\/td>\n<td>0-0-6-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<strong>Semester II <\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>S.no <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CSXXX<\/td>\n<td>Elective I<\/td>\n<td>——<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CSXXX<\/td>\n<td>Elective II<\/td>\n<td>——<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>3<\/td>\n<td>CSXXX<\/td>\n<td>Elective III<\/td>\n<td>——<\/td>\n<td>3 or 4<\/td>\n<\/tr>\n<tr>\n<td>4<\/td>\n<td>CSXXX<\/td>\n<td>Elective IV<\/td>\n<td>——<\/td>\n<td>3 or 4<\/td>\n<\/tr>\n<tr>\n<td>5<\/td>\n<td>XXXX<\/td>\n<td>Elective V<\/td>\n<td>——<\/td>\n<td>3 or 4<\/td>\n<\/tr>\n<tr>\n<td>6<\/td>\n<td>CS500<\/td>\n<td>PG Seminar-1<\/td>\n<td>——<\/td>\n<td>0 (S\/U)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n \n\n<strong>Semester III <\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>S.no <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CS551<\/td>\n<td>Colloquium Series<\/td>\n<td>——<\/td>\n<td>0 (S\/U)<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CS699<\/td>\n<td>Project-1<\/td>\n<td>0-0-28-14-14<\/td>\n<td>14<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<strong>Semester IV <\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>S.no <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CS555<\/td>\n<td>PG Seminar-2<\/td>\n<td>——<\/td>\n<td>0 (S\/U)<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CS799<\/td>\n<td>Project-2 (Topics specific to one\u2019s research project)<\/td>\n<td>0-0-32-16-16<\/td>\n<td>16<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n <\/td>\n<\/tr>\n<tr>\n<td>Area of Research for Internship\/ Project :<\/td>\n<td>Project should done in one of the core topics in computer science and engineering domain. These topics largely span across theory, systems and applications branches of CSE.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<strong>Appendix A: List of CSE Electives**<\/strong>\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td><strong>S.no <\/strong><\/td>\n<td><strong>Course No<\/strong><\/td>\n<td><strong>Course Title<\/strong><\/td>\n<td><strong>L-T-P-S-C<\/strong><\/td>\n<td><strong>Credits<\/strong><\/td>\n<\/tr>\n<tr>\n<td>1<\/td>\n<td>CS503<\/td>\n<td>Machine Learning<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>2<\/td>\n<td>CS504<\/td>\n<td>Artificial Neural Networks<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>3<\/td>\n<td>CS505<\/td>\n<td>Digital Imaging Systems<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>4<\/td>\n<td>CS507<\/td>\n<td>Multimedia System<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>5<\/td>\n<td>CS510<\/td>\n<td>Advanced Computer Architecture<\/td>\n<td>3-1-0-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>6<\/td>\n<td>CS511<\/td>\n<td>Real Time Systems<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>7<\/td>\n<td>CS512<\/td>\n<td>Artificial Intelligence<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>8<\/td>\n<td>CS515<\/td>\n<td>Computer Graphics<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>9<\/td>\n<td>CS516<\/td>\n<td>Wireless Ad-Hoc Networks<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>10<\/td>\n<td>CS517<\/td>\n<td>Digital Image Processing and Analysis<\/td>\n<td>2-1-2-4-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>11<\/td>\n<td>CS518<\/td>\n<td>Computer Vision<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>12<\/td>\n<td>CS519<\/td>\n<td>System Level Design And Modelling<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>13<\/td>\n<td>CS520<\/td>\n<td>Database System Implementatio<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>14<\/td>\n<td>CS521<\/td>\n<td>Fundamentals of Data Science<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>15<\/td>\n<td>CS522<\/td>\n<td>Social Computing and Networks<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>16<\/td>\n<td>CS523<\/td>\n<td>Applied Cryptography<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>17<\/td>\n<td>CS524<\/td>\n<td>Data Mining<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>18<\/td>\n<td>CS525<\/td>\n<td>Post-Quantum Crypto<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>19<\/td>\n<td>CS530<\/td>\n<td>Autonomous MultiAgent Systems<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>20<\/td>\n<td>CS533<\/td>\n<td>Reinforcement Learning<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>21<\/td>\n<td>CS535<\/td>\n<td>Introduction To Game Theory And Mechanism Design<\/td>\n<td>3-1-0-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>22<\/td>\n<td>CS539<\/td>\n<td>Internet of Things<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>23<\/td>\n<td>CS540<\/td>\n<td>Cryptocurrencies and Blockchain Technology<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>24<\/td>\n<td>CS545<\/td>\n<td>Computer Graphics Lab<\/td>\n<td>0-0-2-1-1<\/td>\n<td>1<\/td>\n<\/tr>\n<tr>\n<td>25<\/td>\n<td>CS601<\/td>\n<td>Approximation Algorithms<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>26<\/td>\n<td>CS602<\/td>\n<td>Randomized Algorithms<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>27<\/td>\n<td>CS603<\/td>\n<td>Combinatorial Optimizations<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>28<\/td>\n<td>CS604<\/td>\n<td>Advanced Operating Systems<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>29<\/td>\n<td>CS606<\/td>\n<td>Advanced Software Architecture<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>30<\/td>\n<td>CS607<\/td>\n<td>Contemporary Computing Platforms<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>31<\/td>\n<td>CS608<\/td>\n<td>Topics in Internet Technologies<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>32<\/td>\n<td>CS612<\/td>\n<td>Advanced Machine Learning<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>33<\/td>\n<td>CS615<\/td>\n<td>Biomedical Image Processing & Analysis<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>34<\/td>\n<td>CS616<\/td>\n<td>Advanced Computer Vision<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>35<\/td>\n<td>CS617<\/td>\n<td>Affective Computing and Interaction<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>36<\/td>\n<td>CS620<\/td>\n<td>Introduction to Spatial Computing<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>37<\/td>\n<td>CS621<\/td>\n<td>Probabilistic Graphical Models<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>38<\/td>\n<td>CS622<\/td>\n<td>Advanced Image Processing<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>39<\/td>\n<td>CS623<\/td>\n<td>Multimedia Surveillance Systems<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>40<\/td>\n<td>CS701<\/td>\n<td>Special Topics in Complex Networks<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>41<\/td>\n<td>CS702<\/td>\n<td>Special Topics in Social Computing<\/td>\n<td>3-0-2-7-4<\/td>\n<td>4<\/td>\n<\/tr>\n<tr>\n<td>42<\/td>\n<td>CS720<\/td>\n<td>Advanced Spatial Computing<\/td>\n<td>3-0-0-6-3<\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td>43<\/td>\n<td>CS724<\/td>\n<td>Advanced Data Mining<\/td>\n<td>2-0-2-5-3<\/td>\n<td>3<\/td>\n<\/tr>\n<\/tbody>\n<\/table><\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-bcffde2 e-flex e-con-boxed e-con e-parent\" data-id=\"bcffde2\" data-element_type=\"container\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"<p>UG Courses (catalog) PG Courses (catalog) PG Courses (AI) PG Courses (CSE) UG Courses (catalog)…<\/p>\n<div class=\"visionwp-site-button\"><a href=\"https:\/\/cse.iitrpr.ac.in\/?page_id=317\" class=\"visionwp-primary-button\">Read More <i class=\"fa fa-long-arrow-right\"><\/i><\/a><\/div>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"elementor_header_footer","meta":{"footnotes":""},"class_list":["post-317","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/cse.iitrpr.ac.in\/index.php?rest_route=\/wp\/v2\/pages\/317","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/cse.iitrpr.ac.in\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/cse.iitrpr.ac.in\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/cse.iitrpr.ac.in\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/cse.iitrpr.ac.in\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=317"}],"version-history":[{"count":70,"href":"https:\/\/cse.iitrpr.ac.in\/index.php?rest_route=\/wp\/v2\/pages\/317\/revisions"}],"predecessor-version":[{"id":2115,"href":"https:\/\/cse.iitrpr.ac.in\/index.php?rest_route=\/wp\/v2\/pages\/317\/revisions\/2115"}],"wp:attachment":[{"href":"https:\/\/cse.iitrpr.ac.in\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=317"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}