CS101 Introduction to Computing

Digital computer fundamentals: flowcharts, the von Neumann architecture, programs, assembly language, high level programming languages, text editors, operating systems. Imperative programming (Using C): data types, variables, operators, expressions, statements, control structures, functions, arrays and pointers, recursion, records (structures), files, input/output, some standard library functions and some elementary data structures.

Program development: programming tools, testing and debugging.

Texts:

References:

CS110 Computing Laboratory

Laboratory experiments will be set in consonance with the material covered in CS 101. This will include assignments in a programming language like C.

References:

CS201 OOP and Data Structures

From C to Java: basics of Java, introduction to the object oriented programming (OOP) concepts (such as classes, objects, constructors, destructors, inheritance, polymorphism, operator overloading) using Java, JVM, applets, APIs, GUI Programming. From Java to C++: the OOP concepts using C++. Performance of algorithms: space and time complexity, asymptotics. Fundamental Data structures: linked lists, arrays, matrices, stacks, queues, binary trees, tree traversals. Algorithms for sorting and searching: linear search, binary search, insertion-sort, bubble-sort, quicksort. Priority Queues: lists, heaps. Graphs: representations, depth first search, breadth first search. Hashing: separate chaining, linear probing, quadratic probing. Search Trees: binary search trees, red-black trees, AVL trees, splay trees, B-trees.

Texts:

References:

CS203 Discrete Mathematics

Set theory: sets, functions, relations, partial orders, lattices. Logic: propositional logic (formulae, truth tables, proof systems, soundness and completeness of proof systems), predicate logic (formulae, interpretations, proof systems, soundness and completeness of proof systems). Combinatorics: permutations, combinations, partitions, Stirling numbers. Recurrences, summations, generating functions, asymptotics. Graph Theory: paths, connectivity, subgraphs, isomorphic and homeomorphic graphs, trees, complete graphs, bipartite graphs, matchings, colourability, planarity, digraphs. Algebraic Structures: semigroups, groups, subgroups, homomorphisms, rings, integral domains, fields.

Texts:

References:

CS221 Digital Design

Number Systems: representations of numbers (binary, octal, decimal, and hexadecimal), arithmetics of signed and unsigned numbers. Boolean Algebra and logic gates: gate level minimization of Boolean functions. Combinational logic circuits: design and analysis, some standard combinational circuits (encoders, decoders, multiplexers). Sample and hold Circuits, Analog-to-Digital Converter, Digital-to-Analog Converter. Synchronous sequential logic circuits: design and analysis; flip-flops, registers, counters; finite state model: state tables and state diagram, state minimization. Asynchronous sequential logic circuits: design and analysis; incompletely specified machines; reduction of states and flow tables; race free state assignments. Programmable logic devices: memory, PLA, PAL. Representation and synthesis using ASM charts.

Texts:

References:

HS201 INTRODUCTORY MICROECONOMICS

Introduction:Why Economics, The Central Economic Problem, Production Possibility Curve (PPC)

Overview of Markets:Demand and Supply, Elasticity, Efficiency and Equity, Markets in Action

Determinants of Demand and Supply:Utility and Demand, Production and Costs

Markets for Goods and Services:Competition, Monopoly, Monopolistic Competition and Oligopoly

Markets and Government:Externalities, Public Goods and Taxes, Factor markets, Income distribution

Texts:

References:

HS221 FUNDAMENTALS OF LINGUISTICS SCIENCE

Introduction:Language; Linguistics; Language Learning

Phonetics (Sound Systems):Mechanism of Speech Production, Consonants, Vowels , Phonotactic Rules, Phonology: Phonemes

Morphology:Morphemes, Structure of Words

Syntax:Constituents of a Sentence, Structure of a Sentence; Grammar; Acceptability and Grammaticality; Principles and Parameters; Prescriptive, Descriptive, and Explanatory Adequacy, Syntactic Tools; Principles of modern linguistics with special reference to English and Hindi syntax

Use of language:Language in Literature, Media, Language in Advertisement

Sociolinguistics:Language is Social Context; Multilingualism

Language and Politics:Language in Constitution; Language and Dialect

Psycholinguistics:Language Acquisition; Universal Grammar

Semantics 2:Language Change and Language Variation, Language and Computers

Text and References:

HS231 INTRODUCTORY SOCIOLOGY

Introduction: Sociological Imagination; Subject matter of Sociology

Theoretical Practice:Durkheim (Foundations of the Science of Society), Weber (Economy and Society),Marx (Political Economy), Foucault (Practices and Knowledge), Butler (Gender Performativity), & Burawoy (Public Sociology).

Methodology and Methods:Qualitative, Quantitative, and Mixed

Indian Society:Eminent Indian Sociologists; Caste, Class, and Tribe; Women and Children; Health and Education; Science, Technology and Society; Media and Migration;Globalization and Social Change; Diaspora; Bihar- a case study.

Text and References:

HS241 General Psychology

Aim of the Course

This course covers some of the biological, psychological, and individual factors which influence human thinking, beliefs, and behaviour. This knowledge will help students in understanding their own behaviours and behaviours of others. They can also apply psychological theories and principles in their workplace and practical life.

Course Contents

Introduction: Brief History of Psychology; Human Mind and Human Behaviour; Definition; Methods; Scope and Subject Matter.

Perception: Process; Determinants of Perception; Gestalt Theory; Extra-Sensory Perception; Intuitive Judgement.

Intelligence: Concept of Intelligence; Factors and Measurement of Intelligence; Successful Intelligence and Emotional Quotient (EQ).

Learning: Process of Learning, Retention and Recall; Theories of Learning; Effective Methods of Learning.

Remembering and Forgetting:Information Processing Approach; Sensory Information Stage; Short-Term and Long-Term Memory; Process of Forgetting.

Thinking: Nature of Thinking; Concept Formation; Problem Solving; Creative Thinking; Day Dreaming.

Personality: Definition; Determinants of Personality; Theories of Personality; Assessment of Personality.

Abnormality: Normal and Abnormal; Cause and Significance of Symptoms and Mental Diseases; Mental Health; Spiritual Counselling.

Books Recommended

CS204 Algorithms

Models of Computation: Turing machines and random access machines, space and time complexity measures, lower and upper bounds. Design and analysis techniques: the greedy method, divide-and-conquer, dynamic programming, backtracking, branch and bound, amortized analysis. Priority Queues: lists, heaps, binomial heaps, Fibonacci heaps. Sorting and order statistics: sorting algorithms (insertion-sort, bubble-sort, shell-sort, quicksort, merge-sort, heapsort and external-sort) and their analyses, selection. Graph Algorithms: connectivity, biconnectivity, topological sort, shortest paths, minimum spanning trees, maximum flow. Advanced topics: the disjoint set union problem; string matching; NP-completeness; geometric, approximation, parallel, and randomized algorithms.

Texts:

References:

CS222 Computer Organization and Architecture

Memory organization: hierarchical memory systems, cache memories, cache coherence, virtual memory. System buses: interconnection structures and bus interconnection. Arithmetic Logic Unit. Study of an existing CPU: architecture, instruction set and the addressing modes supported; assembly language programming. Control unit Design: instruction interpretation, hardwired and microprogrammed methods of design. RISC and CISC paradigms. I/O Transfer techniques: programmed, interrupt-driven and DMA; I/O processors and channels, mapping of I/O addresses. Advanced architectures: parallel and pipelined systems, dataflow, hypercubes, superscalar processors.

Texts:

References:

CS223 Hardware Laboratory

Design of synchronous and asynchronous sequential circuits. Digital system design using RTL level functional blocks. Design of various controllers using hardwired and/or microprogrammed techniques. Design of a CPU using SSI/MSI/LSI level components: choice of word size, instruction format, I/O and memory interface, datapath, control unit. Introduction to hardware description languages such as VHDL, Verilog, etc.

References:

CS241 Software Engineering

The software life cycle, nature and qualities of software, software engineering principles. Software project management: planning, scheduling, monitoring, control, risk management. Requirements specification: specification styles (informal, formal), operational and descriptive specifications. Software Design: function-oriented and object-oriented approaches; architectural, component-level and user-Interfaces design; structured programming and implementation. Verification: testing (strategies and techniques), formal methods, validation. Advanced topics: maintenance, reengineering, product metrics. Software Engineering tools and environments. Use of some software engineering packages in laboratory assignments.

Texts:

References:

CS242 Systems Programming Laboratory

Linux administration: basic utilities, make, logging, backup, authentication; PERL programming; Unix system calls and shell programming; electronic mail administration; assemblers, linkers and loaders; assembly language programming; introduction to LaTeX.

References:

GREEN CHEMISTRY AND TECHNOLOGY

Principles and Concepts of Green Chemistry: Sustainable development, atom economy, reducing toxicity. Waste: production, problems and prevention, sources of waste, cost of waste, waste minimization technique, waste treatment and recycling. Catalysis and Green Chemistry: Classification of catalysts, heterogeneous catalysts heterogeneous catalysis, biocatalysis. Alternate Solvents: Safer solvents, green solvents, water as solvents, solvent free conditions, ionic liquids, super critical solvents, fluorous biphase solvents. Alternative Energy Source: Energy efficient design, photochemical reactions, microwave assisted reactions, sonochemistry and electrochemistry. Industrial Case Studies: Greening of acetic acid manufacture, Leather manufacture (tanning, fatliquoring), green dyeing, polyethylene, ecofriendly pesticides, paper and pulp industry, pharmaceutical industry. An integrated approach to green chemical industry.

Texts:

References:

Algebra and Number Theory

Algebra: Semigroups, groups, subgroups, normal subgroups, homomorphisms, quotient groups, isomorphisms. Examples: group of integers modulo m, permutation groups, cyclic groups, dihedral groups, matrix groups. Sylow's theorems and applications. Basic properties of rings, units, ideals, homomorphisms, quotient rings, prime and maximal ideals, fields of fractions, Euclidean domains, principal ideal domains and unique factorization domains, polynomial rings. Finite field extensions and roots of polynomials, finite fields.

Number Theory: Divisibility, primes, fundamental theorem of arithmetic. Congruences, solution of congruences, Euler's Theorem, Fermat's Little Theorem, Wilson's Theorem, Chinese remainder theorem, primitive roots and power residues.
Quadratic residues, quadratic reciprocity. Diophantine equations, equations ax+by=c, x²+y²=z², x⁴+y⁴=z² Simple continued fractions: finite, infinite and periodic, approximation to irrational numbers, Hurwitz's theorem, Pell's equation. Partition functions: Formal power series, generating functions and Euler's identity, Euler's theorem, Jacobi's theorem, congruence properties of p(n). Arithmetical functions: Φ(n), μ(n), d(n), σ(n). A particular Dirichlet series for Riemann Zeta Function.

Texts:

References:

INTRODUCTION TO COMPUTATIONAL TOPOLOGY

1. Introduction and general notions of point set topology : Open and Closed Sets, Neighbourhoods, Connectedness and Compactness, Separation, Continuity.

2. An overview of topology and classification of surfaces : Surfaces – orientable and non-orientable, their topology, classification of closed surfaces

3. Combinatorial Techniques : Simplicial complexes, and simplicial maps, triangulations, Euler characteristics, Maps on surfaces.

4. Homotopy and Homology Groups: Introducing Groups and concept of Homotopy, fundamental group and its calculations, Homology.

5. Calculating Homology : Computation of homology of closed surfaces.

6. Topics in Geometry : Delauny triangulations, Voronoi diagrams, Morse functions

Texts:

References:

INTRODUCTION TO NUMERICAL METHODS

Number Representation and Errors: Numerical Errors; Floating Point Representation; Finite Single and Double Precision Differences; Machine Epsilon; Significant Digits.

Numerical Methods for Solving Nonlinear Equations: Method of Bisection, Secant Method, False Position, Newton‐Raphson's Method, Multidimensional Newton's Method, Fixed Point Method and their convergence.

Numerical Methods for Solving System of Linear Equations:Norms; Condition Numbers, Forward Gaussian Elimination and Backward Substitution; Gauss‐Jordan Elimination; FGE with Partial Pivoting and Row Scaling; LU Decomposition; Iterative Methods: Jacobi, Gauss Siedal; Power method and QR method for Eigen Value and Eigen vector.

Interpolation and Curve Fitting: Introduction to Interpolation; Calculus of Finite Differences; Finite Difference and Divided Difference Tables; Newton‐Gregory Polynomial Form; Lagrange Polynomial Interpolation; Theoretical Errors in Interpolation; Spline Interpolation; Approximation by Least Square Method.

Numerical Differentiation and Integration: Discrete Approximation of Derivatives: Forward, Backward and Central Finite Difference Forms, Numerical Integration, Simple Newton‐Cotes Rules: Trapezoidal and Simpson's (1/3) Rules; Gaussian Quadrature Rules: Gauss‐Legendre, Gauss‐Laguerre, Gauss‐Hermite, Gauss‐Chebychev.

Numerical Solution of ODE & PDE: Euler's Method for Numerical Solution of ODE; Modified Euler's Method; Runge‐Kutta Method (RK2, RK4), Error estimate; Multistep Methods: Predictor‐Corrector method, Adams‐Moulton Method; Boundary Value Problems and Shooting Method; finite difference methods, numerical solutions of elliptic, parabolic, and hyperbolic partial differential equations.

Exposure to software package MATLAB.

Texts:

References:

OPTIMIZATION TECHNIQUES

Introduction to linear and non-linear programming. Problem formulation. Geo- metrical aspects of LPP, graphical solution. Linear programming in standard form, simplex, Big M and Two Phase Methods. Revised simplex method, special cases of LP. Duality theory, dual simplex method. Sensitivity analysis of LP problem. Transportation, assignment and traveling salesman problem. Integer programming problems-Branch and bound method, Gomory cutting plane method for all integer and for mixed integer LP. Theory of games: Computational complexity of the Simplex algorithm, Karmarkar's algorithm for LP. Unconstrained Optimization, basic descent methods, conjugate direction and Newton's methods. Acquaintance to Optimization softwares like TORA.

Texts:

References:

Optics & Lasers

Review of basic optics: Polarization, Reflection and refraction of plane waves. Diffraction: diffraction by circular aperture, Gaussian beams.

Interference: two beam interference-Mach-Zehnder interferometer and multiple beam interference-Fabry-Perot interferometer. Monochromatic aberrations. Fourier optics, Holography. The Einstein coefficients, Spontaneous and stimulated emission, Optical amplification and population inversion. Laser rate equations, three level and four level systems; Optical Resonators: resonator stability; modes of a spherical mirror resonator, mode selection; Q-switching and mode locking in lasers. Properties of laser radiation and some laser systems: Ruby, He-Ne, CO2, Semiconductor lasers. Some important applications of lasers, Fiber optics communication, Lasers in Industry, Lasers in medicine, Lidar.

Texts:

Vacuum Science and Techniques

Fundamentals of vacuum, units of pressure measurements, Gas Laws (Boyles, Charles), load-lock chamber pressures, Partial and Vapor Pressures, Gas flow, Mean free path, Conductance, Gauges, Capacitance Manometer, Thermal Gauges, Thermocouple, Pirani Gauge, Penning Gauge, High Vacuum Gauges, Leak Detection, Helium Leak Detection, Cold Cathode Gauge, Roughing (Mechanical) Pumps, Pressure ranges, High Vacuum Pumps: Oil Diffusion Pump, Tolerable fore line pressure System configuration, Oils, Traps Crossover pressure calculations, Pump usage and procedures, Turbomolecular pump, Cryopumps, Pump usages, Out gassing and Leak Testing.

Introduction to Deposition, Anti Reflection (AR) Coatings, Mono-dimensionally modulated (MDM) Filters, Vacuum Coatings, High reflectors, e-Beam deposition systems, Film Stoichiometry, Sputtering, Itching and Lithography, Chemical Vapour deposition and Pulse Laser deposition, Mass Flow control, Reactive sputtering, Film growth control.

Texts:

References:

INTRODUCTORY MACROECONOMICS

Introduction: Alternative Economic Systems, Government and the Markets, Supply and Demand in Macroeconomics, Aggregate Demand and Supply, Macroeconomic Issues: Measuring the Economy, Economic Growth, Macroeconomics and Income, Aggregate Expenditures, Fiscal Policy, Inflation, Unemployment and Employment, Money and Banking: Money Creation, Monetary Policy, Role of Money in Macroeconomics, Commercial and Central Bank ,International Trade: International Trade, Trade and International Currency, Balance of payments and exchange rate, Exchange Rates and Their Effects

Texts:

References:

LITERATURE: VOICES AND CULTURES

Identity and diversity of culture, Concepts - ideology, power, hegemony. The voice of suppressed women in Charlotte Bronte’s ‘Jane Eyre’, the appearance of the independent woman in ‘Jane Eyre’, woman-woman relationship in ‘Kamala’, challenging patriarchy in ‘Kamala’, Violence and Racism in Alice Walker’s ‘The Colour Purple’, Disruption of traditional roles in ‘The Colour Purple’, The voice of the underdogs in ‘Untouchable’, the female voice in ‘Untouchable’, laws and human behaviour in ‘The God of Small Things’, hierarchies in ‘Indian Society’ in ‘the God of Small Things’, the voice of the Black women in Phillis Wheatley’s ‘On Being Brought from Africa to America’ and A. Ruth’s ‘A Black Woman, Nothing Else’, the voice of the powerless in Langston Hughes ‘Ballad of the Landlord’.

Texts:

References:

LANGUAGE, HUMAN MIND, AND INDIAN SOCIETY

Language: Form and function (Competence vs. Performance), Language as a rule-governed system, Language constitutive of being human; Languages of India: Language families (Genealogical classification of languages), India as a linguistic Area; Human mind: Cognitive language faculty, Biological foundations of language, Language acquisition, Human and non-human systems of communication, Construction of knowledge, Language processing, comprehension and production, Bilingualism and cognitive growth; Indian Society: Multilingualism vs. Bilingualism, India as a multilingual nation, Identities and language, Implications for pedagogy (Multilingual approaches to education), Language and dialect, Politics of language in India

Texts:

References:

COGNITION: LANGUAGE AND COMPUTATION

Language: Study of language as a rule governed system (Structure of Language), Acquisition of language, Universal Grammar, Knowledge of Language; Cognitive Science: Introduction, Study of Human Mind, Language and Human Mind, Language as a Cognitive Behavior; Cognitive Computation: Formal Models of Computation, Church-Turing Thesis, Chomsky/Machine Hierarchy; Human Cognition as Computation: Cognitive Architecture, Production System Architecture, Problem Spaces, Protocol Analyses; Artificial Intelligence and the Design of Intelligent Systems: Physical Symbol System Hypothesis, Representation and Semantics, General Models of Search, Knowledge & Search, Computational Limits and Rationality.

Texts:

References:

CS301 Formal Language and Automata

Basic concepts: alphabets, languages, and grammars. Regular Languages: regular expressions and algebraic laws thereof; deterministic and nondeterministic finite automata (DFAs and NFAs): equivalence of DFAs and NFAs, minimization of DFAs, Myhill-Nerode theorem; regular grammars; closure properties of regular languages; Pumping lemma; decidable properties of regular languages. Context free languages: context free grammars (CFGs): derivations, derivation trees, ambiguous grammars, inherently ambiguous languages, normal forms of CFGs: Chomsky Normal Form and Greibach Normal Form; pushdown automata (PDAs): deterministic and nondeterministic PDAs (DPDAs and NPDAs); deterministic CFLs, LL (k) and LALR grammars; closure properties of CFLs; Pumping lemma and Ogden’s Lemma; decidable properties of CFLs. Context sensitive languages: context sensitive grammars; linear bounded automata. Recursively enumerable languages: unrestricted grammars; Turing machines: variants and equivalence thereof; random access machine and its equivalence with Turing machine.

Texts:

References:

CS331 Programming Language

Introduction to various programming paradigms and their implementation issues. Imperative programming: block structure; scoping rules; parameter passing etc. in languages like C, Pascal, Fortran. Object-oriented programming: abstraction, hiding; objects; classes; inheritance etc in languages like C++, Modula, Java. Functional programming: functions; recursion; types; polymorphism; storage allocation etc in languages like LISP, ML, Scheme. Logic programming: Horn clauses; SLD-resolution etc in languages like Prolog. Introduction to concurrent programming: expressing parallelism; communication; synchronization etc in languages like Ada, CSP, Linda. Semantics of programming languages. (The course will include programming lab assignments in various languages.)

Texts:

References:

CS341 Operating Systems

Process Management: process; thread; scheduling. Concurrency: mutual exclusion; synchronization; semaphores; deadlocks. Memory Management: allocation; protection; hardware support; paging; segmentation. Virtual Memory: demand paging; allocation; replacement; swapping; segmentation; TLBs. File Management: naming; file operations and their implementation. File systems: allocation; free space management; directory management; mounting. I/O Management: device drivers; disk scheduling; block I/O; character I/O. (Unix will be used as a running example, while examples will drawn also from DOS and NT.)

Texts:

References:

CS342 Operating Systems Laboratory

Programming assignments to build parts of an OS kernel. Use of a teaching package such as Nachos.

CS343 Data Communications

Basics of Digital Communications: signals, noise, Nyquist’s rate, Fourier transforms of signals, harmonics. Baseband and broadband transmission: modulation techniques; fundamentals of modems; local loop implementation. Digital transmission of voice: PCM, ADPCM, time division multiplexing; T1, T3 formats. Fibre optics: basic principles; SONET; technologies. VSAT technology: TDMA, DAMA; point-to-point wireless communication (microwave). Local Area Networks: Ethernet (CSMA/CD operation; parameters, specifications, limitations); cabling (Ethernet, Fast-Ethernet, Gigabit Ethernet; hubs, patch panels, wiring closets); bridges; switches; virtual LANs; 100BaseT; 100BaseVGANY; gigabit Ethernet; FDDI; token ring; wireless networks; ISDN, B-ISDN.

Texts:

References:

CS344 Databases

Data models: entity-relationship, relational, network, hierarchical, and logic data models, with the emphasis on the relational model. Query languages: relational algebra, relational calculus, SQL, QBE. Theory of database design: functional dependencies; normal forms: 1NF, 2NF, 3NF, Boyce-Codd NF; decompositions; normalization; multivalued dependencies, join dependencies, 4NF, 5NF. Data storage and indexing: disks, files, file organizations, indexes; tree structured indexing (ISAM, B-trees), hash based indexing. Query processing: evaluation of relational operators, query optimization; transcation management, Concurrency control; error recovery; security. Case studies: ORACLE, Microsoft access etc. Introduction to Open Database Connectivity, Client-Server environment etc.

Texts:

References:

CS345 Databases Laboratory

Familiarization with various databases packages like Microsoft Access, ORACLE, SQL Server, DB2 etc. Client-server and 3 tier web enabled database programming. Use of Application servers. Design and implementation of a Database application using a multi-user DBMS.

ENTREPRENEURSHIP

Topic: Introduction

Understanding Entrepreneurship: Entrepreneurship & Economic Growth. The Entrepreneurial Method –Effectual & Casual, Myths of Entrepreneurship Idea, Generation Exercise

Topic: Accounting and Finance

Form of Business Organization
Generally accepted Accounting Principles (GAAP)
Rules of Double-Entry Accounting
Type of Financial Statement & Relationship of Financial Statements
Preparation of Accounting Statements
Preparing Final Plan
Valuation of New Ventures
Venture Capital Financing

Topic: Sales and Marketing

What is Marketing? Marketing Concepts, Framework of Marketing? 4Ps of Marketing, Socio-cultural, Legal and Regulatory, Economics, Ethical, Political and Social Responsibility Dimension to Marketing

Understanding target markets, segmentation
Marketing Research
Consumer Behaviour: includes consumer behaviour, models, motivation, perception, attitudes and the influences of family, society and cultural
Product
Understanding Innovation
Sales Forecasting
Pricing Strategies
Promotion and Advertising
Marketing Strategies and Marketing Plans

Topic: Business Plan Project

Starting-up: Who do you start with (Apple), When to start (Lemon Tree), Talking the Plunge (Affordable loss Principle), Bootstrapping (Bird in Hand), Partnership (R & R), Start-up Problems

The Business Plan: Need for a Business Plan, What stake-holders look for, Making a Business Plan. Presenting Business Plan Early Growth: Scaling-up, Legal Issues, Financial Issues, Human Issues, Adoption Model – Crossing the Chasm, Marketing or Entrepreneurs

The High Growth Venture: From effectuation to causation, Problems of Growth, Ownership & Control, Harvesting Entrepreneurship and related Issues: E-commerce, Franchising, Family Business, Entrepreneurship within corporate

Industrial Waste Treatment and Management

Introduction to Industrial Waste: Types of industries and industrial pollution, Types of industrial wastes - solid, liquid and gaseous wastes, Hazardous waste - definition and concept, Characteristics of industrial wastes, Effects of industrial wastes on environment and human health, Environmental standards and legislations;

Pollution Prevention and Cleaner Production: Waste minimization, Source reduction, Use of alternate raw materials, Process modifications, Recycle, reuse and byproduct recovery, Opportunities and barriers to cleaner production;

Waste Treatment Techniques: Physico-chemical and biological treatment of wastewater, Concept of common effluent treatment plant (CETP), Concept of zero discharge, Industrial sludge management, Industrial air pollution, Control of gaseous emissions.

Environmental Performance: Environmental audit and performance, Environmental management plan, Introduction to ISO and ISO 14000.

Pollution Control in Major Industries – Case Studies: Manufacturing processes and flow sheets, Sources and characteristics of wastes, Waste treatment and disposal methods – Computer & IT industry and electronic waste (e-waste), Thermal power plants, Iron and steel, Metal plating, Fertilizer, Refinery, Tannery, Food industry, etc.

Text / Reference Books:

Introduction to Infotainment

Introduction to Infotainment Systems – Overview, Components

Information based Services – Localization and Context based Advertisements, Online Social Networking, Crowdsourcing. Information retrieval, Context awareness, Information dissemination and Information diffusion in these systems. Entertainment based Services – Audio and video conferencing, Video-on-Demand, Video Streaming etc, Mobile multimedia applications, Online Games.

Architectural Support – Deployment strategies for these multimedia services, Content delivery networks, peer-to-peer based deployment, Performance metrics, Strategies for improving performance.

Implementation Tools – Tools for animation designing, movie making, Introduction to Android programming. Reading mobile sensor information, group formation and handling data services on Android Platforms.
Case Studies – In-vehicle Infotainment Systems, In-flight Infotainment Systems etc.

Text/Reference Books:

CS302 Theory of Computation

Formal Logic: proof systems for propositional and first-order logic; consistency; completeness; compactness. Computability: primitive recursive functions; Godelization; Church's thesis. Review of models of computations, time and space bounded computations. Classes P, NP, polynomial reducibilities, NP-completeness.

Texts:

References:

CS346 Compilers

Overview of different phases of a compiler : front-end; back-end. Lexical analysis: finite automata; DFA construction and minimization; automatic tools. Syntax analysis: context free grammars; top down and bottom up parsing techniques; construction of efficient parsers; syntax-directed translation; automatic tools. Semantic analysis: declaration processing; type checking; symbol tables; error recovery. Intermediate code generation: run-time environments; translation of language constructs. Code generation: Flow-graphs; register allocation; code-generation algorithms. Introduction to code optimization techniques.

Texts:

References:

CS347 Compilers Laboratory

Programming assignments to build a compiler for a subset of a C-like programming language, using tools such as Lex and Yacc.

CS348 Computer Networks

7 layer OSI/ISO model; evolution of computer networks. Data Link Layer: HDLC, PPP, sliding window protocols. Network Layer: IP, ICMP, X.25, Frame Relay, ATM, routing algorithms (EGP, RIP, OSPF etc.); Transport Layer: TCP, UDP, congestion control, flow control; Sockets interface, sockets programming; Application Layer: SNMP, Authentication, Encryption, electronic mail. WWW basics: http, html, CGI, Java, Firewalls.

Texts:

References:

CS362 Computer Graphics

Introduction: organization of an interactive graphics system. Scan conversion, filling, clipping, antialiasing, geometrical transformations, viewing, hidden line and hidden surface removal, representation of curves and surfaces, solid modeling, illumination and shading. Graphical user interfaces and Interactive input methods.

The laboratory work will involve programming with standard graphics libraries like OpenGL.

Texts:

References:

Diasporic Literature

This course will deal with one of the most popular tools of contemporary theory- the notion of diaspora and its presence in literature:

Diaspora, exile, migration, old and new diaspora, identity formation, cultural assimilation, notion of home and homelessness, ideology of home and nation, homesickness, memory, nostalgia, politics of multiculturalism, the heterogeneity of diasporic groups, especially by gender, class, sexuality, caste, religion, the role of language and other cultural practices in migratory experiences; the significance of memory for the production of "imaginary homelands", Films and Indian diaspora.

Texts:

References:

Sociology of Development

Introduction: Scientific Study of Social Life, Concept and Context of Development, Comparative Perspectives, Systems of Governance, Role of the State, Public- Rights and Responsibilities, Indian Society- Structure and Change

Theories of Development: Classical, Modernization, World System, Dependency, Structure-Agency Integration, Colonial, and Third-World Perspectives

Themes and Perspectives: Rural Development, Gender and Development, Public Health, Sustainable Development, Action Research, (Mal)development- Anomie, Alienation, and Fragmented Identities, Urban Migration, Social Movements, Humanizing Development through Right-Based Approach (Right to Education, Information, Food, etc.)

Texts/References:

CS400 Summer Training

Training for a minimum period of 8 weeks in a reputed industry / R&D lab / academic institution except IIT Patna. The student is expected to submit a report and present a seminar after the training.

CS421 Computer Peripherals and Interfacing

Introduction to architectural details of 8/16/32 bit microprocessors and their programming. Interfacing microprocessors with devices such as displays, keyboard, DAC & ADC’s etc. using programmable chips like I/O ports, timer/counter, keyboard/display controller, DMA controller, Interrupt controller etc. Familiarization with microprocessor development systems (MDS). Bus standards, IEEE 488, VME, MULTIBUS, SCSI, ISA/EISA, PCI, AGP. Selected peripheral devices and their characteristics. Peripheral controller chips, Microcontrollers. Selected applications and design problems.

Texts:

References:

CS422 Peripherals and Interfacing Laboratory

Familiarization with 8/16 bit microprocessors kits, writing simple programs. Assignments relating to interfacing. Design a standalone system. System development: case studies in instrumentation, process control systems etc. using PC based add-on cards. Use of a hardware description language such as VHDL, Verilog to describe & simulate the hardware of selected problems targeted to FPGA.

CS498 Project

Each student will undertake a sizeable project involving survey of literature, development of new techniques and/or implementation of systems, writing of reports etc. under the guidance of one or more faculty members.

Introduction to VLSI CAD

Objective:

Modeling and optimization has always been a matter of great theoretical and practical interest. These techniques have found application in a variety of areas like Physics, Engineering Design, Electronic Design Automation (EDA), Bioinformatics, Operations Research, Economics and Social Sciences. The present course aims at exposing our students to some of these techniques focusing on some aspects of EDA. An important segment of EDA is Computer Aided Design (CAD) of Very Large Scale Integration (VLSI) circuits and systems. The present course aims at introducing the students to algorithms and optimization techniques employed by CAD tools for design of VLSI circuits and systems.

Course Content:

Introduction:Motivation behind CAD tools, Components on a single chip, Brief illustration of the design flow employed by VLSI CAD tools, Algorithmic background for VLSI CAD; High Level Synthesis: Operator DAG Formation, Scheduling, ASAP and ALAP Scheduling, Resource Constrained Scheduling, Time Constrained Scheduling,Register Minimization and Functional Unit Allocation, Binding; Combinational Logic Synthesis: Karnaugh Map, Quine-McClausky, Espresso; Sequential Logic Synthesis: State Encoding, State Assignment; Physical Design: Partitioning using K-L,F-M method, Placement and Floor-planning using ILP and Constraint solving methods, Horizontal and vertical constraint graphs for routing, 2-layer and 3-layer routing algorithms.

Texts:

Lecture notes and handouts will be provided.

CS561 Artificial Intelligence

Introduction to intelligent agents. Problem Solving: Searching, Intelligent search methods, Game Playing. Knowledge and Reasoning: Building a Knowledge Base. Inference in First Order Logic, Logical reasoning systems. Planning. Uncertain Knowledge and Reasoning, Probabilistic Reasoning Systems. Learning from Observations: Inductive Learning, Learning Decision Trees, Computational Learning Theory, Explanation Based Learning. Genetic algorithms, Artificial Neural Networks and Fuzzy Approaches. Introduction to Natural Language Processing. The course will include programming projects involving programming in Lisp, Prolog and C++.

Texts:

References:

CS543 Distributed Systems

Introduction to distributed computing models. Issues in distribution of data and control: Clock synchronization, agreement, deadlock detection, termination detection etc. Distributed file servers: Concurrency control and recovery, resiliency etc. Distributed programming environments: Communication primitives, selected case studies.

(Note: Some topics may be added/deleted to suit specific offerings of the course)

Texts:

References:

CS441 Topics in Databases

Database Computation Models: Page and Object Models

Correctness for page model: Serializability - review of the basic theory, view serializability, conflict serializability, multiversion serializability.

Concurrency control algorithms for page model:Locking schedulers:Two phase locking & variants, Nonlocking schedulers: Timestamp and optimistic methods, Multiversion Concurrency Control Protocols

Page model crash and recovery: Expanded schedules, correctness criteria for page model, sufficient syntactic conditions for page model, handling aborts, crash recovery notion of correctness, redo winner and history algorithms - checkpoints, log truncation, transaction abort, rollbacks

Correctness notion for object model:Conflict serializability for Flat Object Transactions, Tree Reducibility, Sufficient Conditions for Tree Reducibility

Concurrency Control Algorithms for objects model: Locking for Flat Object Transactions, Layered Locking, Locking on General Transaction Forests, Hybrid Algorithms

Object model crash and recovery: Correctness criteria for the object model, simple redo-history algorithm, enhanced redo-history algorithm, complete redo-history algorithm for two-layered systems and for General Object Model Executions

Concurrency control and recovery in distributed databases: Concurrency Control in Homogeneous Federations, serializability in heterogeneous federations, achieving global serializability through local Guarantees, distributed recovery: two and three-phase commit protocols

Concurrency control paradigms in parallel programming: Linearizablity, sequential consistency, global atomicity etc

Resurgence of Transactions: Software and hardware transactional memory

Texts:

References:

CS542: Software Testing

Foundations of Computer Science

Probabilitic arguments: Expectation, 2nd moment, large deviation bounds, balls and bins. Hashing: Isolation Lemma and Universal hashing. Linear programming and duality theorem as a proof technique, rounding, semi-definite programming, Interior point method, Simplex for solving linear programs. Yao's Min-max theorem and applications. Algebraic methods: The dimension argument, Eigenvalues and Eigenvectors. Coding and information theory: Introduction. Fourier analysis, discrete fourier transform and its uses. Basic algorithmic tricks. Introduction to high-dimensional geometry, volume estimation, metric embedding and Johnson Lindenstrauss. Sampling techniques and random walks.

Texts:

References:

Graphs, Groups and Network

Preliminaries in graphs, Mappings of Graphs, Matrices associated with graphs, Degree Sequence, Walks, Cut-Edges and Cut vertices, Weighted graphs, Directed Graphs, Shortest paths. Tree, Spanning Trees, Equivalent definitions, Prims & Kruskal Algorthim, Tree, Distance between spanning tree of a connected graph, eccentricity, Centre(s) of trees and connected graph, diameter of tree and connected graph. Cut-sets, Fundamental cut set, Edge and vertex Connectivity, Separability, Mengers theorem. Paths, circuits, Eulerian and Hamiltonian Graphs, Fleury algorithm, operation on graphs, Travelling salesman Problem, k-Connected graphs. Cliques and Minors in a Graph. Detection of planarity, Dual of a planar graph and map coloring Maximal independent sets, Vertex coloring and Chromatic Number, Vizing theorem, Chromatic Partitioning, Minimal dominating set, knights tour, Chromatic Polynomial, coverings, Number of a connected graph, matching in Bipartite graphs Flows in networks, Max-Flow-Min-Cut Theorem and its applications. Groups as Groups of Symmetries of a graph, Normal Subgroups, Isomorphism Theorems, Cyclic groups, Dihedral Groups. Permutation groups, finitely presented groups.

Texts:

Introduction to Biomechanics

Introduction to Biological System; Cell, Tissues and Connective Tissues and their Phenomenological Models: Bone, Tendon, Cartilage, Smooth Muscle cells: Musculo-Skeletal system as a tensigrity structure, Gait Analysis: Locomotion and Control, Modeling of Humanoid Robots, Physiology and mechanical properties of muscles- Viscoelastic model of muscle,Tentanization pulse in muscle fibers, Physiology and mechanical properties of bones- Bones as bidirectional fibers-nets and its stress response; Circulation system: Composition and rheological properties of blood, Construction of RBC, Composition of Artery and Venus walls, Operation of heart as a pump and electrical potential;

Neural system and control: Central nervous system, Auxiliary nervous system; Experiment on Biological system:experiment on RBC like system, viscocity measurement Blood-like liquid, ECG, Blood pressure, Pressure distribution of Human walk on the foot; Growth, Remodeling and Residual Stresses: Mathematical model of growth,Mathematical model of tumor, Remodeling of biological tissues like skin, artery- Wrinkle of skin, ageing of artery , Modeling of Residual stress,Experiment on Biological system- Determination of residual stress in artery-like tissue, Determination of ageing affect on arterial tissue; Instrumentation Technique in Biomechanics: Measurement of Biopotential – ECG, EMG, ENG, Test on Respiratory Mechanism, Ultrasonic measurement of Blood flow, Drug Delivery Systems; Application of Biomechanics: Sports Biomechanics, Artificial Limbs and organs, Occupational Biomechanics- consideration in Machine Control and Workplace Design, Injury Biomechanics – Analysis and optimal design; Biomaterial.

Texts:

Introduction to Nanomaterials

Introduction:Overview of Nanotechnology, Quantum effect, Naotechnology in nature.

Properties: Physical, Chemical and biological properties of nanomaterials, Effects on structure, ionization potential, melting point, and heat capacity Electronic structure at nanoscale, Magnetism at Nanoscale.

Metal and Semiconductor Nanoparticles: Surface Plasmon Resonance, Theory, Stability of metal particles, metamaterials, Nanowires and Nanotubes.

Synthesis of Nanomaterials: Chemical, Physical, Biological and hybrid Methods of synthesis, Assembly. Carbon Nanotubes, Lithographic methods, Scanning Probe Microscopic Methods, Physical and Chemical Vapor Deposition Methods. MEMS fabrication technique.

Nanotribology and Nanomechanics: Micro/Nanotribology and Materials Characterization Studies using Scanning Probe Microscopy, Surface Forces and Nanorheology of Molecularly Thin Films, Scanning Probe Studies of Nanoscale Adhesion Between Solids in the Presence of Liquids and Monolayer Films, Friction and Wear on the Atomic Scale, Nanoscale Mechanical Properties, Nanomechanical Properties of Solid Surfaces and Thin Films, Mechanics of Biological Nanotechnology, Mechanical Properties of Nanostructures, Micro/Nanotribology of MEMS/NEMS Materials and Devices.

Applications of Nanomaterials:Materials, Sensors and Actuators, Catalysis Medical Applications, Advanced Electronic Materials and Novel Devices. MEMS/NEMS Devices and Applications, Current Challenges and Future Trends.

Texts:

References:

Solid State Devices

Semiconductor Devices: Basic introduction, principles of device fabrication and operation–heterojunction bipolar transistors (HBTs), heterostructure field effect transistors (HFETs),modulation doped field effect transistors (MODFETs), high electron mobility transistors (HEMTs), resonant tunneling diodes (RTDs), single electron transistors (SETs), negative conductance in semiconductors, transit time devices, IMPATT, TRAPATT, THz devices, micro and mm wave devices;

Optical Devices:Optical absorption in a semiconductor, photoconductors, photovoltaic effect, semiconductor lasers, quantum well lasers, longwavelength detectors, Optical waveguides, waveguide fabrication techniques, losses in optical waveguides, Optical sensors, integrated optical devices,

Ferroic Phenomena & Devices: Electrical & optical properties of linear and non-linear dielectrics, Ferroelectrics, Pyroelectric, Piezoelectric and electro-optic devices, non-volatile memory; Magnetic memory and superconducting devices, shape memory effect, Spintronic devices,

Energy Storage/Conversion Devices: Portable power sources, Solar cell, Fuel cells, Secondary batteries, Supercapacitors,

Sensors & Actuators: Elementary concepts of sensors, actuators and transducers, an introduction to Microsensors and MEMS, Evolution of Microsensors & MEMS, Microsensors & MEMS applications, Biosensors.

Texts:

References:

Large Scale Scientific Computation

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:

ME581 Biomechanics and Biomechatronics

Course Objective: After completion of this course the student should be able to

Details of Course:

Suggested Books:

Project-II

Each student will undertake a sizeable project involving survey of literature, development of new techniques and/or implementation of systems, writing of reports etc. under the guidance of one or more faculty members.

Computer and Network Security

Overview, vulnerabilities, risk assessment, incidents. Cryptography: Classical Cryptography, Symmetric Cryptography, Public Key (Asymmetric cryptography), Modern Cryptography, Hash Functions, Key Exchange. Review: Installing Unix and common service daemons (Unix Security, Windows NT Security, Ping, traceroute, TCP Dump, sniffer etc.), Networking. Security issues: Terminology (Integrity, Availability, Confidentiality, Non-repudiation, Authentication, Authorization/Access Control, accounting, auditing, Passive and Active Attacker, Interruption, Interception, Modification, Fabrication, Social Engineering), Vulnerabilities and Counter Measures (Viruses, worms, Trojan horses, backdoors, unused services, buffer overflows, RPC), Exploits (Buffer overflow, Port Scanning etc). Applications Security (System Security, Audit Logs Intrusion Detection, Wrappers, Password and remote authorization tools e.g. PGP, S/MIME, SSH, Netscape/SSL, SET, IPsec, Kerberos, Firewalls, VPN etc, Secure (commerce) Transaction over a network, Network Anonymity.

Texts:

References:

Internet Protocols

Overview of IPv4, TCP, IPv6, ICMP, ARP, DHCP; Routing Protocols: OSPF, RIP, BGP, Ad hoc network routing (AODV, DSR); IP Security: NAT, IPSEC, Socks, SSL; Quality of Service related protocols: Intserv, diffserv, Queuing techniques (WFQ, RED, etc.); Multi-Protocol Label Switching (MPLS) and GMPLS; Virtual Private Network (VPN) Protocols: L2TP, PPTP; Overview of Application Layer Protocols: DNS, LDAP, SMTP, POP3, IMAP4, SNMP; Voice over IP Protocols (VOIP) and videoconferencing: SIP, H323. Server Load Balancing Techniques

Texts:

Refrences:

Wireless Sensor Networks

Introduction to ad hoc networks. Routing- Proactive routing protocols, Reactive routing protocols, backbone, Position based routing, power efficient routing; Introduction to sensor networks and its applications: Architecture and factors influencing the sensor network design. Routing protocols- data centric routing protocols, hierarchical routing protocols, location based routing, energy efficient routing etc; Node Scheduling and coverage issues, topology control. Querying, data collection and processing, Collaborative information processing and group connectivity. Target tracking and identity management using sensor networks. Localization . Application & future research Challenges.

Texts:

References:

Matrix Computation

Introduction to Direct Methods:Diagonalization, Jordan Canonical Forms, SVD and POD, Direct Method for solving linear systems and Application to BVP, Discritization of PDE’s, Sparse Matrices.

Basic iterative methods:Iterative method for solving linear systems: Jacobi, Gauss-Seidel and SOR and their convergence, projection method: general projection method, steepest descent, MR Iteration, RNSD method.

Krylov subspace methods: Introduction to Krylov subspace, Arnoldi’s method, GMRES method, Conjugate gradient algorithm, Lanczos Algorithm.

Convergence & Preconditioners: Convergence check for Krylov subspace methods, Preconditioned CG, ILU preconditioner, Approximate inverse preconditioners, Multigrid methods.

Parallel implementation: Architecture of parallel computers, introduction to MPI & openMP, parallel preconditioners, domain decomposition method.

Texts:

References:

Photovoltaics & Fuel Cell Technology

Photovoltaics:Global energy scenario and impending energy crisis, Basic introduction of energy storage/conversion devices, State-of-the art status of portable power sources, Solar/photovoltaic (PV) cells, PV energy generation and consumption, fundamentals of solar cell materials, Elementary concept of solar cell and its design, solar cell technologies (Si-wafer based, Thin film and concentrator solar cells), Emerging solar cell technologies (GaAs solar cell, dye-sensitized solar cell, organic solar cell, Thermo-photovoltaics), Photovoltaic system design and applications, Analysis of the cost performance ratio for the photovoltaic energy and problems in wide-spread commercialization of the technology.

Fuel Cells:Fuel cells and its classification; Transport mechanism in fuel cells and concept of energy conversion; Fuels and fuel processing, Fuel cell design and its characterization; Technological issues in Solid oxide fuel cells (SOFC); PEM fuel cells; Direct methanol fuel cells (DMFC), Molten carbonate fuel cell (MCFC), Power conditioning and control of fuel cell systems.

Texts:

References:

Applied FEM for Industries

Introduction: Continuum Mechanics, Conservation laws, Riemannian Geometry and stress- strain tensors, Constitutive equation, Potential-, Strain-, and Kinetic energies, Functionals and variational formulation, mathematical programming and weak solutions; Displacement method of FEM analyses.

Field equations: Elasticity, Structural Dynamics, Fluid Mechanics, electromagnetic fields

Alternative approaches:Hybrid FEM, Mixed FEM, Boundary Element Method, Boundary Error Element, Mesh-less methods, Galerkin’s approach of error orthogonalization.

Error analyses: Algebraic and Integral inequalities; estimate of error; error bounds; Convergence, super-convergence,

Computer Packaging: Pre-, Post-processing and Turbo C, Analysis Programs in FRORTAN;

Applications (as per request):Rigid-flexible assembly (ME and Bio-Mechanics); Two-phase flow (ME & CE); Electro-magnetic application to wave-guides, MOSFET analyses (ECE); magnetic levitation (electrical), Vibration and control of quartz substrate using smart material; Stochastic FEM, etc.

Text / Reference Books:

Industrial Waste Treatment and Management

Introduction to Industrial Waste: Types of industries and industrial pollution, Types of industrial wastes - solid, liquid and gaseous wastes, Hazardous waste - definition and concept, Characteristics of industrial wastes, Effects of industrial wastes on environment and human health, Environmental standards and legislations;

Pollution Prevention and Cleaner Production:Waste minimization, Source reduction, Use of alternate raw materials, Process modifications, Recycle, reuse and byproduct recovery, Opportunities and barriers to cleaner production;

Waste Treatment Techniques: Physico-chemical and biological treatment of wastewater, Concept of common effluent treatment plant (CETP), Concept of zero discharge, Industrial sludge management, Industrial air pollution, Control of gaseous emissions;

Environmental Performance:Environmental audit and performance, Environmental management plan, Introduction to ISO and ISO 14000;

Pollution Control in Major Industries – Case Studies: Manufacturing processes and flow sheets, Sources and characteristics of wastes, Waste treatment and disposal methods – Computer & IT industry and electronic waste (e-waste), Thermal power plants, Iron and steel, Metal plating, Fertilizer, Refinery, Tannery, Food industry, etc.

Text / Reference Books:

Mobile Robotics

Objectives:

Mobile robots are now enabling human beings to physically reach and explore unchartered territories in the Universe. Be a place as distant as Mars, in abysmal depths of ocean, or shrouded by thick glaciers of Antarctic, mobile robots help exploring everything; yet this is just the beginning. Even in day to day life autonomous cars hold a potential to revolutionize transportation and domestic mobile robots help humans in cleaning, elderly help, etc. National defense is an area replete with the use of mobile robots. This course will present various aspects of design, fabrication, motion planning, and control of intelligent mobile robotic systems. The focus of the course is distributed equally on the computational aspects and practical implementation issues and thereby leads to a well rounded training. The course will give students an opportunity to design and fabricate a mobile robotic platform and program it to apply learned theoretical concepts in practice as a semester long class project.

Syllabus:

Robot locomotion:

Types of locomotion, hopping robots, legged robots, wheeled robots, stability, maneuverability, controllability; Mobile robot kinematics and dynamics: Forward and inverse kinematics, holonomic and nonholonomic constraints, kinematic models of simple car and legged robots, dynamics simulation of mobile robots.

Perception: Proprioceptive/Exteroceptive and passive/active sensors, performance measures of sensors, sensors for mobile robots like global positioning system (GPS), Doppler effect-based sensors, vision based sensors, uncertainty in sensing, filtering;

Localization: Odometric position estimation, belief representation, probabilistic mapping, Markov localization, Bayesian localization, Kalman localization, positioning beacon systems.

Introduction to planning and navigation: path planning algorithms based on A-star, Dijkstra, Voronoi diagrams, probabilistic roadmaps (PRM), rapidly exploring random trees (RRT), Markov Decision Processes (MDP), stochastic dynamic programming (SDP)

Robotics Project

Students will work on a semester long project consisting of design, fabrication, and programming a mobile robotic platform

Text / Reference Boo ks:

Application of Probabilistic Methods in Engineering

Introduction:

Concept of risk, and uncertainty in engineering analysis and design; Fundamental of probability models.

Analytical models of random phenomena: Baysian Analysis, Analysis of variance (ANOVA); Application of central limit theorem, confidence interval, expected value, and return period.

Application of Monte Carlo simulation (MCS): Determination of function of random variables using MCS methods; Application of MCS in various engineering problems.

Probabilistic analysis and determination:i) Forces induced by earthquakes, ii) Forces induced by wind, iii) Forces induced by sea waves, iv) Load on vehicles induced through surface roughness of roads.

Methods of risk Analysis: Composite risk analysis; Direct integration method; Method using safety margin, reliability index and safety factor.

Introduction to reliability analysis: Application of Bayes theorem in real life problem; Reliability analysis of simple systems: serial, parallel and combined systems; First order uncertainty and reliability analysis (FORM), First order second moment (FOSM) and Advanced FOSM methods; Applications of risk and reliability analysis in engineering systems.

Application of probabilistic methods:i) Fluid-structure interaction, ii) Soil-structure interaction iii) Railways iv) Automobile industry, v) Offshore structure, vi) Hydraulic structure

Text / Reference Books:

Fundamentals of Cognitive Science

Cognitive Science: nature, history, and major findings and applications; Philosophy of language and mind; Psycholinguistic approach to the child language and cognitive development; Linguistics and the study of language in society: language, dialects, and varieties, native speakers and language acquisition, language as a mental phenomenon vs. language as behavior; multilingualism; Artificial Intelligence: Turing Test and Chinese-Room Argument, Natural language vs. artificial language; fuzzy logic; Culture as cognitive construction, culture and society, culture and language, cognition and human evolution.

Texts and References:

>

Industrial and Organizational Psychology

Aim of the Course:

Today, many of the engineering students after passing out are joining some kind of organization. Therefore, they need to know how they will be successful as job applicants, trainees, employees, team players, and managers. This course will help them in knowing about all these and applying psychological principles in industries and organizations.

Course Contents:

Introduction:

Psychology as a science of Behaviour and Mental Processes: Nature, Scope and Subject Matter of Industrial and Organizational Psychology; Time and Motion Study, Classical Hawthorne Studies.

Employer Selection:

Recruitment Process; Selection Process - Job and Worker Analyses, Matching Job with the Person; Selection Methods - Application Blank, Biographical Inventories, References and Recommendation Letters, Interviews

Psychological Testing:

Characteristics of Psychological Tests; Types of Psychological Tests; Tests of Knowledge, Skills and Abilities - Interest, Aptitude and Personality Tests; Limitations of Psychological Testing Programmes.

Training and Learning:

Need Identification; Psychological Factors in Learning; Training Methods in the Workplace; Effective Training Programme; Career Planning and Development.

Motivation:

Needs, Incentives and Motives; Financial and Non-financial Motives; Theories of Motivation; Management of Motivation; Organizational Commitment and Job Satisfaction.

Leadership:

Changing Views of Leadership; Theories of Leadership; Leadership Styles; Pole of Power in Leadership; Charismatic and Effective Leaders.

Group Behaviour:

Formal and Informal Organizations in Industry; Conflicts in Organization; Resolution of the Conflicts; Decision Making Process.

Characteristics of the Workplace:

Working Conditions - Physical and Psychological; Accident, Safety and Health; Management of Stress; Spirituality at Work.

Organizational Communication: Process of Communications; Upward, Downward and Horizontal Communications; Barriers to Communication; Effective Communication.

Texts and References:

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: