UGC NET Computer Science Paper II Previous Questions December 2012 - Part 5

41.       Enumeration is a process of
(A) Declaring a set of numbers
(B) Sorting a list of strings
(C) Assigning a legal values possible for a variable
(D) Sequencing a list of operators
Answer: C
42.       Which of the following mode declaration is used in C++ to open a file for input ?
(A) ios :: app                 (B) in :: ios
(C) ios :: file                  (D) ios :: in
Answer: D
43.       Data Encryption Techniques are particularly used for ……………….
(A) protecting data in Data Communication System.
(B) reduce Storage Space Requirement.
(C) enhances Data Integrity.
(D) decreases Data Integrity.
Answer: A
44.       Let L be a set accepted by a nondeterministic finite automaton. The number of states in non-deterministic finite automaton is |Q|. The maximum number of states in equivalent finite automaton that accepts L is
(A) |Q|                (B) 2|Q|
(C) 2|Q|–1           (D) 2|Q|
Answer: D
45.       What is the result of the following expression ?
(1&2)+(3&4)
(A) 1                   (B) 3
(C) 2                   (D) 0
Answer: D

46.       Back propagation is a learning technique that adjusts weights in the neural network by propagating weight changes.
(A) Forward from source to sink
(B) Backward from sink to source
(C) Forward from source to hidden nodes
(D) Backward from since to hidden nodes
Answer: B
47.       Match the following :
a. TTL                 1. High fan out
b. ECL               2. Low propagation delay
c. CMOS            3. High power dissipation
Code :
   a  b  c
(A) 3  2  1
(B) 1  2  3
(C) 1  3  2
(D) 3  1  2
Answer: A
48.       …………... is an “umbrella” activity that is applied throughout the software engineering process.
(A) Debugging             (B) Testing
(C) Designing              (D) Software quality assurance
Answer: D
49.       Identify the operation which is commutative but not associative ?
(A) OR               (B) NOR
(C) EX-OR        (D) NAND
Answer: B or D
50.    Given a Relation POSITION (Posting-No, Skill), then query to retrieve all distinct pairs of posting-nos. requiring skill is
(A) Select p.posting-No, p.posting-No
from position p
    where p.skill = p.skill
and p.posting-No < p.posting-No
(B) Select p1.posting-No, p2.posting-No
from position p1, position p2
where p1.skill = p2.skill
(C) Select p1.posting-No, p2.posting-No
from position p1, position p2
where p1.skill = p2.skill
and p1.posting-No < p2.posting-No
(D) Select p1.posting-No, p2.posting-No
from position p1, position p2
where p1.skill = p2.skill
and p1.posting-No = p2.posting-No
Answer: C

Pages   2   3   4   5 

Post a Comment

0 Comments