Computer Graphics MC-311 L T P C

Size: px

Start display at page:

Download "Computer Graphics MC-311 L T P C"

Florence Webb
5 years ago
Views:

1 MC-311 Computer Graphics UNIT I Overview of Computer Graphics: Usage of Graphics and their applications, Over view of Graphics systems: Refreshing display devices, Random and raster scan display devices, Colour Models: RGB, HSV etc., Tablets, Joysticks, Track balls, Mouse and light pens, plotters, printers, digitizers. UNIT II Output primitives:: DDA Line drawing algorithm, Bresenham s Line Drawing Algorithm, Mid-point circle algorithm, Mid-point Ellipse algorithms, filling algorithms, boundary fill and flood fill algorithms, scan-line filling, character generation, line attributes, fill styles, anti-aliasing. UNIT III Transformations: Basic 2D Transformations, Matrix representations & Homogeneous Coordinates, Matrix Representations for basic 2D and 3D transformations, Composite Transformations, reflection and shear transformations, affine transformation, transformations between coordinate systems. UNIT IV Two dimensional viewing: The viewing Pipeline, Viewing Coordinate Reference Frame, Window-to-Viewport Coordinate Transformation, Two Dimensional Viewing Functions, Barky line clipping algorithm, Algorithm for polygon clipping, Sutherland-Hodgeman polygon clipping, Wailer-Atherton polygon clipping, curve clipping, Text clipping. UNIT V Curves and Surfaces: Representation of surfaces, polygon meshes, plane equations, parametric cubic curves, Hermite Curves, Bezier Curves, 4 point and 5 point Bezier curves using Bernstein Polynomials, Conditions for smoothly joining curve segments, Bezier bicubic surface patch, B-Spline Curves, Cubic B-Spline curves using uniform knot vectors, Testing for first and second order continuities UNIT VI Projection: Parallel Projection, Oblique Projection on XY plane, Isometric Projection, Perspective Projection, One Vanishing Point (V.P.) projection, Generation of 2 V.P. Projection, planar geometric projections. Shading and Hidden Surface Removal: Shading, Illumination Model for diffused Reflection, Effect of ambient lighting, distances, Specular Reflection Model, Computing Reflection Vector, Curved Surfaces, Polygonal Approximations, Guard Shading, Phong Model, Hidden Surface Removal, Back Face Detection, Depth Buffer (Z-Buffer, A-Buffer) Method, Scan Line Method, Depth Sorting Method, Area Subdivision Method. Suggested Readings: Text Books: 1. D. Hearn and P. Baker, Computer Graphics, Prentice Hall, R. Plastock and G. Kalley, Theory and Problems of Computer Graphics, Schaum s Series, McGraw Hill, Foley et al., Computer Graphics Principles & practice, Addison Wesley, Reference Books: 1. David F. Rogers, Procedural Elements for Computer Graphics, McGraw Hill Book Company,

2 2. D. Rogers and J. Adams, Mathematical Elements for Computer Graphics, MCGraw-Hill International Edition,

3 STOCHASTIC PROCESS (MC 312) Unit I: Stochastic processes Introduction, Classification and properties of stochastic process, Examples of Stochastic processes, Bernoulli process, Poisson process, Gaussian process, Renewal process, Stationary process, Brownian motion, White Noise process, Martingales. Unit II: Discrete time Markov chain Definition, n-step Transition probability, State classification, Limiting probabilities, Distribution of times between states, Irreducible finite chains with aperiodic states, Reducible chains (Finite Markov chains with absorbing states). Unit III: Continuous time Markov chain Definition, Chapman-Kolmogorov equation, Poisson process, Birth-Death process, Special cases of Birth-Death process, Non Birth-Death Process, Markov chains with absorbing states, Stochastic Petri nets. Unit IV: Renewal process and theory Definition, Examples, Renewal equation, Renewal theorems, Application of renewal process. Unit V: Stochastic calculus Theory of Martingales, Stochastic differential equations (SDEs), Ito calculus, Ito and Stratonovich stochastic integrals, connection between SDEs and the Fokker-Planck (forward Kolmogorov) equation. Books: 1. Kishor S. Trivedi, Probability and Statistics with Reliability, Queueing and Computer Science Application, Wiley. 2. J. Medhi, Stochastic Processes, New Age International Publishers. 3. Sheldon Ross, Stochastic Processes, Wiley. 4. S. E. Shreve, "Stochastic Calculus for Finance", Vol. I & Vol. II, Springer. 3

4 MATRIX COMPUTATION (MC - 313) Floating point computations, IEEE floating point arithmetic, analysis of roundoff errors; Sensitivity analysis and condition numbers; Linear systems, Overview of iterative methods: Jacobi, Gauss-Seidel and successive over relaxation methods; LU decompositions, Gaussian elimination with partial pivoting; Banded systems, positive definite systems, Cholesky decomposition - sensitivity analysis; Gram-Schmidt orthonormal process, Householder transformation, QR factorization, stability of QR factorization. Solution of linear least squares problems, normal equations, singular value decomposition (SVD), polar decomposition, Moore-Penrose inverse; Rank deficient least squares problems; Sensitivity analysis of least-squares problems; Review of canonical forms of matrices; Sensitivity of eigenvalues and eigenvectors. Reduction to Hessenberg and tridiagonal forms; Power, inverse power and Rayleigh quotient iterations; Explicit and implicit QR algorithms for symmetric and non-symmetric matrices; Reduction to bidiagonal form; Golub-Kahan algorithm for computing SVD; Sensitivity analysis of singular values and singular vectors; Krylov subspace methods, Arnoldi and Lanczos methods, conjugate gradient method. TEXT BOOKS: 1. G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd Edition, John Hopkins University Press, D. S. Watkins, Fundamentals of Matrix Computations, John Wiley, L. N. Trefethen and D. Bau III, Numerical Linear Algebra, SIAM,

5 MC-314 Theory of Computation UNIT I Introduction; Alphabets, Strings and Languages; Automata and Grammars, Deterministic finite Automata (DFA)-Formal Definition, Simplified notation: State transition graph, Transition table, Language of DFA, Nondeterministic finite Automata (NFA), NFA with epsilon transition, Language of NFA, Equivalence of NFA and DFA, Minimization of Finite Automata, Distinguishing one string from other, Myhill-Nerode Theorem. UNIT II Regular expression (RE), Definition, Operators of regular expression and their precedence, Algebraic laws for Regular expressions, Kleen s Theorem, Regular expression to FA, DFA to Regular expression, Arden Theorem, Non Regular Languages, Pumping Lemma for regular Languages. Application of Pumping Lemma, Closure properties of Regular Languages, Decision properties of Regular Languages, FA with output: Moore and Mealy MChine, Equivalence of Moore and Mealy MChine, Applications and Limitation of FA. UNIT III Context free grammar (CFG): Definition, Examples, Derivation, Derivation trees, Ambiguity in Grammar, Inherent ambiguity, Ambiguous to Unambiguous CFG, Useless symbols, Simplification of CFGs, Normal forms for CFGs: CNF and GNF. UNIT IV Context Free Languages (CFL): Closure properties of CFLs, Decision Properties of CFLs: Emptiness, Finiteness and Membership, Pumping lemma for CFLs. UNIT V Push Down Automata (PDA): Description and definition, Instantaneous Description, Language of PDA, Acceptance by Final state, Acceptance by empty stack, Deterministic PDA, Equivalence of PDA and CFG, CFG to PDA and PDA to CFG, Two stack PDA. UNIT VI Turing MChines (TM): Basic model, definition and representation, Instantaneous Description, Language acceptance by TM, Variants of Turing MChine, TM as Computer of Integer functions, Universal TM, Church s Thesis, Recursive and recursively enumerable languages, Halting problem, Introduction to Undecidability, Undecidable problems about TMs. Post correspondence problem (PCP), Modified PCP, Introduction to recursive function theory. Text Books: 1 Hopcroft, Ullman, Introduction to Automata Theory, Languages and Computation, Pearson Education 2 K.L.P. Mishra and N.Chandrasekaran, Theory of Computer Science Automata, Languages and Computation, PHI. 3 Martin J. C., Introduction to Languages and Theory of Computations, TMH 5

6 Reference Books: 1 Papadimitrou, C. and Lewis, C.L., Elements of the Theory of Computation, PHI 6

7 MC-315 Operating System UNIT I Introduction: Operating system and function, Evolution of operating system, Batch, Interactive, Time Sharing and Real Time System, System protection. Operating System Structure: System Components, System structure, Operating System Services. UNIT II Concurrent Processes: Process concept, Principle of Concurrency, Producer Consumer Problem, Critical Section problem, Semaphores, Classical problems in Concurrency, Inter Process Communication, Process Generation, Process Scheduling. CPU Scheduling: Scheduling Concept, Performance Criteria Scheduling Algorithm, Evolution, Multiprocessor Scheduling. UNIT III Deadlock: System Model, Deadlock Characterization, Prevention, Avoidance and Detection, Recovery from deadlock combined approach. UNIT IV Memory Management: Base MChine, Resident monitor, Multiprogramming with fixed partition, Multiprogramming with variable partition, Multiple base register, Paging, Segmentation, Virtual memory concept, Demand paging, Performance, Paged replaced algorithm, Allocation of frames, Thrashing, Cache memory, Organization, Impact on performance. UNIT V I/O Management & Disk Scheduling: I/O devices and organization of I/O function, I/O Buffering, DISK I/O, Operating System Design Issues. File System: File Concept, File Organization and Access Mechanism, File Directories, File Sharing, Implementation Issues. UNIT VI Case Studies: Windows, Linux and Unix Suggested Readings: Text Books: 1. Silverschwatz, Operating System Concepts, Willey 2. Milenekovic, Operating System Concepts, McGraw Hill 3. Tannenbaum, Operating system design and implementation, PHI. Reference Books: 1. Dietel, An introduction to operating system, Addison Wesley. 7

8 OS LAB (MC 316) Lab based on the paper MC STOCHASTIC PROCESSES & MATRIX COMP. LAB (MC - 317) Lab based on the paper MC

9 9

SCHEME OF INSTRUCTION & EXAMINATION B.E. III YEAR (COMPUTER SCIENCE & ENGINEERING) With effect from the Academic year

SCHEME OF INSTRUCTION & EXAMINATION B.E. III YEAR (COMPUTER SCIENCE & ENGINEERING) With effect from the Academic year 2013-2014 SEMESTER - I S. No. Syllabus Ref. No. SUBJECT Scheme of Scheme of Examination