3.2 Logic Design
4.1 Discrete Mathematical Structures
4.2 Principles Of Programming Languages
4.4 Design And Analysis Of Algorithms
4.5 System Analysis And Design
4.6 Electronic Instrumentation
Semester V
5.2 Automata Languages And Computation
5.3 Microprocessors
5.4 Data Base Management Systems
Semester VI
6.2 Object Oriented Design And Programming
6.5 Device Interfacing And PC Maintenance-I
Semester VII
7.2 Computer Communication Networks - II
7.4 Elective I (a) Embedded System & Software Agents
7.5 Elective II (a) Web Technologies
Semester VIII
8.1 Advanced Data Structures & Algorithms
8.2 Elective III (a) Image Processing AND Pattern Recognition
8.3 Elective IV (a) Natural Languages Processing
Linear Algebra: Types of matrices, adjoint, inverse, elementary transformations, normal form-ranksystems of equations AX = B and AX = 0, Linearly independent systems, Eigen values – eigen vectors, Cayley Hamilton Theorem, minimal equation, diagonalisation, functions of matrices.
MODULE 2
Probability Distributions: Definition, properties, discrete/continuous distributions binomial, Poisson, normal. Samples – tests on large samples, correlation and regression.
MODULE 3
Transforms: Laplace – Definition, properties, inverse, convolution – periodic functions, applications. Fourier transforms.
MODULE 4
Transforms: Fourier and Z transforms – Definition, properties, inverse, convolution – periodic functions, applications.
TEXT BOOKS:
1. A Text Book of Matrices – Shanti Narayn, S. Chand & Company
2. Statistical Methods - Gupta S.P, S. Chand & Sons.
3. System and Signal Analysis – Chi – Tsong Chen, Holt, Rinse Hart and Winston Inc. (Sections: 4.1 – 4.8, 5.1 – 5.6, 6.4 – 6.6 of T.B: 3)
REFERENCE BOOKS:
1. Advanced Engineering Mathematics – Kreyazig Wiley
2. Engineering Mathematics Vol. III – P. Kandasamy et all, S.Chand & Co., New Delhi.
Number Systems and Codes: Number system binary codes, error detection and correction. Logic Gates: Basic gates, Secondary gates, Boolean algebra, De-Morgan’s Law, NOR, NAND as universal gates, EX-OR gate.
MODULE 2
Boolean Algebra: Algebraic simplification, Karnaugh Map, Methods of simplification, Q.M. method. Arithmetic Logic Units: binary addition, binary subtraction, Half adder, Full adders.
MODULE 3
Flip flops: RS latches, Level clocking, D latches, edge triggered D Flip flop, edge triggered JK Flip-flop, JK Mast Slave flip flop. Registers and Counters: Buffer Registers, shift registers, Controlled shift registers, Ripple counters, Synchronous counters, Ring counters.
MODULE 4
Introduction to Synchronous Sequential Circuits: Finite state, Model, Synthesis of synchronous sequential circuits.
TEXT BOOKS:
1. Digital Principles and Applications – A.P. Malvino, Donald P. Leach IV Edn, TMH
2. Digital Computer Electronics – Malvino II Edn., TMH
REFERENCE BOOKS:
1. Switching and Finite Automata Theory – Kohavi, II Edn., TMH
2. Digital Computer Design – Rajaraman & Radhakrishna, III Edn., PHI
3. Digital Computer Design Principles – M.R. Bhujade, Pitamber
4. Computer Architecture and Logic Design – Thomas C. BArtee, TMH
5. Modern Digital Electronics – R.P. Jain, II Edn., TMH.
An overview of object oriented programming: Introduction to C++ programming, loops and decisions, structures, objects, classes operator overloading, inheritance, polymorphism, pointers, files, etc.
Introduction to Data Representation and Data Structures: Arrays and applications. Stacks: Definition, Representation of stacks and applications. Queues: Definition, Representation of queues, circular queues and applications.
List: Single linked list, linked stacks & queues other list structures like doubly linked list, circular linked list, examples and simulation. Trees: basic terminology, binary trees, representations, traversals. Graphs: basic terminology, representation of graphs, graph traversals.
Sorting: Exchange sorts, selection and tree sorting, insertion sorts, merge & radix sorts. Searching: Basic search techniques like binary search, hashing. Introduction to advanced data structures.
TEXT BOOKS:
1. Data Structure Using C & C++ – Yedidya Langsam, Moshej Augenstein, Aaron M. Tenenbaum, Prentice Hall of India.
2. Data Structures, Algorithms and Applications in C++ - Sahni, MCH.
REFERENCE BOOKS:
1. Data Structures and Algorithms – Alfred V. Aho, John e. Hopcraft & J.D. Ullman, Addision Wesley.
2. Data Structures and Program Design in C – Robert L. Kruse, Prentice Hall of India.
3. Fundamentals of Data Structures – Ellis Horowitz and Sartaj Sahni, Galgotia Publications.
CE 3.4 INTEGRATED ELECTRONICS
Operational Amplifiers: Characteristics, features, basic circuits and applications. Waveform generators.
MODULE 2
Voltage Regulators: Definition, design and letter using IC 723, Lm 105, Regulated P.S. 555 timer & its configurations. D/A convertors, A/D convertors, multiplexers, demultiplexers, decoders, encoders.
MODULE 3
Characteristics and comparisons of major logic families: Realizations of logic functions, gates. Design of sequential & Combinational logic circuits with LSI & MSI components.
MODULE 4
Timing Issues: Clock generator, synchronization at system level. Semiconductor memories: memory classification, architecture and building blocks, ROM, Nonvolatile Read-Write memories, RAM. Memory peripheral circuitry: address decoders, sense amplifiers, drivers/buffers and their timing control. Design of PLA and 4 Mbit SRAM
TEXT BOOKS:
1. OpAmps & Linear Integrated Circuits – Ramakant A. Gayakwad, II Edn., PHI
2. Digital Integrated Circuits, A Design Perspective – Jan M. Rabaey, PHI
3. Microelectronics – JAcob Milliman, TMH
REFERENCE BOOKS:
1. Integrated Electronics: Analog and Digital Electronic Circuits and Systems – MIllman and Halkias, TMH.
2. Electronics for Scientist & Engineers – Vishwanathan, Mehta and Rajaraman, PHI.
3. Introduction to System Design using Integrated Circuits – B.S. Sonde, Wiley Eastern
4. Digital Principles & Applications – Malvino & Leach, PHI
5. Microelectronics – Jacob Millman, Arvin GRabel, II Edn., MGH
CE 3.5 COMPUTER ORIENTED NUMERICAL TECHNIQUES
Errors and Approximations: Introduction, sources of errors, problems in computations, safeguards against errors, floating point arithmetic, absolute error, relative error, percentage error – calculations. Interpolation: Newton’s Interpolation formulae, Lagrange’s interpolation, Newton’s Divided difference Interpolation formula.
MODULE 2
Solution of Transcendental and Polynomial equations in one variable: Newton Raphson method, Regula Falsi method, successive bisection, secant method, etc.
MODULE 3
Solution of Linear Equation: Gauss’s Elimination method, Pivoting, Computation of Matrix inverse using Gauss Elimination, Gauss Jordan methods. Iterative algorithms – Jacobi, Gauss Seidal methods. Eigen values and eigen vectors.
MODULE 4
Numerical Integration: Trapezoidal rule & Simpson’s rules, Romberg’s formula. Numerical Differentiation: Newton’s forward and Newton’s backward difference formulae. Solution of ordinary differential equations Euler’s methods, Runge Kutta methods, Predictor Corrector method.
TEXT BOOKS:
1. Numerical Algorithms – E.V. Krishnamurthy and Sen, PHI
2. Introductory Methods of Numerical Analysis – S.S. Shastry, PHI
REFERENCE BOOKS:
1. Computer Oriented Numerical Methods – Rajaraman, PHI
2. First Course in Numerical Methods – A. Ratson, MGH
3. Numerical Methods in Engineering and Science – Dr. B.S, Grewal, Khana Publication
MODULE 1
§ Principles of electromechanical energy conversion
§ DC Motor: principle, voltage equation, torque-equations, motor characteristics, speed control, starting
MODULE 2
MODULE 3
Shunts and multipliers for PMMC type instruments and extension of range,
MODULE 4
TEXT BOOKS :
REFERENCE BOOKS:
1. Electrical Power : J.B. Gupta
2. A First Course on Electrical Drives: S.K. Pillai
Set Theory: Relations, equivalence, ordered sets.
Functions: Relations:-binary, equivalence, partitions, partial ordering, lattices, pigeons holes principle.
Algebraic structures: monoids, groups, rings, fields, vector spaces, integral domain-Homomorphisms, isomorphisms.
Boolean Algebra: duality-properties-Boolean: lattices, functions, expressions, propositional calculus, design of digital networks, switching circuits, simplification.
Mathematical reasoning, induction, deduction, recurrence relations.
MODULE 4
Graph theory, paths, circuits, Eulerian, Hamiltonian paths, binary search trees, Spanning trees, transport networks.
1. Elements of Discrete Mathematics – C.L.Liu, McGraw Hill.
REFERENCE BOOKS
1. Discrete Structures, An introduction to Computer Sciences – Norris F.R., Prentince Hall.
2. Discrete Mathematical Structures with Applications to Computer Sciences – Tremblay J.P. and Manohar R., McGraw Hill, NY.
3. Discrete Mathematics in Computer Science-Stanant D.F. and Allister D.F., Prentice Hall.
4. Concepts in Discrete Mathematics – Sahani S.Narosna, New Delhi.
5. Basic Graph Theory – Parthasarathy K.R, TMH
Language Design Issues: Structure and Operation, Virtual computer, binding times, language Paradigms.
Language translation Issues: Program Language syntax, stages in translation; formal translation models.
Data types: Properties of types and objects, elementary data types structural data types.
Encapsulation: Abstract data types encapsulation, by sub programs, type definitions, storage management.
Sequence Control: Implicit and Explicit sequence control, sequence control, sequence control for arithmetic; non arithmetic expressions, sequence control between structures.
Sub program control: Sub program sequence control attributes of Data Control, shared data in subprograms.
Characteristics and features of procedural languages, structural languages, logic programming languages with reference to suitable example of each.
Advances in language design
TEXT BOOK
1. Programming languages: Design and Implementation – Terrence W.Pratt, Marvin V.Zelkowig, PHI
REFERENCE BOOKS
1. Fundamentals of Programming Languages- Horowitz, Galgotia Pub.
2. Programming Languages – Tucker A.B., ISE McGraw Hill.
Computer arithmetic: Integer representation, integer arithmetic, floating point representation, floating point arithmetic.
Computer System: System buses, Interconnection structure, Bus interconnection
Memory: Internal memory, external memory, memory organisation.
Input/Output devices.
Instruction Sets: Characteristics and functions, addressing modes and formats(8086 based) CPU structure and functions.
Control unit operations, hardwired implementation, microprogramed control.
RISC processors: Characteristics and architecture, pipelining
Introduction to parallel processing
1. Computer Organisation and Architecture: Designing for Performance - William Stallings, Fourth edition, Prentice Hall of India.
1. Computer Systems Architecture- M.Morris Mano, Prentice Hall of India.
2. Structured Computer Organisation – Andrew S.Tanenbaum, Prentice Hall of India.
3. Computer Organisation – V.C.Hamachar, L.G. Vianesic, S.G. Zaky, McGraw Hill International Students Edition.
Algorithm analysis and complexity, dynamic storage management and garbage collection, Recursion, lower bound theory.
MODULE 2
Techniques for algorithm design & analysis: Divide and conquer, dynamic programming.
MODULE 3
Greedy algorithms, basic search and traversal techniques.
MODULE 4
Backtracking, NP hard and NP complete problems.
TEXT BOOKS
1. Fundamentals of Computer Algorithms – E.Horowitz & S.Sahini, Galgotia publication.
2. Introduction to Algorithms – T.H.Cormen, C.E. Leiserson, R.L.Rivest, PHI
REFERENCE BOOKS
1. The Design and Analysis of Computer Algorithms – Aho Hopcraft & Ulman, Addison Wesley.
2. Algorithms – Robert Sedjewick, Addison Wesley.
3. Fundamentals of Algorithms – Brassord & Bratley, PHI
CE 4.5 SYSTEM ANALYSIS AND DESIGN
System Design Overview: Systems Concepts and the Information Systems Environment, System development life cycle, role of System Analyst.
MODULE 2
System Analysis: Planning and initial investigation, information gathering, tools for structured analysis, feasibility study, cost/benefit analysis.
MODULE 3
System Design: Process and stages of system design, input/output and forms design, file organization and data base design.
MODULE 4
System Implementation: System testing and Quality assurance, Implementation and software maintenance, hardware/software selection and evaluation, project scheduling and software, security issues, recovery methods, codes and standards of behavior.
1. Systems Analysis and Design, Elias M.Awad , II Edn., Galkgotia
2. Introducing System Analysis and Design, Vol 1, Vol 2, Int. Edn., NCC
1. System Analysis and Design Methods, Jeffrey L.Whiten, & Lonnie D.Bentler, IV Edn., Galgotia.
2. Introduction to System Analysis and Design, Igor T. Hawrysziewycz, PHI.
3. Analysis and Design of Information Systems, V. Rajaraman, PHI.
4. Analysis and Design of Information Systems, J.A. Senn TMH
Introduction: Measurement and errors, Systems of units of measurements, Standards of Measurements.
Electronic Instruments for measurement of basic parameters: Electronic multimeter, R meter, Digital Voltmeter, Vector impedence meter, R.F. power and voltage measurement.
MODULE 2
Oscilloscopes: Block diagram, CRT and circuits, Vertical deflection, delay line, multiple trace oscilloscopes, Probes and Transducers Oscilloscope techniques.
Signal generation: Sine wave, frequency synthesized, sweep frequency generators, pulse and square wave generators, function generators, audio frequency signal generators.
MODULE 3
Signal analysis: Wave analysers, harmonic distortion analysers & spectrum analysis.
Frequency counters and time interval measurements: Frequency counters, extending the range of frequency counter, Automatic and computing counters.
MODULE 4
Transducers: Classification of transducers, transducers for different physical quantities, strain gauges, displacement transducers, temperature measurements, photosensitive devices etc.
Analog and digital data acquisition systems: Instrumentation systems, interfacing transducers to electronic control and measuring systems, multiplexing.
1. Modern Electonic Instrumentation and Measurement Techniques – A.D.Helfrick and W.D.Cooper, PHI
1. Electronic Instrumentation- H.S.Kalsi, TMH
2. A course in electrical and electronics measurement and Instrumentation – A.K. Sawhney, Dhanpat Rai and Co.(pvt.) Ltd.
3. Electronic Measurement and Instrumentation – Oliver and Cage, McGraw Hill
Introduction to subject, Demand analysis: Determinants, Demand curve, Elasticities, Sales/Demand forecasting techniques, Law of supply.
Cost and production analysis, Types of costs.
MODULE 2
Price and output decisions: Market structures, Price/output decisions in different markets, Economies, Diseconomies of scale. Factors of production, Isoquant, Isocosts.
Profit management: Contribution, Break even analysis, Types of revenue.
Business decision making: Advertising, Product life cycle, SWOT Analysis, BCG – Matrix.
MODULE 3
Managerial Effectiveness: Planning, Organizing, Line & Staff functions, Delegation, Leadership, Managerial grid, Motivation, Theory X, Theory Y, Communication, SBU, Span of Control
MIS: Characteristics, Applications in different functions – Controlling, Planning etc.
MODULE 4
Total Quality Management: Pyramid model of TQM, Objectives, Core concepts.
Marketing Planning, Tasks of marketing, Implementation and control.
TEXT BOOKS
1. Managerial Economics - By R. L. Varshan And K. L. Maheshwari, S. Chand
2. Industrial Management And Managerial Economics - By P. K. Gupta And P. B. Sharma, Ratnasagar Pvt. Ltd
3. Essentials of Management – By H. Koontz and H. Weihrich, Tata McGraw Hill
REFERENCE BOOKS
1. Economics – By Samuelson, McGraw Hill
2. Managerial Economics – By Peterson and Lewis, Prentice Hall.
3. Management – By Stoner, Freeman and Gilbert, Prentice Hall.
4. Engineering Management – By Fraidoon Mazda, Addison-Wesley
5. Marketing – By Philip Kotler, Prentice Hall.
6. Management Information System – By Jawadekar, Tata McGraw Hill
7. Management Information System – By Laudon and Laudon, Prentice Hall
8. Organizational Behavior – By Newstorm and Davis, Tata McGraw Hill
Introduction: Preliminaries, Mathematical induction and recursive definitions.
Finite Automata: Deterministic and Non Deterministic
Regular expressions. Two-way Finite Automata, Applications of finite automata
MODULE 2
Properties of regular sets: Context free Grammars, Chomsky normal form, Greibach normal form, Context free languages.
Pushdown Automata Description: Relation between Pushdown automata and context free languages.
Properties of context free languages
Turing machine: Techniques, modifications, Church’s hypothesis, Deterministic context free languages, Enumerable languages, Universal Turing Machine, Rice’s theorem.
Undecidability: Greibach’s theorem, Chomsky Heirarchy, Regular Grammars, unrestricted grammars, Context – sensitive languages, Closure properties of families of languages.
TEXT BOOKS
1. Introduction to Automata Theory, Languages and Computation - By Hopcraft and Ullman, Narosa Publishing House.
2. Introduction to languages and the theory of computation – By John C. Martin, Tata McGraw Hill
REFERENCE BOOKS
1. Theoretical Science - By Krishnamurthy, AWEP.
2. Theory of Computer Science - By Brady, McGraw Hill.
3. Computations, Finite and Infinite Machines - By Minsky, Prentice Hall
Microprocessor 8086: Pin diagram, Instruction cycle, Architecture, Instruction Set, Assembly Language programming, etc. 8086 Basic configuration in maximum mode.
MODULE 2
8087 Coprocessor: Architecture, Connection and cooperation with main processor. Instruction Set of 8087, Programming with the Arithmetic Coprocessor.
Interfacing:
Programmable Peripheral Interface (PPI) - Basic Description of 8255,
Architecture, Modes of operation, programming the 8255.
Programmable timer 8253/8254, USART 8251
A/D and D/A Interfaces.
MODULE 4
System Design: Design of 8086 using Memory chips and simple I/O devices using interfaces. Microprocessor 80286 and 80386: Brief features, architecture, Memory management system, task switching protection etc. in 80286.
Review processors from 80486 onwards.
TEXT BOOKS
1. Microprocessors and Interfacing: Programming and Hardware, - By Douglas V. Hall, TMH.
2. Microprocessor Systems: The 8086/8088 family architecture programming and design – By Liu and Gibson, PHI
3. Microprocessor Architecture, Programming and Applications - By Ramesh Gaonkar, Wiley Eastern.
REFERENCE BOOKS
1. Microprocessor and Microcomputer Based Systems – By M. Rafiquzzaman, PHI.
2. The Intel microprocessors 8086/8088, 80186/80188, 80286, 80386, 80486, Pentium, and
Pentium pro processor Architecture, Programming and Interfacing - By Barry B. Brey, PHI
CE 5.4 DATA BASE MANAGEMENT SYSTEMS
Introduction to Database System Concept: Purpose of database System, View, database administrator, data models, overall system structure, schemes & instances
Database languages & Interfaces, data modeling using the E-R Model.
The Relational Model: Structure of relational Database, Relational Algebra, Domain, Tuple Relational Calculus, Extended Relational Algebra Operation.
Structured Query Languages (SQL): Data definition, Basic & More Complex Queries, Insert, Delete & Update Statement, Data Definition in SQL Views & Queries in SQL Specifying Constraints & Indexes in SQL, Other Relational Languages.
Relational Database Design: Pitfalls, Decomposition, Normalization, Domain-Key Normal Form, Practical Database Design & Tuning.
MODULE 3
Query Processing & Optimization: Translating SQL Queries into Relational Algebra, Algorithms for Executing Query Operations, Using Heuristics, Selectivity & Cost Estimates in Query optimization.
MODULE 4
Database Recovery Techniques: Recovery Techniques Based On Deferred, Immediate
Update, The ARIES Algorithm, Recovery in Multidatabase Systems.
Database Security & Authorization: Introduction to Database security Issues, Access Control
based on Granting / Revoking of Privileges, Mandatory Access Control for Multilevel
Security, Concurrency.
TEXT BOOKS
1. Fundamentals of Database Systems – By Elmasri & Navathe, Addison Wesley.
2. Database System Concepts, Abraham Silberschatz, Henry F. Korth, S. Sudarshan, McGraw Hill International Edition, IV Edition.
REFERENCE BOOKS
1. Computer Database Organization, James Martin, Prentice Hall International
2. An Introduction to Data Base Systems, C. J. Date, Addison Wesley
3. Data Base Management System, Raghu Ramakrishnan, McGraw Hill International Edition
4. An Introduction to Database Concepts, Desai B Galgotia Publications
CE 5.5 OPERATING SYSTEMS
MODULE 1
Introduction to Operating System
Process Management: Processes, CPU Scheduling, Process Synchronization and deadlocks
Process Management in UNIX/LINUX.
Storage Management: Memory Management, virtual memory, File system interface and File system, Implementation.
Storage Management in UNIX/LINUX.
I/O Systems: I/O systems, secondary storage structure and Tertiary storage structure.
I/O Systems in UNIX/LINUX.
Protection and security issues, Case Study of WINDOWS 98/NT Operating Systems.
Shell Programming in UNIX/LINUX.
1. The Operating System Concepts – By Silberschatz and Galvin, Wesley Publishing Co.
2. Systems Programming & Operating Systems - By D. M. Dhamdhere, Tata McGraw Hill Publication Co.
3. UNIX – Concepts and applications – By Sumitabha Das, Tata McGraw Hill
1. Operating Systems – By W Stallings. PHI.
2. Operating systems, Design and implementation – By A.S Tanenbaum,PHI.
3. Operating Systems – By Milenkovic, Tata McGraw Hill.
4. Operating Systems – By Achyut S. Godbole, Tata McGraw Hill.
5. The Design of the UNIX Operating System – By Maurice J. Bach, PHI
6. Linux Kernel Internals – By M Beck, H Bohme, M Dziadzka, U Kunitz, R Magnus, D Verworner, Addison Wesley
7. Unix System Programming using C++, Terence Chan, PHI
CE 5.6 COMPUTER HARDWARE DESIGN
Design methodology, design levels, system building blocks, loading rules, design conventions, introduction to AHPL, concepts, and features.
MODULE 2
Hardware programming in AHPL, concept of control design, study of hardwired control, realization of high-speed arithmetic circuits using hardwired techniques.
Study of micro programmed control, realization of high-speed arithmetic circuits using micro programmed control
NMOS and CMOS process, Electrical properties of MOS, NMOS inverter, CMOS inverter, MOS circuit design process.
TEXT BOOKS
1. Digital Systems, Hardware Organization and Design - By Hill and Peterson, John Wiley & Sons.
2. Computer Architecture and Organization - By J. P. Hayes, McGraw Hill
3. Basic VLSI Design - By Douglas Pucknell, PHI
1. Computer Engineering and Hardware Design - By Morris Mano PHI.
2. Principles of CMOS VLSI Design - By Niel Weste & Kamran Eshraghian, Addision Wesley
Introduction: Introduction to the subject, classification of problems and Mathematical Modeling in Operations Research.
Linear Programming: Formulation of Models, Graphic Solution, Maximization and Minimization of function with and without constraints, The Simplex method, Transportation and Assignment problems.
Integer Programming: Introduction, Implicit Enumeration, Cutting plane technique.
Branch and Bound Techniques: Introduction, Branch and Bound algorithms for Assignment, Travelling Salesman, Integer and Backpack loading problems.
Dynamic Programming: Introduction, Investment problem, Solutions to general allocation problems, Stage coach problem, Production scheduling.
Sequencing problem: Two Machine sequencing problem, N-job Three Machine sequencing problem.
PERT: PERT network, Critical path, Probability of completing event on schedule.
Queuing Theory: Notations and Assumptions, Queuing models.
TEXT BOOKS
1. Introduction to Operations Research: A Computer Oriented algorithm Approach - By Billey E. Gillet, TMH
REFERENCE BOOKS
1. Operations Research - By H. A. Taha, PHI
2. Operations Research - By Fredricks, Hiller and Leibermen, TMH.
CE 6.2 OBJECT ORIENTED DESIGN AND PROGRAMMING
System Development using Object Orientation
Procedure Oriented and Object Oriented Paradigms, Procedure Oriented Development Tools, Modeling as a design technique.
Object Modeling: Identifying objects and classes, specifying attributes, defining operations.
Object Oriented Analysis: Steps in object oriented analysis, recording analysis w.r.t static & dynamic aspects of classes & systems
MODULE 2
Design: System Design process, principles of a good object oriented design, design patterns with object oriented constructs.
Testing: Method, class, integration and interface testing
Debugging
Case study w.r.t some modeling tool. Eg. UML
Study of VC++: Introduction to VC++, Windows Programming, windows applications using MFC Dialog based applications: Resources, dialog editor, bitmap editor, Dialog boxes
Controls (Child Windows): Buttons, List boxes, Edit controls, Combo boxes, scrollbars, Static controls, Documents and Views
Design: Writing Text and drawing Graphics, Windows and GDI, Introducing the CDC family
Scrolling and Printing: Scrolling View, MFC printing functions, Menus, Toolbars and Status Bars. Simple design problems.
TEXT BOOKS
1. Object Oriented Modeling and Design – By Rambaugh et al., Prentice Hall
2. Object Oriented Analysis & Design – By Andrew Haigh, TMH
3. VC++ Programming – By Yeshwant Kanetkar, BPB Publications.
REFERENCE BOOKS
1. OO Software Engineering – The Professional Developers Guide - By George Wilkle, Addison Wesley
2. The Complete Reference Visual C++ 6 – By Chris H. Pappas & William H. Murray, TMH
3. Beginning VC++ - By Ivor Horton
4. VC++ programming – By Gilbert and Carty.
CE 6.3 ARTIFICIAL INTELLIGENCE
Introduction to AI, AI techniques: Problems, problem spaces & search, problem solving methods,
production system characteristics, design issues of production system
Heuristic search techniques, hill climbing, best first search, problem reduction, A*, AO* algorithm, means end analysis.
Knowledge representation: Representation & mappings, approaches to knowledge representation.
MODULE 2
Predicate logic: Symbolic reasoning under uncertainty, monotonic & non monotonic reasoning
Statistical reasoning, fuzzy logic
Weak slot-and-filler structures, semantic nets, frames
Strong slot-and-filler structures, conceptual dependency, scripts
Game playing, min -max search procedure, adding alpha-beta cutoffs
Planning an example domain: The blocks world, components of a planning system, goal stack planning, non linear planning & hierarchical planning
Natural language processing: Introduction, syntactic, semantic, discourse & pragmatic processing
Learning: Definition, rote learning, learning by taking advice, learning in problem solving, learning from examples
Expert systems: Definition, components, expert system shell, application, knowledge acquisition
Neural networks: Introduction, basics of AI neural networks, characteristics terminology, models of neural & topology, learning in neural networks.
TEXT BOOKS
1. Artificial Intelligence - By Rich & Knight, McGraw Hill.
REFERENCE BOOKS
1. Neural networks & fuzzy logic – By Dart Kooks, PHI
2. Artificial neural networks – By Vegnarayana, PHI
3. Artificial Intelligence – By Winston, PHI
MODULE 1
Basic Concepts: Overview of graphics system, output primitives, Line drawing Algorithm, circle generating, Ellipse generating, parallel line algorithm, Fill area primitives and functioning, Attributes of output primitive.
2D transformation: Principles and matrix representation, Composite transformation, reflection and shear. Clipping and windowing
Interactive graphics: Graphical input devices, Input technique, Event handling, input functions, Raster Graphics.
3D concepts: Realism in 3D graphics, 3D Object representation, 3D geometry and modeling transformation, 3D viewing.
Curves and Surfaces, respective depth, Hidden Surface illumination, shading
Segment and display files, display file compilation, geometric models, picture structure, graphic package.
Computer Animation: Colour models and Colour application, visible surface detection methods.
Illumination models surface rendering methods.
Graphic systems:
Display processor, user interface designs, device independent graphics system.
TEXT BOOKS
1. Computer Graphics – By Donald Hearn and M. P. Baker, PHI.
2. Principles of Interactive Graphics – By Newman and Sproull, McGraw hill.
REFERENCE BOOKS
1. Computer Graphics – By Steven Harrington, Tata McGraw Hill.
2. Compute Graphics: Principles and Practice – By Foley, Van Dam, Feiner and Hughes
3. Introduction to Computer Graphics – By N. Krishnamurthy, TMH
4. Procedural Elements for Computer Graphics – By David F. Rogers, TMH
CE 6.5 DEVICE INTERFACING AND PC MAINTENANCE
MODULE 1
8259 – Programmable interrupt controller: Block diagram, working principle and operation in a PC system.
8257 - DMA controller: Block diagram, working principle and operation in a PC system.
8275 – CRT controller: Block diagram, interface to a video monitor and PC system, types of display devices; their construction and working principle, display modes
8279 – Keyboard / Display controller: Block diagram, working principle and interface to a PC system. Organization of a keyboard, types of keyboards and key switches, interfacing of a keyboard.
MODULE 2
Secondary storage devices: Hard disk drives: Construction, working principle, installation procedure for single and multiple drives, partitioning and interfacing to a PC system.
Floppy disk drive: Construction, working principle, drive assembly, recording techniques and interfacing to a PC system.
8272 – Floppy disk controller: Block diagram, working principle and interface to drive and PC system.
CDROM Drive: Construction, working principle and interface to a PC system.
MODULE 3
I/O interfaces: IDE and SCSI
Buses: Types of buses
Printers: Types of printers, working principle, troubleshooting, Centronic Printer Interface.
Plotters: Types of Plotters.
Power Supply Units: SMPS, UPS, construction, working principle, power line problems and counter measures.
MODULE 4
Troubleshooting and fault finding: Types and nature of faults, fault diagnosis and trouble shooting for each subsystem in a PC.
Diagnostic tools: Logic probe, logic pulser, logic analyzer, IC tester, digital oscilloscope
Diagnostic software: Types, preventive maintenance for a PC system.
TEXT BOOKS
1. Troubleshooting, Maintenance and Repairing PCs - By Stephen Bigelow, TMH
2. Advanced Microprocessors and Peripherals: Architecture, Programming and Interfacing – By Ray and Bharchandani, TMH
3. IBM PC and Clones – Hardware, Troubleshooting and Maintenance – By Govindarajalu, TMH
REFERENCE BOOKS
1. Microprocessors and Interfacing – By D.V. Hall, TMH
2. The Complete PC Upgrade and Maintenance Guide – By Mark Minasi, BPB Publications
3. Upgrading and Repairing PCs – By Scout Muller, PHI
CE 6.6 COMPUTER NETWORKS – I
MODULE 1
Introduction to Data Communications: Data transmission, concepts and terminology, analog and digital data transmission, transmission media, data encoding.
MODULE 2
Data Communication: Synchronous / Asynchronous transmission, interfacing, error detection, error control, interfacing, flow control, control protocols (HDLC).
MODULE 3
Computer Networks - Introduction: Network goals and applications, line configuration, network topology, transmission modes, network categories, circuit and packet switching, Layers in the OSI reference model and TCP/IP model.
MODULE 4
Data Link Layer: Data link layer design issues, elementary data link protocols, sliding window protocols, protocol specification and verification.
TEXT BOOKS
1. Data and Computer Communications – By Williams Stallings, PHI.
2. Data communication and Networking – Behrouz A. Forouzan, Tata McGraw Hill
REFERENCE BOOKS
1. Computer Networks – By Andrew S. Tannenbaum, PHI.
2. Computer Networks and Distributed Processing - By James Martin, PHI
3. Network Programming – By Richard Stevens, PHI.
4. Data Networks – By Dmitri and Bertsekas, Wiley Eastern.
CE 7.1 LANGUAGE TRANSLATORS
Lectures per week
: (3 + 1 +2)
Max marks for theory paper
: 100
Max marks for sessionals
: 25
Max marks for Orals
: 50
Duration of paper
: 3 hours
Total no. of modules
: 4
No. of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one question from each module with two compulsory questions from any one module. )
Language
processors:
Fundamentals of Language processing phases of Language processing, fundamentals
or language specification,
Bootstrapping and Porting Macros and macro expansion, nested macro calls, design
of a macro preprocessor.
MODULE
2
Assemblers: Elements of assembly language programming, statements in assemblers, design specification of an assembler, passes of an assembler, example of single pass assembler problems in single pass assemble, Design of a two pass assembler, Relocation, Linking and Loading
MODULE
3
Compilers: Phases of compilation. Lexical Analysis and lexical analyzer tool-LEX.
Parsing: Top down parsers and bottom up parsers. Recursive
descent parser, predictive parser, LL parser. Shift Reduce parsers, Operator
precedence parsers, LR parsers.
Parser Generator tool-Yaac.
MODULE
4
Syntax directed translation scheme, code optimization, semantic analysis, types of errors, symbol table generation, data structures in symbol table, Runtime environment, Storage administration, Code Generation.
TEXT BOOKS
1. Compilers –by Aho an Ulman, Addison Wesley.
2.
System programming and Operating Systems – by Dhamdhere, Tata McGraw
hill.
REFERENCE BOOKS
1.
Compiler Construction –by Barett, Batesand Couch, Galgotia Publication,
Pvt Ltd.
2.
System Programming- by Donoven, Tata McGraw hill.
3.
Theory and Practice of Compiler Writing – by P. Trembly
4.
Principles of Compiler Design – by Aho and Ulman, narosa publishing
House.
CE 7.2 COMPUTER COMMUNICATION NETWORKS-II
Lectures per week
: (3 + 1 +2)
Max marks for theory paper
: 100
Max marks for sessionals
: 25
Duration of paper
: 3 hours
Total no. of modules : 4
No. of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one question from each module with two compulsory questions from any one module. )
MODULE
1
Over view of OSI model:Design issues of transport layer ,session layer, presentation layer and the application layer.Connection management,RPC and compression techniques.
TCP/IP
protocol suite:Over view of TCP/IP.client server model:concurrency processing,
BOOTP,DHCP,DNS,the
socket interface,applications:TELNET,FTP,SMTP,SNMP,HTTP.
IP Telephony:H.323 and general background of IP telephony.
ATM
Networks:over view of ATM:introduction,genesis,basic principle ,B-ISDN and ATM
,ATM protocol stack:physical layer,ATM layer and AAL layer. Traffic
management:call admission control.ATM routing:PNNI Protocol.ATM
Networks,switching in ATM, ATM in LANs.
Topological
Design issues of computer networks:Importance of topological design, selecting
terminal-conectrator locations, multipoint connections:algorithms-Chandy Russel,
Esau Williams and Kruskal’s algorithm. Link and link capacity assignment,
discrete links: Disjoint route topology.
TEXT
BOOKS:
1.Inter
networking with TCP/IP volume-II and III.-Douglas.E. Comer and Stevens. PHI
2.ATM
Networks Concepts and protocols-Sumeet Kasera and Pankaj Sethi.-TMH
3.Data
and Computer communication –William stallings. PHI
REFERENCES:
1.Design
and analysis of computer Communication networks-Vijay Ahuja TMH.
2.IP
Telephony-Oliver Hersent,David Gurle and Jean Petit. PEA
3.Computer
Networks –Andrew S Tenenbaum. PHI
4.An
Engineering Approach to Computer Networks-S.Keshav. PEA
5.Unix
Network programming-W.Richard Stevens PHI.
CE 7.3 SOFTWARE ENGINEERING
Lectures per week
: (3 + 1)
Duration of paper
: 3 hours
Total no. of modules : 4
No. of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one question from each module with two compulsory questions from any one module. )
Classical Software Engineering:
Introduction to Software Engineering, scope of
software engineering- historical aspects, economic aspects, maintenance aspects,
specification and design aspects, team programming aspects.
The software process- client, developer and user
requirement phase, specification phase, Design phase implementation phase,
Integration phase, maintenance phase improving the software process, capability
maturity models, costs and benefits of software process management.
Software life cycle models- water fall model, rapid
prototyping model, Incremental model, extreme programming, spiral model
comparison of life cycle models.
Cost estimation models- Function point analysis and
COCOMO-I and COCOMO-II
MODULE 2
Object Oriented Software Engineering: object basics, object terminology- cohesion- (logical, temporal procedural, communicational, functional etc. coupling- content coupling, common coupling, Data coupling etc.) Data encapsulation, software re-usability, portability, Interoperability- CASE tools in use for object oriented software engineering- UML and its usage in software engineering
Software testing: software quality assurance, The six essentials of software testing, clean sheet approach, verification testing, validation testing , Integration testing(GVI) Master test planning, Organizational approaches to testing, Software testing tools- for classical engineering and object oriented engineering- software testing standards
Integration testing: Master test planning, Organizational approaches to testing object oriented testing, Testing standards
MODULE 4
Software Project management: Managing
software project, project planning, process planning- the standard process,
requirement change management, quality management Risk management, the project
management plan team structure, communication, team development configuration
management. Project execution project monitoring and control, project closure
performing closure analysis, closure analysis report.
TEXT BOOKS
1.
Object Oriented and Classical Software Engineering- Stephen R.Schah(TMH)
2.
Software Project Management in practice- Pankaj Jalote- PEA
REFERENCE
BOOKS
1.
Software Engineering – A practitioner’s approach – by Roger S.
Pressman, McGraw Hill
2.
A discipline for Software Engineering – by Watts S. Humprey, Pearson
Education
3.
Software Engineering – by K. K. Aggarwal and Yogesh Singh, New Age
Publications
4.
Object Oriented and classical Software Engineering – Steven. Schalch
TMH
5.
‘Ed-Kit’- Software testing in real world. Addison Wesley 1995
6.
Effective methods for software testing(second edition) John-Wiley 1999
7.
Software testing techniques(2nd edition) Van Nostrand Rein
loud 1990
8.
The art of software testing, Jon Wiley Mayers G.J.
CE 7.4 Elective I (b) DIGITAL SIGNAL
PROCESSING
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for sessionals
: 25
Max marks for orals
: 50
Duration of paper : 3 hours
Total no. of modules : 4
No. of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one question from each module with two compulsory questions from any one module. )
Discrete Time signal and its application to LTI
system:
Discrete-time Fourier transform (DTFT), Discrete Fourier Transform (DFT),
Relationship between the DTFT and DFT and their inverses, DFT properties, Linear
and circular convolution, Linear filtering methods based on DFT.
Z-Transforms [Z.T.]:
Introduction, definition of Z-Transform, properties, Region of convergence,
evaluation of inverse Z.T., rational Z.T.
Efficient computation of DFT:
Fast Fourier transform [F.F.T.], Direct computation of DFT, Divide and conquer
approach of DFT, Radix-2FFT algorithm: Decimation in Time [D.I.T] and
Decimation in frequency[D.I.F], Shuffling of the data and bit reversal,
Introduction to basic butterfly computation in radix-4 FFT algorithm, Goertzel
algorithm and Chirp-Z Transform algorithm, Effect of Quantisation in DFT.
Realization of Discrete-Time System:
Introduction, Basic Realization block diagram and the signal flow graph, Basic
structures of IIR filter: Direct, canonical, cascade and parallel realizations.
MODULE
3
Design of Digital Filters: General considerations, causality and its implications, characteristics of practical Frequency selective filters. Design of FIR filters: Symmetric FIR filters, design of linear phase-FIR filters using windows, frequency sampling method.
Design of IIR filter: IIR filter design by impulse invariance, bilinear transformation, Butterworth filter, Chebyshev filters and Elliptic filters.
Frequency selective filters:
Ideal filter characteristics, Lowpass, Highpass and Bandpass filters, Notch
filters, Comb filters.
MODULE
4
Miltirate Digital Signal processing:
Introduction, Decimation by factor D, Interpolation by factor I, sampling,
sampling rate conversion by rational factor I/D, Applications of multirate
signal processing, Design of phase shifters, interfacing of digital systems with
different sampling rates, Subband coding of speech signals, oversampling A/D and
D/A conversion.
Application of DSP:
Voice processing, introduction to wavelet transforms.
Definition of an image, Image representation,
introduction to 2-D Fourier Transform.
TEXT
BOOKS
1.
Digital Signal Processing, algorithm and application – By John C.
Proakis & Dimitris. G. Manolakis, PHI
2.
Digital Signal Processing ---S.Mitra – TMH
REFERENCE
BOOKS
1.
Digital
Signal Processing -By Salivahanan
2.
Signal
Processing & Linear systems - By B.P.Lathi, Oxford
3.
Understanding
Digital Signal Processing - By Lynons,Addison Wesseley
4.
Theory
and Application of digital Signal Processing - ByRabiner and Gold ---PHI
5.
Introduction
to Digital Signal Processing - Johny R. Johnson,PHI
6.
Discrete—Signal
Processing - Oppenhein and Schaffer,PHI.
CE 7.4 Elective I (c) SOFTWARE
AGENTS & EMBEDDED SYSTEMS
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for sessionals
: 25
Max marks for orals
: 50
Duration of paper : 3 hours
Total no. of modules : 4
No. of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one question from each module with two compulsory questions from any one module. )
Software Agents: Introduction , Types of software agents, Intelligent agents, agent architecture, Multi agent systems, agent collaborations, agents as memory aids, mobile agents.
MODULE 2
Microcontrollers: Introduction
to microcontrollers, Architecture of 8051, 8051 Instruction set- data movement
instructions, arithmetic instruction, bit operators, Execution exchange
operators.
MODULE
3
Programming with 8051
– Program to demonstrate arithmetic operations, bank register addressing, RAM
direct addressing-conditional branching , stack operations, variable array
implementation- pseudorandom LED display using 8051 – Applications of
8051(minimum two applications to be covered).
Embedded software development tools: Debugging techniques, performance issues and bottlenecks.
Case study: Embedded
Linux, PSOS , RTOS and Vxworks.
TEXT BOOKS
1.
Text of Intelligent
interfaces as agents- Chin, David N. ACM press/Addison Wesley
2.
Programming and
customizing the 8051 microcontroller- Myke Predko TMH
1.
An Embedded Software Primer – By David E. Simon PHI
2. Software agents – Chris Dellarocas- Addisson Wesley
3.
Mobile software agents
for control in telecom network- Steve Appleby and S.Steward- BT. Technology
Journal 12(2) : 104-113 April 94
ETC/CE 7.4 (a)- Elective I – VLSI Technology and Design
Lectures per week
: (3 + 1 + 2)
Max. marks for theory paper
: 100
Max. marks for sessionals : 25
Max. marks for orals
: 50
Duration of paper : 3
hours
Total no. of modules
: 4
No. of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one questions from each module with two compulsory question from any one module.)
MODULE 1
Silicon Semiconductor Technology:
Wafer processing, oxidation, Epitaxy, deposition, Ion-Implantation and Diffusion
Silicon gate process. Basic CMOS Technology: A basic n-well and p-well
CMOS process. Silicon On Insulator. MOSIS Layout Design Rules (Full – Custom
Mask layout Designs), Stick Diagrams, layout editors (Magic) and circuit
extraction.
MODULE 2
MOS Transistor: Structure, MOS system under external bias, operation of MOS transistor (MOSFET), threshold voltage, MOSFET current-voltage characteristics (GCA), channel length modulation, substrate bias effect, Measurements of parameters – Kn, VTO & g, MOSFET Scaling – Full scaling & Constant Voltage Scaling. Short channel effects, Narrow channel effects, MOSFET capacitances.
Modeling of MOS transistor circuits using SPICE (level 1 model equation)
Features and Comparisons of level 1, 2 and 3 and BSIM.
MODULE
3
MOS Inverters: Static Characteristics: VTC, Noise Immunity and Noise Margins, NMOS Inverter, CMOS Inverter (SPICE model) – Circuit operation, Calculations of VIL, VIH and VTH, Power and Area considerations, CMOS latch-up and its prevention, CMOS logic circuits, CMOS transmission gate.
Overview of CMOS logic structures: CMOS complementary logic, BiCMOS logic, Pseudo-nMOS logic and Dynamic CMOS logic, CMOS Domino logic.
MODULE
4
VLSI Design Methodologies: VLSI Design Flow,
Design analysis, Simulation: Circuit, Timing, Switch – level, Gate – level
(or logic), functional – (using VHDL
Design Verification: Electrical, Timing, Functional (Formal).
Implementation Approaches: Custom circuit design.
Cell based Design Methodology: Standard cell, Macrocell place and route.
Array based Implementation Approaches: Mask – Programmable arrays, Prewired Arrays (FPGA), Ramed based (Volatile FPGAs).
Design Synthesis: Circuit and logic Synthesis.
Validation and
Testing: Test procedure, Design for Testability (DFT), AD-HOC testing, Scan –
Based Test, Boundary – Scan Design, Built in self test (BIST), Test –
Pattern Generation, Fault models, Automatic Test _ Patterns generation (ATPG),
Fault Simulation.
TEXT BOOKS:
REFERENCES:
CE 7.4 Elective I (d) FUZZY LOGIC AND NEURAL
NETWORKS
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for sessionals
: 25
Max marks for orals
: 50
Total no. of modules : 4
No. of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one question from each module with two compulsory questions from any one module. )
Neural
Dynamics: Activations
and Signals, Activation Models
Unsupervised Learning: Learning laws, Stochastic Unsupervised Learning and Stochastic Equilibrium, Hebbian Learning, Competitive Learning, Differential Hebbian Learning, Differential Competetive Learning.
Supervised Learning:
Supervised Function Estimation, Supervised Learning as Operand Conditioning,
Stochastic Pattern Learning and Stochastic Approximation, The Backpropagation
Algorithm
Fuzziness
v/s Probability
Fuzzy Associative Memories(FAMs): Fuzzy and Neural Function Estimators, Fuzzy Hebb FAMs, Adaptive FAMs
Control
Systems:
Fuzzy and Neural Truck Backer – Upper Control Systems, Fuzzy
and Kalman – Filter target Tracking Control Systems
Image
Transform Coding with Fuzzy Systems
1. Neural Networks and Fuzzy Systems: A Dynamical Systems Approach to Machine Intelligence, - By Bart Kosko, PHI
2.
Fundamentals of Artificial Neural Networks, - By Mohamad H. Hassoun, PHI
1.
Neural Networks: A comprehensive Foundation, - By Simon Haykin, Pearson
Education
2.
Introduction to Artificial Neural Networks, - By Jacek M. Zurada, Jaico
Publishing House
CE
7.5 Elective II(a) DATA MINING .
Lectures per week : (3 + 1 +2)
Max
marks for theory paper
: 100
Max
marks for sessionals
: 25
Max
marks for orals
:50
Duration
of paper
: 3 hours
Total
no. of modules : 4
No.
of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one question from each module with two compulsory questions from any one module. )
MODULE
1
Introduction:
Motivation, definition, data ware housing-architecture, data ware house
implementation-OLAP; Data processing-data integration and transformation, data
reduction.
Data
mining primitives, languages and system architecture: DMQL, Mining association
rules in large data bases. Single dimension Boolean association rule, multilevel
association rules, constraint based association mining.
Cluster
analyses: Definition of cluster, clustering methods- portioning methods,
hierarchical methods,density based methods, grid based methods, model based
clustering methods, online
analysis.
Mining
the world wide web. Application and
trends in data mining .
Data
mining and privacy issues-social context.
TEXT
BOOKS:
1.Data
mining concepts and techniques.- Jiawei Han and Micheline Kamber.
-Morgan Kuaffman publisher
2.Modern
data base management- Fred.R. Mcfadden. PEA
REFERENCES:
1.Mastering
Data Mining-Michel. J. A. Berry. Gordon S.Linoff. Wiley
2.Data
Mining-Pieter Adriaans and Dolf Zantinge.-PEA.
CE 7.5 Elective II (b) DISTRIBUTED OPERATING
SYSTEMS
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for sessionals
: 25
Max marks for orals
: 50
Total no. of modules : 4
No. of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one question from each module with two compulsory questions from any one module. )
Introduction to Distributed Systems: Goals, Hardware and Software Concepts in Distributed Systems, Design issues/ Communication in Distributed Systems: Layered protocol, ATM networks, Client-Server model, Sockets, Remote Procedure Call, Group Communication
Synchronization in Distributed Systems: Clock Synchronization, Mutual Exclusion, Election algorithm, Atomic Transactions, Dead lock in Distributed Systems.
Processes in Distributed Systems: Threads,
System model, Processor allocation and scheduling in Distributed systems.
Concepts of Fault Tolerance and Real Time Systems.
Distributed File System:
Distributed File System Design, Distributed File system Implementation, Trends
in Distributed File system. Case study of a File system.
MODULE
4
Distributed shared Memory: What is shared memory, consistancy model, Page based Distributed, shared memory, object based Distributed Shared memory.
Protection & Security in Distributed systems: A case study of distributed system.
1.
Distributed Operating Systems - By A.S.
Tanenbaum, Pearson Education.
2.
Distributed Systems: Concepts and Design - By G.Coulouris, J. Dollimore
and T.King Berg., Addison Wesley.
CE 7.5 Elective II (c) WEB TECHNOLOGIES
Lectures per week
: (3 + 1 +2)
Max marks for theory paper
: 100
Max marks for sessionals
: 25
Max marks for orals
: 50
Duration of paper
: 3 hours
Total no. of modules : 4
No. of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one question from each module with two compulsory questions from any one module. )
Internet: Basics, web objects, sites, e-mail, WWW, File
transfer, TELNET etc.
Web servers, browsers and security:
Web server, proxy server, web browsers, firewalls, data security
Creating a website and Markup languages:
HTML, DHTML
XML: SGML, XML basics, XML parsers
Searching and Web-casting techniques:
Search engines, search tools, etc.
MODULE
2
Dynamic web pages: Overview, Common Gateway Interface, Active server page technology, Java and the concept of a virtual machine, Java Servlets, JSP
Active web pages: Java applets, Java Beans
MODULE
3
COM, DCOM, COM+: Overview, Building ActiveX controls, internet
COM components, building COM, DCOM, COM+ components, Services, Security
MODULE
4
E-Commerce: Introduction, User sessions in e-commerce
applications, Transaction management and Security issues
Introduction to Wireless Access Protocol (WAP)
TEXT BOOKS
1.
Web technologies – By Godbole, TMH
2.
Web technologies – By Rajkumar, TMH
REFERENCE BOOKS
1.
Using
HTML, XML and Java 1.2 – By Eric Ladd and Jim O’ Donnel, PHI
2.
Professional
DCOM – By Dr. Richard Grimes
3.
The Java
FAQ – By Jonni Kanerva
CE 7.5 Elective II (d) DIGITAL SIMULATION AND
MODELING
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for sessionals
: 25
Max marks for orals
: 50
Total no. of modules : 4
No. of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one question from each module with two compulsory questions from any one module. )
Introduction to Simulation and System Modeling concepts, System Specification formalisms, System Specifications, Framework for Modeling and Simulation, Simulation examples, Hierarchy of System Specifications
Introduction to Discrete Event System Specifications (DEVS)
Modeling Formalisms and Simulation Algorithms
Basic formalisms: DEVS, DTSS, DESS, Coupled
multicomponent systems
Simulators for Basic Formalisms
Multiformalism Modeling and Simulation
Parallel and Distributed Discrete Event Simulation System Morphisms: Hierarchy of System Morphisms, Constructing Model families, Verification, Validation, Approximate morphisms
System Design Modeling and System Environments: DEVS Based Design Methodology Simulation Software, Simulation of a Computer System.
1.
Theory of
Modeling and Simulation – Integrationg Discrete Event and Continuous Dynamic
Systems – By Bernard P. Zeigler, Herbert Praehofer, Tag Gon Kim, Academic
Press
2.
Simulation
and Modeling Analysis – By A. M. Law, W. D. Kelten, McGraw Hill
1.
System
Simulation with Digital Computers – By N. Deo, PHI
2.
Concepts
and Methods in Descrete Event Digital Simulation – By G. S. Fishman,
- John Wiley & sons
3.
System
Simulation – By G. Gorden, PHI
4. Discrete Event System Simulation – By Jerry Banks, John S. Carson, Barry L. Nelson, David M. Nicol, Pearson Education
CE 8.1 – ADVANCED DATA STRUCTURES & ALGORITHMS
Lectures per week
: (3 + 1 + 2)
Max. marks for theory paper
: 100
Max. marks for orals
: 50
Duration of paper : 3
hours
Total no. of modules
: 4
No. of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one questions from each module with two compulsory question from any one module.)
MODULE 1
B-trees: definitions, basic operation on the B-trees,
deleting a key from a B-tree.
Heaps: B-heaps and operations on B-heaps. Fibanocci
heaps: heap structure, operations decreasing a key and deleting a node.
Data structures for disjoint sets. Disjoint set
operations, Linked list representation of disjoint sets, disjoint set forests.
MODULE 2
Hoffman coding: error detection and correction.
Polynomials and FFT: Representation of polynomials,
DFT and FFT. Efficient FFT implementation.
RSA public key cryptic algorithms.
MODULE 3
Introduction to parallelism models, simple algorithms
for parallel computers.
CRCW and EREw algorithms, Brent’s theorem and work
efficiency. Handling write conflicts, merging and sorting, finding connected
components, lower bound for adding n integers.
MODULE 4
Probabilistic Algorithms: Introduction; Expected
versus average time, Pseudorandom generation, Buffon’s needle numerical
integration, Probabilistic counting, Monte Carlo algorithms – verifying matrix
multiplication, primality testing, probabilistic selection and sorting,
Universal hashing, Factorizing large integers.
TEXT BOOKS:
REFERENCES:
CE 8.2 Elective III (a) MULTIMEDIA SYSTEMS
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for sessionals
: 25
Max
marks for orals
:50
Total no. of modules : 4
No. of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one question from each module with two compulsory questions from any one module. )
Introduction to Multimedia: Content structure and literature. Media and Data Streams: Medium , properties, multimedia and data string characteristics. Sound/Audio: Basic concepts, music and speech. Images and Graphics: Basic concepts and computer image processing . Video and Animation: Basic concepts , television and computer based animation. Data Compression: Storage space, coding requirements, compression techniques, JPEG, H.261, MPEG, DVI Optical Storage Media: CD , digital audio, CD-ROM, CD-WO, CD-MO.
Computer Technology:
Communication Architecture, Multimedia Workstation. Multimedia Operating
Systems: Real time systems, Resources and Process Management, File Systems,
Interprocess Communication and Synchronization, Memory and Device Management,
Systems Architecture. Networking Systems: local ATM networks, distributed
queue Dual bus(DQDB), MAN connectivity to ATM networks, B-ISDN: ATM.
Multimedia Communication Systems: Application subsystem, transport subsystem, Quality of Service and Resource Management. Multimedia Database Management Systems: Characteristics, data analysis and structure, operations on data, integration in a database model. Documents Hypertext and MHEG: Documents architecture, Hypertext, Hypermedia and multimedia, Hypermedia systems architecture, nodes and pointers, ODA and multimedia, Document architecture SGML. Interactive multimedia presentation: Class hierarchy , contents , behavior of user interaction, container.
1.
Multimedia: Computing Communication and Applications, - By Ralf Steinmetz
and Klara Nahrstedt, Pearson Education
1.
Multimedia Systems, - By John F. Koegel Buford, Pearson Education
2.
Multimedia: Making it Work, - By Tay Vaughan, TMH
3. Principles of Interactive Multimedia, - By Mark Elsom-Cook, TMH
CE 8.2 Elective III (b) SOFTWARE
TOOLS FOR CAD/CAM
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for sessionals
: 25
Max marks for orals
: 50
Total no. of modules : 4
No. of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one question from each module with two compulsory questions from any one module. )
Introduction to CAD/CAM, Review of CAD/CAM Hardware, Basics of Computer Graphics: Database structures for Graphic modeling, Transformation of Geometry, 3D transformations, mathematics of projections, clipping, hidden surface removal etc.
Design of Industrial products:
Geometric Modeling, CAD standards, case study of a drafting system, modeling
system: Unigraphics and solid modeling, finite element Modeling ad software.
Manufacturing aspects of Industrial products: Computer Numeric Control, CNC hardware basics, CNC tooling, CNC tools and control system; CNC programming
1.
CAD/CAM ,Principles and Applications - By
P.N.Rao, TMH
1.
CAD/CAM - By M.P. Groover and E.W. Zimmers, PHI
2.
Computer Aided Design and Manufacturing - By C.B.Basant and C.W.K. Ellis
horward John Wiley and son
CE 8.2 Elective III (c) ROBOTICS
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for sessionals
: 25
Max marks for orals
: 50
Total no. of modules : 4
No. of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one question from each module with two compulsory questions from any one module. )
MODULE 1
Robot Arm Dynamics:
Introduction, Lagrange-Euler Formulation, Newton-Euler Formulation, Generalized
D’Alembert Equations of Motion
Planning of Manipulator Trajectories: General considerations of trajectory planning, Joint –interpolated trajectories, Planning of Manipulator Cartesian Path trajectories
Control of Robot Manipulators: Control of the Puma Robot Arm, Computed Torque technique, Near - minimum time control, Variable Structure Control, Non linear decoupled feedback Control, Resolved Motion Control, Adaptive Control
Sensing:
Range, Proximity, Touch, Force and Torque sensing
Lower
level Vision: Image
Acquisition, Illumination techniques, Imaging Geometry, Relationships between
pixels, Preprocessing
1.
Robotics: Control, Sensing, Vision and Intelligence, By K. S. Fu, R. C.
Gonzalez, C.S.G Lee, TMH
2.
Fundamentals of Robotics: Analysis and Control, By Robert J. Schilling
1.
Industrial Robotics: Technology, Programming and Applications, By Mikell
P. Groover, Mitchell Weiss, Roger N. Nagel, Nicholas G. Odrey, TMH
2.
Introduction to Robotics: Mechanics and Control, By John J. Craig
3.
Robotics Technology and Flexible Automation, By S. B. Deb, TMH
4.
Modeling and Control of Robot Manipulators, By Lorenzo Sciavicco, Bruno
Siciliano, TMH
CE 8.2 Elective III (d) ADVANCED COMPUTER ARCHITECTURES
Lectures per week
: (3 + 1 +2)
Max marks for theory paper
: 100
Max marks for sessionals
: 25
Max marks for orals
: 50
Total no. of modules : 4
No. of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one question from each module with two compulsory questions from any one module. )
Introduction to parallel processing: Evolution of computer systems, parallelism in uniprocessors,
parallel computer modes, Architectural classification schemes, Parallel
processing applications. Conditions of parallelism, Hardware and Software
parallelism, Types of parallelism, Introduction to pipelining, Linear pipeline
processor, Non-linear pipeline processors, Instruction and Arithmetic pipeline
design, principles of designing pipelined processors.
Hierarchical memory technology, Addressing schemes,
Locality of References, Hierarchy optimization.
MODULE
2
Vector processing principles, Vector loops and chaining, pipelined vector processing methods, Architecture or Cray-1,Vectorization and Optimization methods.
SIMD Computer Organization: Introduction, Interconnection networks,parallel algorithms for array processors, The Illiac-IV System architecture and applications
Associative array processing: Associative memory organization, PEPE and STARAN associative processors, associative search algorithms.
Multiprocessors: Functional structures, Interconnection
networks, Cache coherence and solutions, Interleaved memory organization,
Multiprocessor operating systems, Language features to exploit parallelism,
Detection of parallelism using Bernstein’s conditions, Process synchronization
mechanisms, system deadlocks and protection.
Parallel algorithms for
multiprocessors-Classifications and performance of algorithms.
Cray X-MP system architecture and multitasking.
Dataflow computers:
Control flow versus data flow computers, Data flow architectures, Static and
Dynamic data flow computers, study of Arvind’s machine and Dennis Machine,
demand-driven mechanism, Data flow graphs and languages, Advantages and
potential problems in data flow computers.
VLSI computing structures-systolic array
architecture, VLSI chip implementation of matrix multiplication.
RISC processor: RISC architecture, Instruction set of RISC, distinction between RISC and CISC, overlapping windows in RISC, Study of a RISC processor called SPARC, Advantages and disadvantages of RISC processor.
TEXT
BOOKS
1. Advanced computer architecture by Kai Hwang, TMH.
2.
Computer
architecture and parallel processing by Hwang and Briggs, TMH.
REFERENCE
BOOKS
1.
Computer
Architecture by Nicholas Carter, TMH
CE 8.3 Elective IV (a) IMAGE
PROCESSING AND PATTERN RECOGNITION
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for sessionals
: 25
Max marks for orals
: 50
Total no. of modules : 4
No. of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one question from each module with two compulsory questions from any one module. )
Fundamentals of Images: Digital Image representation, Elements of Image processing systems and simple image model, sampling and Quantisation, Basic relationship between pixels, Image Geometry.
Image Transforms: Fourier transforms, Properties , Fast Fourier transforms, Other separable transforms.
Image Enhancement: Enhancement by point processing, Spatial
filtering, Enhancement in frequency domain, Color Image Processing
Image Restoration: Degradation model, Algebraic approach to
Restoration problem Inverse filtering.
MODULE
3
Image Compression: Fundamentals, Image Compression models, error
free compression, lossy compression.
Image segmentation: Detection of discontinuities, linking and boundary detection,
Thresholding, Region oriented segmentation.
MODULE
4
Representation and description: Representation schemes, boundary descriptors, Regional descriptors and morphology.
Recognition: elements of image analysis pattern and pattern classes, Decision theoretic methods.
TEXT
BOOKS
1.
Digital Image Processing - By R.C.
Gonzalez and R.E. Woods, Addision Wesley.
REFERENCE
BOOKS
1.
Fundamentals of Digital Image Processing - By A.K.Jain, PHI.
2.
Digital Image Processing - By W.K.Pralt, McGraw Hill
3.
Digital Image Processing - By C.C. Rafeil, Paul Wintez, Addison Wesley.
CE
8.3 Elective IV(b) CRYPTOGRAPHY AND
NETWORK SECURITY
Lectures per week
: (3 + 1 +2)
Max marks for theory paper
: 100
Max marks for sessionals
: 25
Max
marks for orals
:50
Duration of paper
: 3 hours
Total no. of modules : 4
No. of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one question from each module with two compulsory questions from any one module. )
CRYPTOGRAPHY 1: Introduction: Attacks, Services, and Mechanisms, Security Attacks, Security Services, A model of Internetwork Security. Conventional Encryption Model, Steganography, Classical Encryption Techniques, Simplified DES, Block Cipher Principles The Data Encryption Standard, The strength of DES, Differential and Linear Cryptanalysis. Algorithms: Triple DES, International Data Encryption Algorithm, Blowfish, Confidentiality Using Conventional Encryption: Placement of Encryption Function, Traffic Confidentiality, Key Distribution, Random Number Generation.
CRYPTOGRAPHY 2: Public key cryptography : Principles of
Public-Key Cryptosystems, The RSA Algorithm, Key Management, Diffie-Hellman Key
Exchange, Number Theory: Prime and Relatively Prime Numbers, Modular Arithmetic,
Fermat’s and Euler’s Theorems, Testing for Primality, Euclid’s Algorithm,
The Chinese Remainder Theorem, Discrete Logarithms, Message Authentication and
Hash functions: Authentication Requirements, Authentication Functions, Message
Authentication Codes, MDs Message Digest Algorithm, Digital Signatures and
Authentication Protocols: Digital Signatures, Authentication Protocols, Digital
Signature Standard.
Network Security-I Authentication Applications: Kerberos, X.509 Directory
Authentication Service, Electronic Mail Security: Pretty Good Privacy, S/MIME.IP
Security: IP Security Overview, IP Security Architecture, Authentication Header,
Encapsulating Security Payload, Combining Security Associations, Key Management.
Network Security-II Web Security: Web security Requirements, Secdure Sockets Layer
and Transport Layer Security, Secure Electronic Transaction. Intruders, Viruses,
and Worms: Intruders, Viruses and Related Threats, Firewalls: Firewall Design
Principles, Trusted Systems.
TEXT BOOKS:
1.Cryptography and Network security 2nd
ed.—William Stallings PEA
REFERENCES:
1.Internet
Cryptography, Addison Wesley 1997—Richard E Smith PEA.
CE 8.3 Elective IV (c) NATURAL
LANGUAGES PROCESSING
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for sessionals
: 25
Max marks for orals
: 50
Duration of paper : 3 hours
Total no. of modules : 4
No. of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one question from each module with two compulsory questions from any one module. )
Words: Regular Expressions and Automata, Morphology
and Finite State transducers, Computational Phonology and Text to speech,
Probabilistic models of Pronunciation and Spelling, N-Grams, HMM’s and Speech
Recognition
Syntax: Word classes and Part of speech tagging, Context Free
Grammars(CFGs) for English, Parsing with CFGs, Features and Unification,
Lexicalized and Probabilistic parsing, Languages and Complexity
Semantics: Representing meaning, Semantic Analysis, Lexical
Semantics, Word Sense Disambiguation and Information Retrieval
1. Speech and Language Processing – Introduction to Natural Language Processing, Computational Linguistics and Speech Recognition – By Daniel Jurafsky, James H. Martin, Pearson Education
2. Natural Language Understanding – By Allien James, Benjamin, Cummin
1.
Language
as a Cognitive Process
3. Readings in Natural Language Processing – By Morgan Kauffman
4. A theory of syntactic Recognition for Natural Languages – By Marcus M., MIT Press
CE 8.3 Elective IV(d) GENETIC ALGORITHMS
Lectures
per week
: (3 + 1 +2)
Max
marks for theory paper
: 100
Max
marks for sessionals
: 25
Max
marks for Orals
: 50
Duration
of paper
: 3 hours
Total
no. of modules : 4
No.
of questions from each module
: 2
Total no. of questions to be answered : 5 (At least one question from each module with two compulsory questions from any one module.)
MODULE
1
GENETIC
ALGORITHMS: robustness
of traditional optimization and search techniques, goals of optimization, A
Simple Genetic Algorithm, Similarity Templates
MATHEMATICAL
FOUNDATIONS:
Fundamental theorem, Schema Processing, 2 armed and K armed bandit problem,
building block hypothesis, minimal deceptive, similarity templates as hyper
planes
COMPUTER
IMPLEMENTATION OF GENETIC ALGORITHMS: Data structure, reproduction, crossover and mutation, mapping objective
functions to fitness form, fitness scaling
MODULE
3
ADVANCED
OPERATORS AND TECHNIQUES IN GENETIC ALGORITHM SEARCH: Dominance, Diploidy and abeyance, inversion and other
re-ordering operators, Macro operators, niche and special speciation, multi
objective optimization, knowledge based techniques, Genetic Algorithms and
Parallel processors, Genetic Based machine learning, Classifier systems
INDUSTRIAL APPLICATION OF GENETIC ALGORITHMS: Datamining using genetic Algorithms, using genetic operators to distinguish chaotic behavior from Noise in a time serie
TEXT BOOKS:
1.David Goldberg, Genetic Algorithms in search,
optimization machine leaning , Addison Wesley International student exition,
1999.(chapter 1,2,3(pages 59 to 79 both inclusive), 5,6)
2.
Charles L Karr and L.Michael Freeman, Industrial applications of Genetic
Algorithms, CRC Press, Washington DC, 1998(chapter 9,13)
REFERENCES:
1. Industrial applications of genetic
algorithms—Charles l Karr and Michael Freeman—CRC .