Register

UGC NET CSE | December 2018 | Part 2 | Question: 45

• edited by
1,074 views
0 votes
0 votes

​​​​​​​In $3D$ Graphics, which of the following statements is/are true?

P: Back-face culling is an example of image-precision visible-surface determination procedure.

Q: Z- buffer is a $16$-bit, $32$-bit, or $64$ bit field associated with each pixel in a frame buffer that can be used to determine the visible surfaces at each pixel

Choose the correct answer from the code given below :

$Code:$

  1. P only
  2. Q only
  3. P and Q
  4. Neither P nor Q
• edited by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
3
Arjun asked Jan 2, 2019
968 views
UGC NET CSE | December 2018 | Part 2 | Question: 9
Use Dual Simplex Method to solve the following problem: $\begin{array} \text{Maximize} & z=-2x_1-3x_2 \\ \text{subject to:} & \\ & x_1+x_2 \geq 2 \\ & 2x_1 +x_2 \leq10 \\ & x_2 +x_2 \leq 8 \\ & x_1,x_2 \geq 0 \end{array}$ ... $x_1=0, x_2=2, \text{ and } z=-6$ $x_1=6, x_2=2, \text{ and } z=-18$
Use Dual Simplex Method to solve the following problem:$\begin{array} \text{Maximize} & z=-2x_1-3x_2 \\ \text{subject to:} & \\ & x_1+x_2 \geq 2 \\ & 2x_1 +x_2 \leq10 \\ ...
User Avatar
0 votes
0 votes
2 answers
4
Arjun asked Jan 2, 2019
4,385 views
UGC NET CSE | December 2018 | Part 2 | Question: 12
Consider the graph shown below: Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is $17$ $14$ $16$ $13$
Consider the graph shown below:Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is$17$$14$$16$$13$
User Avatar
Link Copied!