Vous êtes sur la page 1sur 5

THEORY OF COMPUTATION UNIT I Church-Turing thesis: Turing machines Variants of Turing Machines Hilberts problems.

s. Decidability: Decidable languages Halting problem. UNIT II Reducibility: Undecidable problems from Language theory A simple Undecidable problem Mapping Reducibility. Advanced topics in Computability Theory: The Recursion Theorem Decidability of logical theories Turing Reducibility. UNIT III Time Complexity: Measuring Complexity The Class P The class NP NPcompleteness Additional NP-complete Problems. UNIT IV Space Complexity: Savitchs Theorem The Class PSPACE PSPACEcompleteness The classes L and NL NL-completeness NL equals coNL. Intractability: Hierarchy Theorems Relativization Circuit Complexity. UNIT V Advanced topics in complexity theory: Approximation Algorithms Probabilistic Algorithms Alternation Interactive Proof Systems Parallel Computation Cryptography TOTAL : 60 TUTORIAL 15

TEXT 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.

OPEN SOURCE SOFTWARE UNIT I INTRODUCTION Introduction to Open sources Need of Open Sources Advantages of Open SourcesApplication 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 MySQL: Introduction Setting up account Starting, terminating and writing your Own SQL programs Record selection Technology Working with strings Date and Time Sorting Query Results Generating Summary Working with metadata Usingsequences MySQL and Web. UNIT III OPEN SOURCE PROGRAMMING LANGUAGES PHP: Introduction Programming in web environment variables constants data;types operators Statements Functions Arrays OOP String Manipulation and regular expression File handling and data storage PHP and SQL database PHP and LDAP PHP Connectivity Sending and receiving E-mails Debugging and error handling Security Templates. UNIT IV PYTHON Syntax and Style Python Objects Numbers Sequences Strings Lists and Tuples Dictionaries Conditionals and Loops Files Input and Output Errors and Exceptions Functions Modules Classes and OOP Execution Environment. UNIT V PERL Perl backgrounder Perl overview Perl parsing rules Variables and Data Statements and Control structures Subroutines, Packages, and Modules- Working with Files Data Manipulation. Total: 45 Text Books: 1. Remy Card, Eric Dumas and Frank Mevel, The Linux Kernel Book, Wiley Publications, 2003 2. Steve Suchring, MySQL Bible, John Wiley, 2002 References: 1. Rasmus Lerdorf and Levin Tatroe, Programming PHP, OReilly, 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 McGrawHill Publishing Company Limited, Indian Reprint 2009.

OBJECT ORIENTED SYSTEM DESIGN Unit I Introduction Introduction to Object Orientation - Development - Themes-Evidence for Usefulness of OO Development-OO Modeling Modeling 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 Tips Unit II Advanced Class Modeling Advanced Object and Class Concepts-Association Ends-N-ary AssocationsAggregation-Abstract Classes-Multiple Inheritance-metadata-Reification-ConstraintsDerived Data-Packages- Practical Tips State ModelingEvents-states-Transitions and Conditions-State diagrams-state diagrams behaviorpractical tips-Advanced state Modeling-Nested State DiagramsNested States-Signal Generalization-concurrency- A sample state Model- Relation of class and state models Interaction Modeling Use case Models-Sequence Models- Activity Models- Use Case Relationships-Procedural Sequence Models- special constructs for Activity ModelsClass Model-StateModel-Interaction Model Unit III Analysis Process Overview-Development stages-Development Lifecycle-System conceptiondevisinga 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 ModelApplication Class Model-Application state Model-Adding operations Unit IV Design Overview of system Design-Estimating performance- Making a reuse plan-Breaking a system into sub systems-identifying concurrency-Allocation of subsystemsManagement of Data Storage-Handling Global Resources-Choosing a software control strategy-handling boundary conditions-setting Trade-off Priorities-common architectural styles-Architecture of the ATM System Class Design Overview of class Design-Bridging the gap-Realizing use casesDesigning Alogrithms-Recursing Downward-Refactoring-Design optimization-Reification of behavioradjustmentof inheritance-organizing a class design-ATM Example Unit V Implementation Implementation Modeling-overview of implementation-Fine-tuning classes-fine tuning generalizations-realizing associations-oo languages-introduction abbreviated ATM Model-implementing structure-implementing functionality-practical tips DatabaseIntroduction-Abbreviated ATM Model-Implementing structure-Implementing structure -Implementing structure for the ATM Example-Implementing FunctionalityObject oriented Databases Programming style Object-oriented style-reusability-extensibility robustness - programming in large

NUMERICAL METHODS UNIT I SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS Linear interpolation methods (method of false position) Newtons method Statement of Fixed Point Theorem Fixed point iteration: x=g(x) method Solution of linear system by Gaussian elimination and Gauss-Jordon methods- Iterative methods: Gauss Jacobi and Gauss-Seidel methods- Inverse of a matrix by Gauss Jordon method Eigenvalue of a matrix by power method. UNIT II INTERPOLATION AND APPROXIMATION Lagrangian Polynomials Divided differences Interpolating with a cubic spline Newtons forward and backward difference formulas. UNIT III NUMERICAL DIFFERENTIATION AND INTEGRATION Derivatives from difference tables Divided differences and finite differences Numerical integration by trapezoidal and Simpsons 1/3 and 3/8 rules Rombergs method Two and Three point Gaussian quadrature formulas Double integrals using trapezoidal and Simpsons rules. UNIT IV INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL EQUATIONS Single step methods: Taylor series method Euler and modified Euler methods Fourth order Runge Kutta method for solving first and second order equations Multistep methods: Milnes and Adams predictor and corrector methods. UNIT V BOUNDARY VALUE PROBLEMS IN ORDINARY AND PARTIAL DIFFERENTIAL EQUATIONS Finite difference solution of second order ordinary differential equation Finite difference solution of one dimensional heat equation by explicit and implicit methods One dimensional wave equation. TEXT 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.

COMPUTER GRAPHICS UNIT- I Introduction to Computer Graphics & Scan conversion Overview of Computer Graphics, Computer Graphics Application and Software, DisplayTechnologies, Storage Tube Graphics Displays, Calligraphic Refresh Graphics Displays, Raster Refresh (Raster-Scan) Graphics Displays, Cathode Ray Tube Basics, Color CRT Raster Scan Basics, Video Basics, The Video Controller, Random-Scan Display 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 and Liang-Barsky, Clipping Polygons, problem with multiple components. UNIT-II Two-Dimensional Transformations Transformations and Matrices, Transformation Conventions, 2D Transformations, Homogeneous Coordinates and Matrix Representation of 2D Transformations, Translations and Homogeneous Coordinates, Rotation, Reflection, Scaling, Combined Transformation, Transformation of Points, Transformation of The Unit Square, Solid Body Transformations, Rotation About an Arbitrary Point, Reflection through an Arbitrary Line, A Geometric Interpretation of Homogeneous Coordinates, The Windowto-Viewport Transformations. UNIT-III Three-Dimensional Transformations Introduction, Three-Dimensional Scaling, Three-Dimensional Shearing, ThreeDimensional Rotation, Three-Dimensional Reflection, Three-Dimensional Translation, Multiple Transformation, Rotation about an Arbitrary Axis in Space, Reflection through an Arbitrary Plane, Matrix Representation of 3D Transformations, Composition of 3D Transformations, Affine and Perspective Geometry, Perspective Transformations, Techniques for Generating Perspective Views, Vanishing Points, the Perspective Geometry and camera models, Orthographic Projections, Axonometric Projections, Oblique Projections, View volumes for projections. UNIT-IV Solid Modeling & Visible-Surface Determination Representing Solids, Regularized Boolean Set Operations, Primitive Instancing, Sweep Representations, 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 zBuffer Algorithm, Scan-line method, Painters algorithms (depth sorting),Area subdivision method, BSP trees, Visible-Surface Ray Tracing, comparison of the methods. UNIT-V llumination and Shading & Graphics Programming using OPENGL Illumination and Shading Models for Polygons, Reflectance properties of surfaces, Ambient, Specular and Diffuse reflections, Atmospheric attenutation, Phongs 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.

Vous aimerez peut-être aussi