APSET and NET Class room coaching at Anantapur

APSET and NET Class Room Coaching in Computer Science and Applications @ Anantapur, A.P

Faculty A.Bhanu Prakash Reddy.M.Tech(NIT Calicut).

GATE/NET/SET Qualified.

Registrations Open

Outstation Students : We have a plenty of hostels (both Women’s & Men’s) are available around coaching center.

Call us on 8297534842 write to us on reachmeatbhanu@gmail.com

UGC NET Computer Science and Applications Solved Paper III June 2015

UGC NET Computer Science and Applications Solved Paper III June 2015

Please post the questions based on memory so that we can discuss solutions.

UGC NET Computer Science and Applications Solved Paper II June 2015

UGC NET Computer Science and Applications  Solved Paper II June 2015

Please post the questions based on memory so that we can discuss solutions.

SnapDeal

click

GATE CS 2013 answer key for set B

GATE 2013 Key

Computer science and information technology key for set B

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

13-07-2012

Daily 10 questions(13-07-2012)




1. Which one of the following is a top-down parser?
(A) Recursive descent parser. (B) Operator precedence parser.
(C) An LR(k) parser. (D) An LALR(k) parser.



2. Which of the following graphs has an Eulerian circuit?
(A) Any k-regular graph where k is an even number.
(B) A complete graph on 90 vertices.
(C) The complement of a cycle on 25 vertices.
(D) None of the above


3. A minimum state deterministic finite automaton accepting the language
{ { }* }
L = w w Î 0,1 , number of 0s and 1s in w are divisible by 3 and 5, respectively
has
(A) 15 states (B) 11 states (C) 10 states (D) 9 states


4. The language {0 21 0} i i L = i ³ over the alphabet {0,1,2} is:
(A) not recursive
(B) is recursive and is a deterministic CFL.
(C) is a regular language.
(D) is not a deterministic CFL but a CFL.

7. The following postfix expression with single digit operands is evaluated using a
stack:
8 2 3 Ù / 2 3 * + 5 1 * -
Note that Ù is the exponentiation operator. The top two elements of the stack
after the first * is evaluated are:
(A) 6, 1 (B) 5, 7 (C) 3, 2 (D) 1, 5


8. Which one of the following statements if FALSE?
(A) Any relation with two attributes is in BCNF
(B) A relation in which every key has only one attribute is in 2NF
(C) A prime attribute can be transitively dependent on a key in a 3 NF relation.
(D) A prime attribute can be transitively dependent on a key in a BCNF relation.


9. Match the following:
(P) SMTP             (1) Application layer
(Q) BGP               (2) Transport layer
(R) TCP                (3) Data link layer
(S) PPP                 (4) Network layer
                              (5) Physical layer
(A) P - 2 Q - 1 R - 3 S - 5
(B) P - 1 Q - 4 R - 2 S - 3
(C) P - 1 Q - 4 R - 2 S - 5
(D) P - 2 Q - 4 R - 1 S - 3




10.

12-07-2012

Daily 10 Questions(12-07-2012)






1. Let S be a set of n elements. The number of ordered pairs in the largest and the
smallest equivalence relations on S are:

2. What is the maximum number of different Boolean functions involving n Boolean
variables?

3. Let G be the non-planar graph with the minimum possible number of edges. Then
G has
(A) 9 edges and 5 vertices (B) 9 edges and 6 vertices
(C) 10 edges and 5 vertices (D) 10 edges and 6 vertices




4. Consider the DAG with V = {1,2,3,4,5,6}, shown below.
Which of the following is NOT a topological ordering?

(A) 1 2 3 4 5 6 (B) 1 3 2 4 5 6 (C) 1 3 2 4 6 5 (D) 3 2 4 1 6 5


5. Which of the following problems is undecidable?
(A) Membership problem for CFGs. (B) Ambiguity problem for CFGs.
(C) Finiteness problem for FSAs. (D) Equivalence problem for FSAs.






6. Which of the following is TRUE?
(A) Every subset of a regular set is regular.
(B) Every finite subset of a non-regular set is regular.
(C) The union of two non-regular sets is not regular.
(D) Infinite union of finite sets is regular.




7. Consider the following Boolean function of four variables:
f (w,x,y ,z ) =
(1,3,4,6,9,11,12,14)
The function is:
(A) independent of one variables. (B) independent of two variables.
(C) independent of three variables. (D) dependent on all the variables.




8. The height of a binary tree is the maximum number of edges in any root to leaf
path. The maximum number of nodes in a binary tree of height h is:

9. The maximum number of binary trees that can be formed with three unlabeled
nodes is:
(A) 1 (B) 5 (C) 4 (D) 3


10. Which of the following sorting algorithms has the lowest worst-case complexity?
(A) Merge sort (B) Bubble sort (C) Quick sort (D) Selection sort