PGT Computer Science (Level-3), (HTET Practice MCQs) (Part-VI)Total Questions: 10041. Find the equation of the circle x² + y² = 1 in terms of x'y' coordinates, assuming that the xy coordinate system results from a scaling of 3 units in the x' direction and 4 units in the y' direction.A.B.C.D.Correct Answer: B.42. Find the normalization transformation that maps a window whose lower left corner is at (1, 1) and upper right corner is at (3, 5) onto a viewport that is the entire normalized device screen.A.B.C.D.Correct Answer: A.43. The three aspects of Quantization, programmers generally concerned with are:A. Coding error, Sampling rate and AmplificationB. Sampling rate, Coding error and ConditioningC. Sampling rate, Aperture time and Coding errorD. Aperture time, Coding error and StrobingCorrect Answer: C. Sampling rate, Aperture time and Coding error44. The logic of pumping lemma is an example of __________ .A. iterationB. recursionC. the divide and conquer principleD. the pigeon hole principleCorrect Answer: D. the pigeon hole principle45. Heap allocation is required for languages that:A. use dynamic scope rulesB. support dynamic data structuresC. support recursionD. support recursion and dynamic data structuresCorrect Answer: B. support dynamic data structures46. Pumping lemma for regular language is generally used for proving:A. whether two given regular expressions are equivalentB. a given grammar is ambiguousC. a given grammar is regularD. a given grammar is not regularCorrect Answer: D. a given grammar is not regular47. Which of the following problems is undecidable?A. To determine if two finite automata are equivalentB. Membership problem for context free grammarC. Finiteness problem for finite automataD. Ambiguity problem for context free grammarCorrect Answer: D. Ambiguity problem for context free grammar48. Finite state machine can recognize language generated by __________ .A. Only context free grammarB. Only context sensitive grammarC. Only regular grammarD. Any unambiguous grammarCorrect Answer: C. Only regular grammar49. The language L = {aⁱ b cⁱ Ι i ≥ 0} over the alphabet {a, b, c} is:A. a regular language.B. not a deterministic context free language but context free language.C. recursive and is a deterministic context free language.D. not recursive.Correct Answer: C. recursive and is a deterministic context free language.50. Suppose we want to download text documents at the rate of 100 pages per second. Assume that a page consists of an average of 24 lines with 80 characters in each line. What is the required bit rate of the channel?A. 192 kbpsB. 512 kbpsC. 1.248 MbpsD. 1.536 MbpsCorrect Answer: D. 1.536 MbpsSubmit Quiz« Previous12345678910Next »