Friday, 29 July 2016

HSST Computer Science Solved Paper (SR For ST) 144/2013 - Part 4

31.       DNS is a
(A) Distributed hierarchical naming system
(B) Vertical naming system
(C) Horizontal naming system
(D) Client Server system
Answer: A
32.       E-commerce is not suitable for
(A) Online job searching
(B) Sale/Purchase of expensive jewellery and antiques
(C) Sale/Purchase of branded clothes
(D) Sale/Purchase of mobile phones
Answer: A
33.       Several factors exist that affect the efficiency of lookup operations in a hash table. Which among the following is NOT one of those factors ?
(A) Size of elements stored in the hash table.
(B) Number of elements stored in the hash table.
(C) Quality of the hash function.
(D) Number of buckets in the hash table.
Answer: A
34.       A DBMS query language is designed to
(A) specify the structure of a database
(B) support end users with English-like commands
(C) support the development of complex applications software
(D) all of the above
Answer: D
35.       Let r be a resource. There are 3 user processes each requiring 2 units of R. Then the minimum number of units of R such that no deadlocks will occur is
(A) 4       (B) 3
(C) 5       (D) 6
Answer: A

36.       Assume a cache memory with associative mapping. If the main memory is of 8K bytes and the cache memory is of 2K words, then each word of cache memory is
(A) 21 bits          (B) 11 bits
(C) 16 bits         (D) 20 bits
Answer: C
37.       Which of the following is true ?
(A) Stream cipher technique is an encryption technique
(B) Block cipher technique is an encryption technique
(C) Both (A) and (B)
(D) Neither of (A) and (B)
Answer: C
38.       Given a linked list with n elements. Then the time taken to insert an element after an element pointed to by some pointer is
(A) O(n log2 n)              (B) O(1)
(C) O(log2 n)                 (D) O(n)
Answer: B
39.       Let h be a hashing function and is used to hash n keys into a table of size m (given n<=m). Then the expected number of collisions involving a particular key x is
(A) less than 1              (B) less than m
(C) less than n             (D) less than n/2
Answer: A
40.    If L is a lattice, then for every a and b in L which among the following is correct?
(A) a ν (b Λ c) =a
(B) a ν (b ν c) = (a ν b) ν c
(C) a ν b = a Λ b
(D) a ν (b ν c) = b
Answer: B


0 comments:

Post a Comment