Course structure of B. Tech. AI & DS IIT Patna

Geometrical construction of simple plane figure:Bisecting the line, draw perpendicular, parallel line, bisect angle, trisect angle, construct equatorial triangle, square, polygon, inscribed circle.

Free hand sketching: prerequisites for freehand sketching, sketching of regular and irregular figures.

Drawing scales: Engineering scale, graphical scale, plane scale, diagonal scale, comparative scale, scale of chord.

Orthographic projection: Principle of projection, method of projection, orthographic projection, plane of projection, first angle of projection, third angle of projection, reference line.

Projection of points, lines and plane: A point is situated in the first quadrant, point is situated in the second quadrant, point is situated in the third quadrant, point is situated in the fourth quadrant, projection of line parallel to both the plane, line contained by one or both the plane, line perpendicular to one of the plane, line inclined to one plane and parallel to other, line inclined to both the plane, true length of line.

Missing views: Drawing of missing front view of a solid, missing top view of solids, missing side view of solids, Orthographic projection of simple solid: Introduction, types of solid, projection of solid when axis perpendicular to HP, axis perpendicular to VP, axis parallel to both HP and VP, axis inclined to both HP and VP.

Orthographic projection of simple solid: Introduction, types of solid, projection of solid when axis perpendicular to HP, axis perpendicular to VP, axis parallel to both HP and VP, axis inclined to both HP and VP.

Text and Reference Books:

Electrical Sciences

Circuit Analysis Techniques, Circuit elements, Simple RL and RC Circuits, Kirchhoff’s law, Nodal Analysis, Mesh Analysis, Linearity and Superposition, Source Transformations, Thevnin's and Norton's Theorems, Time Domain Response of RC, RL and RLC circuits, Sinusoidal Forcing Function, Phasor Relationship for R, L and C, Impedance and Admittance.

Semiconductor Diode, Zener Diode, Rectifier Circuits, Clipper, Clamper, Bipolar Junction Transistors, Transistor Biasing, Transistor Small Signal Analysis, Transistor Amplifier, Operational Amplifiers, Op-amp Equivalent Circuit, Practical Op-amp Circuits, DC Offset, Constant Gain Multiplier, Voltage Summing, Voltage Buffer, Controlled Sources, Instrumentation Circuits, Active Filters and Oscillators.

Number Systems, Logic Gates, Boolean Theorem, Algebraic Simplification, K-map, Combinatorial Circuits, Encoder, Decoder, Combinatorial Circuit Design, Introduction to Sequential Circuits.

Magnetic Circuits, Mutually Coupled Circuits, Transformers, Equivalent Circuit and Performance, Analysis of Three-Phase Circuits, Electromechanical Energy Conversion, Introduction to Rotating Machines.

Text and Reference Books:

Communicative English for Engineers

In today’s ‘global village’, there are many who believe that ‘Communication is like breathing and life would cease to continue without it’. This particular course on communication skills imbibes the same and therefore, it aims to equip the students with getting the basics right of communication and presentation skills for academic and professional purposes. It is designed to help the second language learners acquire fluency in both spoken and written English to communicate information with clarity, precision and confidence especially in the professional sphere. It will introduce learners not only to the basic concepts in communication but also focus on providing them a hands-on experience of the same. It is hoped that after commanding the skills required in spoken and written English, learners will be able to express themselves more effectively.

The course will have ten units and shall focus on the following topics:

Unit 1: Language and Communication
What is Communication
Nature, Style and Process of Communication
Communication Barriers
Objectives and Importance of Communication
Formal and Informal Communication
Verbal and Non-Verbal Communication

Unit 2: English Language Remedial Skills
Construction of Sentences
Subject-Verb Agreement
Tenses
Active and Passive Voice
Direct and Indirect Speech
Common Errors

Unit 3: Oral Skills
Public Speaking
Dealing with lack of confidence
Making an Effective Presentation
Telephone Etiquette
Understanding GD
Why conduct a GD?
How to gear up for a GD?
Different Phases of GD

Unit 4: Listening Skills
Meaning of Listening
Different Types of Listening
Barriers to Listening and Methods to overcome them
Various strategies to develop effective Listening
Semantic Markers

Unit 5: Reading Skills
What is Reading?
Types of Reading
Reading Comprehension

Unit 6: Writing Skills
Business Correspondence
Element and Style of Writing
Report Writing
Notice, Agenda and Minutes

Unit 7: Interview Techniques
How to prepare for an Interview
An Interview

Text and Reference Books:

Mathematics I

Properties of real numbers. Sequences of real numbers, montone sequences, Cauchy sequences, divergent sequences. Series of real numbers, Cauchy’s criterion, tests for convergence. Limits of functions, continuous functions, uniform continuity, montoneand inverse functions. Differentiable functions, Rolle's theorem, mean value theorems and Taylor's theorem, power series. Riemann integration, fundamental theorem of integral calculus, improper integrals. Application to length, area, volume, surface area of revolution. Vector functions of one variable and their derivatives. Functions of several variables, partial derivatives, chain rule, gradient and directional derivative. Tangent planes and normals. Maxima, minima, saddle points, Lagrange multipliers, exact differentials. Repeated and multiple integrals with application to volume, surface area, moments of inertia. Change of variables. Vector fields, line and surface integrals. Green’s, Gauss’ and Stokes’ theorems and their applications.

Text Books:

Reference Books:

Workshop-I

Sheet Metal Working:

Sheet material: GI sheets, aluminium, tin plate, copper, brass etc.; Tools: steel rule, Vernier calipers, micrometer, sheet metal gauge, scriber, divider, punches, chisels, hammers, snips, pliers, stakes etc.; operations: scribing, bending, shearing, punching etc.; Product development: hexagonal box with cap, funnel etc.

Pattern Making and Foundry Practice:

Pattern material: wood, cast iron, brass, aluminium, waxes etc.; Types of patterns: split, single piece, match plate etc.; Tools: cope, drag, core, core prints, shovel, riddle, rammer, trowel, slick, lifter, sprue pin, bellow, mallet, vent rod, furnace etc. Moulding sands: green sand, dry sand, loam sand, facing sand etc., Sand casting: Sand preparation, mould making, melting, pouring, and cleaning. Joining: Classifications of joining processes; Introduction to Arc welding processes; power source; electrodes; edge preparation by using tools bench vice, chisels, flat file, square file, half round file, round file, knife edge file, scrapers, hacksaws, try squares; cleaning of job, Job: lap and butt joints using manual arc welding.

Machining Centre:

Introduction to different machine tools; Working principle of lathe, milling, drilling etc.; Setting and preparation of job using lathe and milling; Performing different operations namely, straight turning, taper turning, knurling, thread cutting etc.; Introduction to dividing head, indexing, performing operation in milling using indexing mechanism.

CNC Centre:

Introduction to CNC machines; Fundamentals of CNC programming using G and M code; setting and operations of job using CNC lathe and milling, tool reference, work reference, tool offset, tool radius compensation.

Text and Reference Books:

Physics-I

Orthogonal coordinate systems and frames of reference, conservative and non-conservative forces, work-energy theorem, potential energy and concept of equilibrium; Rotation about fixed axis, translational-rotational motion, vector nature of angular velocity, rigid body rotation and its applications, Euler's equations; Gyroscopic motion and its application; Accelerated frame of reference, centrifugal and Coriolis forces.

Harmonic oscillator, damped and forced oscillations, resonance, coupled oscillations, small oscillation, normal modes, longitudinal and transverse waves, wave equation, plane waves, phase velocity, superposition wave packets and group velocity, two- and three-dimensional waves.

Failure of classical concepts, Black body radiation, photo-electric effect, Compton effect, Davison and Germer's experiment, Frank-Hertz experiment, Bohr's theory, Sommerfeld's model, correspondence principle, Planck hypothesis, De Broglie's hypothesis, Hilbert space, observables, Dirac notation, principle of superposition, wave packets, phase and group velocities, probability & continuity equation, eigenvalues and Eigen functions, orthonormality, expectation values, uncertainty principle, postulates of Quantum Mechanics, Schrodinger equation & its applications to 1D potentials, field quantization, periodic potential wells: Kronig Penny model and origin of band gap.

Textbooks:

Reference Books:

Physics Laboratory

The list of experiments is as follows:

Ex 1 Decay of Current in A Capacitive Circuit

Ex 2 Q-Factor of an LCR Circuit

Ex 3 Study of Hall Effect

Ex 4 Speed of Sound in Air

Ex 5 ‘g’ by A Compound Pendulum

Ex 6 Speed of Light in Glass

Ex 7 Determination of e/m

Ex 8 Interference of Light: Newton’s Ring

Ex 9 Surface Tension of Water by Method of Capillary Ascent

Ex 10 Determination of Plank’s constant by Photoelectric Effect

Biology and Environment Studies

Module 1 - Biology: 1. Cell – Structure and logic of optimization; 2. Blood – The following tissue – Basis and rationale; 3. Organs – Structure, function, interactions, failure; 4. Molecular basis of disorders – example: Diabetes; 5. Modern techniques of evaluations and corrections; 6. Open discussions – Feedback from students

Module 2 – Environmental Science / Studies: 1.Ecology and Sustainable Development – Ecosystems, Natural cycles, Biodiversity, Man and environment; 2. Water Resources – Hydrologic cycle and its components, Groundwater and surface water, Water quality; 3. Environmental Sanitation: Conventional and ecological sanitation; 4. Environmental Pollution and Control – Air, Water, Soil, Noise Pollution, Solid and Hazardous Waste, Biomedical Waste, E-waste: Sources, effect, treatment and control; 5. Environmental Legislations and Standards; 6.Current Environmental Issues: Greenhouse gases and global warming, Acid rain, Ozone layer depletion, Climate change

Text Books:

Reference Books:

PHYSICAL CHMEISTRY

Thermodynamics: The fundamental definition and concept, the zeroth and first law. Work, heat, energy and enthalpies. Second law: entropy, free energy and chemical potential. Change of Phase. Third law. Chemical equilibrium, Chemical kinetics: The rate of reaction, elementary reaction and chain reaction.

Electrochemistry: Conductance of solutions, equivalent and molar conductivities and its variation with concentration. Kohlrausch’s law-ionic mobilities, Transference number of ions. activities, application of Debye-Huckel theory. The Walden’s rule. Debye-Huckel-Onsager treatment. Electrochemical cells, Nernst equation. Application of EMF measurements. Liquid junction potential, commercial cells – the primary and secondary cells. Fuel cells.

INORGANIC CHEMISTRY

Coordination chemistry: ligand, nomenclature, isomerism, stereochemistry, valence bond, crystal field and molecular orbital theories. Bioinorganic chemistry: Trace elements in biology, heme and non-heme oxygen carriers, haemoglobin and myoglobin; organometallic chemistry.

ORGANIC CHEMISTRY
Stereo and regio-chemistry of organic compounds, conformers. Bioorganic chemistry: amino acids, peptides, proteins, enzymes, carbohydrates, nucleic acids and lipids. Modern techniques in structural elucidation of compounds (UV – Vis, IR, NMR). Solid phase synthesis and combinatorial chemistry. Green chemical processes.

Textbooks:

Reference Books:

Estimation of metal ion: Determination of total hardness of water by EDTA titration. Experiments based on chromatography: Identification of a mixture containing two organic compounds by TLC. Experiments based on pH metry.: Determination of dissociation constant of weak acids by pH meter. Experiments based on conductivity measurement: Determination of amount of HCl by conductometric titration with NaOH. Synthesis and characterization of inorganic complexes: e.g. Mn(acac)3, Fe(acac)3, cis-bis(glycinato)copper (II) monohydrate and their characterization by m. p. IR etc. Synthesis and characterization of organic compounds: e.g. Dibenzylideneacetone. Kinetics: Acid catalyzed hydrolysis of methyl acetate. Verification of Beer-Lamberts law and determination of amount of iron present in a supplied solution. Experiments based on electro gravimetry and electroplating. Experiments based on magnetometry.

Introduction to digital computers; introduction to programming- variables, assignments; expressions; input/output; conditionals and branching; iteration; functions; recursion; arrays; introduction to pointers; structures; introduction to data-procedure encapsulation; dynamic allocation; linked structures; introduction to data structures stacks, queues and trees; time and space requirements.

References:

Introduction to Unix commands; Introduction to program development tools- vi editor, GNU compiler, testing and debugging, etc.; Implementation of programs in C language.

Experiments using diodes and bipolar junction transistor (BJT): design and analysis of half -wave and full-wave rectifiers, clipping circuits and Zener regulators, BJT characteristics and BJT amplifiers; experiments using operational amplifiers (op- amps): summing amplifier, comparator, precision rectifier, astable and mono stable multi vibrators and oscillators; experiments using logic gates: combinational circuits such as staircase switch, majority detector, equality detector, multiplexer and demultiplexer; experiments using flip-flops: sequential circuits such as non- overlapping pulse generator, ripple counter, synchronous counter, pulse counter and numerical display.

Reference Books:

Linear Algebra: Vector spaces (over the field of real and complex numbers). Systems of linear equations and their solutions. Matrices, determinants, rank and inverse. Linear transformations. Range space and rank, null space and nullity. Eigenvalues and eigenvectors. Similarity transformations. Diagonalization of Hermitian matrices. Bilinear and quadratic forms.

Ordinary Differential Equations: First order ordinary differential equations, exactness and integrating factors. Variation of parameters. Picard's iteration. Ordinary linear differential equations of n-th order, solutions of homogeneous and non-homogeneous equations. Operator method. Method of undetermined coefficients and variation of parameters.

Power series methods for solutions of ordinary differential equations. Legendre equation and Legendre polynomials, Bessel equation and Bessel functions of first and second kind. Systems of ordinary differential equations, phase plane, critical point, stability.

Textbooks:

Reference Books:

Text and Reference books:

Complex Analysis: Complex numbers, geometric representation, powers and roots of complex numbers. Functions of a complex variable: Limit, Continuity, Differentiability, Analytic functions, Cauchy-Riemann equations, Laplace equation, Harmonic functions, Harmonic conjugates. Elementary Analytic functions (polynomials, exponential function, trigonometric functions), Complex logarithm function, Branches and Branch cuts of multiple valued functions. Complex integration, Cauchy's integral theorem, Cauchy's integral formula. Liouville’s Theorem and Maximum-Modulus theorem, Power series and convergence, Taylor series and Laurent series. Zeros, Singularities and its classifications, Residues, Rouches theorem (without proof), Argument principle (without proof), Residue theorem and its applications to evaluating real integrals and improper integrals. Conformal mappings, Mobius transformation, Schwarz-Christoffel transformation.

Fourier series: Fourier Integral, Fourier series of 2p periodic functions, Fourier series of odd and even functions, Half-range series, Convergence of Fourier series, Gibb’s phenomenon, Differentiation and Integration of Fourier series, Complex form of Fourier series.

Fourier Transformation: Fourier Integral Theorem, Fourier Transforms, Properties of Fourier Transform, Convolution and its physical interpretation, Statement of Fubini’s theorem, Convolution theorems, Inversion theorem

Partial Differential Equations: Introduction to PDEs, basic concepts, Linear and quasi-linear first order PDE, Second order PDE and classification of second order semi-linear PDE, Canonical form. Cauchy problems. D’ Alembert’s formula and Duhamel’s principle for one dimensional wave equation, Laplace and Poisson equations, Maximum principle with application, Fourier method for IBV problem for wave and heat equation, rectangular region. Fourier method for Laplace equation in three dimensions.

Text Books:

Reference Books:

Asymptotic notations, introduction to complexity (time/space) analysis of algorithms. Basic introduction to algorithmic paradigms like divide and conquer, recursion, greedy, dynamic programming, etc. Searching: binary search trees, balanced binary search trees, AVL trees and red-black trees, B-trees, hashing. Priority queues, heaps, Interval trees. Sorting: quick sort, heap sort, merge sort, radix sort, bucket sort, counting sort, etc. and their analysis. Graph Algorithms: BFS, DFS, connected components, topological sort, minimum spanning trees, shortest paths, network flow. Reducibility between problems and NP-completeness: discussion of different NP-complete problems.

Books

The laboratory component will emphasize two areas: Implementation of algorithms covered in class: This will involve running the algorithms under varying input sets and measuring running times, use of different data structures for the same algorithm (wherever applicable) to see its effect on time and space, comparison of different algorithms for the same problem etc. Design of Algorithms: This will involve design and implementation of algorithms for problems not covered in class but related to topics covered in class. The exact set of algorithms to design and implement is to be decided by the instructor. In addition, there will be at least one significantly large design project involving some real-world application. An efficient design of the project should require the use of multiple data structures and a combination of different algorithms/techniques. The lab work can be carried out using any programming language.

Propositional logic: Syntax, semantics, valid, satisfiable and unsatisfiable formulas, encoding and examining the validity of some logical arguments; Recurrences, summations, generating functions, asymptotic; Sets, relations and functions: Operations on sets, relations and functions, binary relations, partial ordering relations, equivalence relations, principles of mathematical induction, Finite and infinite sets, countable and uncountable sets, Cantor’s diagonal argument and the power set theorem; Introduction to counting: Basic counting techniques - inclusion and exclusion, pigeon-hole principle, permutation, combination, generating function; Algebraic structures and morphisms: semigroups, groups, subgroups, homomorphism, rings, integral domains, fields; Introduction to graphs: paths, connectivity, subgraphs, isomorphic and homeomorphic graphs, trees, complete graphs, bipartite graphs, matchings, colourability, planarity, digraphs;

Text Books:

Number Systems, Boolean algebra, logic gates, minimization of completely and incompletely specified switching functions, Karnaugh map and Quine-McCluskey method, multiple output minimization, twolevel and multi-level logic circuit synthesis. Clocks, flip-flops, latches, counters and shift registers, finite state machine model, synthesis of synchronous sequential circuits, minimization and state assignment, Programmable logic devices: memory design. Data path control path partition-based design.

Experiments: Combinational logic circuits: Design and implementation of combinational circuits such as ALU and 7-segment LED display driver; Sequential Circuits: Design of sequence generators and detectors, counters, design of ASMs such as, traffic light controllers, lift controllers, etc. Digital design project: The students design and implement a final digital project of their choice.

References:

Linear programming: Introduction and Problem formulation, Concept from Geometry, Geo-metrical aspects of LPP, Graphical solutions, Linear programming in standard form, Simplex, Big M and Two-Phase Methods, Revised simplex method, Special cases of LPP.

Duality theory: Dual simplex method, Sensitivity analysis of LP problem, Transportation, Assignment and travelling salesman problem.

Integer programming problems: Branch and bound method, Gomory cutting plane method for all integer and for mixed integer LPP.

Theory of games: saddle point, linear programming formulation of matrix games, two-person zero-sum games with and without saddle-points, pure and mixed strategies, graphical method of solution of a game, solution of a game by simplex method. Computational complexity of the Simplex algorithm, Karmarkar's algorithm for LPP. Acquaintance to softwares like TORA and MATLAB.

Text Books:

Reference Books:

Bash shell programming – basic concepts, expressions, decision making selections, repetition, special parameters - positional parameters, shift, argument validation, script examples.

Android Basics: Getting started with Android development, project folder structure, simple programming, running project, generating build/APK of the app from Android Studio

First application: Creating Android Project, Android Virtual Device Creation, set up debugging environment, Workspace set up for development, launching emulator, debugging on mobile devices. Basic UI design: Basics about Views, Layouts, Drawable Resources, input controls, Input Events etc. Understand the app idea and design user interface/wireframes of mobile app

Set up the mobile app development environment.

Algebra of sets, probability spaces, random variables, cumulative distribution functions, mathematical expectations, conditional probability and expectation, moments and inequalities, special discrete and continuous probability distributions, function of a random variable, random vectors and their distributions, convolutions, joint, marginal and conditional distributions, product moments, independence of random variables, bivariate distributions and properties, order statistics and their distributions, sampling distributions, Central Limit Theorem, strong law of large numbers, sequence of random variables, modes of convergence, distributions of the sample mean and the sample variance for a normal population, chi-square, t and F distributions, method of moments and maximum likelihood estimation, concepts of unbiasedness, criteria for choosing estimators, consistency and efficiency of estimates, confidence intervals, pivotal quantities, confidence intervals for proportions, simple and composite hypothesis, null and alternative hypotheses, types of error, level and size of tests, the most powerful test and Neyman - Pearson Fundamental Lemma, tests for one- and two-sample problems for normal populations, tests for proportions, likelihood ratio tests, chi-sqaure test for goodness of fit. discrete and continuous stochastic processes, markov chains, transition probability matrix, state spaces, classification of states, stationary distributions, ergodicity, poisson process, birth and death process. Introduction to reliability analysis: Application of Bayes theorem in real life problem; Reliability analysis of simple syste serial, parallel and combined systems; First order uncertainty and reliability analysis (FORM), First order second mom (FOSM) and Advanced FOSM methods; Applications of risk and reliability analysis in engineering systems.

Text / Reference Books:

CPU - registers, instruction execution cycle, RTL interpretation of instructions, addressing modes, instruction set. Case study - instruction sets of some common CPUs; Assembly language programming for some processor; Data representation: signed number representation, fixed and floating point representations, character representation. Computer arithmetic - integer addition and subtraction, ripple carry adder, carry look-ahead adder, etc. multiplication – shift-and-add, Booth multiplier, carry save multiplier, etc. Division - non-restoring and restoring techniques, floating point arithmetic; CPU control unit design: hardwired and micro-programmed design approaches, Case study - design of a simple hypothetical CPU; Pipelining: Basic concepts of pipelining, throughput and speedup, pipeline hazards; Memory organization: Memory interleaving, concept of hierarchical memory organization, cache memory, cache size vs block size, mapping functions, replacement algorithms, write policy; Peripheral devices and their characteristics: Input-output subsystems, I/O transfers - program controlled, interrupt driven and DMA, privileged and non-privileged instructions, software interrupts and exceptions. Programs and processes - role of interrupts in process state transitions.

Familiarization with assembly language programming; Synthesis/design of simple data paths and controllers, processor design using HDL like verilog/vhdl; Interfacing - DAC, ADC, keyboard-display modules, etc. Development kits as well as Microprocessors/PCs may be used for the laboratory, along with design/simulation tools as and when necessary.

Regular Languages: Finite Automata-Deterministic and Nondeterministic, regular operations, Regular Expressions, Equivalence of DFA, NFA and Res, Nonregular Languages and pumping lemma

Context-Free Languages: Context-Free Grammars, Chomsky Normal Form, Pushdown Automata, Non Context-Free Languages and pumping lemma, Deterministic Context-Free Languages

Turing Machines: Definition of TM and its variants, Decidability, Reducibility.

Complexity Theory: Time complexity and Space Complexity.

Text Books:

Database system architecture: Data Abstraction, Data Independence, Data Definition and Data Manipulation Languages; Data models: Entity-relationship, network, relational and object oriented data models, integrity constraints and data manipulation operations; Relational query languages: Relational algebra, tuple and domain relational calculus, SQL and QBE; Relational database design: Domain and data dependency, Armstrong’s axioms, normal forms, dependency preservation, lossless design; Query processing and optimization: Evaluation of relational algebra expressions, query equivalence, join strategies, query optimization algorithms; Storage strategies: Indices, B-trees, hashing; Transaction processing: Recovery and concurrency control, locking and timestamp based schedulers, multi-version and optimistic Concurrency Control schemes; Recent Trends: XML Data, XML Schema, JSON and “NoSQL Systems, etc.

Books:

Database schema design, database creation, SQL programming and report generation using a commercial RDBMS like ORACLE/SYBASE/DB2/SQL-Server/INFORMIX. Students are to be exposed to front end development tools, ODBC and CORBA calls from application Programs, internet based access to databases and database administration.

Introduction: Alphabet, languages and grammars, productions and derivation, Chomsky hierarchy of lan- guages. Regular languages and finite automata: Regular expressions and languages, deterministic finite automata (DFA) and equivalence with regular expressions, nondeterministic finite automata (NFA) and equivalence with DFA, regular grammars and equivalence with finite automata, properties of regular languages, pumping lemma for regular languages, minimization of finite automata. Context-free languages and pushdown automata: Context-free grammars (CFG) and languages (CFL), Chomsky and Greibach normal forms, nondeterministic pushdown automata (PDA) and equivalence with CFG, parse trees, ambiguity in CFG, pumping lemma for context-free languages, deterministic pushdown automata, closure properties of CFLs. Context-sensitive languages: Context-sensitive grammars (CSG) and languages, linear bounded automata and equivalence with CSG. Turing machines: The basic model for Turing machines (TM), Turing- recognizable (recursively enumerable) and Turing-decidable (recursive) languages and their closure properties, variants of Turing machines, nondeterministic TMs and equivalence with deterministic TMs, unrestricted grammars and equivalence with Turing machines, TMs as enumera- tors. Undecidability: Church-Turing thesis, universal Turing machine, the universal and diagonalization languages, reduction between languages and Rice’s theorem, undecidable problems about languages.

References:

Basic functional blocks of a computer: CPU, memory, input-output subsystems, control unit. Instruction set architecture of a CPU - registers, instruction execution cycle, RTL interpretation of instructions, addressing modes, instruction set. Case study - instruction sets of some common CPUs; Assembly language programming for some processor; Data representation: signed number representation, fixed and floating point representations, character representation. Computer arithmetic - integer addition and subtraction, ripple carry adder, carry look-ahead adder, etc. multiplication – shift-and-add, Booth multiplier, carry save multiplier, etc. Division - non-restoring and restoring techniques, floating point arithmetic; CPU control unit design: hardwired and micro- programmed design approaches, Case study - design of a simple hypothetical CPU; Pipelining: Basic concepts of pipelining, throughput and speedup, pipeline hazards; Memory organization: Memory interleaving, concept of hierarchical memory organization, cache memory, cache size vs block size, mapping functions, replacement algorithms, write policy; Peripheral devices and their characteristics: Input-output subsystems, I/O transfers - program controlled, interrupt driven and DMA, privileged and non-privileged instructions, software interrupts and exceptions. Programs and processes - role of interrupts in process state transitions.

References:

Familiarization with assembly language programming; Synthesis/design of simple data paths and controllers, processor design using HDL like verilog/vhdl; Interfacing - DAC, ADC, keyboard-display modules, etc. Development kits as well as Microprocessors/PCs may be used for the laboratory, along with design/simulation tools as and when necessary.

Database system architecture: Data Abstraction, Data Independence, Data Definition and Data Manipulation Languages; Data models: Entity-relationship, network, relational and object oriented data models, integrity constraints and data manipulation operations; Relational query languages: Relational algebra, tuple and domain relational calculus, SQL and QBE; Relational database design: Domain and data dependency, Armstrongs axioms, normal forms, dependency preservation, lossless design; Query processing and optimization: Evaluation of relational algebra expressions, query equivalence, join strategies, query optimization algorithms; Storage strategies: Indices, B-trees, hashing; Transaction processing: Recovery and concurrency control, locking and timestamp based schedulers, multiversion and optimistic Concurrency Control schemes; Recent Trends: XML Data, XML Schema, JSON and “NoSQL Systems, etc,.

References:

Database schema design, database creation, SQL programming and report generation using a commercial RDBMS like ORACLE/SYBASE/DB2/SQL-Server/INFORMIX. Students are to be exposed to front end development tools, ODBC and CORBA calls from application Programs, internet based access to databases and database administration.

Process Management: process; thread; scheduling. Concurrency: mutual exclusion; synchronization; semaphores; monitors; Deadlocks: characterization; prevention; avoidance; detection. Memory Management: allocation; hardware sup- port; paging; segmentation. Virtual Memory: demand paging; replacement; allocation; thrashing. File Systems and Implementation. Secondary Storage: disk structure; disk scheduling; disk management. (Linux will be used as a running example, while examples will drawn also from Windows NT/7/8.); Advanced Topics: Distributed Systems. Security. Real-Time Systems.

References:

Programming assignments to build different parts of an OS kernel.

Evolution of computer networks; Physical Layer: Theoretical basis for data communication, transmission media and impairments, switching systems Medium Access Control Sublayer: Channel allocation Problem, multiple access protocols, Ethernet Data link layer: Framing, HDLC, PPP, sliding window protocols, error detection and correction Network Layer: Internet addressing, IP, ARP, ICMP, CIDR, routing algorithms (RIP, OSPF, BGP); Transport Layer: UDP, TCP, flow control, congestion control; Introduction to quality of service; Application Layer: DNS, Web, email, authentication, encryption.

References:

Simulation experiments for protocol performance, configuring, testing and measuring network devices and parameters/policies; network management experiments; Exercises in network programming.

The project can span the course Project-II. Hence it is expected that the problem specification and the milestones to be achieved in solving the problem are clearly specified.

The students who work on a project are expected to work towards the goals and milestones set in course Project-I. At the end there would be demonstration of the solution and possible future work on the same problem. A dissertation outlining the entire problem, including a literature survey and the various results obtained along with their solutions is expected to be produced.

Review of concepts of computer architecture: Study of an existing CPU: architecture, instruction set and the addressing modes, assembly language programming. Control unit Design: instruction interpretation, hardwired and micro-programmed methods of design. Pipelining and parallel processing, RISC and CISC paradigms, I/O Transfer techniques: programmed, interrupt-driven and DMA; Memory organization: hierarchical memory systems, cache memories, cache coherence, virtual memory.

Review of concepts of operating systems: Processes, threads, Unix fork-exec model, Unix signals, Interprocess communication, scheduling, memory management.

Review of concepts of computer networks: link layer protocols, local area networks (Ethernet and variants), interconnecting networks with IP, routing, transport layer protocols. Advanced concepts of distributed networked systems: Virtualization, distributed file systems, mass storage systems, recovery and fault tolerance, content networking including multimedia delivery.

Texts:

Discrete Structures Sets, Relations and Functions; Proof Techniques, Algebraic Structures, Morphisms, Posets, Lattices and Boolean Algebras.

Logic Propositional calculus and Predicate Calculus, Satisfiabiliy and validity, Notions of soundness and completeness. Automata and Languages -- Finite automata and regular expressions, pushdown automata and context-free grammars, pumping lemmas and closure properties of regular and context-free languages, non-context-free languages.

Computability theory Church-Turing thesis, Hilbert's problem, decidability, halting problem, reducibility; Complexity theory: time and space complexity, Classes P, NP, NP-complete, PSPACE, and PSPACE-complete

Texts:

References:

Problem Solving using Computers - Abstraction - Abstract data types; Data Representation; Elementary data types; Basic concepts of data Structures; Mathematical preliminaries - big-Oh notation; efficiency of algorithms; notion of time and space complexity; performance measures for data structures.

ADT array - Computations on arrays -sorting and searching algorithms. ADT Stack, Queue, list - array, linked list, cursor based implementations of linear structures.

ADT Tree - tree representation, traversal of trees;

ADT Binary tree - binary trees, threaded binary trees, application of binary trees -Huffman coding; application of threaded binary trees - differentiation;

Search Tree - Binary search tree; balanced binary search trees - AVL tree; Applications of Search Trees - TRIE; 2-3 tree, 2-3-4 tree; concept of B-Tree.

ADT Dictionary - array based and tree based implementations; hashing - definition and application - LZW encoding. ADT Priority Queue - Heaps; heap-based implementations; applications of heaps - sorting; Graphs - shortest path, minimum spanning tree, DFS, BFS - an application of DFS and BFS.

Algorithm Design Paradigms - greedy, divide and conquer, dynamic Programming, backtracking.

References:

Probability : algebra of sets, monotone class, sigma fields, Borel sigma fields, set function, product spaces, measurable transformations, probability measure, notions of probability space and some consequences, Borel-Cantelli Lemma Discrete, continuous and mixed type probability spaces, cumulative distribution functions, probability mass (density) functions, mathematical expectations, general concepts of conditional probability and expectation, conditional expectation given a sigma field, properties of conditional expectation, moments, moment and probability generating functions, moment inequalities: Markov, Chebyshev-Bienayme, Lyapunov.

Special Probability Distributions : Discrete and continuous uniform, binomial, beta, Cauchy, Negative Binomial, Hypergeometric, Gamma, Normal, Lognormal, Weibull, Pareto distributions, generalized distributions, Approximation properties of discrete distributions, Beta-Binomial and Poisson-Gamma relationship. Function of a random variable, random vectors and their distributions, convolutions, Joint, marginal and conditional distributions, product moments, correlation, independence of random variables, bivariate distributions and properties, order statistics and their distributions, further properties.

Sampling Distributions: The Central Limit Theorem, Demoivre theorem, uniform convergence in CLT, characteristics functions, continuity theorems, strong law of large numbers, Sequence of random variables, modes of convergence and some results, Slutsky theorem, distributions of the sample mean and the sample variance for a normal population, Chi - Square, t and F distributions and their distributional properties Point and Interval Estimation : The method of moments and the method of maximum likelihood estimation, large sample properties, concepts of unbiasedness, criteria for choosing estimators, consistency and efficiency of estimates, confidence intervals for the parameters of common distributions, pivotal quantities, confidence intervals for proportions (one and two samples problems) .

Testing of Hypotheses : simple and composite hypothesis, Null and alternative hypotheses, critical and acceptance regions, two types of error, level and size of test, error probabilities of a test, the most powerful test and Neyman - Pearson Fundamental Lemma, tests for one sample and two sample problems for normal populations, tests for one sample and two sample proportions, Likelihood ratio tests, Chisqaure test for goodness of fit.

Stochastic Processes: illustrations of stochastic processes, stochastic matrices, Markov chains: finite and countably infinite state spaces, Classification of states, strong markov property, stationary distributions, time reversible markov chains, Branching processes, ergodic and nonergodic markov chains, recurrent and transient random walk, General Markov processes in discrete and continuous state spaces. Poisson process: homogeneous and nonhomogeneous,
pure birth process, birth and death process, regenerative processes, notions of queuing models

References:

Introduction, Problem Solving: Uninformed search, Informed search, local Search, Online search; Knowledge and Reasoning: Building a Knowledge Base, Semantic Nets, Frames, First order logic, Inference in First Order Logic; Probabilistic Reasoning Systems: Bayes’ Nets; Learning: Learning from examples and analogy, Naive Bayes, Computational Learning Theory, Explanation Based Learning, Neural Networks; Evolutionary Optimization: Genetic algorithms, Multi objective optimization, Differential Evolution, Particle Swarm Optimization; Introduction to NLP;

Introduction to Fuzzy sets.

References:

Journals:- Artificial Intelligence, AI Magazine, IEEE Expert, Machine Learning, Computer Vision Image Processing and Graphics, IEEE Transactions on Neural Networks.

Testing Background, The Realities of Software Testing, Verification and Validation, Testing Fundamentals, Examining the Specification, Examining the Code, Configuration Testing, Compatibility Testing, Usability Testing, Special Testing Techniques; Test Management, Test Automation and Testing Tools; Recent Trends in Software Testing;

Books:

Basic concepts. Models of computation: shared memory and message passing systems, synchronous and asynchronous systems. Logical time and event ordering. Global state and snapshot algorithms, mutual exclusion, clock synchronization, leader election, deadlock detection, termination detection, spanning tree construction. Programming models: remote procedure calls, distributed shared memory. Fault tolerance and recovery: basic concepts, fault models, agreement problems and its applications, commit protocols, voting protocols, checkpointing and recovery, reliable communication. Security and Authentication: basic concepts, Kerberos. Resource sharing and load balancing. Special topics: distributed objects, distributed databases, directory services, web services.

References:

Introduction to sparse matrices, Storage Schemes, Permutations and Reorderings, , Sparse Direct Solution Methods. Iterative methos and Preconditioning Convergence Krylov Subspaces, Arnoldi’s Method, GMRES, Symmetric Lanczos Algorithm, conjugate Gradient Algorithm, Convergence Analysis, Block Krylov Methods, Preconditioned Conjugate Gradient, Preconditioned GMRES, Jacobi, SOR, and SSOR Preconditioners, ILU Factorization Preconditioners, Block Preconditioners, Types of Partitionings, Techniques, Direct Solution and the Schur Complement, Schur Complement Approaches, Full Matrix Methods, Graph Partitioning: Geometric Approach, Spectral Techniques. Newton’s method and some of its variations, Newton method in several dimension, continuation methods, conjugate direction method and Davidon-Fletcher-Powell Algorithms, Introduction to Non- linear Multigrid with applications. HPC kernels (BLAS, multicore and GPU computing)

Texts / References:

Introduction: VLSI design flow, challenges.

Verilog/VHDL: introduction and use in synthesis, modeling combinational and sequential logic, writing test benches. Logic synthesis: two-level and multilevel gate-level optimization tools, state assignment of finite state machines. Basic concepts of high-level synthesis: partitioning, scheduling, allocation and binding. Technology mapping. Testability issues: fault modeling and simulation, test generation, design for testability, built-in self-test. Testing SoC's. Basic concepts of verification. Physical design automation. Review of MOS/CMOS fabrication technology. VLSI design styles: full-custom, standard-cell, gate-array and FPGA.

Physical design auto-mation algorithms: floor-planning, placement, routing, compaction, design rule check, power and delay estimation, clock and power routing, Special considerations for analog and mixed-signal designs.

References::

Introduction and background knowledge of complex networks; Network analysis metrics like paths, components, degree distribution, clustering, degree correlations, centrality etc., social network analysis methods; Introduction to network analysis tools like iGraph and Pajek; Properties of networks like scale-free, small world; Network evolution models like random networks, preferential attachment models and its variants, Watts & Strogatz model; Community detection methods and real world application of community detection; Dynamics on networks like percolation,
spreading, synchronization and real world applications.

Texts:

References:

Wireless technologies: Antennas and radio propagation. Signal encoding and modulation techniques. Spread spectrum. Coding and error control.

Wireless Networking: Cellular wireless networks and systems principles. Mobile IP and Wireless Access Protocol. Multiple access techniques.

Wireless LANs: Wireless LAN technology. Wireless standard (IEEE 802.11 etc.). Bluetooth. Ad-hoc Networks. Architectures and routing protocols for hybrid wireless networks, Issues and challenges in wireless sensor networks:

Texts:

References:

Overview: vulnerabilities, risk assessment, incidents.

Cryptography: Classical Cryptography, Symmetric Cryptography, Public Key (Asymmetric cryptography), Modern Cryptography(RSA, ECC), Hash Functions, Digital Signature.

Authentication and Key Management : Entity authentication, Key exchange, Key management, Kerberos Networking. Security: Security at application layer (PGP, S/MIME), Security at Transport Layer (SSL and TLS), Security at Network Layer (IPSEC)

System Security: Unix Security, Vulnerabilities and Counter Measures (Viruses, worms, Trojan horses, backdoors, buffer overflows, RPC), Exploits (Buffer overflow, Port Scanning etc). Firewalls, VPN etc, Secure (commerce) Transaction over a network.

Current network security Issues: Texts :

References:

Introduction to formal methods; Analysis Vs. Verification; Correctness and soundness theorem; Formal semantics: operational, denotational, axiomatic; Specification Languages; Various formal methods and their application to verification and analysis: Model Checking, Abstract Interpretation, Shadow semantics, Hoare logic, Theorem Proving.

References:

Syllabus : Introduction to Pattern Recognition: Learning paradigms, Supervised and unsupervised learning; Bayesian decision theory: Minimum error rate classifier.

Parameter estimation: Maximum likelihood and Bayesian Estimation; Hidden Markov models; Nonparametric techniques: Nearest neighbor rules, Parzen windows; Decision trees: Axis-parallel, Oblique, Impurity measures; Feature selection: Forward, backward search; Component analysis and discriminate functions: Principal component analysis, Fisher linear discriminate, Perceptron, Support vector machines; Generalization ability of learning methods: Bias and variance, Regularization; Bootstrapping, Boosting, Bagging; Unsupervised learning and clustering: k-Means methods.

Texts:

References:

Database Computation Models: Page and Object Models

Correctness in databases: Serializability - review of the basic theory, multiversion serializability, semantic serializability, relative atomicity, relative serializability, etc.

Concurrency control methods: Two phase locking, timestamp and optimistic methods, tree locking. Correctness in Software Transactional Memory (STM): Opacity, Virtual Worlds Consistency, Abort Shielded Consistency.

Page model crash and recovery: Expanded Schedules, Page-Model Correctness Criteria, Sufficient Syntactic Conditions, Further Relationships Among Criteria, Extending Page-Model CC Algorithms, Redo, undo algorithms. Object model crash and recovery: Unified concurrency control and recovery, compensating transactions, Algorithm for 2-Layered Systems, Algorithm for General Executions.

Special Database Systems: Object based, Semi-structured, Active, Deductive, Temporal, Spatial, Multimedia. Database Security: Access Control Models MAC, DAC, RBAC.

Datawarehousing: Multidimensional data model, OLAP, Data Warehouse Architecture This course will draw materials mainly from the books given below. However, there are many research papers that will help understand the course contents. These will be provided on time to time basis.

Suggested Text Books:

Reference Books:

Basics of OS programming: process creation and synchronization, shared memory and semaphore, shell programming.

Socket programming, database creation and update, building large client server applications. Basics of compiler writing using lex and yacc .

Object-oriented programming concepts and implementation of abstract data types. Implementation of graph algorithms. Linear programming with applications.

Basic concepts. Models of computation: shared memory and message passing systems, synchronous and asynchronous systems. Logical time and event ordering. Global state and snapshot algorithms, mutual exclusion, clock synchronization, leader election, deadlock detection, termination detection, spanning tree construction. Programming models: remote procedure calls, distributed shared memory. Fault tolerance and recovery: basic concepts, fault models, agreement problems and its applications, commit protocols, voting protocols, checkpointing and recovery, reliable communication. Security and Authentication: basic concepts, Kerberos. Resource sharing and load balancing. Special topics: distributed objects, distributed databases, directory services, web services.

Texts:

References:

Overview of computer networks, the Internet and OSI model Responsibilities of the Data Link Layer, Network Layer and Transport Layer; Local Area Networks – Ethernet, Token Ring etc. Scheduling algorithms and MAC layer protocols (Link Layer) Routing protocols - BGP, RIP, OSPF, AODV etc. (Network Layer). Congestion control Algorithms (Transport Layer). Peer-to-peer and client-server programming using sockets in TCP and UDP. Quality of Service (QoS) Provisioning Network Security

Texts:

References:

Symmetric key encryption algorithm, Key distribution, Stream Ciphers, Pseudo Random Numbers, Public Key Cryptography, Hashes and Message Digests, Digital Signatures, Certificates, User Authentication. System authentication, IPSec, Virtual Private Networks Secure Socket layer, transport layer security.

Texts:

References:

Algorithmic paradigms: Dynamic Programming, Greedy, Branch-and-bound; Asymptotic complexity, Amortized analysis; Graph Algorithms: Shortest paths, Flow networks; NP-completeness; Approximation algorithms; Randomized algorithms; Linear programming; Special topics: Geometric algorithms (range searching, convex hulls, segment intersections, closest pairs), Numerical algorithms (integer, matrix and polynomial multiplication, FFT, extended Euclid's algorithm, modular exponentiation, primality testing, cryptographic computations), Internet algorithms (text pattern matching, tries, information retrieval, data compression, Web caching).

References:

References: