midterm past paper quiz
midterm past paper quiz

CS602 Midterm Past Paper

You have come here while searching for cs602 midterm past papers. But before going to download the cs602 midterm past paper. I have a better option for you. That is, that you can attempt the online quiz of cs602.

Practice Quiz from CS602 Midterm Past Paper

This quiz will evaluate your preparation for the cs602 midterm examination and it is based on the past papers of cs602. The purpose of this quiz is to evaluate your performance in this subject. If you can pass this quiz, then there is a great chance that you can secure good marks in your exams.

0%
0 votes, 0 avg
2

You Time starts now.

Times Up

Created on By faisal_faisi

CS602

midterm past paper quiz

CS602 Midterm Past Paper Online Practice Quiz

Welcome to CS602 Midterm Online Practice Quiz.

You can check your preparation of CS602 for your Exams here.

1 / 30

Category: CS602-mid

1. Save a line with both endpoints inside all clipping boundaries

2 / 30

Category: CS602-mid

2. In Trivial acceptance/reject test there are four bits of nine regions, Bit 1 represents condition
______________.

3 / 30

Category: CS602-mid

3. Both Boundary Filling and Flood filling algorithms are non-recursive techniques.

4 / 30

Category: CS602-mid

4. ________uses a divide and conquer strategy.

5 / 30

Category: CS602-mid

5. In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition
______________.

6 / 30

Category: CS602-mid

6. Concave polygons are a superset of ________ polygons, having fewer restrictions than _____
polygons.

7 / 30

Category: CS602-mid

7. Various curve functions are useful in ________________________.

8 / 30

Category: CS602-mid

8. DDA abbreviated for __________________.

9 / 30

Category: CS602-mid

9. Boundary Filling Algorithm can work for complex polygons

10 / 30

Category: CS602-mid

10. Each number that makes up a matrix is called an __________ of the matrix.

11 / 30

Category: CS602-mid

11. In Trivial acceptance/reject test there are four bits of nine regions, Bit 3 represents condition
______________.

12 / 30

Category: CS602-mid

12. Both Boundary Filling and Flood filling algorithms are _____________ as compared to scan line filling algorithm.

13 / 30

Category: CS602-mid

13. Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines

14 / 30

Category: CS602-mid

14. A * B = |A| * |B| * cos(?) where ? is the angle between the two vectors

15 / 30

Category: CS602-mid

15. Intensity of the electron beam is controlled by setting __________ levels on the control grid, a metal cylinder that fits over the cathode.

16 / 30

Category: CS602-mid

16. Shadow mask methods can display a __________ range of colors

17 / 30

Category: CS602-mid

17. x^2 / a^2 ) + ( y^2 / b^2 ) = 1 is an equation of ____________________________.
Select correct option:

18 / 30

Category: CS602-mid

18. By preserving the original shape of an object with a scaling is called _______ scaling.

19 / 30

Category: CS602-mid

19. Each hyperbola consists of two ___________.

20 / 30

Category: CS602-mid

20. _________________ is the set of points that are equidistant from its origin

21 / 30

Category: CS602-mid

21. Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
Select correct option:

22 / 30

Category: CS602-mid

22. Computer graphics is very helpful in producing graphical representations for scientific
visualization.

23 / 30

Category: CS602-mid

23. Process of moving points in space is called

24 / 30

Category: CS602-mid

24. We can draw eight points corresponding to each (x , y) point calculation in _________ drawing algorithm.

25 / 30

Category: CS602-mid

25. Twice the radius of circle is called as ____________________.

26 / 30

Category: CS602-mid

26. In video text memory, ______ are used to display a character

27 / 30

Category: CS602-mid

27. In Trimetric the direction of projection makes unequal angle with the three principal axes

28 / 30

Category: CS602-mid

28. Polygons are basically concave polygons that may have self-intersecting edges

29 / 30

Category: CS602-mid

29. Parity is a concept used to determine which _________________ lie within a polygon.

30 / 30

Category: CS602-mid

30. Concave polygons are superset of________ polygons, having fewer restrictions than ______
polygons.

Your score is

The average score is 58%

Share your result with your fellow students.

LinkedIn Facebook Twitter VKontakte
0%

Exit

Note before downloading CS602 midterm past paper

One thing to note dear fellows that you must don’t rely on these papers only. They can be a source of help but not an ultimate solution. If you want to get good marks in your exams you are advised to go through all of your handouts and must watch all of the video lectures.

Golden rules for good marks in VU Exams.

As per my experience, I have developed some golden rules for getting good marks in Virtual University Exams based on experience. I got 3.96 CGPA by following these rules. So here they are:

  1. Never miss your Quiz, Assignment, or GDB.
  2. Always try to do your Assignment on your own.
  3. Try your best to finish your video lectures 10 days before exams.
  4. Try your best to read your handouts twice before exams.
  5. Read forward attempt backward.
  6. Never schedule more than one paper on the same day.
  7. Your most difficult paper should have a gap of 1 or more days.
  8. Toughest paper must be scheduled first.
  9. Read questions forward and attempt backward.
  10. Don’t waste your time during a paper on illegal activities.

You can also download the Latest VU Handouts

To download the CS602 midterm past paper click here.

 

RELATED ARTICLESMORE FROM AUTHOR