NET Computer science solved papers

Friday, July 13, 2012

11-07-2012

1. Consider a relation scheme R = (A,B,C,D,E,H) on which the following functional dependencies hold:
{A - B, BC - D, E C, D - A}. What are the candidate keys of R?
(a) AE, BE
(b) AE, BE, DE
(c) AEH, BEH, BCH
(d) AEH, BEH, DEH

2. The set {1,2,3,5,7,8,91 under multiplication modulo 10 is not a group. Given
below are four plausible reasons. Which one of them is false?
(A) It is not closed
(B) 2 does not have an inverse
(C) 3 does not have an inverse
(D) 8 does not have an inverse

3. In a binary max heap containing n numbers, the smallest element can be found in time
(A) 0(n)
(B) O(logn)
(C) 0(loglogn)
(D) 0(1)

4.

6. Which of the following logic families is the fastest?

(a) TTL (b) DTL (c) ECL (d) MOS

7.

9. DELETE statement in SQL is used to:

(A) Remove a database
(B) Remove a table from a database
(C) Remove a record from table
(D) Remove a field from a table

10. A B-tree of minimum degree t can have maximum ---- pointers in a node

(A) t-1
(B) 2t-1
(C) 2t
(D) t

Will publish answers soon

Thursday, July 12, 2012

10-07-2012

Daily 10 questions(10-07-2012)

1. An Abstract Data Type (ADT) is:

(a) same as an abstract class

(b) a data type that cannot be instantiated

(d) all ofthe above

2. A common property of logic programming languages and functional languages is:

(a) both are procedural languages

(b) both are based on 2k-calculus

(d) both use Horn-clauses

3. An undirected graph G has n nodes. Its adjacency matrix is given by an n x n square

matr4ix whose (i) diagonal elements are 0’s and (ii) non-diagonal elements are l’s. which one

of the following is TRUE?

(a) Graph G has no minimum spanning tree (MST)

(b) Graph G has a unique MST of cost n-i

(d) Graph G has multiple spanning trees of different costs

4. Let G be a simple graph with 20 vertices and 100 edges. The size of the minimum vertex

cover of G is 8. then, the size of the maximum independent set of G is:

(a) 12

(b) 8

(d) More than 12

5. The hexadecimal representation of 6578 is:

(a) 1AF

(b) D78

(d) 32F

6. The switching expression corresponding to f(A,B,C,D)= (1,4,5,9,11,12) is:

(a) BC’D’ + A’C’D + AB’D

(b) ABC’+ACD+B’C’D

(d) A’BD + ACD’ + BCD’

7. The address resolution protocol (ARP) is used for:

(a) Finding the IP address from the DNS

(b) Finding the IP address of the default gateway

(d) Finding the MAC address that corresponds to an IP address

8. Consider the regular language L =(111+11111)*. The minimum number of

states in any DFA accepting this languages is:

(A) 3

(B) 5

(D) 9

9. L={aa,ab,ba,bb} minimum number of states required to implement using DFA are

(A) 2

(B) 3

(D) 5

10. Which one of the following graphs is NOT planar?

Key
1.
2.C
3.
4.
5.
6.A
7.
8.D
9.C
10. Looks like something wrong with the question

05-07-2012

Daily 10 questions(05-07-2012)

(1)What is the complement of the language accepted by the NFA shown below

Answer: (B)

Given NFA does not accept epsilon, so complement should accept epsilon. We left out with two options (B) and (D). But NFA accepts 'a' so complement should not accept 'a'. that means (B) is the answer.

(2) The Truth table

X	Y	f(X,Y)
0	0	0
0	1	0
1	0	1
1	1	1

Represents the boolean function

(A) X (B) X+Y (C) X EX-OR Y (D) Y

Answer(A)

f(x,y) and X are same

(3) What will be the output of the following C program segment?

char inChar='A';

switch( inChar ) {

case 'A' : printf ( "Choice A\n");

case 'B' :

case 'C' : printf (" Choice B");

case 'D' :

case 'E' :

default : printf (" No choice ");

}

(A) No choice

(B) Choice A

Choice B No Choice

(D) Program gives no output as it errorneous

Answer(C)

No break statement after case statements so it is nothing but sequential statement execution.

(4) Which of the following is TRUE

(A) Every relation in 3NF is also in BCNF

(B) A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R

(D) No Relation can be in both BCNF and 3NF

Answer: (C)

(5) Given the language L= {ab, aa, baa} which of the following strings are in L*?

1) abaabaaabaa 2) aaaabaaaa

3) baaaaabaaaab 4) baaaaabaa

(A) 1,2 and 3 (B) 2,3 and 4

Answer(C)

(6) What is the minimal form of the Karnaugh map shown below? Assume that X denotes a don't care term

Answer: (B)

(7) Which of the following graphs is isomorphic to

Answer(B)

Compare degree sequences with the given graph

(8) Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros for example, 001110 and 011001 are in the language, but 100010 is not. All strings of less than three are also in the language. A partially completed DFA that accepts this language is shown below.

Answer(D)

(9) How many onto(or surjective) functions are there from an n-element (n>=2) set to a 2-element set?

Answer(C)

(10) K4 and Q3 are graphs with the following structures

Which one of the following statements is TRUE in relation to these graphs?

(A) K4 is planar while Q3 is not (B) Both K4 and Q3 are planar

Answer(B)

*******************************************
Key will be published on 06-07-2012 ( Friday ) at 8:00 PM (IST)
*******************************************

Answer Key

1. B
2. A
3. C
4. C
5. C
6. B
7. B
8. D
9. C
10.B

Let me know if anybody needs explanation.

Monday, July 9, 2012

December 2011 Question paper with answer key

Download Question Paper Here

Will update Answer Key by end of day


1	D	11	A	21	C	31	D	41	B
2	D	12	C	22	C	32	B	42	D
3	B	13	C	23		33	B	43	B
4	D	14	A	24		34	D	44	D
5	D	15	D	25	A	35	C	45	C
6	B	16	C	26	A	36	D	46	D
7	B	17	A	27	D	37	A	47
8	A	18	C	28	B	38	C	48	B
9	B	19	C	29		39	B	49
10	C	20	B	30	D	40	A	50	A

Explanation:

Friday, July 6, 2012

Net Qualifying Criteria

Dear All,

I have seen many people discussing about Qualifying criteria for NET. So thought of writing a post on Qualifying criteria.

The candidates are required to obtain minimum marks separately in Paper-I, Paper-II and Paper-III as given below:

As per my observation, UGC changes the cutoff marks depends on the number of candidates qualified the mimimum eligibility crieteria

According to me, eligibility criteria for Lecturership for june 2012 may be like this

Category	Expected Qualifying Cut-off Marks for Lectureship Eligibility in UGC-NET held on 24.06.2012
	Paper-I	Paper-II	Paper-I + Paper-II	Paper-III	Paper-I + Paper-II + Paper-III
GEN	40 (40%)	40 (40%)	100 (50%)	75 (50%)	210(60%)
OBC(NCL)	35 (35%)	35 (35%)	90 (45%)	68 (45%)	193(55%)
SC/ST/PH/VH	35 (35%)	35 (35%)	80 (40%)	70 (40%)	175(50%)

Category	Expected Qualifying Cut-off Marks for Junior Research Fellowship in UGC-NET held on 24.06.2012
	Paper-I	Paper-II	Paper-I + Paper-II	Paper-III	Paper-I + Paper-II + Paper-III
GEN	40 (40%)	40 (40%)	100 (50%)	83 (55%)	228(65%)
OBC(NCL)	35 (35%)	35 (35%)	90 (45%)	68 (45%)	210(60%)
SC/ST/PH/VH	35 (35%)	35 (35%)	80 (40%)	70 (40%)	193(55%)

Ugc followed the qualifying criteria for previous years

I Hope above analysis will give some idea about NET cut-off marks and minimum eligibility criteria for June-2012. Any comments please....

Thursday, June 28, 2012

MY ANSWER KEY FOR JUNE 2012

JUNE 2012 COMPUTER SCIENCE QUESTIONS & ANSWERS WITH EXPLANATION

***************************************************
My answer key for june 2012 computer science paper
This is my carbon copy of june 2012 exam. this is not original key.
***************************************************

PAPER-2

Q.NO	Key	Q.NO	Key	Q.NO	Key
1	A	21	C	41	A
2	C	22	B	42	C
3	B	23	A	43	B
4	D	24	B	44	D
5	C	25	C	45	D
6	B	26	B	46	D
7	D	27	B	47	C
8	D	28	A	48	C
9	B	29	B	49	D
10	D	30	A	50	C
11	C	31	A
12	D	32	B
13	B	33	C
14	C	34	D
15	C	35	B
16	B	36	D
17	B	37	D
18	A	38	C
19	A	39	B
20	D	40	B

PAPER-3

Q.NO	Key	Q.NO	Key	Q.NO	Key	Q.NO	Key
1	A	21	C	41	B	61	A
2	B	22	D	42	A	62	B
3	C	23	C	43	D	63	D
4	B	24	D	44	B	64	C
5	B	25	B	45	A	65	B
6	A	26	C	46	B	66	A
7	B	27	A	47	D	67	D
8	D	28	B	48	A	68	C
9	B	29	D	49	B	69	D
10	D	30	C	50	C	70	A
11	A	31	D	51	A	71	B
12	B	32	D	52	B	72	D
13	D	33	C	53	A	73	D
14	A	34	C	54	B	74	A
15	B	35	C	55	A	75	C
16	B	36	B	56	D
17	D	37	B	57	B
18	B	38	A	58	A
19	C	39	C	59	C
20	B	40	B	60	C