Computer Science Study Materials for Competitive Exams

Sample Questions, Previous Year Solved Papers, Study Materials For Competitive Examinations Like UGC NET, SET And GATE Computer Science.

Saturday, 27 December 2014

UGC NET Computer Science and Applications Paper III December 2012 - Part 1

1.       Eco system is a Frame work for
(A) Building a Computer System
(B) Building Internet Market
(C) Building Offline Market
(D) Building Market
Answer: B
2.       The efficiency (E) and speed up (sp) for Multiprocessor with p processors satisfies :
(A) E≤p and sp≤p
(B) E≤1 and sp≤p
(C) E≤p and sp≤1
(D) E≤1 and sp≤1
Answer: B
3.       Match the following :
List – I
a. Critical region
b. Wait/signal
c. Working set
d. Dead lock
List – II
1. Hoares Monitor
2. Mutual exclusion
3. Principal of locality
4. Circular wait
Codes :
      a   b   c   d
(A) 2   1   3   4
(B) 1   2   4   3
(C) 2   3   1   4
(D) 1   3   2   4
Answer: A
4.       The technique of temporarily delaying outgoing acknowledgements so that they can be hooked onto the next outgoing data frame is known as
(A) Bit stuffing
(B) Piggy backing
(C) Pipelining
(D) Broadcasting
Answer: B
5.       …………… is process of extracting previously non known valid and actionable information from large data to make crucial business and strategic decisions.
(A) Data Management
(B) Data base
(C) Data Mining
(D) Meta Data
Answer: C

6.       The aspect ratio of an image is defined as
(A) The ratio of width to its height measured in unit length.
(B) The ratio of height to width measured in number of pixels.
(C) The ratio of depth to width measured in unit length.
(D) The ratio of width to depth measured in number of pixels.
Answer: A
7.       Which of the following features will characterize an OS as multiprogrammed OS?
(a) More than one program may be loaded into main memory at the same time.
(b) If a program waits for certain event another program is immediately scheduled.
(c) If the execution of a program terminates, another program is immediately scheduled.
(A) (a) only
(B) (a) and (b) only
(C) (a) and (c) only
(D) (a), (b) and (c) only
Answer: D
8.       Using RSA algorithm, what is the value of cipher text C, if the plain text M=5 and p=3, q=11 & d=7?
(A) 33
(B) 5
(C) 25
(D) 26
Answer: D
Explanation:
RSA (Rivest, Shamir, & Adleman) is an algorithm used by modern computers to encrypt and decrypt messages. It is an asymmetric cryptographic algorithm. Asymmetric means that there are two different keys. The keys for the RSA algorithm are generated the following way:
Choose two different large random prime numbers p and q.
Calculate n = pq = 3 x11=33
Calculate the totient: ɸ(n) = (p-1)(q-1)=2 x 10=20
(In number theory, the totient ɸ(n) of a positive integer is the number of integers less than the number which are coprime to n (they share no factors).)
(In mathematics, two integers (a and b) are coprime (or relatively prime) if they share no common factors. In other words, there is no number, other than 1, that divides both a and b.)
Choose an integer e, such that 1 < e < ɸ(n), and e is coprime to ɸ(n), ie: e and ɸ(n) share no factors other than 1.
de ≡ 1 (mod ɸ(n)) => 7e≡1mod20, then 7e must be 21, 41, 61, etc. Dividing each of these in turn by 7 to see which is divisible by 7, we find that 21/7 = 3, hence e = 3.
c=me mod n = 53 mod 33 = 125 mod 33 = 26
9.       You are given an OR problem and a XOR problem to solve. Then, which one of the following statements is true?
(A) Both OR and XOR problems can be solved using single layer perception.
(B) OR problem can be solved using single layer perception and XOR problem can be solved using self organizing maps.
(C) OR problem can be solved using radial basis function and XOR problem can be solved using single layer perception.
(D) OR problem can be solved using single layer perception and XOR problem can be solved using radial basis function.
Answer: D
10.    Match the following :
List – I                           List – II
a. Application layer     1. TCP
b. Transport layer         2. HDLC
c. Network layer           3. HTTP
d. Data link layer          4. BGP
Codes :
      a   b   c   d
(A) 2   1   4   3
(B) 3   4   1   2
(C) 3   1   4   2
(D) 2   4   1   3
Answer: C


No comments:

Post a Comment