HSSC PGT Computer Science Paper 2016 (Solved)-PART 2
March 16, 2016 Leave a comment
HSSC PGT Computer Science Exam. 2016 (Recruitment of Teachers for classes XI & XII) Solved paper of PGT Computer Science Group held on 06 March 2016 [PART-I : 41 – 80] ( correct answers are highighted in deep saffron color) |
|
41. Select from the alternatives the word which conveys the same meaning as the word given in the capital letters. COWARDICE a) Timidity b) Gallantry c) Criminal d) Humanity |
|
42. Select from the alternatives the word which conveys the opposite meaning as the word given in the capital letters. REPULSIVE a) Inducive b) Dull c) Attractive d) Attentive |
|
43. In the following question, out of the four alternatives choose the one which can be substituted for the given words/phrase Somethings which becomes outdated a) Old b) Ancient c) Obsolete d) Useless |
|
44. Fill in the blank with most appropriate alternative. Everyone should pay ______subscription amount by 31st of March a) his b) her c) their d) your |
|
45. In the following questions, find out which part of the sentence has an error. If there is no mistake, the answer is ‘No error’. Both the civilians and armymen joined the First World War. a) Both the civilians b) and armymen c) joined the First World War. d) No error |
|
46. तरनि तनुजा तट तमाल तरुवर बहु छाए उक्त पंक्ति में कौन सा अलंकार है? a) अनुप्रास b) यमक c) उत्प्रेक्षा d) उपमा |
|
47. निम्न शब्द में कौन सा समास है? ‘दालरोटी’ / ‘दालभात’ a) द्वंद b) अव्ययीभाव c) दिगु d) तत्पुरुष |
|
48. ‘‘छाती पर मूँग दलना’ मुहावरे का अर्थ है a) कठिन काम करना b) बात-बात पर लड़ना c) कर्जा वसूल करना d) पास रहकर दुःख देना |
|
49. ‘‘लक्ष्मण’ का पर्यायवाची शब्द है a) सौमित्र b) कपीश c) लंकेश d) माघ |
|
50. ‘‘राग’ का विलोमार्थक शब्द है a) लगन b) वैराग्य c) विराग d) धुन |
|
51. The maximal elements of the poset <(2,4,5,10,12,20,25),D> are a) 20,25 b) 25 c) 12,20,25 d) 10,20,25 |
|
52. The subset relation defined on a power set is a) Reflexive and symmetric only b) Equivalnce relation c) Irreflexive and transitive only d) Partial ordered relation |
|
53. Consider the group <{1, -1, i, -i}, *> under multiplication. The inverse of -i is a) 1 b) -1 c) i d) -i |
|
54. The range of integers that can be represented by the 32 bit computer using 2’s compliment to represent integers is a) -232 to 232 b) -232 to 231 c) -231 to 232 a) -231 to 231-1 |
|
55. A full binary tree with n leaf nodes has in all _______nodes. a) 2n – 1 b) 2n c) 2n + 1 d) log 2n |
|
56. In a full complete binary tree, the vertices other than root have degree a) 1 b) 2 c) 3 d) 1 or 3 |
|
57. If for a real continuous function f{x}, f(a)f(b)<0, then f(x) has _______ in [a,b] a) may or may not have a root b) no roots c) odd no. of roots d) even no. of roots |
|
58. Palindromes cannot be recognized by a) FSM b) PDA c) Post Machine d) Turing Machine |
|
59. Let cardinality of set A be 16 and cardinality of set of all equivalnce relation on A be 4. Then the number of elements in each quivalnce class is a) 2 b) 4 c) 6 d) 8 |
|
60. A function that call itself for its processing is known as a) Inline function b) Nested function c) Overloaded function d) Recursive function |
|
61. In a time sharing operating system, when the time slot given to a process is completing, the process goes from the RUNNING state to the a) BLOCKED state b) READY state c) SUSPENDED state d) TERMINATED sate |
|
62. The existential quantifier in predicate logic indicates that a) Statement is true for all b) Statement is true for atleast one c) Statement is false for atleast one d) Statement is false for all |
|
63. It is possible to express every Boolean expression using a) AND alone b) OR alone c) NOT alone d) NAND alone |
|
64. The instructions : x = x + y y = x – y x = x – y a) Retain the values of x and y b) Complement the values of x and y c) Swap x and y d) Negates x and y |
|
65. _________ holds information before going to the decoder. a) Control register b) Data register c) Address register d) Accumulator |
|
66. Which of the following array represents a binary max heap? a) {20,12,15,14,10,7,8} b) {20,14,12,16,5,10,6} c) {20,12,15,10,11,14,13} d) {20,12,15,10,11,16,13} |
|
67. Match List-I with List-II and select correct answer from the cosed given below the lists. List-I List-II A. Indirect adressing 1. Loops B. Immediate addressing 2. Pointers C. Autodecrement addressing 3. Constants a) A:3 B:2 C:1b) A:1 B:3 C:2 c) A:2 B:3 C:1 d) A:3 B:1 C:2 |
|
68. Big O estimate for the function f(x) = xlog(2x) + x3 + 5x2 + 10 is a) O(X log x) b) O(x3) c) O(x2) d) O(x log(2x)) |
|
69. Strings are character arrays. The last index of itcontains the null-terminated character: a) \t b) \n c) \0 d) \1 |
|
70. _______sorting algorithms does not have a worst case running time O(n2) a) Insertion b) Merge c) Quick d) Bubble |
|
71. The hexadecimal equivalnce of the Octal number 377 is a) FF b) AF c) F00 d) FA |
|
72. The Boolean operator for logical -and is ___________. a) & b) && c) | d) |& |
|
73. _________ algorithm is a public key encryption algorithm. a) Ceaser Cipher b) DES c) AES d) Knap Sack |
|
74. A data dictionary is a special file that contains a) names of all fields in all files b) data types of all fields in all files c) width of all fields in all files d) All of these |
|
75. Encryption and Decryption is the responsibility of _________ layer. a) physical b) application c) network d) presentaion |
|
76. _________ data structure is used in recursion. a) Stack b) Queue c) Graph d) Tree |
|
77. The number of tuples in relation is called its _________ while the number of attribute in a relation is called its _________. a) Degree, Cardinality b) Cardinality, Degree c) Rows, Columns d) Columns, Rows |
|
78. A relation is _________if every field contains only atomic values that is, no lists or sets. a) 1NF b) 2NF c) 3NF d) BCNF |
|
79. Attribute of one table matching the primary key of another table is called as a) Foreign Key b) Secondary Key c) Candidate Key d) Composite Key |
|
80. Which one of the following will declare a pointer to an integer at address 0x200 in memory? a) int *x; *x = 0x200; b) int *x = &0x200; c) int *x = *0x200; d) int *x = 0x200; |
|
Note: Clicke here to see PART-I Write your comments/feedback in comment box and don’t forget to rate the post. Post created by |