## Wednesday, 15 April 2015

### UGC NET Computer Science Solved Paper II June 2007 - Part 1

1.       The following deterministic finite automata recognizes:
(A) Set of all strings containing ‘ab’
(B) Set of all strings containing ‘aab’
(C) Set of all strings ending in ‘abab’
(D) None of the above
2.       Depth ion travels of the following directed graph is:
(A) ABCDEF     (B) ABDEFC
(C) ACEBDF    (D) None of the above
3.       The maximum number of nodes in a binary tree of depth 10 is:
(A) 1024                        (B) 210-1
(C) 1000                        (D) None of the above
4.       The regular expression given below describes:
r=(1+01)*(0+Î»)
(A) Set of all string not containing ‘11’
(B) Set of all string not containing ‘00’
(C) Set of all string containing ‘01’
(D) Set of all string ending in ‘0’
5.       Which of the following language is regular?
(A) L={anbn|n≥1}
(B) L={anbmcndm|n,m≥1}
(C) L={anbm|n,m≥1}
(D) L={anbmcn|n,m≥1}
6.       2’s complement of -100 is:
(A) 00011100               (B) 10011101
(C) 10011100               (D) 11100100
7.       Which of the following expression remove hazard form: xy+zx’ ?
(A) xy+zx’          (B) xy+zx’
(C) xy+zx’+yz    (D) xy+zx’+wz
8.       How many 1’s are present in the binary representation of 15x256+5x16+3:
(A) 8       (B) 9
(C) 10     (D) 11
9.       If AB=C, then:
(A) AC=B                   (B) BC=A
(C) ABC=1                        (D) ABC=0

10.    What is the maximum counting speed of a 4-bit binary counter which is composed of Flip-Flop with a propagation delay of 25ns?
(A) 1MHz           (B) 10MHz
(C) 100MHz      (D) 4MHz
11.    The following loop in ‘C’:
int i=0;
While(i++<0)i--;
(A) will terminate
(B) will go into an infinite loop
(C) will give compilation error
(D) will never be executed
12.    In case of right shift bitwise operator in ‘C’ language, after shifting n bits, the left most n bits:
(A) are always filled with zeroes
(B) are always filled with ones
(C) are filled with zeroes or ones and is machine dependent
(D) none of the above
13.    What keyword in class specification helps to hide data:
(A) Public          (B) Private
(C) Static           (D) Void
14.    What is the output of the following ‘C’ program?
main()
{printf(“%x”,-1>>4);}
(A) ffff                (B) 0fff
(C) 0000                        (D) fff0
15.    Runtime polymorphism can be achieved by:
(A) Accessing virtual function through the pointer of the base class
(B) Accessing virtual function through the object
(C) The derived class
(D) None of these
16.    Which of the following statements is wrong?
(A) 2-phase Locking Protocols suffer from deadlocks
(B) Time-Stamp Protocols suffer from more aborts
(C) Time-Stamp Protocols suffer from cascading roll back where as 2-Phase locking Protocol do not
(D) None of these
17.    A recursive foreign key is a:
(A) references a relation
(B) references a table
(C) references its own relation
(D) references a foreign key
18.    A sub class having more than one super class is called:
(A) Category                 (B) Classification
(C) Combination          (D) Partial Participation
19.    A relation R={A,B,C,D,E,F} is given with following set of functional dependencies:
F={A→B,AD→C,B→F,A→E}. Which of the following is Candidate Key?
(A) A                   (B) AC
(C) AD               (D) None of these
20.    Which statement is false regarding data independence?
(A) Hierarchical data model suffers from data Independence
(B) Network model suffers from data Independence
(C) Relational model suffers only from logical data Independence
(D) Relational model suffers only from physical data Independence

Part 1   Part 2

#### 1 comment:

1. ugc computer science june 2007 - Question No - 5 .