Cse 5 8sem

1,888 views

Published on

Published in: Education
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
1,888
On SlideShare
0
From Embeds
0
Number of Embeds
2
Actions
Shares
0
Downloads
7
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Cse 5 8sem

  1. 1. ANNA UNIVERSITY COIMBATORE [Regulation 2008] B E – COMPUTER SCIENCE AND ENGINEERING Semester – VCode. Course Title L T P C NoTheory Discrete Mathematics 3 1 0 4 PC Hardware and Trouble Shooting 3 0 0 3 Software Engineering 3 0 0 3 Formal Languages and Automata Theory 3 1 0 4 Java Programming 3 0 0 3 Computer Networks 3 0 0 3Practical Software Engineering Lab 0 0 3 2 Java Programming Lab 0 0 3 2 Computer Networks Lab 0 0 3 2 Semester – VICode. Course Title L T P C NoTheory Theory of Computation 3 1 0 4 Open Source Software 3 0 0 3 Object Oriented System Design 3 0 0 3 Numerical Methods 3 1 0 4 Computer Graphics 3 0 0 3 Elective – I 3 0 0 3Practical Open Source Lab 0 0 3 2 Object Oriented Systems Lab 0 0 3 2 Computer Graphics Lab 0 0 3 2
  2. 2. Semester – VIICode. Course Title L T P C NoTheory Artificial Intelligence 3 1 0 4 Cryptography and Network Security 3 1 0 4 Internet Programming 3 0 0 3 Principles of Compiler Design 3 0 0 3 Elective – II 3 0 0 3 Elective - III 3 0 0 3Practical Compiler Design Lab 0 0 3 2 Internet Programming Lab 0 0 3 2 System Software Lab 1 0 3 3 Semester – VIIICode. Course Title L T P C NoTheory Open Source Tools and Components 3 0 0 3 Elective – IV 3 0 0 3 Elective – V 3 0 0 3Project 1 Project Work 0 0 6 12 Elective – ICode. Course Title L T P M No Embedded System 3 0 0 3 VLSI Design 3 0 0 3 Visual Programming 3 0 0 3 Optimization Techniques 3 0 0 3 Professional Ethics 3 0 0 3 Mobile Computing 3 0 0 3 Management Information Systems 3 0 0 3 Middleware Technology 3 0 0 3
  3. 3. Elective – II, IIICode. Course Title L T P C No Software Testing 3 0 0 3 Software Project Management 3 0 0 3 Grid Computing 3 0 0 3 Distributed Computing 3 0 0 3 Parallel Processing 3 0 0 3 Soft Computing 3 0 0 3 ADHOC and Sensor Networks 3 0 0 3 Data Warehousing and Data Mining 3 0 0 3 Client Server Computing 3 0 0 3 Real Time Systems 3 0 0 3 Total Quality Management 3 0 0 3 Elective – IV, VCode. Course Title L T P C No Digital Image Processing 3 0 0 3 Natural Language Processing 3 0 0 3 System Modeling And Simulation 3 0 0 3 Software Quality Management 3 0 0 3 High Speed Networks 3 0 0 3 C # And .Net Framework 3 0 0 3 Network Programming And Management 3 0 0 3 Enterprise Resource Planning 3 0 0 3 Information Security 3 0 0 3 Cloud computing 3 0 0 3 Real Time Systems 3 0 0 3 Semantic Web 3 0 0 3 Service Oriented Architecture 3 0 0 3 Disaster Management 3 0 0 3
  4. 4. DISCRETE MATHEMATICS L T P M C 3 1 0 100 4UNIT I PROPOSITIONAL CALCULUS 10 + 3Propositions – Logical connectives – Compound propositions – Conditional andbiconditional propositions – Truth tables – Tautologies and contradictions –Contrapositive – Logical equivalences and implications – DeMorgan’s Laws – Normalforms – Principal conjunctive and disjunctive normal forms – Rules of inference –Arguments - Validity of arguments.UNIT II PREDICATE CALCULUS 9+3Predicates – Statement function – Variables – Free and bound variables – Quantifiers –Universe of discourse – Logical equivalences and implications for quantified statements– Theory of inference – The rules of universal specification and generalization – Validityof arguments.UNIT III SET THEORY 10 + 3Basic concepts – Notations – Subset – Algebra of sets – The power set – Ordered pairsand Cartesian product – Relations on sets –Types of relations and their properties –Relational matrix and the graph of relation – Partitions – Equivalence relations – Partialordering – Poset – Hasse diagram – Lattices and their properties – Sublattices –Boolean algebra – Homomorphism.UNIT IV FUNCTIONS 7+3Definitions of functions – Classification of functions –Type of functions - Examples –Composition of functions – Inverse functions – Binary and n-ary operations –Characteristic function of a set – Hashing functions – Recursive functions – Permutationfunctions.UNIT V GROUPS 9+3Algebraic systems – Definitions – Examples – Properties – Semigroups – Monoids –Homomorphism – Sub semigroups and Submonoids - Cosets and Lagrange’s theorem– Normal subgroups – Normal algebraic system with two binary operations - Codes andgroup codes – Basic notions of error correction - Error recovery in group codes. TUTORIAL 15 TOTAL : 60Text Book: 1. Trembly J.P and Manohar R, “Discrete Mathematical Structures with Applications to Computer Science”, Tata McGraw–Hill Pub. Co. Ltd, New Delhi, 2003. 2. Ralph. P. Grimaldi, “Discrete and Combinatorial Mathematics: An Applied Introduction”, Fourth Edition, Pearson Education Asia, Delhi, 2002.
  5. 5. References: 1. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, “Discrete Mathematical Structures”, Fourth Indian reprint, Pearson Education Pvt Ltd., New Delhi, 2003. 2. Kenneth H.Rosen, “Discrete Mathematics and its Applications”, Sixth Edition, Tata McGraw – Hill Pub. Co. Ltd., New Delhi, 2006
  6. 6. PC HARDWARE AND TROUBLE SHOOTING L T P M C 3 0 0 100 3Unit – I Introduction 9Introduction - Computer Organization – Number Systems and Codes – Memory – ALU– CU – Instruction prefetch – Interrupts – I/O Techniques – Device Controllers - ErrorDetection Techniques – Microprocessor – Personal Computer Concepts – AdvancedSystem Concepts – Microcomputer Concepts – OS – Multitasking andMultiprogramming – Virtual Memory – Cache Memory – Modern PC and User.Unit – II Peripheral Devices 9Introduction – Keyboard – CRT Display Monitor – Printer – Magnetic Storage Devices –FDD – HDD – Special Types of Disk Drives – Mouse and Trackball – Modem – FaxModem – CD ROM Drive – Scanner – Digital Camera – DVD – Special Peripherals.Unit – III PC Hardware Overview 9Introduction – Hardware BIOS DOS Interaction – The PC family – PC hardware – Insidethe System Box – Motherboard Logic – Memory Space – Peripheral Interfaces andControllers – Keyboard Interface – CRT Display interface – FDC – HDC.Unit – IV Installation and Preventive Maintenance 9Introduction – system configuration – pre installation planning – Installation practice –routine checks – PC Assembling and integration – BIOS setup – Engineering versionsand compatibility – preventive maintenance – DOS – Virus – Data Recovery.Unit – V Troubleshooting 9Introduction – computer faults – Nature of faults – Types of faults – Diagnostic programsand tools – Microprocessor and Firmware – Programmable LSI’s – Bus Faults – FaultsElimination process – Systematic Troubleshooting – Symptoms observation andanalysis – fault diagnosis – fault rectification – Troubleshooting levels – FDD, HDD, CDROM Problems. Total : 45Text Book: 1. B. Govindarajalu, “IBM PC Clones Hardware, Troubleshooting and Maintenance”, 2/E, TMH, 2002. [References: 1. Peter Abel, Niyaz Nizamuddin, “IMB PC Assembly Language and Programming”, Pearson Education, 2007 2. Scott Mueller, “Repairing PCs”, PHI,1992
  7. 7. SOFTWARE ENGINEERING L T P M C 3 0 0 100 3UNIT I Introduction to Software Engineering 9 Introduction to Software Engineering - A systems Approach- An Engineering Approach-Members of the Development Team- How Has Software Engineering changed?-Information Systems Example- Real- Time ExampleModeling the process and Life cycleThe meaning of process –Software process Models- Tools and Techniques for ProcessModeling- Practical process modeling- Information system Example- Real- TimeExampleUnit II 9Planning and Managing the projectTracking progress-project personnel-Effort Estimation-Risk Management-The projectPlan-Process Models and Project Management-Information System Example- RealTime ExampleCapturing the RequirementsThe Requirements Process- Requirements Elicitation-Types of Requirements-Characteristic of Requirements- Modeling Notations- Requirements and SpecificationLanguages-Prototyping Requirements-requirements Documentation-Validation andVerification- Measuring Requirements –choosing a specification Technique.Unit III 9Designing the SystemIntroduction to Design- decomposition and Modularity-Architectural styles andStrategies-Issues in Design Creation-Characteristics of Good Design-Techniques ofImproving Design-Design Evaluation and Validation-Documenting the Design-Information system Example-Real-Time ExampleConsidering objectsWhat is OO-the OO Development process –use cases- Representing OO:An Exampleusing UML-OO System Desing-OO Program Desingn-OO Measurement-Informationsystems Example-Real-Time ExampleUnit IV 9Writing the programsProgramming standards and procedures-Programming Guidelines-Documentation-TheProgramming process-Information systems Example-Real-Time ExampleTesting the programsSoftware faults and failures-Testing Issues-unit Testing Integration Testing-TestingObject-Oriented Systems-Test Planning-Automated Testing Tools-When to stopTesting-Information’s Systems Example-Real-Time Example
  8. 8. Unit V 9Testing the SystemsPrinciples of system testing -function testing-performance Testing-Reliability, Availabilityand Maintainability-Acceptance Testing-Installation Testing-Automated system Testing-Test Documentation-Testing safety-Critical systems-Information systems Example.Maintaining the systemThe changing system-The nature of maintenance-Maintenance Problems-MeasuringMaintenance characteristics-Maintenance Techniques and Tools-Software Rejuvention-Information Systems Example-Real-Time Example. Total : 45Text Book: 1. Software Engineering Theory and Practice, Shari Lwarence Pfleeger, Joanne M.Atlee, Third Edition, Pearson Education, 2006 2. Object-Oriented Software Engineering Using UML, Patterns, and Java,Bernd Bruegge,Allen H.Dutoit, Second Editon, Pearson Edition, 2006 3. Roger S. Pressman, Software Engineering- A Practitioners Approach, McGraw-Hill International Edition, Seventh Edition, 2009
  9. 9. FORMAL LANGUAGES AND AUTOMATA THEORY L T P M C 3 1 0 100 4UNIT I 9Mathematical preliminaries and notations – Central concepts of automata theory – Finiteautomata - Deterministic Finite Automata - Nondeterministic Finite Automata –Equivalence of DFA and NFA – Finite Automata with Epsilon transitions - Application ofFA.UNIT II 9Regular languages: Regular Expressions – Finite Automata and Regular Expressions –Applications of Regular Expressions - Regular Grammars.UNIT III 9Properties of regular languages: Pumping lemma for regular languages – Closureproperties of regular languages – Decision properties of Regular languages -Equivalence and Minimization of Finite Automata.UNIT IV 9Context Free languages: Context Free Grammars – Parse Trees - Ambiguity inGrammars and languages – Applications of Context Free Grammars - Pushdownautomata (PDA) – Languages of a PDA - Equivalence of PDA’s and CFG’sUNIT V 9Properties of Context Free Languages: Normal Forms(CNF,GNF) for Context FreeGrammars - Pumping lemma for CFL’s - Closure properties of CFL – Decisionproperties of CFL’s. Total : 45Text Book: 1. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, “Introduction to Automata Theory, Languages and Computation”, 3/E, Pearson Education, 2009. 2. Peter Linz, “An Introduction to formal Languages and Automata”, 4/ E, Jones & Bartlett Pub, 2006.References: 1. Kamala Krithivasan, Rama R, “Introduction to Formal Languages, Automata Theory and Computation”, Pearson, 2009 2. Dr. B. N. Srinivasa Murthy, “Formal Languages and Automata Theory”, Sanguine Publishers, 2006.
  10. 10. JAVA PROGRAMMING L T P M C 3 0 0 100 3UNIT I 8A look at procedure oriented programming – Object oriented programming paradigm –Basic concepts of object oriented programming – Benefits of OOP –What is java? -Simple java program- Java vs. C++-Tokens – Keywords – Identifiers and constants –Data types – Type Conversions and Casting - Arrays-Operators - Control statements injava. Class fundamentals – Declaring Objects- Assigning Object Reference Variables –introducing methods- constructors – this keyword- garbage Collection – finalize ()method – overloading methods- objects as parameters- returning objects- accesscontrol – static- final keyword- Nested classes – Inner classes- classes with commandline argumentsUNIT II 8Basics- Super keyword- Multilevel Hierarchy- Invoking Constructors- Method overridingAbstract Classes – Using Final with Inheritance- Packages- Access Protection –Importing a Packages- Interfaces-Special String Operations – Character Extraction –String Comparison – Modifying a String –String Buffer.UNIT III 9Exception Types – Uncaught Exceptions – Using Try Catch – Multiple Catch – NestedTry – throw- throws- finally – Built in Exceptions- Using Exceptions- Thread Model –Character Streams- Stream I/O- Serialization- FilesUNIT IV 10Applet Architecture – Skeleton- Simple Applet Display Methods- HTML APPLET tag –Passing Parameters to the Applet- AudioClip and AppletStub Interface - DelegationEvent Model – Event Classes. Collection Interfaces – Collection Classes – UsingIterator – Maps- Comparators- Legacy Classes and InterfacesUNIT V 10String Tokenizer – BitSet – Calendar – Gregorian – TimeZone – Locale – Random-Currency- Case studies – Real time application development- Debugging theapplication – Testing the application. TOTAL = 45Text Book: 1. D.Norton and H. Schildt, “Java 2 the complete Reference Fifth edition”, TMH, 2002 (Re print 2009)
  11. 11. References: 1. By Kathy Sierra, Bert Bates, “Head First Java”, Second Edition, OReilly Media, 2005 2. M.Deitel and Deitel, “Java How To Program” 7/e, Prentice Hall Publications. 3. Paul Deitel , Harvey M Deitel, Java for Programmers, Pearson, 2010. 4. Elliote Rusty Harold, “Java Network Programming” Third Edition, O’Reilly Publishers. 5. “Java Cook Book”, Second Edition O’Reily Media 2002.
  12. 12. COMPUTER NETWORKS L T P M C 3 0 0 100 3Unit I 8Uses of Computer Networks, Components, and Direction of Data flow, NetworksComponents and Categories, types of Connections, Topologies, and Reference models:OSI and TCP/IP. Multiple Access: Random Access, Controlled Access. LAN: TokenRing, FDDI, Ethernet- Fast Ethernet, Gigabit Ethernet, Wireless LANs: IEEE 802.11a/b/g/nUnit II 8Data Link Layer: Error Detection and Correction (Parity – LRC – CRC – Hammingcode), Flow Control and Error control protocols (stop and wait – go back-N ARQ –selective repeat ARQ- sliding window), HDLC, Bridges: Spanning tree .Unit III 9Network Layer: IP addressing methods – Subnetting, Routing Algorithms: Shortest pathAlgorithm, Flooding, Flow based routing, Distance vector routing, Link state routing,Hierarchical routing.Unit IV 10Transport Layer: Duties of transport layer, Multiplexing and Demultiplexing, Sockets,UDP, TCP. Congestion Control Techniques: Leaky bucket algorithm, Token bucketalgorithm. Congestion prevention Policies: Traffic shaping, Choke packets, LoadShedding, Jitter Control. Application Layer: DNS, SMTP, FTP, HTTP.Unit V 10Introduction: Storage Area Network, Peer to Peer network, Overlay network, Wirelessnetwork: Adhoc, Sensor network, optical Network. Total: 45Text Book: 1. Behrouz A. Forouzan, “Data Communications and Networks”, 4/E, Tata McGraw Hill Publication, 2006. 2.References: 1. William Stallings ,”Data & Computer Communications”, Sixth Edition, Pearson Education Asia, 2002. 2. Andrew. S. Tanenbaum, “Computer Networks”, Forth edition, Pearson Education, 2002. 3. Larry L. Peterson and Bruce S. Davie ,” Computer Networks: A systems approach” , Third Edition, Morgan Kaufmann Publishers, 2003.
  13. 13. SOFTWARE ENGINEERING LAB L T P M C 0 0 3 100 2Solving Simple problems using CASE tools for Planning, cost estimation, Modeling therequirements and configuration management 1. Payroll system (pay slip generation, detection and pay master report generation) 2. On line shopping ( Web based) 3. Banking system (with debit and credit ledger report creation) 4. Text editor 5. Online voting system 6. Library automation system (Flash message generation of new arrivals for all the users via sms / mail alerts) JAVA PROGRAMMING LAB L T P M C 0 0 3 100 2Solving Simple problems using, 1. Abstract classes 2. Inheritance 3. Interfaces 4. Event handling using applets 5. Threads(single and multiple) 6. Swings 7. File handling and I/O handling 8. Database applications (JDBC) COMPUTER NETWORKS LAB L T P M C 0 0 3 100 2Implementing the following programs 1. Network topology configuration with hubs/ switches 2. Socket programming 3. Data grams 4. TCP 5. SMTP 6. FTP 7. Implementation of any two congestion control algorithms 8. Study of various IP Address classes practically(IPv4 , IPv6 dual stack configuration)
  14. 14. THEORY OF COMPUTATION L T P M C 3 1 0 100 4UNIT I 9Church-Turing thesis: Turing machines – Variants of Turing Machines – Hilbert’sproblems. Decidability: Decidable languages – Halting problem.UNIT II 9Reducibility: Undecidable problems from Language theory – A simple Undecidableproblem – Mapping Reducibility. Advanced topics in Computability Theory: TheRecursion Theorem – Decidability of logical theories – Turing Reducibility.UNIT III 9Time Complexity: Measuring Complexity – The Class P – The class NP – NP-completeness – Additional NP-complete Problems.UNIT IV 9Space Complexity: Savitch’s Theorem – The Class PSPACE – PSPACE-completeness– The classes L and NL – NL-completeness – NL equals coNL. Intractability: HierarchyTheorems – Relativization – Circuit Complexity.UNIT V 9Advanced topics in complexity theory: Approximation Algorithms – ProbabilisticAlgorithms – Alternation – Interactive Proof Systems – Parallel Computation –Cryptography TUTORIAL 15 TOTAL : 60TEXT BOOKS: 1. Michael Sipser, Introduction to the Theory of Computation, Thomson Brook/cole, 1997.(2006) 2. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Introduction to Automata Theory, Languages and Computation, 3/E, Pearson Education, 2009.REFERENCES 1. Peter Linz, An Introduction to formal Languages and Automata, 4/ E, Jones & Bartlett Pub, 2006. 2 Kamala Krithivasan, Rama R, Introduction to Formal Languages, Automata Theory and Computation, Pearson, 2009 3. Dr. B. N. Srinivasa Murthy, Formal Languages and Automata Theory, Sanguine Publishers, 2006.
  15. 15. OPEN SOURCE SOFTWARE L T P M C 3 0 0 100 3UNIT I INTRODUCTION 9Introduction to Open sources – Need of Open Sources – Advantages of Open Sources–Application of Open Sources. Open source operating systems: LINUX: Introduction –General Overview – Kernel Mode and user mode – Process – Advanced Concepts –Scheduling – Personalities – Cloning – Signals – Development with Linux. .UNIT II OPEN SOURCE DATABASE 9MySQL: Introduction – Setting up account – Starting, terminating and writing yourownSQL programs – Record selection Technology – Working with strings – Date andTime– Sorting Query Results – Generating Summary – Working with metadata –Usingsequences – MySQL and Web.UNIT III OPEN SOURCE PROGRAMMING LANGUAGES 9PHP: Introduction – Programming in web environment – variables – constants –data;types – operators – Statements – Functions – Arrays – OOP – String Manipulationand regular expression – File handling and data storage – PHP and SQL database –PHP and LDAP – PHP Connectivity – Sending and receiving E-mails – Debugging anderror handling – Security – Templates.UNIT IV PYTHON 9Syntax and Style – Python Objects – Numbers – Sequences – Strings – Lists andTuples – Dictionaries – Conditionals and Loops – Files – Input and Output – Errors andExceptions – Functions – Modules – Classes and OOP – Execution Environment.UNIT V PERL 9Perl backgrounder – Perl overview – Perl parsing rules – Variables and Data –Statements and Control structures – Subroutines, Packages, and Modules- Workingwith Files –Data Manipulation. Total: 45Text Books: 1. Remy Card, Eric Dumas and Frank Mevel, “The Linux Kernel Book”, Wiley Publications, 2003 2. Steve Suchring, “MySQL Bible”, John Wiley, 2002References: 1. Rasmus Lerdorf and Levin Tatroe, “Programming PHP”, O’Reilly, 2002 2. Wesley J. Chun, “Core Phython Programming”, Prentice Hall, 2001 3. Martin C. Brown, “Perl: The Complete Reference”, 2nd Edition, Tata McGraw-Hill Publishing Company Limited, Indian Reprint 2009. 4. Steven Holzner, “PHP: The Complete Reference”, 2nd Edition, Tata McGraw-Hill Publishing Company Limited, Indian Reprint 2009. 5. Vikram Vaswani, “MYSQL: The Complete Reference”, 2nd Edition, Tata McGraw- Hill Publishing Company Limited, Indian Reprint 2009.
  16. 16. OBJECT ORIENTED SYSTEM DESIGN L T P M C 3 0 0 100 3Unit I 9IntroductionIntroduction to Object Orientation - Development - Themes-Evidence for Usefulness ofOO Development-OO ModelingModeling ConceptsModeling-Abstraction-The Three Models-Class Modeling-Object and Class Concepts-Link and Association Concepts-Generalization and Inheritance-A Sample Class Model-Navigation of Class Models-Practical TipsUnit II 9Advanced Class ModelingAdvanced Object and Class Concepts-Association Ends-N-ary Assocations-Aggregation-Abstract Classes-Multiple Inheritance-metadata-Reification-Constraints-Derived Data-Packages- Practical TipsState ModelingEvents-states-Transitions and Conditions-State diagrams-state diagrams behavior-practical tips-Advanced state Modeling-Nested State Diagrams-Nested States-SignalGeneralization-concurrency- A sample state Model- Relation of class and state modelsInteraction ModelingUse case Models-Sequence Models- Activity Models- Use Case Relationships-Procedural Sequence Models- special constructs for Activity Models-Class Model-StateModel-Interaction ModelUnit III 9AnalysisProcess Overview-Development stages-Development Lifecycle-System conception-devising a system concept-Elaborating a concept-preparing a problem statement-Domain analysis-overview of analysis-Domain class model-Domain state model-DomainInteraction Model-Iterating the analysis-Application Interaction Model-Application ClassModel-Application state Model-Adding operationsUnit IV 9DesignOverview of system Design-Estimating performance- Making a reuse plan-Breaking asystem into sub systems-identifying concurrency-Allocation of subsystems-Management of Data Storage-Handling Global Resources-Choosing a software controlstrategy-handling boundary conditions-setting Trade-off Priorities-common architecturalstyles-Architecture of the ATM System
  17. 17. Class DesignOverview of class Design-Bridging the gap-Realizing use cases-Designing Alogrithms-Recursing Downward-Refactoring-Design optimization-Reification of behavior-adjustment of inheritance-organizing a class design-ATM ExampleUnit V 9ImplementationImplementation Modeling-overview of implementation-Fine-tuning classes-fine tuninggeneralizations-realizing associations-oo languages-introduction abbreviated ATMModel-implementing structure-implementing functionality-practical tipsDatabaseIntroduction-Abbreviated ATM Model-Implementing structure-Implementing structure -Implementing structure for the ATM Example-Implementing Functionality-Objectoriented DatabasesProgramming styleObject-oriented style-reusability-extensibility – robustness - programming in large Total : 45TEXT BOOKS 1. Object-Oriented Modeling and Design with UML, Michael Blaha, James Rumbaugh, Second Edition, Pearson Education,2004. 2. Object-Oriented Software Engineering using UML, Pattens, and Java second Edition Bernd Bruegge, Robert S 3. Object-Oriented Software Engineering using UML, Pattens, and Java second Edition Bernd Bruegge, Allen H.Dutoit(200x?)References 1. Object Oriented System Development, Ali Bahrami, McGraw-Hill International Edition,1999 2. Object Oriented analysis and Design, Booch G, Addison-Wesley Publishing company,1994
  18. 18. NUMERICAL METHODS L T P M C 3 1 0 100 4UNIT I SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS 9+3Linear interpolation methods (method of false position) – Newton’s method – Statementof Fixed Point Theorem – Fixed point iteration: x=g(x) method – Solution of linearsystem by Gaussian elimination and Gauss-Jordon methods- Iterative methods: GaussJacobi and Gauss-Seidel methods- Inverse of a matrix by Gauss Jordon method –Eigenvalue of a matrix by power method.UNIT II INTERPOLATION AND APPROXIMATION 9+ 3Lagrangian Polynomials – Divided differences – Interpolating with a cubic spline –Newton’s forward and backward difference formulas.UNIT III NUMERICAL DIFFERENTIATION AND INTEGRATION 9+ 3Derivatives from difference tables – Divided differences and finite differences –Numerical integration by trapezoidal and Simpson’s 1/3 and 3/8 rules – Romberg’smethod – Two and Three point Gaussian quadrature formulas – Double integrals usingtrapezoidal and Simpson’s rules.UNIT IV INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIALEQUATIONS 9+ 3Single step methods: Taylor series method – Euler and modified Euler methods –Fourth order Runge – Kutta method for solving first and second order equations –Multistep methods: Milne’s and Adam’s predictor and corrector methods.UNIT V BOUNDARY VALUE PROBLEMS IN ORDINARY AND PARTIAL DIFFERENTIAL EQUATIONS 9+ 3Finite difference solution of second order ordinary differential equation – Finitedifference solution of one dimensional heat equation by explicit and implicit methods –One dimensional wave equation. TUTORIAL 15 TOTAL : 60TEXT BOOKS 1. Gerald, C.F, and Wheatley, P.O, “Applied Numerical Analysis”, Sixth Edition, Pearson Education Asia, New Delhi, 2002. 2. Balagurusamy, E., “Numerical Methods”, Tata McGraw-Hill Pub.Co.Ltd, New Delhi, 1999.REFERENCES 1. Kandasamy, P., Thilagavathy, K. and Gunavathy, K., “Numerical Methods”, S.Chand Co. Ltd., New Delhi, 2003. 2. Burden, R.L and Faires, T.D., “Numerical Analysis”, Seventh Edition, Thomson Asia Pvt. Ltd., Singapore, 2002.
  19. 19. COMPUTER GRAPHICS L T P M C 3 0 0 100 3UNIT- I Introduction to Computer Graphics & Scan conversion 10Overview of Computer Graphics, Computer Graphics Application and Software, DisplayTechnologies, Storage Tube Graphics Displays, Calligraphic Refresh GraphicsDisplays, Raster Refresh (Raster-Scan) Graphics Displays, Cathode Ray Tube Basics,Color CRT Raster Scan Basics, Video Basics, The Video Controller, Random-ScanDisplay Processor, LCD displays.Scan Converting Lines, Mid-point criteria, Problems of Aliasing, end-point ordering andclipping lines, Scan Converting Circles, Scan Converting Ellipses, Filling Polygons,edge data structure, Clipping Lines algorithms– Cyrus-Beck, Cohen-Sutherland andLiang-Barsky, Clipping Polygons, problem with multiple components.UNIT-II Two-Dimensional Transformations 8Transformations and Matrices, Transformation Conventions, 2D Transformations,Homogeneous Coordinates and Matrix Representation of 2D Transformations,Translations and Homogeneous Coordinates, Rotation, Reflection, Scaling, CombinedTransformation, Transformation of Points, Transformation of The Unit Square, SolidBody Transformations, Rotation About an Arbitrary Point, Reflection through anArbitrary Line, A Geometric Interpretation of Homogeneous Coordinates, The Window-to-Viewport Transformations.UNIT-III Three-Dimensional Transformations 9Introduction, Three-Dimensional Scaling, Three-Dimensional Shearing, Three-Dimensional Rotation, Three-Dimensional Reflection, Three-Dimensional Translation,Multiple Transformation, Rotation about an Arbitrary Axis in Space, Reflection throughan Arbitrary Plane, Matrix Representation of 3D Transformations, Composition of 3DTransformations, Affine and Perspective Geometry, Perspective Transformations,Techniques for Generating Perspective Views, Vanishing Points, the PerspectiveGeometry and camera models, Orthographic Projections, Axonometric Projections,Oblique Projections, View volumes for projections.UNIT-IV Solid Modeling & Visible-Surface Determination 9Representing Solids, Regularized Boolean Set Operations, Primitive Instancing, SweepRepresentations, Spatial-Partitioning Representations - Octree representation, B-Reps,Constructive Solid Geometry, Comparison of Representations.Techniques for efficient Visible-Surface Algorithms, Categories of algorithms, Back faceremoval, The z-Buffer Algorithm, Scan-line method, Painter’s algorithms (depth sorting),Area sub-division method, BSP trees, Visible-Surface Ray Tracing, comparison of themethods.
  20. 20. UNIT-V llumination and Shading & Graphics Programming using OPENGL 9Illumination and Shading Models for Polygons, Reflectance properties of surfaces,Ambient, Specular and Diffuse reflections, Atmospheric attenutation, Phong’s model,Gouraud shading, some examples.Why OpenGL, Features in OpenGL, OpenGL operations, Abstractions in OpenGL – GL,GLU & GLUT, 3D viewing pipeline, viewing matrix specifications, a few examples anddemos of OpenGL programs. TOTAL :45Text books : 1. J. D. Foley, A. Van Dam, S. K. Feiner and J. F. Hughes, Computer Graphics - Principles and Practice, Second Edition in C, Pearson Education, 2003. 2. D. Hearn and M. Pauline Baker, Computer Graphics (C Version), Pearson Education, 2nd Edition, 2004.References: 1. D. F. Rogers and J. A. Adams, Mathematical Elements for Computer Graphics, 2nd Edition, McGraw-Hill International Edition, 1990. 2. F. S. Hill Jr., Computer Graphics using OpenGL, Pearson Education, 2003.
  21. 21. OPEN SOURCE LAB LTPC 0 0 3 21. Installation in different modes (user mode, GUI, Single user, Server )2. MySQL installation3. Apache installation4. PHP with Database connectivity5. PHYTON programming6. Perl script and CGI7. Network simulator (NS2) installation and simple tcl scripts OBJECT ORIENTED SYSTEM DESIGN LAB LTPC 0 0 3 2Solving Simple problems using CASE tools for design, testing with structure analysisand design method and object oriented analysis and design methodi) SRS DOCUMENT (IEEE Standard)ii) Design documentiii) Implementationiv) Test case generation and test document preparation1. Payroll system2. Online shopping3. Online voting system4. Banking system COMPUTER GRAPHICS LAB LTPC 0 0 3 21. Implementation of Bresenham’s Algorithm Line Circle Ellipse2. 2D and 3D transformation Translation Rotation Scaling Reflection Shearing of objects3. Cohen Sutherland 2D clipping and windowing
  22. 22. ARTIFICIAL INTELLIGENCE L T P M C 3 1 0 100 4UNIT I Introduction and Problem Solving I 9Artificial Intelligence: Definition-Turing Test-Relation with other Disciplines-History of AI-Applications - Agent: Intelligent Agent-Rational Agent - Nature of Environments-Structure of Agent.-Problem Solving Agent - Problems: Toy Problems and Real-worldProblems-Uninformed Search Strategies: BFS, DFS, DLS, IDS, Bidirectional Search -comparison of uninformed search strategies.UNIT II Problem Solving II: 9Informed Search Strategies-Greedy best-first search-A* search-Heuristic functions-Local search Algorithms and Optimization problems - Online Search Agent-ConstraintSatisfaction Problems-Backtracking Search for CSP’s –Local Search for ConstraintSatisfaction Problems-Structure of Problems -Adversarial Search-Optimal Decision inGames-Alpha-Beta Pruning-Imperfect Real Time Decisions-Games that Include anElement of Chance.UNIT III Knowledge Representation 9 First-Order Logic-Syntax and Semantics of First-Order-Logic-Using First-Order-Logic-Knowledge Engineering in First-Order-Logic.- Inference in First-Order-Logic- Inferencerules-Unification and Lifting-Forward Chaining-Backward Chaining-Resolution.UNIT IV Learning 9Learning from Observations- Forms of Learning-Learning Decision –Ensemble Learning- A Logical Formulation of Learning-Knowledge in Learning-Explanation BasedLearning-Learning using Relevance Information-Inductive Logic Programming.UNIT V Applications 9Communication –Communication as action -A formal grammar for a fragment of English– Syntactic Analysis – Augmented Grammars – Semantic Interpretation – Ambiguityand Disambiguation – Discourse Understanding – Grammar Induction.Perception –Image Formation –Early Image Processing Operations – Extracting ThreeDimensional Information – Object Recognition – Using Vision for Manipulation andNavigation. Total:45TEXT BOOKS: 1. Stuart Russell, Peter Norvig, “Artificial Intelligence – A Modern Approach”, 3rd Edition, Pearson Education / Prentice Hall of India 2010(yet to be published). 2. Nils J. Nilsson, “Artificial Intelligence: A new Synthesis”, Harcourt Asia Pvt. Ltd, 2003.
  23. 23. REFERENCES: 1. Elaine Rich and Kevin Knight, “Artificial Intelligence”, 2nd Edition, Tata McGraw- Hill, 2003. 2. Patrick Henry Winston, “Artificial Intelligence”, Pearson Education / PHI, 2004.
  24. 24. CRYPTOGRAPHY AND NETWORK SECURITY L T P M C 3 1 0 100 4UNIT-I Introduction 8Introduction -Motivating examples-Basic concepts: confidentiality, integrity, availability,security policies, security mechanisms, assurance- Basic cryptography Historicalbackground Transposition/Substitution, Caesar Cipher Introduction to Symmetric cryptoprimitives, Asymmetric crypto primitives.Unit-II Symmetric Ciphers 8Traditional Symmetric ciphers- Substitution ciphers-Transposition ciphers-stream andblock ciphers. Modern Symmetric key ciphers-Modern block and Stream ciphers-DataEncryption Standard-DES analysis-Structure-Multiple DES- Advanced data EncryptionStandard-Transformation-Key Expansion-Analysis. Modern Block Ciphers-StreamCiphers-other issues.UNIT-III Asymmetric Ciphers 8Mathematics of cryptography-Primality testing-factorization –Chinese remaindertheorem-Quadratic congruence- exponentiation and logarithm-RSA Cryptosystem-Rabin Cryptosystem-Elgamal Cryptosystem-Elliptic cryptosystem.UNIT-IV Message integrity and Message authentication 12Message integrity and Message authentication –Cryptographic hash functions-Digitalsignature- Key management – private and public -distribution –Kerberos- PGP-Securityat application layer-Transport layer-Network layer-IKE-ISAKMPUNIT-V Advanced Network Security 9Wireless Application protocol (WAP) security- Security in GSM- Security in 3G- Securityin java- .Net-Operating Systems- Network Security- firewalls and VPN- Case studies –Single Sign On (SSO)-Denial of service (DOS)-Cross site scripting vulnerability CSSV. Total : 45TEXT BOOKS: 1. Behrouz A.Forouzan “Cryptography and Network Secuity”, The McGraw-Hill Companies, 2007. 2. Cryptography and Network security, Atul Kahate, Tata McGraw-Hill Pub company Ltd., 2 edition, New Delhi 2009.REFERENCES 1. William Stallings, “Cryptography and Network security”, Pearson Education, New Delhi 2007 2. Network Security: The Complete Reference by Roberta Bragg, Mark Phodes- Ousley, Keith Strassberg Tata McGraw-Hill, 2008. 3. Charlie Kaufman, Radia Perlman, and Mike Speciner, “Network Security: PRIVATE Communication in a PUBLIC World “, Prentice Hall. 2007
  25. 25. INTERNET PROGRAMMING L T P M C 3 0 0 100 3UNIT I XHTML 8Introduction to XHTML: Headers -Linking - Images–Unordered Lists -Nested andOrdered Lists forms -Tables–Form- frames– Cascading style sheets .UNIT II DHTML and Java 10Object model and collections -event model - filters and transition. Java Basics: Datatypes, variables, Array, Operator, Control statements, I/O operation, Exception handling,file handling.UNIT III Data Binding, ActiveX and Java Script 8Data binding with tabular data control – Multimedia -ActiveX Control. Introduction toJavaScript: control structures - functions - arrays - objectsUNIT IV Java Servlet 10Servlet: Introduction , Architecture, Lifecycle -Working with servlet- Handling HTTP getRequests - Handling HTTP get Requests Containing Data - Handling HTTP postRequests - Redirecting Requests to Other Resources - Multi-Tier Application (JDBC)UNIT V Java Network Programming 9Looking up Internet Address - Socket programming – client/server programs – E-mailclient – SMTP - POP3 programs – web page retrieval – protocol handlers – contenthandlers. Security Issues in Internet programming TOTAL: 45TEXT BOOKS: 1. Deitel Deitel Goldberg, “Internet and World Wide Web – How to program”, Third Edition, Prentice hall Publishers,2004. 2. Elliotte Rusty Harold, “Java Network Programming”, Third Edition , O’Reilly Publishers.REFERENCE BOOKS 1. Thomno A. Powell, “The Complete Reference HTML and XHTML”, fourth edition, Tata McGraw Hill, 2003. 2. Herbert Schildt, “The Complete Reference – Java2”, Tata McGraw-Hill, Fifth edition, 2002 3. Black Book, “ Java Server Programming “, Dreamtech Press, 2008 4. Ivan Bayross,Vaishali Shah,Sharanam Shah,Cynthia Bayross ,”Java Server Programming for Professionals: Covers Java EE 5”, Second Edition, Shroff Publishers
  26. 26. PRINCIPLES OF COMPILER DESIGNUNIT I INTRODUCTION TO COMPILING 9Compilers - Analysis of the source program - Phases of a compiler - Cousins of theCompiler - Grouping of Phases - Compiler construction toolsUNIT II LEXICAL ANALYSIS 9Role of Lexical Analyzer - Input Buffering - Specification and recognition of Tokens -Finite automata – Regular expression to finite automata – Optimization of DFA-basedpattern matchers – Tool for generating lexical analyzer.UNIT III SYNTAX ANALYSIS 9Role of the parser -Writing Grammars -Context-Free Grammars - Top Down parsing -Recursive Descent Parsing - Predictive Parsing - Bottom-up parsing - Shift ReduceParsing - Operator Precedence Parsing - LR Parsers - SLR Parser - Canonical LRParser - LALR Parser-Tool for parser.UNIT IV INTERMEDIATE CODE GENERATION 9Intermediate languages - Declarations - Assignment Statements - Boolean Expressions– Flow control statements - Back patching - Procedure calls.UNIT V CODE GENERATION AND CODE OPTIMIZATION 9Issues in the design of code generator - The target machine - Basic Blocks and FlowGraphs - A simple Code generator - DAG representation of Basic Blocks – Introductionto optimization - Principal Sources of Optimization - Optimization of basic Blocks -Peephole Optimization.Case Study : One Pass Compiler. TOTAL: 45TEXT BOOKS: 1. Alfred Aho, Ravi Sethi, Jeffrey D Ullman, “Compilers: Principles, Techniques and Tools”, Pearson Education Asia, 2004. 2. Allen I. Holub “Compiler Design in C”, Prentice Hall of India, 2003.REFERENCES 1. C. N. Fischer and R. J. LeBlanc, “Crafting a compiler with C”, Benjamin Cummings, 2003. 2. J.P. Bennet, “Introduction to Compiler Techniques”, Second Edition, Tata McGraw-Hill, 2003. 3. Henk Alblas and Albert Nymeyer, “Practice and Principles of Compiler Building with C”, PHI, 2001. 4. Kenneth C. Louden, “Compiler Construction: Principles and Practice”, Thompson Learning, 2003
  27. 27. COMPILER DESIGN LAB LTPC 0032 1. Construction of NFA 2. Construction of minimized DFA from a given regular expression 3. exercise on lexical analysis using LEX 4. implementation of symbol table 5. construction of operator precedence parse table 6. Exercise on syntax analysis using YACC 7. Implementation of shift reduced parsing algorithms 8. construction of LR parsing table 9. Generation of code for a given intermediate code 10. implementation of code optimization techniques SYSTEM SOFTWARE LAB LTPC 1033(Using C or C++) 1. Implement a symbol table with functions to create, insert, modify, search, and display. 2. Implement pass one of a two pass assembler. 3. Implement pass two of a two pass assembler. 4. Implement a single pass assembler. 5. Implement a macro processor. 6. Implement an absolute loader. 7. Implement a relocating loader. 8. Implement pass one of a direct-linking loader. 9. Implement pass two of a direct-linking loader. 10. Implement a simple text editor with features like insertion / deletion of a character, word, sentence.(For loader exercises, output the snap shot of the main memory as it would be, after theloading has taken place) INTERNET PROGRAMMING LAB LTPC 0032 1. DHMTL based web design for tourism information system for your local city 2. USING Java script develop an online portal for distributed library information system 3. Using servlet design a system for employee information system (JDBC- use do get and do post method) 4. Create an instant messenger (with file transfer and message transfer)
  28. 28. OPEN SOURCE TOOLS AND COMPONENTS L T P M C 3 0 0 100 3UNIT I 10Overview of Free/Open Source Software-- Definition of FOSS & GNU, History ofGNU/Linux and the Free Software Movement , Advantages of Free Software andGNU/Linux, FOSS usage , trends and potential—global and Indian. GNU/Linux OSinstallation-- detect hardware, configure disk partitions & file systems and install aGNU/Linux distribution ; Basic shell commands - logging in, listing files, editing files,copying/moving files, viewing file contents, changing file modes and permissions,process management ; User and group management, file ownerships and permissions,PAM authentication ; Introduction to common system configuration files & log files;Configuring networking, basics of TCP/IP networking and routing, connecting to theInternet (through dialup, DSL, Ethernet, leased line).Unit II 10Configuring additional hardware - sound cards, displays & display cards, network cards,modems, USB drives, CD writers ; Understanding the OS boot up process; Performingevery day tasks using gnu/Linux -- accessing the Internet, playing music, editingdocuments and spreadsheets, sending and receiving email, copy files from disks andover the network, playing games, writing CDs ; X Window system configuration andutilities -- configure X windows, detect display devices ; Installing software – fromsource code as well as using binary packages. Setting up email servers-- using postfix(SMTP services), courier (IMAP & POP3 services), squirrel mail (web mail services)Setting up file services -- using samba ( file and authentication services for windowsnetworks), using NFS ( file services for gnu/Linux /Unix networks) ; Setting up proxyservices -- using squid ( http / ftp / https proxy services) ; Setting up printer services -using CUPS (print spooler), foomatic (printer database)Unit III 10Setting up a firewall - Using netfilter and ip tables; Using the GNU Compiler Collection –GNU compiler tools ; the C preprocessor (cpp), the C compiler (gcc) and the C++compiler (g++), assembler (gas) ; Understanding build systems -- constructing makefiles and using make, using autoconf and autogen to automatically generate make filestailored for different development environments ; Using source code versioning andmanagement tools -- using CVS to manage source code revisions, patch & diff.Unit IV 10Web Server: Apache Web server – Working with Web Server – Configuring and Usingapache web services MDA: Introduction to MDA – Genesis of MDA – Meta ObjectFacility – UML – UML Profiles – MDA Applications.Unit V 10Basics of the X Windows server architecture; Qt Programming; Gtk+ Programming,Programming GUI applications with localization support
  29. 29. REFERENCE BOOKS 1. Stephen J. Mellor, Marc Balces, “Executable UMS: A foundation for MDA”, Addison,2002. 2. N. B. Venkateshwarlu (Ed); Introduction to Linux: Installation and Programming,B S Publishers; 2005. 3. 2 Matt Welsh, Matthias Kalle Dalheimer, Terry Dawson, and Lar Kaufman, Running 4. Linux, Fourth Edition, OReilly Publishers, 2002. 5. 3 Carla Schroder, Linux Cookbook, First Edition, OReilly Cookbooks Series, 2004ON-LINE MATERIAL 1. Open Sources: Voices from the Open Source Revolution, First Edition, January 1999, ISBN: 1-56592-582-3. URL: http://www.oreilly.com/catalog/opensources/book/toc.html 2. The Linux Cookbook: Tips and Techniques for Everyday Use, First Edition, Michael Stutz, 2001. URL: http://dsl.org/cookbook/cookbook_toc.html 3. The Linux System Administrators Guide, Lars Wirzenius, Joanna Oja, Stephen Stafford, and Alex Weeks, December 2003. URL: http://www.tldp.org/guides.html 4. Using GCC, Richard Stallman et al. URL: http://www.gnu.org/doc/using.html 5. An Introduction to GCC, Brian Gough. URL: http://www.networktheory. co.uk/docs/gccintro/ 6. GNU Autoconf, Automake and Libtool, Gary V. Vaughan, Ben Elliston, Tom Tromey and Ian Lance Taylor. URL: http://sources.redhat.com/autobook/ 7. Open Source Development with CVS, Third Edition, Karl Fogel and Moshe Bar. URL: http://cvsbook.red-bean.com/ 8. Advanced Bash Scripting Guide, Mendel Cooper, June 2005. URL:http://www.tldp.org/guides.html GTK+/GNOME Application Development, Havoc Pennington. URL:http://developer.gnome.org/doc/GGAD
  30. 30. EMBEDDED SYSTEMS L T P M C 3 0 0 100 3UNIT I INTRODUCTION TO EMBEDDED SYSTEMS 9Definition and Classification – Overview of Processors and hardware units in anembedded system – Software embedded into the system – Exemplary EmbeddedSystems – Embedded Systems on a Chip (SoC) and the use of VLSI designed circuitsUNIT II DEVICES AND BUSES FOR DEVICES NETWORK 9I/O Devices - Device I/O Types and Examples – Synchronous - Iso-synchronous andAsynchronous Communications from Serial Devices - Examples of Internal Serial-Communication Devices - UART and HDLC - Parallel Port Devices - Sophisticatedinterfacing features in Devices/Ports- Timer and Counting Devices - ‘12C’, ‘USB’, ‘CAN’and advanced I/O Serial high speed buses- ISA, PCI, PCI-X, cPCI and advancedbuses.UNIT III PROGRAMMING CONCEPTS AND EMBEDDED PROGRAMMING IN C,C++ 9Programming in assembly language (ALP) vs. High Level Language - C ProgramElements, Macros and functions -Use of Pointers - NULL Pointers - Use of FunctionCalls – Multiple function calls in a Cyclic Order in the Main Function Pointers – FunctionQueues and Interrupt Service Routines Queues Pointers – Concepts of EMBEDDEDPROGRAMMING in C++ - Objected Oriented Programming – Embedded Programmingin C++, ‘C’ Program compilers – Cross compiler – Optimization of memory codes.UNIT IV REAL TIME OPERATING SYSTEMS – PART - 1 9Definitions of process, tasks and threads – Clear cut distinction between functions –ISRs and tasks by their characteristics – Operating System Services- Goals –Structures- Kernel - Process Management – Memory Management – DeviceManagement – File System Organisation and Implementation – I/O Subsystems –Interrupt Routines Handling in RTOS, REAL TIME OPERATING SYSTEMS : RTOSTask scheduling models - Handling of task scheduling and latency and deadlines asperformance metrics – Co-operative Round Robin Scheduling – Cyclic Scheduling withTime Slicing (Rate Monotonics Co-operative Scheduling) – Preemptive SchedulingModel strategy by a Scheduler – Critical Section Service by a Preemptive Scheduler –Fixed (Static) Real time scheduling of tasks - INTER PROCESS COMMUNICATIONAND SYNCHRONISATION – Shared data problem – Use of Semaphore(s) – PriorityInversion Problem and Deadlock Situations – Inter Process Communications usingSignals – Semaphore Flag or mutex as Resource key – Message Queues – Mailboxes– Pipes – Virtual (Logical) Sockets – Remote Procedure Calls (RPCs).UNIT V REAL TIME OPERATING SYSTEMS – PART - 2 9Study of Micro C/OS-II or Vx Works or Any other popular RTOS – RTOS System LevelFunctions – Task Service Functions – Time Delay Functions – Memory Allocation
  31. 31. Related Functions – Semaphore Related Functions – Mailbox Related Functions –Queue Related Functions – Case Studies of Programming with RTOS – UnderstandingCase Definition – Multiple Tasks and their functions – Creating a list of tasks –Functions and IPCs – Exemplary Coding Steps. TOTAL: 45TEXT BOOKS 1. Rajkamal, Embedded Systems Architecture, Programming and Design, TATA McGraw-Hill, First reprint Oct. 2003 2. Steve Heath, Embedded Systems Design, Second Edition-2003, Newnes,REFRENCE BOOKS: 1. David E.Simon, An Embedded Software Primer, Pearson Education Asia, First Indian Reprint 2000. 2. Wayne Wolf, Computers as Components; Principles of Embedded Computing System Design – Harcourt India, Morgan Kaufman Publishers, First Indian Reprint 2001 3. Frank Vahid and Tony Givargis, Embedded Systems Design – A unified Hardware / Software Introduction, John Wiley, 2002.
  32. 32. VLSI DESIGN L T P M C 3 0 0 100 3Unit I BASIC MOS TRANSISTOR 9Enhancement mode & Depletion mode – Fabrication (NMOS, PMOS, CMOS, BiCMOS)Technology – NMOS transistor current equation – second order effects – MOSTransistor Model.Unit II NMOS & CMOS INVERTER AND GATES 9NMOS & CMOS inverter – Determination of pull up / pull down ratios – stick diagram –lamda based rules – super buffers – BiCMOS & steering logic.Unit III SUB SYSTEM DESIGN & LAYOUT 9Structured design of combinational circuits – Dynamic CMOS & clocking – Tally circuits– (NAND-NAND, NOR-NOR and AOI logic) – EXOR structure – Multiplexer structures –Barrel shifter.Unit IV DESIGN OF COMBINATIONAL ELEMENTS & REGULAR ARRAYLOGIC 9NMOS PLA – Programmable Logic Devices - Finite State Machine PLA – Introductionto FPGA.Unit V VHDL PROGRAMMING 9RTL Design – combinational logic – Types – Operators – Packages – Sequential circuit– Sub programs – Test benches. (Examples: address, counters, flipflops, FSM,Multiplexers / Demltiplexers). Total = 45TEXT BOOKS: 1. D.A.Pucknell, K.Eshraghian, ‘Basic VLSI Design’, 3rd Edition, Prentice Hall of India, New Delhi, 2003. 2. Douglas Perry, ‘VHDL Programming By Example’, Tata McGraw Hill, 3rd Edition.REFERENCES 1. Eugene D.Fabricius, ‘Introduction to VLSI Design’, Tata McGraw Hill, 1990. 2. N.H.Weste, ‘Principles of CMOS VLSI Design’, Pearson Education, India, 2002. 3. Charles H.Roth, ‘Fundamentals of Logic Design’, Jaico Publishing House,1992. 4. Zainalatsedin Navabi, ‘VHDL Analysis and Modelling of Digital Systems’, 2nd Edition, Tata McGraw Hill, 1998.
  33. 33. VISUAL PROGRAMMING L T P M C 3 0 0 100 3UNIT I INTRODUCTION TO WINDOWS PROGRAMMING 9GUI Concepts – Overview of Windows programming – Creating the window - Displayingthe window - message Loop – windows procedure-WM_PAINT message -WM_DESTROY message – An Introduction to GDI -– device context – basic drawing –child window controlsUNIT II VISUAL BASIC PROGRAMMING 9IDE – First Visual Basic Program - Introduction to Forms –Intrinsic Controls –workingwith Files - Accessing databases with data control - Classes and Objects – ADO ObjectModel.UNIT III VISUAL C++ PROGRAMMING 9Windows Programming Model - Visual C++ components – Microsoft foundation classesLibrary Application Framework – Getting Started with AppWizard – Basic Eventhandling, Mapping modes, and a Scrolling View - Graphics Device Interface, Colors andfonts – modal and modeless dialog – windows common controls – bitmapsUNIT IV THE DOCUMENT AND VIEW ARCHITECTURE 9Menus – Keyboard Accelerators – Rich Edit Control – Tool bars – Status bars – Areusable Frame Window Base Class - Reading and writing documents - SDI and MDIenvironments – splitter windows and multiple views.UNIT V APPLICATIONS OF VISUAL PROGRAMMING 9Dynamic link library – ActiveX controls Vs. Ordinary Windows Controls – InstallingActiveX controls – Calendar Control – ActiveX control container programming – createActiveX control at runtime -Component Object Model - Object linking and embedding –Data Base Management with Microsoft ODBC- Threading. Total: 45TEXT BOOKS: 1. Charles Petzold, “Windows Programming”, Microsoft press, 1996. 2. Francesco Balena, “Programming Microsoft Visual Basic6.0”, Microsoft press, Indian Reprint, 2001. 3. David Kruglirski.J, “Programming Microsoft Visual C++”, Fifth Edition, Microsoft press, 1998.REFERENCES 1. Visual C++ 6 From the grounded up , 2nd Edition by John Mueller, McGraw – HILL INTERNATIONAL EDITION, Indian Reprint, 2008. 2. Visual Basic 6.0 Programming, Content Development Group, Tata McGraw-Hill Publishing Company Limited, Indian Reprint, 2008.
  34. 34. OPTIMIZATION TECHNIQUES L T P M C 3 0 0 100 3UNIT I INTRODUCTION 9Statement of an optimization problems – classification of optimization problem –classical optimization techniques; Single variable optimizations, Multi variableoptimization, equality constrainst, inequality constraints, No constraints.UNIT II LINEAR PROGRAMMING 9Graphical method for two dimensional problems – central problems of LinearProgramming – Definitions – Simples – Algorithm – Phase I and II of simplex Method –Revised Simplex Method.Simplex Multipliers – Dual and Primal – Dual Simplex Method – Sensitivity Analysis –Transportation problem and its solution – Assignment problem and its solution –Assignment problem and its solution by Hungarian method – Karmakar’s method –statement, Conversion of the Linear Programming problem into the required form,Algorithm.UNIT III NON LINEAR PROGRAMMING 9NON LINEAR PROGRAMMING (ONE DIMENSIONAL MINIMIZATION: Introduction –Unrestricted search – Exhaustive search – interval halving method – Fibonacci method.NON LINEAR PROGRAMMING : (UNCONSTRAINED OPRIMIZATION): - Introduction– Random search method – Uni variate method – Pattern search methods – Hooke andjeeves method, simplex method- Gradient of a function – steepest descent method –Conjugate gradient method.NON LINEAR PROGRAMMING – (CONSTRAINED OPTIMIZATION):Introduction – Characteristics of the problem – Random search method – Conjugategradient method.UNIT IV DYNAMIC PROGRAMMING 9Introduction – multistage decision processes – Principles of optimality – Computationprocedures.UNIT V DECISIOIN MAKING 9Decisions under uncertainty, under certainty and under risk – Decision trees – Expectedvalue of perfect information and imperfect information.TEXT BOOKS: 1. Kalynamoy Deb, “Optimization for Engineering Design, Alogorithms and Examples”, Prentice Hall, 2004. 2. Hamdy A Taha, “Operations Research – An introduction”, Pearson Education , 2002.
  35. 35. REFERENCES: 1. Hillier / Lieberman, “Introduction to Operations Research”, Tata McGraw Hill Publishing company Ltd, 2002. 2. Singiresu S Rao, “Engineering optimization Theory and Practice”, New Age International, 1996. 3. Mik Misniewski, “Quantitative Methods for Decision makers”, MacMillian Press Ltd., 1994. 4. Kambo N S, “Mathematical Programming Techniques”, Affiliated East – West press, 1991.
  36. 36. PROFESSIONAL ETHICS L T P M C 3 0 0 100 3UNIT I. HUMAN VALUES 10Morals, Values and Ethics – Integrity – Work Ethic – Service Learning – Civic Virtue –Respect for Others – Living Peacefully – caring – Sharing – Honesty – Courage –Valuing Time – Co-operation – Commitment – Empathy – Self-Confidence – Character– SpiritualityUNIT II Engineering Ethics 9Senses of Engineering Ethics - variety of moral issued - types of inquiry - moraldilemmas - moral autonomy - Kohlbergs theory - Gilligans theory - consensus andcontroversy – Models of Professional Roles - theories about right action - Self-interest -customs and religion - uses of ethical theories.UNIT III ENGINEERING AS SOCIAL EXPERIMENTATION 9Engineering as experimentation - engineers as responsible experimenters - codes ofethics - a balanced outlook on law - the challenger case studyUNIT IV SAFETY, RESPONSIBILITIES AND RIGHTS 9Safety and risk - assessment of safety and risk - risk benefit analysis and reducing risk -the three mile island and chernobyl case studies.Collegiality and loyalty - respect for authority - collective bargaining - confidentiality -conflicts of interest - occupational crime - professional rights - employee rights -Intellectual Property Rights (IPR) - discrimination.UNIT V GLOBAL ISSUES 8Multinational corporations - Environmental ethics - computer ethics - weaponsdevelopment - engineers as managers-consulting engineers-engineers as expertwitnesses and advisors -moral leadership-sample code of Ethics like ASME, ASCE,IEEE, Institution of Engineers (India), Indian Institute of Materials Management,Institution of electronics and telecommunication engineers (IETE),India, etc. TOTAL : 45TEXT BOOK: 1. Mike Martin and Roland Schinzinger, “Ethics in Engineering”, McGraw-Hill, New York 1996. 2. Govindarajan M, Natarajan S, Senthil Kumar V. S, “Engineering Ethics”, Prentice Hall of India, New Delhi, 2004.
  37. 37. REFERENCES 1. Charles D. Fleddermann, “Engineering Ethics”, Pearson Education / Prentice Hall, New Jersey, 2004 (Indian Reprint) 2. Charles E Harris, Michael S. Protchard and Michael J Rabins, “Engineering Ethics – Concepts and Cases”, Wadsworth Thompson Learning, United States, 2000 (Indian Reprint now available) 3. John R Boatright, “Ethics and the Conduct of Business”, Pearson Education, New Delhi, 2003. 4. Edmund G Seebauer and Robert L Barry, “Fundamentals of Ethics for Scientists and Engineers”, Oxford University Press, Oxford, 2001.
  38. 38. MOBILE COMPUTING L T P M C 3 0 0 100 3UNIT I WIRELESS COMMUNICATION FUNDAMENTALS 9Introduction – Wireless transmission – Frequencies for radio transmission – Signals –Antennas – Signal Propagation – Multiplexing – Modulations – Spread spectrum – MAC– SDMA – FDMA – TDMA – CDMA – Cellular Wireless Networks.UNIT II TELECOMMUNICATION NETWORKS 11Telecommunication systems – GSM – GPRS – DECT – Satellite Networks - Basics –Parameters and Configurations – Capacity Allocation – FAMA and DAMA – BroadcastSystems – DAB - DVB.UNIT III WIRLESS LAN 9Wireless LAN – IEEE 802.11 - Architecture – services – MAC – Physical layer – IEEE802.11a - HIPERLAN – Blue Tooth.UNIT IV MOBILE NETWORK LAYER 9Mobile IP – Dynamic Host Configuration Protocol - Routing – DSDV – DSR – AlternativeMetrics.UNIT V TRANSPORT AND APPLICATION LAYERS 7Traditional TCP – Classical TCP improvements – WAP- Introduction to 4G mobilenetworks- Case study – Mobile multimedia networks. TOTAL : 45TEXT BOOKS: 1. Jochen Schiller, “Mobile Communications”, PHI/Pearson Education, Second Edition, 2003. 2. William Stallings, “Wireless Communications and Networks”, PHI/Pearson Education, 2002.REFERENCES 1. Kaveh Pahlavan, Prasanth Krishnamoorthy, “Principles of Wireless Networks”, PHI/Pearson Education, 2003. 2. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, “Principles of Mobile Computing”, Springer, New York, 2003. 3. Hazysztof Wesolowshi, “Mobile Communication Systems”, John Wiley and Sons Ltd, 2002.
  39. 39. MANAGEMENT INFORMATION SYSTEMS L T P M C 3 0 0 100 3UNIT I INFORMATION SYSTEM AND ORGANIZATION 9Matching the information system plane in to the organizational strategic plan –identifying key Organizational Objective and processes and Developing an informationSystem Development – User role in Systems Development process – Maintainabilityand Recoverability in System Design.UNIT IIREPRESENTATION AND ANALYSIS OF SYSTEM STRUCTURE 9Models for Representing Systems Mathematical, Graphical and Hierarchical(Organization Chart, Tree Diagram) – Information Flow – Process Flow – Methods andHeuristics – Decomposition and aggregation – Information architecture – Application ofSystem Representation to Case Studies.UNIT III SYSTEMS, INFORMATION AND DECISION THEORY 9Information theory – Information content and Redundancy – Classification andcompression – Summarizing and Filtering – inferences and Uncertainty – Identifyinginformation needed to support to decision Making – Human Factors – problemcharacteristics and information System Capabilities in Decision Making.UNIT IV INFORMATION SYSTEM APPLICATION 9Transaction processing Application – Basic Accounting Application – Applications forBudgeting and planning – other use of information Technology: Automation – Wordprocessing – Electronic Mail – Evaluation Remote Conferencing and Graphics –Systems and Selection – Cost Benefit – Centralized vs. Decentralized AllocationMechanism.UNIT V DEVELOPMENT AND MAINTANANCE OF INFORMATION SYSTEMS 9Systems analysis and design – System development life cycle – Limitation – End userdevelopment – Managing End users of the shelf software packages – Outsourcing –Comparison of different methodologies. Total : 45TEXT BOOKS: 1. K.C. Laudon ,J.P. Laudon, M.E.Brabaston.”Management Information Systems:Managing the Digital Firm”,Pearson Education,2002. 2. K.C. Laudon ,J.P. Laudon,”Management Information Systems-Organization and Technology in the Networked Enterprise”,sixth Edition,Prentice Hall,2000.
  40. 40. REFERENCES 1. E.F.Turban,R.K. Turban,R.E.Potter,”Introduction to Information Technology”,2004. 2. Wiley and M.E. Brabston, K.C. ”Management Information Systems:Managing the Digital Firm”,Pearson Education,2002. 3. Jeffrey A. Hoffer ,Joey F . George and Joseph S.Valachich,”Modern System analysis and Design”,third Edition,
  41. 41. MIDDLEWARE TECHNOLOGY L T P M C 3 0 0 100 3UNIT I CLIENT / SERVER CONCEPTS 9Client – Server – File Server, Database server, Group server, Object server, Webserver .Middleware – General middleware – Service specific middleware. Client / ServerBuilding blocks – RPC – Messaging – Peer – to- Peer.UNIT II EJB ARCHITECTURE 9EJB – EJB Architecture – Overview of EJB software architecture – View of EJB –Conversation – Building and Deploying EJBs – Roles in EJB.UNIT III EJB APPLICATIONS 9EJB Session Beans – EJB entity beans – EJB clients – EJB Deployment – Building anapplication with EJB.UNIT IV CORBA 9CORBA – Distributed Systems – Purpose – Exploring CORBA alternatives –Architecture overview – CORBA and networking model – CORBA object model – IDL –ORB – Building an application with CORBA.UNIT V COM 9COM – Data types – Interfaces – Proxy and Stub – Marshalling – Implementing Server /Client – Interface Pointers – Object Creation, Invocation , Destruction – ComparisonCOM and CORBA – Introduction to .NET – Overview of .NET architecture – Marshalling– Remoting. Total: 45Text Books: 1. Robert Orfali, Dan Harkey and Jeri Edwards, “The Essential Client/Server Survival Guide”, Galgotia Publications Pvt. Ltd., 2002. (Unit 1) 2. Tom Valesky,”Enterprise Java Beans”,Pearson Education, 2002.(Unit 2 & 3) 3. Jason Pritchard,”COM and CORBA side by side”, Addison Wesley,2000 (Unit 4 & 5)References : 4. Jesse Liberty, “Programming C#”, 2nd Edition, O’Reilly Press, 2002. (Unit 5)
  42. 42. SOFTWARE TESTING L T P M C 3 0 0 100 3UNIT I INTRODUCTION 8Purpose of testing- Some Dichotomies – A model for testing-The taxonomy of bugs:Synopsis – Consequence of bugs – taxonomy of bugs – Level of Testing – Test Cases-Examples.UNIT II FUNCTIONAL AND STRUCTURAL TESTING 9Boundary Value Testing – Equivalence Class Testing – Comparison Testing-CauseEffect Graphs- Basis Path Testing - Condition Testing- Data Flow Testing – LoopTesting - Structural Coverage.UNIT III UNIT, INTEGRATION AND SYSTEM TESTING 9Unit Testing- Integration Testing – System Testing – Interaction Testing – Verificationand Validation – Extreme Testing.UNIT IV OBJECT ORINTED TESTING 9Issues in Object Oriented Testing – Class Testing – Object Oriented Integration Testing– GUI Testing – Object Oriented System Testing.UNIT V DEBUGGING AND TESTING TOOLS 10Debugging Process – Debugging Approach –Software Testing Tool: An Overview- WinRunner – Silk Test – Load Runner – Jmeter - Test Director Total: 45Text Books: 1. Paul C. Jorgensen “Software Testing, A Craftsman’s Approach”, Second Edition (2007), CRC Press. 2. “Software Testing Effective methods, Tools and Techniques” Renu Rajani, Pradeep Oak, Tata McGraw- Hill, 2005.References: 1. J.Myers ,“The Art of Software Testing”, 2nd edition. Published by John Wiley & Sons Inc., NJ, USA. 2. Boris Beizer ,”Software Testing Techniques”, DreamTech Press.
  43. 43. SOFTWARE PROJECT MANAGEMENT L T P M C 3 0 0 100 3UNIT I 9Introduction to Software Project Management, An Overview of Project Planning: SelectProject, Identifying Project scope and objectives, infrastructure, project products andcharacteristics. Estimate efforts, Identify activity risks, and Allocate resources.UNIT II 9Project Evaluation: Strategic Assessment, Technical Assessment, cost-benefit analysis,cash flow forecasting, cost-benefit evaluation techniques, Risk Evaluation. Selection ofAppropriate Project approach: Choosing technologies, choice of process models,structured methods.UNIT III 9Software Effort Estimation: Problems with over and under estimations, Basis of softwareestimation, Software estimation techniques, expert Judgment, Estimating by analogy.Activity Planning: Project schedules, projects and activities, sequencing and schedulingactivities, networks planning models, formulating a network model.UNIT IV 9Risk Management: Nature of Risk, Managing Risk, Risk Identification and Analysis,Reducing the Risk. Resource Allocation: Scheduling resources, Critical Paths, Costscheduling, Monitoring and Control: Creating Framework, cost monitoring, prioritizingmonitoring.UNIT V 9Software Quality: defining software quality, ISO9126, External Standards.Comparison of project management software’s: dot Project, Launch pad, openProj.Case study: PRINCE2Text Books: 1. Bob Hughes & Mike Cotterell, “Software Project Management”, Tata McGraw- Hill Pubs, Fourth Edition 2006.References: 1. Richard H.Thater “Software Engineering Project Management,”: IEEE Computer Society 2. , S. A. Kelkar,” Software Project Management” PHI. 3. http://en.wikipedia.org/wiki/Comparison_of_project_management_software 4. http://www.ogc.gov.uk/methods_prince_2.asp
  44. 44. GRID COMPUTING L T P M C 3 0 0 100 3UNIT-I: INTRODUCTION: 9 Grid activities - Grid Business Areas – Applications - Infrastructure. GRIDCOMPUTING ORGANIZATIONS AND THEIR ROLES: Organizations developing Gridstandards & best practice Guidelines - Organizations developing Grid ComputingToolkits & the framework Organizations building and using Grid base solutions to solvecomputing - data, & network requirements. GRID COMPUTING ANATOMY: Gridproblem –Grid Architecture.UNIT-II THE GRID COMPUTING ROAD MAP: 9Autonomic computing -Business on demand & infrastructure virtualization - serviceoriented architecture- semantic grids. THE NEW GENERATION OF GRIDCOMPUTING APPLICATION: Merging the Grid service Architecture with Web serviceArchitecture- Service Oriented Architecture-Web Service Architecture- XML messagesand Enveloping- SOAP- Service message description mechanism- Relationshipbetween Web services & Grid services.UNIT-III GRID COMPUTING TECHNOLOGICAL VIEWPOINTS: 9Open Grid Service Architecture (OGSA) - Introduction-Architecture-Goals: SOMESAMPLE US CASES THAT DRIVE THE OGSA: Commercial Data center (CDC) -National Fusion Collaborations (NFS)-Online Media & entertainment. OGSAPLATFORM COMPONENTS: Native platform services-mechanisms-OGSA hostingEnvironment- Core Networking services-Security, Infrastructure- basic services. OPENGRID SERVICES INFRASTRUCTURE (OGSI): Introduction-Grid services- High-levelintroduction to OGSI- Technical details- Introduction to service data components- Gridservice: Naming & change management recommendations.OGSA BASIC SERVICES: Common Management model (CMM)-service domains-policy architecture- security architecture- Mastering & Accounting- common distributedLogging.UNIT – IV SCHEDULING GRID SERVICES 9Introduction - Scheduling algorithms and strategies: Static heuristics - Dynamicheuristics - Grid scheduling algorithms and strategies. Architecture:Meta-schedulers -Grid scheduling scenarios - Metascheduling schemes, Service discovery :Servicedirectories - Techniques syntactic and semantic. Resource information: Globus Toolkitinformation service - Other information services and providers Data-intensive servicescheduling : Algorithms - Architecture of data grid. Fault tolerant : Fault-tolerantalgorithms - Fault-tolerant techniques - Grid fault tolerance. Case study: GSSIM: GridScheduling SimulatorUNIT-V GLOBUS GT3 TOOLKIT 9Architecture-GT3 software architecture model- default server side - framework - security- system level services. GLOBUS GT3 TOOLKIT PROGRAMMING MODEL:Introduction- service programming model- Grid service behavior implementation-
  45. 45. operation providers- factory call back mechanisms- Grid service life cycle-Management- service activation & deactivation- custom query engines & evaluators-GT3tools- configuration- security - basic service implementation- Grid serviceconfiguration- simple client implementation- advanced Grid services- advanced servicedata concepts-operation providers – CASE STUDY: GridSIM: A Tool kit for Modelingand Simulating Grid Computing TOTAL – 45Text Books: 1. Joshy Joseph & Craig Fellenstein , “Grid Computing”, IBM Press, 2003. 2. Frédéric Magoulès, Thi-Mai-Huong Nguyen,Lei Yu “Grid Resource Management”, CRC press.(Unit IV)References: 1. Daniel Minoli, “A networking approach to Grid Computing”, Wiley Interscience, 2004. 2. Ian Foster & Carl Kesselman – “The Grid2 Blueprint for a New Computing Infrastructure”- Morgan Kaufmann, 2003. 3. Micheal L.Pinedo, “Scheduling, theory algorithms and systems”, 3rd Edition, Springer. 4. Ahmar Abbas,”Grid Computing: A practical guide to Technology and Applications,” firewall publisher, 2004. 5. www.buyya.com
  46. 46. DISTRIBUTED COMPUTING L T P M C 3 0 0 100 3UNIT I INTRODUCTION 9Characterization of Distributed Systems - Examples - Resource Sharing and the Web -Challenges - System Models - Architectural and Fundamental Models - Networking andInternetworking - Types of Networks - Network Principles - Internet Protocols - CaseStudies.UNIT II PROCESSES AND DISTRIBUTED OBJECTS 9Interprocess Communication - The API for the Internet Protocols - External DataRepresentation and Marshalling - Client-Server Communication - Group Communication- Case Study - Distributed Objects and Remote Invocation - Communication BetweenDistributed Objects - Remote Procedure Call - Events and Notifications - Java RMI -Case Study.UNIT III OPERATING SYSTEM ISSUES – I 9The OS Layer - Protection - Processes and Threads - Communication and Invocation –OS Architecture - Security - Overview - Cryptographic Algorithms - Digital Signatures -Cryptography Pragmatics - Case Studies - Distributed File Systems - File ServiceArchitecture - Sun Network File System - The Andrew File SystemUNIT IV OPERATING SYSTEM ISSUES – II 9Name Services -Domain Name System - Directory and Discovery Services - GlobalName Service - X.500 Directory Service - Clocks, Events and Process States -Synchronizing Physical Clocks - Logical Time And Logical Clocks - Global States -Distributed Debugging - Distributed Mutual Exclusion – Elections – MulticastCommunication Related Problems.UNIT V DISTRIBUTED TRANSACTION PROCESSING 9Transactions - Nested Transactions - Locks - Optimistic Concurrency Control -Timestamp Ordering - Comparison - Flat and Nested Distributed Transactions - AtomicCommit Protocols - Concurrency Control in Distributed Transactions - DistributedDeadlocks - Transaction Recovery - Overview of Replication And Distributed MultimediaSystems TOTAL : 45Text Books: 1. George Coulouris, Jean Dollimore and Tim Kindberg, “Distributed Systems Concepts and Design”, Pearson Education, 3rd Edition, 2002. 2. Sape Mullender, “ Distributed Systems”, Addison Wesley, 2nd Edition, 1993.
  47. 47. References: 1. Albert Fleishman, “Distributes Systems- Software Design and Implementation”, Springer-Verlag, 1994 2. M.L.Liu, “Distributed Computing Principles and Applications”, Pearson Education, 2004. 3. Andrew S Tanenbaum , Maartenvan Steen,”Distibuted Systems –Principles and Pardigms”,Pearson Education, 2002 4. Mugesh Singhal,Niranjan G Shivaratri,”Advanced Concepts in Operating Systems”,Tata McGraw Hill Edition, 2001
  48. 48. PARALLEL PROCESSING L T P M C 3 0 0 100 3UNIT I INTRODUCTION TO PARALLELISM 7Parallel computer models - the state of computing, Multiprocessors and Multicomputersand Multivectors and SIMD computers, PRAM and VLSI models, Architecturaldevelopment tracks. Program and network PropertiesUNIT II THEORY OF PARALLELISM 8Conditions of parallelism, Program partitioning and scheduling, Program flowmechanisms, System interconnect architectures. Principles of scalable performance -performance matrices and measures, Parallel processing applications, speedupperformance laws, scalability analysis and approaches.UNIT III HARDWARE TECHNOLOGIES 10Processor and memory hierarchy advanced processor technology, superscalar andvector processors, memory hierarchy technology, virtual memory technology, bus cacheand shared memory - backplane bus systems, cache memory organisations, sharedmemory organisations, sequential and weak consistency models.UNIT IV PIPELINING AND SUPERSCLAR TECHNOLOGIES 10Parallel and scalable architectures, Multiprocessor and Multicomputers, Multivector andSIMD computers, Scalable, Multithreaded and data flow architectures.UNIT V SOFTWARE AND PARALLEL PROGRAMMING 10Parallel models, Languages and compilers, Parallel program development andenvironments, UNIX, MACH and OSF/1 for parallel computers. Total: 45Text Books: 1. Kai Hwang, "Advanced Computer Architecture", McGraw Hill International, 1993.References: 1. William Stallings, "Computer Organization and Architecture", Macmillan Publishing Company, 1990. 2. M. J. Quinn, "Designing Efficient Algorithms for Parallel Computers", McGraw Hill International, 1994.

×