Duration: 2 hours Max. Marks: 60
|
|
- Noreen Burns
- 5 years ago
- Views:
Transcription
1 I. (a) Determine the number of positive integers n where 1 and n is not divisible by 2 or 3 or. (b) How many integers between 1 and 2000 are divisible by 2, 3, or 7? (c) Let S = {1, 2, 3, 4,, 6, 7, 8, 9}. Determine whether or not each of the following is a partition of S. i) {{1, 3, }, {2, 6}, {4, 8, 9}} ii) {{1, 3, }, {2, 4, 6, 8}, {, 7, 9}} iii) {{1, 3, }, {2, 4, 6, 8}, {7, 9}} iv) {{S}} (d) It is known that at the University, 60% of the professors play tennis, 0% of them play bridge. 70% jog, 20% play tennis and bridge, 30% play tennis and jog, 40% play bridge and jog. If someone claimed that 20% of professors jog and play bridge and tennis, would you believe the claim? Why? (a) Draw truth tables for the following logical statements: i) ( ) ( ) ii) ( ( )) (b) Prove the following logical equivalence using laws of logic only: i) [( ) ( )] ( ) ii) ( ) [ ( )] ( ) (c) Determine whether ( ) and ( ) ( ) are logically equivalent using truth tables. (d) Prove that (3n-1) = ( ) using Mathematical Induction. III (a) Let A = {1, 2, 3} and R and S are relations on A (b) [ ] and [ ] Find Let A = {1, 2, 3, 4} Determine whether the relation R whose matrix [ ] is Reflexive, Irreflexive, Symmetric, Asymmetric, Antisymmetric or Transitive. (c) Let A = {1, 2, 3, 4} and R = {(1, 2), (2, 1), (2, 3), (3, 4)} Find transitive closure of R using Warshall s Algorithm. (d) Draw Hasse Diagram for the given relation matrix defined on set A = {1, 2, 3, 4, } Is it a chain? [ ]
2 IV (a) Obtain CNF and DNF for the following: i) ( ) ii) ( ) (b) Let A = {a, b, c, d, e} and B = {x, y, z}. Determine whether relation R from A to B is a function, give its range. i) R = {(a, y), (b, z), (c, x), (d, z), (a, z), (b, x)} ii) R = {(a, x), (b, y), (c, x)} iii) R = {(a, x), (b, z), (c, y), (d, y), (e, z)} iv) R = {(a, x), (b, x), (c, x), (d, x), (e, x)} v) R = {(a, z), (b, y), (c, z), (c, y), (c, x),(b, x)} (c) Let A = B = C. Let defined by ( ) ( ) Find f o g(x), g o f(x), f o f(x), g o g(x), f o f o f(x) (d) Let f, g, h be the functions mapping set A = {1, 2, 3, 4} into itself. f = {(1, 2), (2, 1), (3, 1), (4, 4)} g = {(1, 2), (2, 4), (3, 1), (4, 3)} h = {(1, 1), (2, 3), (3, 1), (4, 3)} Find f o g, g o h, g o g, h o h V. (a) Using Nearest neighbor method find Hamiltonian circuit for the graph shown in figure stating with vertex a. What is the weight of this path? (b) Define: i) Graph ii) Degree iii) Loop iv) Isolated Vertex v) Adjacent Vertices (c) How many nodes are necessary to construct a graph with exactly 6 edges in which each node is of degree 2? (d) Show that the maximum number of edges in a simple graph with n vertices is ( ) VI (a) Find the solution of that satisfies (b) Find the solution of (c) Find the solution of that satisfies (d) Find total solution of
3 I. (a) Write step involved in DDA algorithm. Consider the line coordinates A(,) and B(13,9).Determine the line segment using DDA algorithm (b) Describe the components of a typical computer graphics display system. Explain the construction & working of CRT displays. (c) Define Image. Also write a difference between bitmap and vector image. (d) Derive steps involved in Mid point circle drawing algorithm. I (a) Develop a single transformation matrix which does the following i) Scale by 2, 3 in x and y direction ii) Rotates by an angle 30 0 in clockwise direction iii) Translates 4 units in the xdirection (b) Derive the matrix of rotation by an angle Ө in clockwise direction. (c) Derive the transformation matrix to magnify the triangle A(0,0),B(1,2),C(3,2) to twice its size. Draw the same. (d) Write note on 2D Shear transformation. (a) Shear a unit cube situated at origin in xz plane by factor 2, 3 in x and y direction respectively. (b) What is homogeneous coordinate system? Write scaling, translation 3D matrix in homogeneous form. (c) Rotate an object about z axis with coordinates A(1,1,), B(4,1,1),C(,1,4) and D(6,0,0) by and angle 90 degree. (d) Reflect the object about the x=0 plane, where object is having vector coordinates A[ ], B[ ], C[ ],D[ ]. (a) Explain why the Sutherland-Hodgman algorithm works only for convex polygon regions. also suggest modifications to clip concave polygon. (b) Explain Inside-outside test method test with example (c) Write a short note on 2D Viewing pipeline. (d) Clip line p1p2 having coordinates p1 (-10, 0),p2 (30,80 ) against window (Xmin= -30,Ymin= 10), (Xmax= 20,Ymax= 60) using Cohen-Sutherland line clipping algorithm. V. (a) Generate a B-spline curve having polygon vertices p1(1,1), p2(4,3), p3(8,),(8,10) { X=[ ] and N 1,4 (u)=(1-u) 3,N 2,4 (u)=(1-u) 2 *u, N 3,4 =(1-u)*u 2,N 4,4 =u 2 } (b) Explain Painter s algorithm for hidden surface removal. Also give its advantages and disadvantages. (c) Write short note on Bilinear surfaces. (d) Explain following terms i) Spane line coherence ii) Object coherence iii) frame ccoherence iv) depth coherence. (a) What is shadow? Explain different types of shadows. (b) How to put realism in a scene?explain 2 types of colour model. (c) Explain how phong shading technique is works. Also state advantages and disadvantages of phong shading technique (d) Explain term visibility invisible surfaces. Explain two approaches used to determine hidden surfaces
4 I. (a) Explain the following Functions with syntax and example i) MONTHS_BETWEEN ii)next_day iii) SQRT iv) SIGN v)trunc (b) What is a predicate? Explain its different types (c) What are the guidelines for GROUP BY clause (d) What is a view? Explain its types with example I (a) What is a privilege? Explain its types with example. (b) Explain multiple column subqueries with suitable example (c) What is set operators? Explain its type with example (d) What is correlated subquery? Explain scalar subquery with example (a) Explain the advantages of PL/SQL (b) What is an identifier? Write a note on Bind variable. (c) Write a short note on comments in PL/SQL (d) Explain PL/SQL Block structure. (a) Explain IF-THEN-ELSE statement with example. (b) write a PL/SQL program to reverse the nos from 10 to 1 using FOR loop (c) Explain any collection methods with example. (d) What are cursors? Write a short note on classification of cursors. V. (a) What is a procedure? Explain with syntax. (b) List the advantages of stored functions and procedure. Also write the syntax for dropping a function. (c) What are packages? What are its advantages? (d) create a procedure raise_salary to update the emp table, raise the salary by 10% using IN parameter. (a) Explain the execution flow of SQL. (b) Define triggers. List the guidelines for designing triggers. (c) Distinguish between statement level and row level triggers. (d) Explain the INSTEAD of trigger with syntax.
5 I. (a) What is object oriented programming? How is it different from procedure oriented programming? (b) Explain the basic concepts of OOPs. (c) Explain the benefits of OOP. (d) How does object oriented approach differ from object based approach. I (a) Can a class contain multiple constructors? If yes, explain with an example. (b) Short note on destructor. (c) Explain static member functions with an example. (d) What is a class? Explain the general form of class declaration. (a) Explain overloading of unary operator. (b) Explain this pointer in detail. (c) Explain overloading of increment operation. (d) What are friend functions? Write a program using friend function to find largest of 2 numbers. (a) Explain multilevel inheritance with an example. (b) How are constructors used in derived class? (c) Explain read() and write() function. (d) Explain how to open and close a file with an example. V. (a) Explain showpos, showpoint flag with an example. (b) What is a stream? Explain C++ stream classes. (c) How can we design our own manipulators? (d) Both cin and getline() function can be used for reading a string. Comment. (a) What are function templates? Write a program using function template 2 swap 2 integer and 2 float numbers. (b) What is a vector? What are the functions of vector class? (c) Explain maps with an example. (d) Explain use of function objects in algorithms.
6 I. (a) Explain operating system with diagram (b) Write a short note on i) Assembler ii) Linker (c) Discuss real time system (d) Write a short note on cluster system. I (a) Discuss kernel concept (b) Discuss layered approach structure (c) Discuss system call with example (d) Write a short note on system boot (a) Discuss peterson s algorithm (b) Discuss process states (c) Explain multi-threading models (d) Discuss threading issues (a) Discuss concept of swapping (b) Assume there are 4 fixed partitions 1k, 2k, 4k, 8k in the main memory for user. Separate memory is allocated for operating system is 200k then show the memory map of MFT with single queue as well as memory map for MFT with multiple queue. 1. Job 1 need 3.7k memory 2. Job 2 need 1.2 k memory 3. Job 3 need 2k memory 4. Job 4 need 7k memory. Job 2 over 6. Job 3 over 7. Job needs 6 k memory (c) Explain demand paging algorithms (d) Find out page removal algorithms for 3 frames and 4 frames. If reference strings is as follows 1,2,3,4,1,2,,1,2,3,4, Use MRU algorithms. V. (a) Discuss function that is performed on file. (b) Discuss necessary condition required for deadlock creation. (c) Write a short note on i) Bit vector ii) Linked list (d) Discuss deadlock prevention (a) Discuss security problem (b) Discuss DOS attack. (c) Explain virus and it s types. (d) Explain password and it s rules and characteristics.
Station Road, Datar Colony, Bhandup (East), Mumbai Tel.: / TIME TABLE BSC IT SUBJECT
Managed By : UTTARI BHARAT SABHA (Regd.) EGE I Station Road, Datar Colony, Bhandup (East), Mumbai -400 042. Tel.: 2566 6691 /2566 2921 Email: info@radav.org TIME TABLE BSC IT 2015-16 SY BSC IT SEMESTER
More informationSRM INSTITUTE OF SCIENCE AND TECHNOLOGY
SRM INSTITUTE OF SCIENCE AND TECHNOLOGY DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK SUB.NAME: COMPUTER GRAPHICS SUB.CODE: IT307 CLASS : III/IT UNIT-1 2-marks 1. What is the various applications
More informationModule Contact: Dr Stephen Laycock, CMP Copyright of the University of East Anglia Version 1
UNIVERSITY OF EAST ANGLIA School of Computing Sciences Main Series PG Examination 2013-14 COMPUTER GAMES DEVELOPMENT CMPSME27 Time allowed: 2 hours Answer any THREE questions. (40 marks each) Notes are
More informationBCA (Part II) EXAMINATION 2008 C++ PROGRAMMING Max Time : 3 Hours Max. Marks : 50
C++ PROGRAMMING 1. (a) What are the characteristics of object-oriented language? What are the advantages of using OOPS? (b) What are the Application of Public, Private, and Protected keywords? Explain.
More informationCOMPUTER GRAPHICS, MULTIMEDIA AND ANIMATION, Second Edition (with CD-ROM) Malay K. Pakhira
Computer Graphics, Multimedia and Animation SECOND EDITION Malay K. Pakhira Assistant Professor Department of Computer Science and Engineering Kalyani Government Engineering College Kalyani New Delhi-110001
More informationPrinciples of Computer Graphics. Lecture 3 1
Lecture 3 Principles of Computer Graphics Lecture 3 1 Why we learn computer graphics? Appreciate what we see The knowledge can applied when we want to develop specific engineering program that requires
More informationB.Sc. (Part II) (Information Technology) EXAMINATION, 2009
1 COMPUTER ORIENTED STATISTICAL METHODS (B.Sc. I.T.-21) 1. What are the main characteristics of Numerical Computation? Explain them clearly. ( 10) 2. Factorize the matrix : as a product of lower and an
More informationOXFORD ENGINEERING COLLEGE (NAAC Accredited with B Grade) DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING LIST OF QUESTIONS
OXFORD ENGINEERING COLLEGE (NAAC Accredited with B Grade) DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING LIST OF QUESTIONS YEAR/SEM.: III/V STAFF NAME: T.ELANGOVAN SUBJECT NAME: Computer Graphics SUB. CODE:
More information(DMCA101) M.C.A. DEGREE EXAMINATION, MAY First Year INFORMATION TECHNOLOGY
(DMCA101) M.C.A. DEGREE EXAMINATION, MAY - 2017 First Year INFORMATION TECHNOLOGY Time : 3 Hours Maximum Marks : 70 SECTION - A (3 15 = 45) Answer any three of the following Q1) Discuss business pressures
More informationCS602 MCQ,s for midterm paper with reference solved by Shahid
#1 Rotating a point requires The coordinates for the point The rotation angles Both of above Page No 175 None of above #2 In Trimetric the direction of projection makes unequal angle with the three principal
More informationI BCS-031 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination. June, 2015 BCS-031 : PROGRAMMING IN C ++
No. of Printed Pages : 3 I BCS-031 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination 05723. June, 2015 BCS-031 : PROGRAMMING IN C ++ Time : 3 hours Maximum Marks : 100 (Weightage 75%)
More informationPart 3: 2D Transformation
Part 3: 2D Transformation 1. What do you understand by geometric transformation? Also define the following operation performed by ita. Translation. b. Rotation. c. Scaling. d. Reflection. 2. Explain two
More information(a) rotating 45 0 about the origin and then translating in the direction of vector I by 4 units and (b) translating and then rotation.
Code No: R05221201 Set No. 1 1. (a) List and explain the applications of Computer Graphics. (b) With a neat cross- sectional view explain the functioning of CRT devices. 2. (a) Write the modified version
More informationInstitutionen för systemteknik
Code: Day: Lokal: M7002E 19 March E1026 Institutionen för systemteknik Examination in: M7002E, Computer Graphics and Virtual Environments Number of sections: 7 Max. score: 100 (normally 60 is required
More informationII/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION. Discrete Mathematical Structures. Answer ONE question from each unit.
14CS IT302 November,2016 II/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION Common for CSE & IT Discrete Mathematical Structures (4X12=48 Marks) 1. Answer all questions (1X12=12 Marks) a (Pv~P) is
More informationCourse Title: Computer Graphics Course no: CSC209
Course Title: Computer Graphics Course no: CSC209 Nature of the Course: Theory + Lab Semester: III Full Marks: 60+20+20 Pass Marks: 24 +8+8 Credit Hrs: 3 Course Description: The course coversconcepts of
More informationCHAPTER 1 Graphics Systems and Models 3
?????? 1 CHAPTER 1 Graphics Systems and Models 3 1.1 Applications of Computer Graphics 4 1.1.1 Display of Information............. 4 1.1.2 Design.................... 5 1.1.3 Simulation and Animation...........
More informationGraphics and Interaction Rendering pipeline & object modelling
433-324 Graphics and Interaction Rendering pipeline & object modelling Department of Computer Science and Software Engineering The Lecture outline Introduction to Modelling Polygonal geometry The rendering
More informationCHETTINAD COLLEGE OF ENGINEERING & TECHNOLOGY CS2401 COMPUTER GRAPHICS QUESTION BANK
CHETTINAD COLLEGE OF ENGINEERING & TECHNOLOGY DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS2401 COMPUTER GRAPHICS QUESTION BANK PART A UNIT I-2D PRIMITIVES 1. Define Computer graphics. 2. Define refresh
More informationRoll No. :... Invigilator's Signature : GRAPHICS AND MULTIMEDIA. Time Allotted : 3 Hours Full Marks : 70
Name : Roll No. :.... Invigilator's Signature :.. CS/MCA/SEM-4/MCA-402/2011 2011 GRAPHICS AND MULTIMEDIA Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks. Candidates
More informationEnd-Term Examination
Paper Code: MCA-108 Paper ID : 44108 Second Semester [MCA] MAY-JUNE 2006 Q. 1 Describe the following in brief :- (3 x 5 = 15) (a) QUADRATIC SURFACES (b) RGB Color Models. (c) BSP Tree (d) Solid Modeling
More informationLesson Plan. Name of Faculty: Sana Bharti. Discipline: MCA. Semester: 4 th. Subject: Data Mining and Warehousing (MCA-16-43)
Lesson Plan Name of Faculty: Sana Bharti Discipline: MCA Semester: 4 th Subject: Data Mining and Warehousing (MCA-16-43) Lesson Plan Duration: 15 Weeks Workload (Lecture) Per Week: 4 Lecture Per Week Week
More informationTime : 3 hours. Full Marks : 75. Own words as far as practicable. The questions are of equal value. Answer any five questions.
XEV (H-3) BCA (6) 2 0 1 0 Time : 3 hours Full Marks : 75 Candidates are required to give their answers in their Own words as far as practicable. The questions are of equal value. Answer any five questions.
More informationM.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following.
Paper I INFORMATION TECHNOLOGY Answer any THREE of the following. 1. Explain Architecture of computer in detail. 2. Explain in detail about Input and Output technologies. 3. What is MODEM? What factors
More informationQUESTION BANK 10CS65 : COMPUTER GRAPHICS AND VISUALIZATION
QUESTION BANK 10CS65 : COMPUTER GRAPHICS AND VISUALIZATION INTRODUCTION OBJECTIVE: This chapter deals the applications of computer graphics and overview of graphics systems and imaging. UNIT I 1 With clear
More information1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order).
Exercises Exercises 1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order). a) {(1, 1), (1, 2), (1, 3)} b) {(1, 2), (2, 1), (2, 2), (3,
More informationClipping and Scan Conversion
15-462 Computer Graphics I Lecture 14 Clipping and Scan Conversion Line Clipping Polygon Clipping Clipping in Three Dimensions Scan Conversion (Rasterization) [Angel 7.3-7.6, 7.8-7.9] March 19, 2002 Frank
More informationCS 130 Final. Fall 2015
CS 130 Final Fall 2015 Name Student ID Signature You may not ask any questions during the test. If you believe that there is something wrong with a question, write down what you think the question is trying
More informationADMINISTRATIVE MANAGEMENT COLLEGE
First Semester ADMINISTRATIVE MANAGEMENT COLLEGE BACHELOR OF COMPUTER APPLICATION COURSE OUTCOME (CO) Problem solving techniques Using C CO 1: Understand the basic concepts of programming, software and
More informationCS184 : Foundations of Computer Graphics Professor David Forsyth Final Examination
CS184 : Foundations of Computer Graphics Professor David Forsyth Final Examination (Total: 100 marks) Figure 1: A perspective view of a polyhedron on an infinite plane. Cameras and Perspective Rendering
More informationCS2401 COMPUTER GRAPHICS ANNA UNIV QUESTION BANK
CS2401 Computer Graphics CS2401 COMPUTER GRAPHICS ANNA UNIV QUESTION BANK CS2401- COMPUTER GRAPHICS UNIT 1-2D PRIMITIVES 1. Define Computer Graphics. 2. Explain any 3 uses of computer graphics applications.
More informationClipping & Culling. Lecture 11 Spring Trivial Rejection Outcode Clipping Plane-at-a-time Clipping Backface Culling
Clipping & Culling Trivial Rejection Outcode Clipping Plane-at-a-time Clipping Backface Culling Lecture 11 Spring 2015 What is Clipping? Clipping is a procedure for spatially partitioning geometric primitives,
More informationRasterization. MIT EECS Frédo Durand and Barb Cutler. MIT EECS 6.837, Cutler and Durand 1
Rasterization MIT EECS 6.837 Frédo Durand and Barb Cutler MIT EECS 6.837, Cutler and Durand 1 Final projects Rest of semester Weekly meetings with TAs Office hours on appointment This week, with TAs Refine
More informationMadhya Pradesh Bhoj (Open) University, Bhopal
Subject- Optimization Techniques Maximum Marks: 20 Q.1 Explain the concept, scope and tools of O.R. Q.2 Explain the Graphical method for solving Linear Programming Problem. Q.3 Discuss the Two phase method
More informationCS184 : Foundations of Computer Graphics Professor David Forsyth Final Examination (Total: 100 marks)
CS184 : Foundations of Computer Graphics Professor David Forsyth Final Examination (Total: 100 marks) Cameras and Perspective Figure 1: A perspective view of a polyhedron on an infinite plane. Rendering
More informationTotal No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.
(DMCS01) Total No. of Questions : 18] [Total No. of Pages : 02 M.Sc. DEGREE EXAMINATION, DEC. 2016 First Year COMPUTER SCIENCE Data Structures Time : 3 Hours Maximum Marks : 70 Section - A (3 x 15 = 45)
More informationRani Durgavati Vishwavidyalaya Jabalpur (M.P.) (UICSA) Master of Computer Application (MCA) Practical List of. MCA III SEM Session -2010
Rani Durgavati Vishwavidyalaya Jabalpur (M.P.) (UICSA) Master of Computer Application (MCA) Practical List of MCA III SEM Session -2010 MCA-301 - Object Oriented Programming in C++ 1. WAP to generate Fibonacci
More informationTEACHING PLAN FOR DEGREE COLLEGE FOR THE YEAR
SVKM's Narsee Monjee College of Commerce and Economics JVPD, Vile Parle (West), Mumbai 400 056. TEACHING PLAN FOR DEGREE COLLEGE FOR THE YEAR 2015-2016 Department : BSc IT Class :- Subject: Month 1 08/06
More information1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices.
(DMCA 101) ASSIGNMENT - 1, MAY-2014. PAPER- I : INFORMATION TECHNOLOGY 1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices. 3) What is software?
More informationAbout the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Computer Graphics
r About the Tutorial To display a picture of any size on a computer screen is a difficult process. Computer graphics are used to simplify this process. Various algorithms and techniques are used to generate
More informationM.C.A. DEGREE EXAMINATION, MAY First Year Paper - I : INFORMATION TECHNOLOGY. Time : 03 Hours Maximum Marks : 75
M.C.A. DEGREE EXAMINATION, MAY - 2013 First Year Paper - I : INFORMATION TECHNOLOGY (DMCA 101) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer any Three of the following 1) What is the
More informationSRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR
SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR 603203 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS QUESTION BANK (2017-2018) Course / Branch : M.Sc CST Semester / Year : EVEN / II Subject Name
More informationFROM VERTICES TO FRAGMENTS. Lecture 5 Comp3080 Computer Graphics HKBU
FROM VERTICES TO FRAGMENTS Lecture 5 Comp3080 Computer Graphics HKBU OBJECTIVES Introduce basic implementation strategies Clipping Scan conversion OCTOBER 9, 2011 2 OVERVIEW At end of the geometric pipeline,
More informationThe Traditional Graphics Pipeline
Last Time? The Traditional Graphics Pipeline Participating Media Measuring BRDFs 3D Digitizing & Scattering BSSRDFs Monte Carlo Simulation Dipole Approximation Today Ray Casting / Tracing Advantages? Ray
More informationWrite C++/Java program to draw line using DDA and Bresenham s algorithm. Inherit pixel class and Use function overloading.
Group A Assignment No A1. Write C++/Java program to draw line using DDA and Bresenham s algorithm. Inherit pixel class and Use function overloading. Aim: To draw line using DDA and Bresenham s algorithm
More informationRenderer Implementation: Basics and Clipping. Overview. Preliminaries. David Carr Virtual Environments, Fundamentals Spring 2005
INSTITUTIONEN FÖR SYSTEMTEKNIK LULEÅ TEKNISKA UNIVERSITET Renderer Implementation: Basics and Clipping David Carr Virtual Environments, Fundamentals Spring 2005 Feb-28-05 SMM009, Basics and Clipping 1
More informationKRISTU JYOTI COLLEGE OF MANAGEMENT & TECHNOLOGY QUESTION BANK BCA SEMESTER III Computer graphics Part A (2 marks questions)
KRISTU JYOTI COLLEGE OF MANAGEMENT & TECHNOLOGY QUESTION BANK 2018 BCA SEMESTER III Computer graphics Part A (2 marks questions) 1. What do mean by refreshing of a screen? 2. Define computer graphics 3.
More informationME COMPUTER AIDED DESIGN COMPUTER AIDED DESIGN 2 MARKS Q&A
ME6501 - COMPUTER AIDED DESIGN COMPUTER AIDED DESIGN 2 MARKS Q&A Unit I 1. What is CAD? Computer aided design (CAD) is the technology concerned with the use of computer systems to assist the creation,
More informationCs602-computer graphics MCQS MIDTERM EXAMINATION SOLVED BY ~ LIBRIANSMINE ~
Cs602-computer graphics MCQS MIDTERM EXAMINATION SOLVED BY ~ LIBRIANSMINE ~ Question # 1 of 10 ( Start time: 08:04:29 PM ) Total Marks: 1 Sutherland-Hodgeman clipping algorithm clips any polygon against
More informationVALLIAMMAI ENGINEERING COLLEGE
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK B.E. - Electrical and Electronics Engineering IV SEMESTER CS6456 - OBJECT ORIENTED
More informationBCA (Part II) EXAMINATION, 2009 C++ PROGRAMMING Time allowed: Three Hours Maximum Marks: 50 Attempt any five questions
C++ PROGRAMMING Attempt any five questions 1. (a) What is encapsulation? Why is data considered safe if encapsulated? How are the terms abstraction and encapsulation related. 4 (b) What do you understand
More informationThe Traditional Graphics Pipeline
Final Projects Proposals due Thursday 4/8 Proposed project summary At least 3 related papers (read & summarized) Description of series of test cases Timeline & initial task assignment The Traditional Graphics
More informationB.Sc. Final B.SC. PART-III PAPER I COMPUTER ORGANIZATION II
TEACHING & EXAMINATION SCHEME For the Examination - 2015 COMPUTER SCIENCE B.Sc. Final THEORY Pd/W Exam. Max. (45mts.) Hours Marks 150 CS.301 Paper I Computer Organisation II 2 3 50 CS.302 Paper II Programming
More informationCS602 Midterm Subjective Solved with Reference By WELL WISHER (Aqua Leo)
CS602 Midterm Subjective Solved with Reference By WELL WISHER (Aqua Leo) www.vucybarien.com Question No: 1 What are the two focusing methods in CRT? Explain briefly. Page no : 26 1. Electrostatic focusing
More information2D Image Synthesis. 2D image synthesis. Raster graphics systems. Modeling transformation. Vectorization. u x u y 0. o x o y 1
General scheme of a 2D CG application 2D Image Synthesis Balázs Csébfalvi modeling image synthesis Virtual world model world defined in a 2D plane Department of Control Engineering and Information Technology
More informationCS452/552; EE465/505. Clipping & Scan Conversion
CS452/552; EE465/505 Clipping & Scan Conversion 3-31 15 Outline! From Geometry to Pixels: Overview Clipping (continued) Scan conversion Read: Angel, Chapter 8, 8.1-8.9 Project#1 due: this week Lab4 due:
More informationPROGRAMMING IN C AND C++:
PROGRAMMING IN C AND C++: Week 1 1. Introductions 2. Using Dos commands, make a directory: C:\users\YearOfJoining\Sectionx\USERNAME\CS101 3. Getting started with Visual C++. 4. Write a program to print
More informationRealtime 3D Computer Graphics Virtual Reality
Realtime 3D Computer Graphics Virtual Reality From Vertices to Fragments Overview Overall goal recapitulation: Input: World description, e.g., set of vertices and states for objects, attributes, camera,
More informationCS602- Computer Graphics Solved MCQS From Midterm Papers. MIDTERM EXAMINATION Spring 2013 CS602- Computer Graphics
CS602- Computer Graphics Solved MCQS From Midterm Papers Dec 18,2013 MC100401285 Moaaz.pk@gmail.com Mc100401285@gmail.com PSMD01 Question No: 1 ( Marks: 1 ) - Please choose one DDA abbreviated for. Discrete
More informationEND TERM EXAMINATION
END TERM EXAMINATION THIRD SEMESTER [BCA] DECEMBER 2007 Paper Code: BCA 209 Subject: Object Oriented Programming Time: 3 hours Maximum Marks: 75 Note: Attempt all questions. Internal choice is indicated.
More informationCOMP30019 Graphics and Interaction Rendering pipeline & object modelling
COMP30019 Graphics and Interaction Rendering pipeline & object modelling Department of Computer Science and Software Engineering The Lecture outline Introduction to Modelling Polygonal geometry The rendering
More informationLecture outline. COMP30019 Graphics and Interaction Rendering pipeline & object modelling. Introduction to modelling
Lecture outline COMP30019 Graphics and Interaction Rendering pipeline & object modelling Department of Computer Science and Software Engineering The Introduction to Modelling Polygonal geometry The rendering
More informationCS 6456 OBJCET ORIENTED PROGRAMMING IV SEMESTER/EEE
CS 6456 OBJCET ORIENTED PROGRAMMING IV SEMESTER/EEE PART A UNIT I 1. Differentiate object oriented programming from procedure oriented programming. 2. Define abstraction and encapsulation. 3. Differentiate
More informationASSIGNMENT - 1 M.C.A.DEGREE EXAMINATION, MAY 2019 Second Year SOFTWARE ENGINEERING. Maximum : 30 MARKS Answer ALL questions.
ASSIGNMENT - 1 M.C.A.DEGREE EXAMINATION, MAY 2019 SOFTWARE ENGINEERING (DMCA201) Q1) Explain Spiral model with suitable example. Also explain how it differs from Software Prototyping model. Q2) a) Draw
More informationThe Traditional Graphics Pipeline
Last Time? The Traditional Graphics Pipeline Reading for Today A Practical Model for Subsurface Light Transport, Jensen, Marschner, Levoy, & Hanrahan, SIGGRAPH 2001 Participating Media Measuring BRDFs
More informationVALLIAMMAI ENGINEERING COLLEGE
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF MECHANICAL ENGINEERING QUESTION BANK M.E: CAD/CAM I SEMESTER ED5151 COMPUTER APPLICATIONS IN DESIGN Regulation 2017 Academic
More informationJAIPUR NATIONAL UNIVERSITY, JAIPUR
Paper Code: MCA - 101 Paper Title: Fundamental of Computer Master of Computer Application (MCA) (i) Differentiate between data and information. Which is more useful to the people and why? (ii) Explain
More informationR. C. TECHNICAL INSTITUTE, SOLA
R. C. TECHNICAL INSTITUTE, SOLA Information Technology Department SEMESTER 3 Assignments list for all subjects Subject Name: DIGITAL MEMORY SYSTEMS Subject Code: 3331601 ASSIGNMENT-1- Digital Memory Systems
More informationKINGS GRAPHICS AND MULTIMEDIA DEPARTMENT OF COMPUTER SCIENCE AND ENGG. OUTPUT PRIMITIVES Part-A (2-MARKS)
KINGS COLLEGE OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE AND ENGG QUESTION BANK YEAR/ SEM : III/ VI SUB. CODE : SUBJECT NAME: UNIT- I OUTPUT PRIMITIVES 1. What is the purpose of presentation graphics?
More informationComputer Graphics. Apurva A. Desai
Computer Graphics Apurva A. Desai COMPUTER GRAPHICS Apurva A. Desai Professor and Head Department of Computer Science Veer Narmad South Gujarat University Surat New Delhi-110001 2008 COMPUTER GRAPHICS
More informationEXAMINATIONS 2017 TRIMESTER 2
EXAMINATIONS 2017 TRIMESTER 2 CGRA 151 INTRODUCTION TO COMPUTER GRAPHICS Time Allowed: TWO HOURS CLOSED BOOK Permitted materials: Silent non-programmable calculators or silent programmable calculators
More informationSRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR
SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR 603203 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS QUESTION BANK (2017-2018) Course / Branch : BCA Semester / Year : IV / II Subject Name : Computer
More informationViewing with Computers (OpenGL)
We can now return to three-dimension?', graphics from a computer perspective. Because viewing in computer graphics is based on the synthetic-camera model, we should be able to construct any of the classical
More informationVALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year & Semester : III Year, V Semester Section : CSE - 1 & 2 Subject Code : CS6504 Subject
More informationLIST OF EXPERIMENTS. (1) (Office Automation)
LIST OF EXPERIMENTS (1) 310042 (Office Automation) 1 Computer Fundamentals 2 DOS Command 3 Execute DOS Command using examples. 4 Introduction to windows & familarity with controls. 5 Introduction of Ms-Office
More informationSilver Oak Engineering College and technology Information Technology Department
Silver Oak Engineering College and technology Information Technology Department Mid Semester 2 Syllabus 4th Semester IT Subject Code Subject Name Syllabus 2140709 COMPUTER NETWORKS Unit 3- Transport Layer
More informationB.Sc. (Part II) (Information Technology) EXAMINATION, 2008
1 BCA (I) 2010 B.Sc. (Part II) (Information Technology) EXAMINATION, 2008 COMPUTER ORIENTED STATISTICAL METHODS (B.Sc. I.T.-21) Time allowed : Three Hours Maximum Marks : 50 Attempt any Five question.
More informationThe University of Calgary
The University of Calgary Department of Computer Science Final Examination, Questions ENEL/CPSC 555 Computer Graphics Time: 2 Hours Closed Book, calculators are permitted. The questions carry equal weight.
More informationComputer Graphics: 7-Polygon Rasterization, Clipping
Computer Graphics: 7-Polygon Rasterization, Clipping Prof. Dr. Charles A. Wüthrich, Fakultät Medien, Medieninformatik Bauhaus-Universität Weimar caw AT medien.uni-weimar.de Filling polygons (and drawing
More informationExample Examination 2IV
Example Examination IV60-04071 (translated version IV10 4 july 01, 14:00-17:00) This examination consist of four questions with in total 16 subquestion. Each subquestion weighs equally. In all cases: EXPLAIN
More informationGeneral Hidden Surface Removal Algorithms. Binghamton University. EngiNet. Thomas J. Watson. School of Engineering and Applied Science CS 460/560
Binghamton University EngiNet State University of New York EngiNet Thomas J. Watson School of Engineering and Applied Science WARNING All rights reserved. No Part of this video lecture series may be reproduced
More informationCS/IT DIGITAL LOGIC DESIGN
CS/IT 214 (CR) Total No. of Questions :09] [Total No. of Pages : 02 II/IV B.Tech. DEGREE EXAMINATIONS, DECEMBER- 2016 First Semester CS/IT DIGITAL LOGIC DESIGN Time: Three Hours 1. a) Flip-Flop Answer
More informationShort Notes of CS201
#includes: Short Notes of CS201 The #include directive instructs the preprocessor to read and include a file into a source code file. The file name is typically enclosed with < and > if the file is a system
More informationPolygon Partitioning. Lecture03
1 Polygon Partitioning Lecture03 2 History of Triangulation Algorithms 3 Outline Monotone polygon Triangulation of monotone polygon Trapezoidal decomposition Decomposition in monotone mountain Convex decomposition
More informationS Y B Voc Software Development Syllabus
S Y B Voc Software Development Syllabus Course Level Job Roles Course Name: Pattern: Examination Pattern: Eligibility: Medium of Instruction: NSQF Level-VI 1. Jr. Software Developer 2. Trainer Software
More informationComputer Graphics (CS 543) Lecture 9 (Part 2): Clipping. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)
Computer Graphics (CS 543) Lecture 9 (Part 2): Clipping Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) OpenGL Stages After projection, several stages before objects drawn
More informationCS201 - Introduction to Programming Glossary By
CS201 - Introduction to Programming Glossary By #include : The #include directive instructs the preprocessor to read and include a file into a source code file. The file name is typically enclosed with
More information2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into
2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into the viewport of the current application window. A pixel
More informationCOMP30019 Graphics and Interaction Scan Converting Polygons and Lines
COMP30019 Graphics and Interaction Scan Converting Polygons and Lines Department of Computer Science and Software Engineering The Lecture outline Introduction Scan conversion Scan-line algorithm Edge coherence
More informationCS1354 GRAPHICS AND MULTIMEDIA DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK SUB CODE / SUBJECT: CS1354 GRAPHICS AND MULTIMEDIA.
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK SUB CODE / SUBJECT: CS1354 GRAPHICS AND MULTIMEDIA YEAR / SEM: II / III Unit 1 OUTPUT PRIMITIVES 1. Define 2D rotation. 2. Write the 2D transformation
More information3D Rendering Pipeline (for direct illumination)
Clipping 3D Rendering Pipeline (for direct illumination) 3D Primitives 3D Modeling Coordinates Modeling Transformation Lighting 3D Camera Coordinates Projection Transformation Clipping 2D Screen Coordinates
More information3D Polygon Rendering. Many applications use rendering of 3D polygons with direct illumination
Rendering Pipeline 3D Polygon Rendering Many applications use rendering of 3D polygons with direct illumination 3D Polygon Rendering What steps are necessary to utilize spatial coherence while drawing
More informationPoints and lines, Line drawing algorithms. Circle generating algorithms, Midpoint circle Parallel version of these algorithms
Jahangirabad Institute Of Technology Assistant Prof. Ankur Srivastava COMPUTER GRAPHICS Semester IV, 2016 MASTER SCHEDULE Unit-I Unit-II Class 1,2,3,4 Mon, Jan19,Tue20,Sat23,Mon 25 Class 5 Wed, Jan 27
More informationMET71 COMPUTER AIDED DESIGN
UNIT - II BRESENHAM S ALGORITHM BRESENHAM S LINE ALGORITHM Bresenham s algorithm enables the selection of optimum raster locations to represent a straight line. In this algorithm either pixels along X
More informationCERTIFICATE IN WEB PROGRAMMING
COURSE DURATION: 6 MONTHS CONTENTS : CERTIFICATE IN WEB PROGRAMMING 1. PROGRAMMING IN C and C++ Language 2. HTML/CSS and JavaScript 3. PHP and MySQL 4. Project on Development of Web Application 1. PROGRAMMING
More informationOverview. Pipeline implementation I. Overview. Required Tasks. Preliminaries Clipping. Hidden Surface removal
Overview Pipeline implementation I Preliminaries Clipping Line clipping Hidden Surface removal Overview At end of the geometric pipeline, vertices have been assembled into primitives Must clip out primitives
More informationDesign and implement a program to solve a real-world problem using the language idioms, data structures,, and standard library.
Course Outcome Second Year of B.Sc. IT Program Semester I Course Number: USIT301 Course Name: Python Programming Understanding basic fundamentals of programming using Python. Recognize and construct common
More informationComputer Graphics and GPGPU Programming
Computer Graphics and GPGPU Programming Donato D Ambrosio Department of Mathematics and Computer Science and Center of Excellence for High Performace Computing Cubo 22B, University of Calabria, Rende 87036,
More informationEinführung in Visual Computing
Einführung in Visual Computing 186.822 Rasterization Werner Purgathofer Rasterization in the Rendering Pipeline scene objects in object space transformed vertices in clip space scene in normalized device
More informationCIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)
By the end of this course, students should CIS 1.5 Course Objectives a. Understand the concept of a program (i.e., a computer following a series of instructions) b. Understand the concept of a variable
More information