21. Create Matrix class using templates. Write a menu-driven program to perform following Matrixoperations (2-D array implementation): a) Sum b) Difference c) Product d) Transpose

 21. Create Matrix class using templates. Write a menu-driven program to perform following Matrixoperations (2-D array implementation): a) Sum b) Difference c) Product d) Transpose

COMPUTER GRAPHICS question set (PAKHIRA)

  CHAPTER 9

1. window and view port

2. clipping

3. Cohen_Sutherland algo

4. Midpoint subdivision'

5. Sutherland-Hodgman algo

COMPUTER GRAPHICS question set (PAKHIRA)

 CHAPTER 8

1. Parallel projection, Perspective projection

2. orthographic,oblique

3. Vanishing point

COMPUTER GRAPHICS question set (PAKHIRA)

 CHAPTER 7

1. 3D Translation, scaling , rotation

2. 3D rotation about a reference point

4. 3D reflection

5. 3D reflection about a reference point

6. 3D shearing

COMPUTER GRAPHICS question set (PAKHIRA)

 CHAPTER 5

1. Translation, scaling , rotation

2. Translation, scaling , rotation about a reference point

3. homogeneous coordinate system

4. reflection

5. reflection about a reference point

6. shearing

COMPUTER GRAPHICS question set (PAKHIRA)

 CHAPTER 4

1. polygon - concave,convex, scan conversion.

2. odd-even method.

3. winding number method.

4. Boundary fill

5. Flood fill.

6. scan line fill

7. Scan line seed fill.

COMPUTER GRAPHICS question set (PAKHIRA)

 CHAPTER 3

1. Scan conversion method

2. ploynomial method of line, cicrle.

3. DDA for a line, circle.

4. advantage and disadvantage of DDA.

5. Bresssenham's algorithm for line, circle.

6. Midpoint method of line, circle,ellipse.

COMPUTER GRAPHICS question set (PAKHIRA)

 CHAPTER 2

1. Raster Scan Display.

2. Working principle of CRT.

3. Interlacing.

4. Aspect ratio.

5. RGB & CMY color system.

6. frame buffer.

7. LUT.

8. LCD

9. Random scan devices.

10. Memory tube displays.

COMPUTER GRAPHICS question set (PAKHIRA)

 CHAPTER 1

1. Application of computer graphics.

2. Operation of computer graphics.

Deadlock:

 Operating System Question Set 

GALVIN

1. What is deadlock?

2. Request , Use, Release.

3. Necessary condition of deadlock.

4. Resource allocation graph.

5. Safe state , safe sequence, unsafe state.

6. Deadlock prevention, deadlock avoidance, deadlock recoverey.

7. Bakers algorithm- i) deadlock avoidance, ii) resource request