Which of the following is not a basic primitive of the Graphics Kernel System (GKS)?
| A. | POLYLINE |
| B. | POLYDRAW |
| C. | FILL AREA |
| D. | POLYMARKER |
|
Option: B Explanation :
graphics kernel system(GKS) is based on four basic primitive : Click on Discuss to view users comments. |
Which of the following statement(s) is/are incorrect?
(a) Mapping the co-ordinates of the points and lines that form the picture into the appropriate co-ordinates on the device or workstation is known as viewing transformation.
(b) The right-handed Cartesian co-ordinates system in whose co-ordinates we describe the picture is known as world co-ordinate system.
(c) The co-ordinate system that corresponds to the device or workstation where the image is to be displayed is known as physical device co-ordinate system.
(d) Left - handed co-ordinate system in which the display area of the virtual display device corresponds to the unit (|x|) square whose lower left-hand corner is at the origin of the co-ordinate system, is known as normalized device co-ordinate system.
Codes:
| A. | (a) only |
| B. | (a) and (b) |
| C. | (c) only |
| D. | (d) only |
|
Option: D Explanation :
Normalized device coordinates (NDCs) make up a coordinate system that describes positions on a virtual plotting device. The lower left corner corresponds to (0,0), and the upper right corner corresponds to (1,1). Click on Discuss to view users comments. |
Match the following:
|
List – I |
List – II |
|
(a) Flood Gun |
(i) An electron gun designed to flood the entire screen with electrons. |
|
(b) Collector |
(ii) Partly energized by flooding gun, stores the charge generated by the writing gun. |
|
(c) Ground |
(iii) Used to discharge the collector. |
|
(d) Phosphorus grains |
(iv) Used in memory - tube display and similar to those used in standard CRT. |
|
(e) Writing Gun System |
(v) Used in memory - tube display and basically the same as the electron gun used in a conventional CRT. |
|
Codes: |
|
| A. | (i) (ii) (iii) (iv) (v) |
| B. | (ii) (iii) (i) (iv) (v) |
| C. | (iii) (i) (ii) (v) (iv) |
| D. | (iv) (v) (i) (ii) (iii) |
|
Option: A Explanation : All are definitions. Click on Discuss to view users comments. |
Minimal deterministic finite automaton for the language L = {0n | n ≥ 0 , n ≠ 4} will have :
| A. | 1 final state among 5 states |
| B. | 4 final states among 5 states |
| C. | 1 final state among 6 states |
| D. | 5 final state among 6 states |
|
Option: D Explanation : Click on Discuss to view users comments. |
