0 valutazioniIl 0% ha trovato utile questo documento (0 voti)
26 visualizzazioni2 pagine
This document contains a test paper on computer graphics for a fourth semester computer technology course. It has three sections with multiple choice questions. Section one has four questions and students must answer three. Section two has three questions and students must answer two. Section three also has three questions and students must answer two. The questions cover topics like windowing and viewport, graphics standards, fractal surfaces, GUI, Cohen-Sutherland line clipping algorithm, Bezier curves, PHIGS, viewing transformation, B-spline curves, and Sutherland-Hodgeman polygon clipping algorithm. Students are instructed to illustrate their answers with sketches whenever needed.
This document contains a test paper on computer graphics for a fourth semester computer technology course. It has three sections with multiple choice questions. Section one has four questions and students must answer three. Section two has three questions and students must answer two. Section three also has three questions and students must answer two. The questions cover topics like windowing and viewport, graphics standards, fractal surfaces, GUI, Cohen-Sutherland line clipping algorithm, Bezier curves, PHIGS, viewing transformation, B-spline curves, and Sutherland-Hodgeman polygon clipping algorithm. Students are instructed to illustrate their answers with sketches whenever needed.
This document contains a test paper on computer graphics for a fourth semester computer technology course. It has three sections with multiple choice questions. Section one has four questions and students must answer three. Section two has three questions and students must answer two. Section three also has three questions and students must answer two. The questions cover topics like windowing and viewport, graphics standards, fractal surfaces, GUI, Cohen-Sutherland line clipping algorithm, Bezier curves, PHIGS, viewing transformation, B-spline curves, and Sutherland-Hodgeman polygon clipping algorithm. Students are instructed to illustrate their answers with sketches whenever needed.
Course Name : Computer Technology Course Code : CM4E
Semester : Fourth Semester Test : 2 Title of Subject : Computer Graphics Subject Code : 12112 Max. Marks : 25 Time : 1 hr. Section A.
Instruction: - 1) All questions are compulsory.
2) Figure to the right indicate full marks. 3) Illustrate our answer with neat sketches whenever necessary. 4) Assume suitable data if necessary.
Q1. Attempt any THREE (3*3=09)
1. Define term windowing and viewport. 2. List any four advantages of graphics standards. 3. Describe Fractal surface. 4. Describe GUI along with its any two features (component )
Q2. Attempt Any TWO (2*4=08)
1. Define Cohen-Sutherland line clipping algorithm. 2. Write a note on Bezier curve. 3. What is PHIGS? Explain
Q3. Attempt Any TWO (2*4=08)
1. Describe viewing transformation. 2. Explain the features of B-spline curve 3. Write down the Sutherland Hodgeman polygon clipping algorithm SHRI DATTA MEGHE POLYTECHIC, NAGPUR
DAPARTMENT OF COMPUTER TECHNOLOGY
Roll No.
Course Name : Computer Technology Course Code : CM4E
Semester : Fourth Semester Test : 2 Title of Subject : Computer Graphics Subject Code : 12112 Max. Marks : 25 Time : 1 hr. Section A.
Instruction: - 1) All questions are compulsory.
2) Figure to the right indicate full marks. 3) Illustrate our answer with neat sketches whenever necessary. 4) Assume suitable data if necessary.
Q1. Attempt any THREE (3*3=09)
1. Define term windowing and viewport. 2. List any four advantages of graphics standards. 3. Describe Fractal surface. 4. Describe GUI along with its any two features (component )
Q2. Attempt Any TWO (2*4=08)
1. Define Cohen-Sutherland line clipping algorithm. 2. Write a note on Bezier curve. 3. What is PHIGS? Explain
Q3. Attempt Any TWO (2*4=08)
1. Describe viewing transformation. 2. Explain the features of B-spline curve 3. Write down the Sutherland Hodgeman polygon clipping algorithm