UGC NET COMPUTER SCIENCE SOLVED QUESTION AND ANSWERS FOR DECEMBER 2015

UGC NET COMPUTER SCIENCE SOLVED QUESTION AND ANSWERS FOR DECEMBER 2015

1. What is pixel mask ?

(a) It is a string containing the digits 1 and 0 to indicate which positions to plot along the line path.

(b) The mask wear by the pixel to hide the face

(c) The mask used by pixel to cheat the line drawings.

(d) All of the above

Ans.: a

2. A chip having  1200 gates will be classified as
(A) SSI
(B) MSI
(C) LSI
(D) VLSI

Ans:-C       

Often asked question.

Important points: The number of gates for the different classification are as follows.
Small Scale Integration(SSI) - <10
Medium Scale Integration(MSI) - between 10 to 1000
Large Scale Integration(LSI) - >1000
Very Large Scale Integration(VLSI) - >100000

3. The projection in which the projection plane is allowed to intersect the x, y and z-axes at equal distances

(a) Wire frame model

(b) Constructive solid geometry methods

(c) Isometric projection

(d) Back face removal

Ans.: c

4. The method which is based on the principle of comparing objects and parts of objects to each other to find which are visible and which are hidden are called

(a) Object-space method

 (b) image-space method

(c) Both a & b

(d) None of these

Ans.: a

5. Given the following statements :
(i) The power of deterministic finite state machine and non- deterministic finite state machine are same.
(ii) The power of deterministic pushdown automaton and non- deterministic pushdown automaton are same.
Which of the above is the correct statement(s) ?
(a) Both (i) and (ii)
(b) Only (i)
(c) Only (ii)
(d) Neither (i) nor (ii)

Ans.: b

Important Facts:

1. The power of Deterministic and non deterministic finite automata is same.

2. The power of non deterministic push down automata is greater than deterministic pushdown automata.

3. The power of deterministic and non deterministic turing machine is same.

6. Alpha-beta pruning:

(a) May not find the minimax optimal strategy.

(b) Prunes the same number of subtrees independent of the order in which successor states are expanded.

(c) Generally requires more run-time than minimax on the same game tree

(d) Generally requires less run-time than minimax on the same game tree

Ans.: d

7. Consider the following statements :
I. Recursive languages are closed under complementation.
II. Recursively enumerable languages are closed under union.
III. Recursively enumerable languages are closed under complementation.
Which of the above statements are true ?
(A) I only
(B) I and II
(C) I and III
(D) II and III

Ans:-B

Important Note:-
Recursive languages are closed under the following operations.

1.            Kleene star

2.            Concatenation

3.            Union

4.            Intersection

5.            Complement

6.            Set difference

Recursively enumerable languages are closed under the following operations.

1.            Kleene star

2.            Concatenation

3.            Union

4.            Intersection

8. “Temporal redundancy”refers to the fact that

(a) Neighboring pixels in a frame have varying intensities.

(b) Neighboring pixels in a frame have similar intensities.

(c) Pixels in the same location across successive frames have varying intensities.

(d) Pixels in the same location across successive frames have similar intensities.

Ans.:d

9. Lack of inter-media synchronization leads to

(a) Discontinuities in audio or video presentations.

(b) Incoherency in multimedia presentation.

(c) More end-toend delays.

(d) Less utilization of channel bandwidth.

Ans.:b

10. High data compression in audio/video is associated with :

(a) poor reconstruction quality.

(b) Increased processing time.

(c) Increased transmission time.

(d) Increased channel error rate.

Ans.: a

11. Buffer overflow/underflow results when:

(a) The channel is of variable bit rate.

(b) The channel is of constant bit rate.

(c) The rate of filling up the buffer and that of empting are significantly different.

(d) There is no intra-media containuity.

 Ans.: c

12. The graphics method in which one object is transformed into another object are called

(a) Clipping

 (b) Morphing

(c) Reflection

(d) Shear

Ans.: b

13. Consider a logical address space of 8 pages of 1024 words mapped with memory of 32 frames. How many bits are there in the physical address ?

(A) 9 bits
(B) 11 bits
(C) 13 bits
(D) 15 bits

Ans:-D

Logic: 2^10=1024

2^5=32

Therefore, 10+5=15 bits

14. A Bezier curve is a polynomial of degree ___________the no of control points used

(a) One more than

(b) One less than

 (c) Two less than

 (d) None of these

Ans.:b

15. “Spatial redundancy” refers to the fact that

(a) Neighboring pixels in a frame have verying intensities.

(b) Neighboring pixels in a frame have similar intensities.

(c) Pixels in the same location across successive frames have varying intensities.

(d) Pixels in the same location across successive frame have similar intensities.

Ans.: b