Archive for June 2016

<div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="background-color: white; color: #333333; font-family: "Open Sans", serif, sans-serif; font-stretch: normal; line-height: normal; margin: 0px; position: relative; text-align: left;">
<span style="color: red; font-weight: normal;"><span style="font-size: large;">SYBSCIT III Semester Syllabus (Effect from the academic year 2012–2013)</span></span></h2>
<div>
<span style="color: red;"><br /></span></div>
<h2 style="background-color: white; font-stretch: normal; line-height: normal; margin: 0px; position: relative; text-align: left;">
<span style="color: #38761d; font-family: "Open Sans", serif, sans-serif; font-size: 16.8px;"><u>Subject : </u></span><span style="background-color: transparent; font-size: 16.8px;"><span style="color: #38761d; font-family: Open Sans, serif, sans-serif;"><u>Computer Graphics</u></span></span></h2>
<div>
<span style="background-color: transparent; font-size: 16.8px;"><span style="color: #38761d; font-family: Open Sans, serif, sans-serif;"><u><br /></u></span></span></div>
<div>
<span style="background-color: transparent; font-size: 16.8px;"><span style="color: #38761d; font-family: Open Sans, serif, sans-serif;"><u><br /></u></span></span></div>
<div>
<span style="background-color: transparent; font-size: 16.8px;"><span style="font-family: Open Sans, serif, sans-serif;"><div>
<b>Unit – I</b>  Introduction Computer Graphics and Primitive Algorithms:<span style="font-size: 16.8px;">Introduction to Image and Objects, Image Representation, Basic </span><span style="font-size: 16.8px;">Graphics Pipeline, Bitmap and Vector-Based Graphics, Applications </span><span style="font-size: 16.8px;">of Computer Graphics, Display Devices, Cathode Ray Tubes, Raster Scan Display, Random-Scan Display, Flat Panel Display, Input </span><span style="font-size: 16.8px;">Technology, Coordinate System Overview, </span></div>
<div>
Scan-Conversion of graphics primitives:Scan-Conversion of a <span style="font-size: 16.8px;">Lines (Digital Differential Analyzer Algorithm, Bresenham’s Line Drawing Algorithm, Scan-Conversion of Circle and Ellipse </span><span style="font-size: 16.8px;">(Bresenham’s Method of Circle Drawing, Midpoint Circle </span><span style="font-size: 16.8px;">Algorithm), Drawing Ellipses and Other Conics. </span></div>
<div>
(8 <span style="font-size: 16.8px;">Lectures)</span></div>
<div>
<span style="font-size: 16.8px;"><br /></span></div>
<div>
<b>Unit- II</b>  Two Dimensional Transformation: Introduction to transformations, <span style="font-size: 16.8px;">Transformation Matrix, Types of Transformations in Two Dimensional Graphics: Identity Transformation, Scaling, Reflection, </span><span style="font-size: 16.8px;">Shear Transformations, Rotation, Translation, Rotation about an </span></div>
<div>
Arbitrary Point, Combined Transformation, Homogeneous <span style="font-size: 16.8px;">Coordinates, 2D Transformations using Homogeneous Coordinates </span></div>
<div>
<span style="font-size: 16.8px;">(8 </span><span style="font-size: 16.8px;">Lectures)</span></div>
<div>
<span style="font-size: 16.8px;"><br /></span></div>
<div>
<b>Unit-III</b>  Three-dimensional transformations, Objects in Homogeneous <span style="font-size: 16.8px;">Coordinates, Three-Dimensional Transformations: Scaling, </span><span style="font-size: 16.8px;">Translation, Rotation, Shear Transformations, Reflection, World </span><span style="font-size: 16.8px;">Coordinates and Viewing Coordinates,Projection, Parallel Projection, </span></div>
<div>
Perspective Projection. </div>
<div>
<span style="font-size: 16.8px;">(8 </span><span style="font-size: 16.8px;">Lectures)</span></div>
<div>
<span style="font-size: 16.8px;"><br /></span></div>
<div>
<b>Unit-IV</b>  Viewing and Solid Area Scan-Conversion:Introduction to viewing <span style="font-size: 16.8px;">and clipping, Viewing Transformation in Two Dimensions, </span><span style="font-size: 16.8px;">Introduction to Clipping, Two-Dimensional Clipping, Point Clipping, </span><span style="font-size: 16.8px;">Line Clipping, Introduction to a Polygon Clipping, Viewing and </span></div>
<div>
Clipping in Three Dimensions, Three-Dimensional Viewing <span style="font-size: 16.8px;">Transformations, Text Clipping </span></div>
<div>
Introduction to Solid Area Scan-Conversion, Inside–Outside Test, <span style="font-size: 16.8px;">Winding Number Method and Coherence Property, Polygon Filling, </span><span style="font-size: 16.8px;">Seed Fill Algorithm, Scan-Line Algorithm, Priority Algorithm, Scan </span><span style="font-size: 16.8px;">Conversion of Character, Aliasing, Anti-Aliasing, Halftoning, </span><span style="font-size: 16.8px;">Thresholding and Dithering </span></div>
<div>
<span style="font-size: 16.8px;">(8 </span><span style="font-size: 16.8px;">Lectures)</span></div>
<div>
<span style="font-size: 16.8px;"><br /></span></div>
<div>
<b>Unit –V </b> Introduction to curves, Curve Continuity, Conic Curves, Piecewise <span style="font-size: 16.8px;">Curve Design, Parametric Curve Design, Spline Curve </span><span style="font-size: 16.8px;">Representation, Bezier Curves, B-Spline Curves, Fractals and its </span><span style="font-size: 16.8px;">applications. </span></div>
<div>
<b>Surface Design</b>: Bilinear Surfaces, Ruled Surfaces, Developable <span style="font-size: 16.8px;">Surfaces, Coons Patch, Sweep Surfaces, Surface of Revolution, </span><span style="font-size: 16.8px;">Quadric Surfaces, Constructive Solid Geometry, Bezier Surfaces, BSpline Surfaces, Subdivision Surfaces </span></div>
<div>
<span style="font-size: 16.8px;"><b>Visible Surfaces</b>: Introduction to visible and hidden surfaces, </span></div>
<div>
Coherence for visibility, Extents and Bounding Volumes, Back Face <span style="font-size: 16.8px;">Culling, Painter’s Algorithm, Z-Buffer Algorithm, Floating Horizon </span><span style="font-size: 16.8px;">Algorithm, Roberts Algorithm. </span></div>
<div>
<span style="font-size: 16.8px;">(8 </span><span style="font-size: 16.8px;">Lectures)</span></div>
<div>
<span style="font-size: 16.8px;"><br /></span></div>
<div>
<b>Unit-VI</b>  Object Rendering: Introduction Object-Rendering, Light Modeling <span style="font-size: 16.8px;">Techniques, Illumination Model, Shading, Flat Shading, Polygon </span><span style="font-size: 16.8px;">Mesh Shading, Gaurand Shading Model, Phong Shading, </span><span style="font-size: 16.8px;">Transparency Effect, Shadows, Texture and Object Representation, </span></div>
<div>
Ray Tracing, Ray Casting, Radiosity, Color Models. <span style="font-size: 16.8px;">Introduction to animation, Key-Frame Animation, Construction of </span><span style="font-size: 16.8px;">an Animation Sequence, Motion  Control Methods, Procedural </span></div>
<div>
Animation, Key-Frame Animation vs. Procedural Animation, <span style="font-size: 16.8px;">Introduction to Morphing, Three-Dimensional Morphing </span></div>
<div>
<span style="font-size: 16.8px;">(8 </span><span style="font-size: 16.8px;">Lectures)</span></div>
</span></span></div>
<div>
<span style="background-color: transparent; font-size: 16.8px; font-weight: normal;"><span style="color: #38761d; font-family: Open Sans, serif, sans-serif;"><u><br /></u></span></span></div>
<div>
<span style="background-color: transparent; font-size: 16.8px;"><span style="font-family: Open Sans, serif, sans-serif;"><div>
<b>Books</b>: </div>
<div>
<i>Computer Graphics, R. K. Maurya, John Wiley.</i></div>
<div>
<i>Mathematical elements of Computer Graphics, David F. Rogers, J. Alan Adams, </i></div>
<div>
<i>TATAMCGRAW-HILL</i></div>
<div>
<i>Procedural elements of Computer Graphics, David F. Rogers, Tata McGraw-Hill.</i></div>
<div>
<br /></div>
<div>
<b>Reference</b>: </div>
<div>
<i>Computer Graphics, Donald Hearn and M. Pauline Baker, Prentice Hall of India </i></div>
<div>
<i>Computer Graphics, Steven Harrington, McGraw-Hill </i></div>
<div>
<i>Computer Graphics Principles and Practice, J.D. Foley, A. Van Dam,S.K. Feiner and R.L. </i></div>
<div>
<i>Phillips, Addision Wesley </i></div>
<div>
<i>Principles of Interactive Computer Graphics, Willaim M. Newman, Robert F. Sproull, </i></div>
<div>
<i>TATAMCGRAW-HILL </i></div>
<div>
<i>Introduction to Computer Graphics, J.D. Foley, A. Van Dam, S.K. Feiner, J.F. Hughes and </i></div>
<div>
<i>R.L. Phillips, Addision Wesley</i></div>
<div>
<i><br /></i></div>
<div>
<b>Practical Code : USIT3P2 </b></div>
<div>
<b><br /></b></div>
<div>
Term Work: <i>Should contain at least 6 assignments (one per unit) covering the syllabus. </i></div>
<div>
<i>Suggested Practical: </i></div>
<div>
<br /></div>
<div>
Should contain at least 10 programs development in C++. Some Sample practical are listed </div>
<div>
below. </div>
<div>
<i>1. Write a program with menu optionto input the line coordinates from the user to generate a </i></div>
<div>
<i>line using Bresenham’s method and DDA algorithm. Compare the lines for their values on </i></div>
<div>
<i>the line. </i></div>
<div>
<i>2. Develop a program to generate a complete circle based on </i></div>
<div>
<i>a.  Bresenham’s circle algorithm   b. Midpoint Circle Algorithm </i></div>
<div>
<i>3. Implement the Bresenham’s/DDA algorithm for drawing line (programmer is expected to </i></div>
<div>
<i>shift the origin to the center of the screen and divide the screen into required quadrants).</i></div>
<div>
<i>4. Write a program to implement a stretch band effect. (A user will click on the screen and </i></div>
<div>
<i>drag the mouse/arrow keys over the screen coordinates. The line should be updated like </i></div>
<div>
<i>rubber-band and on the right-click gets fixed).</i></div>
<div>
<i>5. Write program to perform the following 2D and 3D transformations on the given input </i></div>
<div>
<i>figure </i></div>
<div>
<i>a.  Rotate throughθ. </i></div>
<div>
<i>b.  Reflection </i></div>
<div>
<i>c.  Scaling </i></div>
<div>
<i>d.  Translation.</i></div>
<div>
<i>6. Write a program to demonstrate shear transformation in different directions on a unit </i></div>
<div>
<i>square situated at the origin. </i></div>
<div>
<i>7. Develop a program to clip a line using Cohen-Sutherland line clipping algorithm between </i></div>
<div>
<i>(x1,y1)(x2, y2) against a window (xmin, ymin)(xmax, ymax). </i></div>
<div>
<i>8. Write a program to implement polygon filling. </i></div>
<div>
<i>9. Write a program to generate a 2D/3D fractal figures (Sierpinski triangle, Cantor set, tree </i></div>
<div>
<i>etc). </i></div>
<div>
<i>10.  Write a program to draw Bezierand B-Spline Curves with interactive user inputs for </i></div>
<div>
<i>control polygon defining the shape of the curve. </i></div>
<div>
<i>11.  Write a program to demonstrate 2D animation such as clock simulation or rising sun </i></div>
<div>
<i>12.  Write a program to implement the bouncing ball inside a defined rectangular window.</i></div>
</span></span></div>
<div>
<span style="background-color: transparent; font-size: 16.8px; font-weight: normal;"><span style="color: #38761d; font-family: Open Sans, serif, sans-serif;"><u><br /></u></span></span></div>
</div>

Computer Graphics ( SYBSCIT Sem III ) Syllabus

SYBSCIT III Semester Syllabus (Effect from the academic year 2012–2013) Subject : Computer Graphics Unit – I Introduction Co...

<div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="text-align: left;">
<span style="color: red;">SYBSCIT III Semester Syllabus (Effect from the academic year 2012–2013)</span></h2>
<h3 style="text-align: left;">
<span style="color: #38761d;"><u>Subject : Logic and Discrete Mathematics</u></span></h3>
<div>
<span style="color: red;"><br /></span></div>
<div>
<div>
<b>Unit – I </b> Set Theory: Fundamentals - Sets and subsets, Venn Diagrams, Operations on sets, Laws of Set Theory, Power Sets and Products, Partition of sets, The principle of Inclusion-Exclusion. </div>
<div>
Logic:  Propositions and Logical operations, Truth tables, Equivalence, Implications, Laws of Logic, Normal forms,Predicates and quantifiers, Mathematical Induction</div>
<div>
(8 Lectures)</div>
<div>
<br /></div>
<div>
<b>Unit- II</b>  Relations, diagraphs and lattices: – Product sets and partitions, relations and digraphs, paths in relations and digraphs, properties of relations, equivalence and partially ordered relations, computer representation of relations and digraphs, manipulation of relations, Transitive closure and Warshall’s algorithm, Posets and Hasse Diagrams, Lattice.</div>
<div>
(8 Lectures)</div>
<div>
<br /></div>
<div>
<b>Unit-III </b> Functions and Pigeon Hole Principle: Definitions and types of functions: injective, surjective and bijective, Composition, identity and inverse, Pigeon hole principle. </div>
<div>
(8 Lectures)</div>
<div>
<br /></div>
<div>
<b>Unit-IV</b>  Graphs and Trees: Graphs, Euler paths and circuits, Hamiltonian paths and circuits, Planer graphs, coloring graphs, Isomorphism of Graphs. Trees: Trees, rooted trees and path length in rooted trees, Spanning tree and Minimal Spanning tree, Isomorphism of trees, Weighted trees and Prefix Codes. </div>
<div>
(8 Lectures)</div>
<div>
<br /></div>
<div>
<b>Unit -V</b>  Algebric Structures: Algebraic structures with one binary operation – semi groups, monoids and groups, Product and quotientof algebraic structures, Isomorphism, homomorphism, automorphism, Cyclic groups, Normal sub group, codes and group codes, Algebraic structures with two binary operations – rings, integral domains and fields. Ring homomorphism and Isomorphism.</div>
<div>
(8 Lectures)</div>
<div>
<br /></div>
<div>
<b>Unit-VI</b>  Generating Functions and Recurrence relations: Series and Sequences, Generating Functions, Recurrence relations, Applications, Solving difference equations, Fibonacci.</div>
<div>
(8 Lectures)</div>
</div>
<div>
<br /></div>
<div>
<div>
<b>Books</b>: </div>
<div>
<i>Discrete mathematical structuresby B Kolman RC Busby,S Ross PHI Pvt. Ltd. </i></div>
<div>
<i>Discrete mathematical structures byRM somasundaram (PHI) EEE edition</i></div>
<div>
<br /></div>
<div>
<b>References</b>: </div>
<div>
<i>Discrete structuresby Liu, TATAMCGRAW-HILL </i></div>
<div>
<i>Digital LogicJohn M Yarbrough Brooks/cole, Thompson Learning </i></div>
<div>
<i>Discrete Mathematics and its Applications,Kenneth H. Rosen, TATAMCGRAW-HILL </i></div>
<div>
<i>Discrete Mathematics for computerscientists and Mathematicians, Joe L.Mott, Abraham </i></div>
<div>
<i>Kandel Theodore P. Baker, Prentice-Hall of India Pvt. Ltd. </i></div>
<div>
<i>Discrete MathematicsWith Applications, Susanna S. Epp, Books/Cole Publishing Company </i></div>
<div>
<i>Discrete Mathematilcs, Schaum’s Outlines Series, Seymour Lipschutz, Marc Lipson, </i></div>
<div>
<i>TATAMCGRAW-HILL </i></div>
</div>
<div>
<i><br /></i></div>
<div>
<div>
<b>Practical Code </b><i>: <b>USIT3P1 </b></i></div>
<div style="font-style: italic;">
<b>Term Work</b>: Should contain at least 6 assignments (one per unit) covering the syllabus. </div>
<div style="font-style: italic;">
<b>Tutorial</b>: At leastthree tutorials based on above syllabus must be conducted. </div>
</div>
</div>

Logic and Discrete Mathematics ( SYBSCIT Sem III ) Syllabus

SYBSCIT III Semester Syllabus (Effect from the academic year 2012–2013) Subject : Logic and Discrete Mathematics Unit – I Set Theo...

BSCIT Academic

Computer Graphics ( SYBSCIT Sem III ) Syllabus

Logic and Discrete Mathematics ( SYBSCIT Sem III ) Syllabus

Contact Form