APSET KEY
PAPER-1 (Z series)
i found following are wrong in paper-3
apset july 2012 answer key
apset july 2012 computer science question paper, apset july 2012 computer science question paper with solutions, apset 2012 exam key,apset 2012 answer key , apset key
apset results will be announced in a month time ( that means any time in august) from saskhi telugu news paper
Key for 10 questions from paper-3 (Key is 100% correct for the following 10 questions only)
Q.No Answer
4 C
5 C
7 C
9 D
52 C
53 A
54 C
55 C
56 B
69 A
My Answer Key for Paper-1(Z series), Paper-2 and Paper-3 and I am expecting around 30+ questions correct in paper-1, 30+ in Paper-2,40+ in Paper-3.
PAPER-1 (Z Series)
PAPER-2
PAPER-3
(1) A process executes the code
forkO;
fork();
forkO;
fork();
The total number of child processes created is
(A) 3 (B) 15 (C) 7 (D) 8
Answer: (B)
(2) Assuming P != NP, which of the following is TRUE?
(A) NP-complete = NP
(B) NP-complete INTERSECTION P = 0
(C) NP-hard = NP
(D) P = NP-complete
Answer(B)
(3) Which of the following statements are TRUE about an SQL query?
P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause
Q: An SQL query can contain aHA VING clause only if it has a GROUP BY clause
R: All attributes used in the GROUP BY clause must appear in the SELECT clause
S : Not all attributes used in the GROUP BY clause need to appear in the SELECT clause
(A) P and R (B) P and S (C) Q and R (D) Q and S
Answer(A)
(4) Given the basic ER and relational models, which of the following is INCORRECT?
(A) An attribute of an entity can have more than one value
(B) An attribute of an entity can be composite
(C) In a row of a relational table, an attribute can have more than one value
(D) In a row of a relational table, an attribute can have exactly one value or a NULL value
Answer(C)
(5) Consider the 4.processes, PI, P2 and P3 shown in the table.
Process ArTrivmael Units time Required
PI 0 9
P2 1 7
P3 3 4
P4 5 5
The completion order of the 4 processes under the RR2 (round robin scheduling
with CPU quantum of 2 time units) are
(6) Which of the following graphs is isomorphic to
Answer: (B)
(7) Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number ofdistinct cycles of length 4 in G is equal to
(A) 15 (B) 30 (C) 90 (D) 360
Answer(A)
(8) Disk requests come into the disk driver for cylinders: 10, 22, 20, 2, 40, 6, 38, in
that order. The disk has 60 total cylinders and the disk head is currently positioned over
cylinder 20. A seek takes 6 milliseconds per cylinder moved. What is the sequence of
reads and total seek time using each of the following algorithms?
First-come, first-served:
10, 22, 20, 2, 40, 6, 38
10 + 12 + 2 + 18 + 38 + 34 + 32 = 146 cylinders = 876 milliseconds.
Answer: 876 milliseconds
(9) Closest cylinder next:
20, 22, 10, 6, 2, 39, 40
0 + 2 + 12 + 4 + 4 + 36 + 2 = 60 cylinders = 360 milliseconds.
Answer: 360 milliseconds
(10) Which of the sorting procedure is the slowest?
(a) bubble sort
(b) quick sort
(c) shell sort
(d) Heap sort
Answer(A)
(11) which of the following eliminates transitive dependency
(a) 1NF (b) 2 NF
(c) BCNF (d) None
(12) which of the following suffering from belady's anamoly
(13) What is the min number of states required for converting ANY NFA with N states to a DFA ?
A. N B. N^2 C. 2^N D. 2N E. N!
Ans: (C)
PAPER-1 (Z series)
i found following are wrong in paper-3
For Question Number: 24. Both (a) and (c) are correct
For Question Number: 25. No answer in the given options
For Question Number: 39. Both (c) and (d) are correct
For Question Number: 73. Answer: (B)
apset july 2012 answer key
apset july 2012 computer science question paper, apset july 2012 computer science question paper with solutions, apset 2012 exam key,apset 2012 answer key , apset key
apset results will be announced in a month time ( that means any time in august) from saskhi telugu news paper
Key for 10 questions from paper-3 (Key is 100% correct for the following 10 questions only)
Q.No Answer
4 C
5 C
7 C
9 D
52 C
53 A
54 C
55 C
56 B
69 A
My Answer Key for Paper-1(Z series), Paper-2 and Paper-3 and I am expecting around 30+ questions correct in paper-1, 30+ in Paper-2,40+ in Paper-3.
PAPER-1 (Z Series)
1
|
C
|
31
|
A
|
2
|
D
|
32
|
C
|
3
|
C
|
33
|
D
|
4
|
C
|
34
|
D
|
5
|
B
|
35
|
B
|
6
|
A
|
36
|
D
|
7
|
B
|
37
|
C
|
8
|
D
|
38
| |
9
|
A
|
39
| |
10
|
A
|
40
|
B
|
11
|
C
|
41
|
C
|
12
|
D
|
42
|
D
|
13
|
C
|
43
|
C
|
14
|
D
|
44
|
B
|
15
|
C
|
45
|
B
|
16
|
D
|
46
|
C
|
17
|
A
|
47
|
B
|
18
|
B
|
48
|
A
|
19
|
C
|
49
|
B
|
20
|
D
|
50
|
C
|
21
|
C
|
51
| |
22
|
C
|
52
| |
23
|
B
|
53
|
B
|
24
|
A
|
54
|
A
|
25
|
A
|
55
|
C
|
26
|
C
|
56
| |
27
|
D
|
57
| |
28
|
A
|
58
| |
29
|
A
|
59
| |
30
|
60
|
PAPER-2
1
|
A
|
26
|
C
|
2
|
B
|
27
|
B
|
3
|
D
|
28
|
B
|
4
|
C
|
29
|
B
|
5
|
D
|
30
|
B
|
6
|
C
|
31
|
B
|
7
|
D
|
32
|
A
|
8
|
B
|
33
|
A
|
9
|
A
|
34
|
B
|
10
|
A
|
35
|
B
|
11
|
C
|
36
|
C
|
12
|
C
|
37
|
B
|
13
|
C
|
38
|
A
|
14
|
A
|
39
|
C
|
15
|
B
|
40
|
C
|
16
|
B
|
41
|
C
|
17
|
D
|
42
|
C
|
18
|
D
|
43
|
D
|
19
|
C
|
44
|
C
|
20
|
A
|
45
|
B
|
21
|
A
|
46
|
C
|
22
|
A
|
47
|
A
|
23
|
B
|
48
|
A
|
24
|
B
|
49
|
C
|
25
|
A
|
50
|
D
|
PAPER-3
1
|
B
|
26
|
C
|
51
|
D
|
2
|
C
|
27
|
D
|
52
|
C
|
3
|
B
|
28
|
C
|
53
|
A
|
4
|
C
|
29
|
C
|
54
|
B
|
5
|
C
|
30
|
A
|
55
|
B
|
6
|
D
|
31
|
B
|
56
|
B
|
7
|
C
|
32
|
C
|
57
|
C
|
8
|
D
|
33
|
B
|
58
|
C
|
9
|
D
|
34
|
D
|
59
|
D
|
10
|
D
|
35
|
D
|
60
|
B
|
11
|
B
|
36
|
A
|
61
|
B
|
12
|
B
|
37
|
D
|
62
|
A
|
13
|
C
|
38
|
A
|
63
|
C
|
14
|
A
|
39
|
C
|
64
|
D
|
15
|
D
|
40
|
A
|
65
|
A
|
16
|
D
|
41
|
A
|
66
|
A
|
17
|
C
|
42
|
B
|
67
|
A
|
18
|
C
|
43
|
C
|
68
|
D
|
19
|
B
|
44
|
B
|
69
|
A
|
20
|
D
|
45
|
A
|
70
|
A
|
21
|
D
|
46
|
B
|
71
|
A
|
22
|
D
|
47
|
A
|
72
|
B
|
23
|
D
|
48
|
B
|
73
|
B
|
24
|
A
|
49
|
C
|
74
|
C
|
25
|
C
|
50
|
A
|
75
|
A
|
(1) A process executes the code
forkO;
fork();
forkO;
fork();
The total number of child processes created is
(A) 3 (B) 15 (C) 7 (D) 8
Answer: (B)
(2) Assuming P != NP, which of the following is TRUE?
(A) NP-complete = NP
(B) NP-complete INTERSECTION P = 0
(C) NP-hard = NP
(D) P = NP-complete
Answer(B)
(3) Which of the following statements are TRUE about an SQL query?
P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause
Q: An SQL query can contain aHA VING clause only if it has a GROUP BY clause
R: All attributes used in the GROUP BY clause must appear in the SELECT clause
S : Not all attributes used in the GROUP BY clause need to appear in the SELECT clause
(A) P and R (B) P and S (C) Q and R (D) Q and S
Answer(A)
(4) Given the basic ER and relational models, which of the following is INCORRECT?
(A) An attribute of an entity can have more than one value
(B) An attribute of an entity can be composite
(C) In a row of a relational table, an attribute can have more than one value
(D) In a row of a relational table, an attribute can have exactly one value or a NULL value
Answer(C)
(5) Consider the 4.processes, PI, P2 and P3 shown in the table.
Process ArTrivmael Units time Required
PI 0 9
P2 1 7
P3 3 4
P4 5 5
The completion order of the 4 processes under the RR2 (round robin scheduling
with CPU quantum of 2 time units) are
(6) Which of the following graphs is isomorphic to
Answer: (B)
(7) Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number ofdistinct cycles of length 4 in G is equal to
(A) 15 (B) 30 (C) 90 (D) 360
Answer(A)
(8) Disk requests come into the disk driver for cylinders: 10, 22, 20, 2, 40, 6, 38, in
that order. The disk has 60 total cylinders and the disk head is currently positioned over
cylinder 20. A seek takes 6 milliseconds per cylinder moved. What is the sequence of
reads and total seek time using each of the following algorithms?
First-come, first-served:
10, 22, 20, 2, 40, 6, 38
10 + 12 + 2 + 18 + 38 + 34 + 32 = 146 cylinders = 876 milliseconds.
Answer: 876 milliseconds
(9) Closest cylinder next:
20, 22, 10, 6, 2, 39, 40
0 + 2 + 12 + 4 + 4 + 36 + 2 = 60 cylinders = 360 milliseconds.
Answer: 360 milliseconds
(10) Which of the sorting procedure is the slowest?
(a) bubble sort
(b) quick sort
(c) shell sort
(d) Heap sort
Answer(A)
(11) which of the following eliminates transitive dependency
(a) 1NF (b) 2 NF
(c) BCNF (d) None
(12) which of the following suffering from belady's anamoly
(13) What is the min number of states required for converting ANY NFA with N states to a DFA ?
A. N B. N^2 C. 2^N D. 2N E. N!
Answer: (C)
(14) Consider the huffman's coding for the symbol A with probability 0.3, B with probability 0.15,
C with 0.1, D with 0.25 and E with 0.2
C with 0.1, D with 0.25 and E with 0.2
what is the minimum number of bits required to represent B
(a) 1
(b) 2
(c) 3
(d) 4
Answer: (C)
(15) minimum number of bits required to represent above codes
(a) 14
(b) 11
(c) 12
(d) 15
Answer: (C)
(16) What is the average length of the code
(a) 2
(b) 2.25
(c) 2.40
(d) 3
Answer: (B)
(17) Packet size of IPV4 is
(a) 1500 bytes
(b) 2 MB
Answer: (C)
Answer: 4
(38) Search Engine is intelligent agent
(39) CHARACTER RECOGNITION IS NEURAL NETWORKS
(40) NEURAL NETWORKS IS DECISION SUPPORT SYSTEMS
(41) The java compiler generates code in
(a) assembly language (b) machine language (c) p-code (d) byte code
Answer: (d)
(42) unix commands ls,cut executes on /bin or /usr/bin
(43)In a paged memory, the page hit ratio is 0.35. the time required to access page in
secondary memory is equal to 100 ns.the time required to access page in primary memory is 10 ns. the average time required to access a page is
Answer: 68.5 Ns
(44) Idempotent Law
(A) X+X=X
(B) X.X=X
(C)
Answer: (A) and (B)
(45) Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock
(1) 2-phase commit
(2) Timestamp ordering
(a) (1) only
(b) (2) Only
(c) both (1) and (2)
(d) neither (1) nor (2)
Answer: (C)
(46) Question on Hashing
(47) Inorder and postorder are given find out the root
(48) Cocomo model is used to estimate
Answer: effort and cost
(49) question on compiler design but two answers are correct
i did not understand the difference between
a^n b^n c^n, n>=1
a^n b^n c^n, n>0
(50) Which of the following strings accepted by DFA
(A) BAAAB
(B)BAB
Answer (A) and (B) are correct... but we need to select only one answer
(51) Language accepted by the following DFA
(a) PGP
(73) Search algorithms judge on basis of the following
(a) Space complexity
Answer: All the above
(74) Consider the following statements about the cyclomatic complexity of the control
flow graph of a program module. Which of these are TRUE?
I. The cyclomatic complexity of a module is equal to the maximum number of
linearly independent circuits in the graph.
II. The cyclomatic complexity of a module is the number of decisions in the
module plus one, where a decision is effectively any conditional statement in
the module.
III. The cyclomatic complexity can also be used as a number of linearly
independent paths that should be tested during path coverage testing.
(A) I and II (B) II and III (C) I and III (D) I, II and III
Answer: (D)
(75) Which of the following is an assertion?
(a) P is true, P and Q is true, K or Not(Q) is true implies K is true
(b) P is true, P and Q is true, K or Not(Q) is true implies K is false
(c) P is true, P and Q is false, K or Not(Q) is true implies K is true
(d) P is true, P and Q is true, K or Not(K) is true implies K is true
Answer:(A)
(76) the message 11001001 is to be transmitted using the CRC polynomial x^3+1 to protect it from errors. the message that should be transmitted is
(a) 11001001000 (b) 11001001011 (c) 11001010 (d) 110010010011
Answer: (B)
(77) Match the following
1. Data link layer (i) the lowest layer whose function is to activate, deactivate and
circuit between DTE and DCE
2. physical layer (ii) perform routing and communication
3. presentation layer (iii) detection and recovery from errors in the transmitted data
4. Network layer (iv) provides for the syntax of the data
(a) 1-(iii) 2-(i) 3-(iv) 4-(ii)
(b) 1-(ii) 2-(i) 3-(iv) 4-(iii)
(c) 1- (iv) 2-(i) 3-(ii) 4-(iii)
(d) 1- (ii) 2-(i) 3-(iii) 4-(iv)
Answer: (a)
(a) 1500 bytes
(b) 2 MB
(c) 65355 bytes
(b) 48 bytes
Answer: (C)
(18) Match the following
(1) DFA (a) Lexical analysis
(2) PDA (b) syntax analysis
......................................
...............................
(19) Match the following
(a) O(logn) (1) bubble sort
(b) O(n^2) (2) binary search
(c) O(nlogn) (3) DFS
.................................
(20) Match the following
(1) error control (a) parity bit
(2) Flow control (b) Sliding window
(c) Congestion control (c) token bucket
(d) Synchronization (d) Manchestor coding
will update remaining questions as sooon as possible
(21) In a Simple undirected graph each vertex has degree 3 and |E|=2|V|-3. then
(a) 6 vertices and 9 edges
(b) 6 vertices and 12 edges
(c) ....
....
Answer(a). K3,3 Grpah
(22) SQL is
(a) Structured Query Language
(23) ADO is
ActiveX Data Object
(24) Match the following
Add 3 bits full adder
multiply by 2 left shift by 1
divide by 2 right shift by 1
add 2 bits Half adder
(25) Function overloading done at
(a) Compile time
(26)
swap(int *p, int *q)
{
*p=*p-*q;
*q=*q+*p;
*p=*q-*p;
}
(27) The concatenation of two lists is to be performed in O(1) time. Which of the following implementations of a list could be used?
Answer(c)
(28) What is the maximum number of different Boolean functions involving n Boolean variables?
(a) n^2 (b) 2^n (c) 2^(2^n) (d) 2^(n^2)
Answer: (c) 2^(2^n)
(29) a compiler that runs on one machine and produces code for a different machine is called
Answer: Cross Compiler
(30) Insert, Update ........
Answer: DML
(31) How many T-flip flops are required to implement decade counter?
(32) If Hamming distance is "m" then how many bits can be corrected?
Answer: Less than m/2
(33) Fuzzy logic by
Answer: I think (mamdani)
(34) OLAP
Answer: Online Analytical Processing
(35) Pre-emptive algorithm
Answer: Round Robin
(36) Gray code for 7 is
Answer: 0100
(37) How many flip-flops are required to construct a decade counter?
(a) 6 vertices and 9 edges
(b) 6 vertices and 12 edges
(c) ....
....
Answer(a). K3,3 Grpah
(22) SQL is
(a) Structured Query Language
(23) ADO is
ActiveX Data Object
(24) Match the following
Add 3 bits full adder
multiply by 2 left shift by 1
divide by 2 right shift by 1
add 2 bits Half adder
(25) Function overloading done at
(a) Compile time
(26)
swap(int *p, int *q)
{
*p=*p-*q;
*q=*q+*p;
*p=*q-*p;
}
(27) The concatenation of two lists is to be performed in O(1) time. Which of the following implementations of a list could be used?
a. Singly linked list
b. Doubly linked list
c. Circularly doubly linked list
d. Array implementation o f list
Answer(c)
(28) What is the maximum number of different Boolean functions involving n Boolean variables?
(a) n^2 (b) 2^n (c) 2^(2^n) (d) 2^(n^2)
Answer: (c) 2^(2^n)
(29) a compiler that runs on one machine and produces code for a different machine is called
Answer: Cross Compiler
(30) Insert, Update ........
Answer: DML
(31) How many T-flip flops are required to implement decade counter?
(32) If Hamming distance is "m" then how many bits can be corrected?
Answer: Less than m/2
(33) Fuzzy logic by
Answer: I think (mamdani)
(34) OLAP
Answer: Online Analytical Processing
(35) Pre-emptive algorithm
Answer: Round Robin
(36) Gray code for 7 is
Answer: 0100
(37) How many flip-flops are required to construct a decade counter?
Answer: 4
(38) Search Engine is intelligent agent
(39) CHARACTER RECOGNITION IS NEURAL NETWORKS
(40) NEURAL NETWORKS IS DECISION SUPPORT SYSTEMS
(41) The java compiler generates code in
(a) assembly language (b) machine language (c) p-code (d) byte code
Answer: (d)
(42) unix commands ls,cut executes on /bin or /usr/bin
(43)In a paged memory, the page hit ratio is 0.35. the time required to access page in
secondary memory is equal to 100 ns.the time required to access page in primary memory is 10 ns. the average time required to access a page is
Answer: 68.5 Ns
(44) Idempotent Law
(A) X+X=X
(B) X.X=X
(C)
Answer: (A) and (B)
(45) Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock
(1) 2-phase commit
(2) Timestamp ordering
(a) (1) only
(b) (2) Only
(c) both (1) and (2)
(d) neither (1) nor (2)
Answer: (C)
(46) Question on Hashing
(47) Inorder and postorder are given find out the root
(48) Cocomo model is used to estimate
Answer: effort and cost
(49) question on compiler design but two answers are correct
i did not understand the difference between
a^n b^n c^n, n>=1
a^n b^n c^n, n>0
(50) Which of the following strings accepted by DFA
(B)BAB
Answer (A) and (B) are correct... but we need to select only one answer
(51) Language accepted by the following DFA
Answer: ab(a+b)*
(52) Difference between java application and applet
(53) UNLINK and SEEK are unix commands related to FILE operations
(54) FILE Descriptor returns an Integer value
(55) One Question on EOF
(56) Parse Generator
Answer: YAAC
(57) acceptance test
(a) regression test
(b) Unit Test
(c) Integration test
(d) Functional test
(58) Object Oriented approach
(a) Booach
(b)ranbaugh
Answer: ALL THE ABOVE
(59) Connectivity between modules
(a) cohesion
(b) temporal cohesion
(c) Coupling
(d) Logical cohesion
Answer: (C)
(60) ------------------- abstraction
(a) Procedural
(b) data
(c) Control
(d) physical
(61) Inference system consists of
(a) facts
(b) search
(c) Domain Experts
(d) Knowledge Base
Answer: Facts and KnowledgeBase
(62) which of the following protocol resolves IP address
(a) ARP
(b) RARP
(c) HTTP
(d) DNS
Answer: B and D
(63) which if the following regular expressions are equivalant
(a) (r')'=r
Answer: (A)
(64) Question on Exterior GateWay protocol
(65) if(A>B) ....
a=a+1;
b=b+1;
what is cyclomatic complexity
(66) one more on cyclomatic complexity
(67) Which of the following is non-linear datatype
Answer: Tree and graph
(68) f(1,1)=1 and f(-1,0)=0 then f(3,5) =?
(69) 1000k Memory is partioned using variable partitions but to compaction. 340K and 200K are available now. .........
Answer: 461
(70) one question on ActiveX tag
(OBJECT) tag is used to place ActiveX controls in HTML pages.
(71) transport emails security
(a) PGP
(b) BGP
(c) IP-sec
(72) combinational circuit, 4-bit input, if 5,6,7,9 then output is one, others zero. minimum number of gates required to implement the functionality (AND, NOT and OR)
(73) Search algorithms judge on basis of the following
(a) Space complexity
(b)Time complexity
(c) Completeness
(d) Optimality
Answer: All the above
(74) Consider the following statements about the cyclomatic complexity of the control
flow graph of a program module. Which of these are TRUE?
I. The cyclomatic complexity of a module is equal to the maximum number of
linearly independent circuits in the graph.
II. The cyclomatic complexity of a module is the number of decisions in the
module plus one, where a decision is effectively any conditional statement in
the module.
III. The cyclomatic complexity can also be used as a number of linearly
independent paths that should be tested during path coverage testing.
(A) I and II (B) II and III (C) I and III (D) I, II and III
Answer: (D)
(75) Which of the following is an assertion?
(a) P is true, P and Q is true, K or Not(Q) is true implies K is true
(b) P is true, P and Q is true, K or Not(Q) is true implies K is false
(c) P is true, P and Q is false, K or Not(Q) is true implies K is true
(d) P is true, P and Q is true, K or Not(K) is true implies K is true
Answer:(A)
(76) the message 11001001 is to be transmitted using the CRC polynomial x^3+1 to protect it from errors. the message that should be transmitted is
(a) 11001001000 (b) 11001001011 (c) 11001010 (d) 110010010011
Answer: (B)
(77) Match the following
1. Data link layer (i) the lowest layer whose function is to activate, deactivate and
circuit between DTE and DCE
2. physical layer (ii) perform routing and communication
3. presentation layer (iii) detection and recovery from errors in the transmitted data
4. Network layer (iv) provides for the syntax of the data
(a) 1-(iii) 2-(i) 3-(iv) 4-(ii)
(b) 1-(ii) 2-(i) 3-(iv) 4-(iii)
(c) 1- (iv) 2-(i) 3-(ii) 4-(iii)
(d) 1- (ii) 2-(i) 3-(iii) 4-(iv)
Answer: (a)
(78) Consider the join of relation R with a relation S. If R has m tuples and S has n
tuples, then the maximum and minimum size of the join respectively are
(A)
m+n and 0 (B) m+n and |m-n|
(C)
mn and 0 (D) mn and m+n
12. Bélády's anomaly ----- First in FirstOut
ReplyDelete(FIFO) page replacement algorithm.
13. What is the min number of states required
for converting ANY NFA with N states to a
DFA ?
A. N B. N^2 C. 2^N D. 2N E. N!
2^N is the max states(i think please check)
11. which of the following eliminates
transitive dependency
BCNF(Every Relation in BCNF is also in 3NF)
This comment has been removed by the author.
ReplyDeleteapset official key
Deletehttp://netcs2012.blogspot.in/p/apset-july-2012-answer-key.html
HI ... I GOT 38 CORRECT IN PAPER 3...CAN U LIST SOME ANSWERS TO QUESTIONS....
ReplyDeleteapset official key
Deletehttp://netcs2012.blogspot.in/p/apset-july-2012-answer-key.html
FOR QUESTION 6 ANSWER IS B
ReplyDeleteCAN U GIVE ANSWERS TO 14 15 16
ReplyDeleteAnswers are updated for above questions
Delete17TH ANSWER C
ReplyDeleteNLP(NON LINEAR PROGRAMMING) QUESTION ANS IS: OBJECTIVE FUNCTION HAVE NON LINEAR AND ALL CONSTRAINTS HAVE LINEARITY.
ReplyDeleteSEARCH ENGINE IS INTELIGENT AGENT
ReplyDeleteCHARACTER RECOGNITION IS NEURAL NETWORKS
ReplyDeleteNEURAL NETWORKS IS DECISION SUPPORT SYSTEMS(I THINK)
ReplyDeletejava after compile produces byte code
ReplyDeleteunix commands ls,cut executes on /bin or /usr/bin
ReplyDeleteI TOO EXPECTING 30+ 30+ 40+
ReplyDelete59 ans c
ReplyDeleteWhat could be the cutoff for this time for the final result?
ReplyDelete63 ans is (p+q)'=(p'.q')'
ReplyDeleteminimum cutoff is given in website.
ReplyDeletethey are used to qualify the candidates to prepare the results. but the final list is prepared from the top 4 to 5% merit i think. if any info on this plz share
DeleteI heard 5% will be selected from each branch... 5% is huge number compare to NET qualified candidates in past couple of years
Delete63 ans (r')'=r is wrong actual ans is:(p+q)'=(p'.q')'
ReplyDelete(r')'=r' this is right but in the question paper (r')'=r which is wrong
please give me any link which supports ur answer...
DeleteQuestion 63 explanation:
Deletehttp://vedyadhara.ignou.ac.in/wiki/images/5/5e/UNIT3%28B-3_MCS-031%29.pdf
see page no:52
Thanks for the info.. will change answer accordingly
DeleteIn 63 question, in RE, is it clean-closure or any thing else?
Deleteit suppose to be kleene closure but in the exam, given as '
Deleteall regular expression properties based on clean-closure not complementation
Delete(r')'=r is correct
Delete65 ans is chromatic complexity is :2
ReplyDeleteExceptions are raised by
ReplyDeleteuser
os
user and os
Ans:user
Delete61 inference engine refers to facts and knowledge base.
ReplyDeletegood
DeleteFuzzy logic began with the 1965 proposal of fuzzy set theory by Lotfi Zadeh
ReplyDelete33 question answer is Lotfi zadeh
EOF return -1 values
ReplyDelete55 question answer
52 question answer is D (all of the above)
ReplyDeleteare sure answer is all the above??
Deletequestion 27 answer is D (array implemetation)
ReplyDeleteCAN U GIVE EXPLANATION OR LINK?
DeleteI would like to add explanation to support Author answer as C.
DeleteConsider SLL, each node has a link which contains address of next node. to concatenate 2 lists we have to place address of second linked list first node in first linked list last node. so we have to find last node of first linked list. it need O(m) to traverse from first node to last node(assume first linked list has m elements). so complexity of concatenate by using in SLL is:O(m).
Similar case with DLL: Since first node previous and last node next of DLL are NULL.
In case of Circular DLL: first node previous contains last node address.
we can then go to last node, we will place its next as second linked list first node address.
second linked list last node address save in temporary variable(which is previous of second linked list first node previous) and fill the second linked list first node previous as first linked list last node address.
finally second linked list last node next fill by first linked list first node address.
so for any number of elements in 2 linked lists: we need only constant no. of operations. so for Circular linked list concatenation needs only O(1).
question 3 answer is C (Q&R are correct)
ReplyDeletePlease refer the below website
Deletehttp://manuals.sybase.com/onlinebooks/group-as/asg1250e/sqlug/@Generic__BookTextView/9481;pt=9316
one question on ActiveX tag
ReplyDelete(OBJECT) tag is used to place ActiveX controls in HTML pages.
can u give explanation for question no:14 15 16
ReplyDeletehttp://www.google.co.in/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&ved=0CGMQFjAA&url=http%3A%2F%2Felderlab.yorku.ca%2F~vida%2Fppt%2FHuffman_Coding.ppt&ei=f48WUPglx-OsB6f-gJgL&usg=AFQjCNFSyA7hc3NJVdcukQsq4KkUj8dr0Q&sig2=g79alw7v5uSt_kbw1yPj5Q
Deletei know procedure how to solve, if u solved this problem pz post ur solution. As i got C,D,C as answers exactly.
Deletequestion 63 explanation:
ReplyDeletehttp://vedyadhara.ignou.ac.in/wiki/images/5/5e/UNIT3%28B-3_MCS-031%29.pdf
see page no:52
sunil, in question, they mentioned ' . is it *??
DeleteMEMORY MANAGEMENT QUESTION WITH VARIABLE PARTITION SCHEMES QUESTION ANS:461
ReplyDeleteEven i guessed answer as 461 but how?
Deleteif u can post question, then i will give solution i forgot values
DeleteANSWERS FOR 14,15,16 ARE: C, D , C
ReplyDeleteI SOLVED PROBLEM 14,15,16 I GOT : C,D,C
ReplyDeleteI have added solution to 14,15 and 16. please check and let me know
Delete62 ANS IS : B AND D
ReplyDeleteThanks sunil
Deletei think answers are ARP and HTTP
DeleteHi Bhanu,
ReplyDeleteCould u please increase the font when special symbols are in the questions.
hi ravi, which question u r referring
Delete69th solution: after inserting two jobs remaining space after compaction is 640 which is sufficient to insert any job <=640. But if we insert job with 641, it does not insert so it suffers external fragmentation.
ReplyDeleteThanks sunil
DeleteYou will surely clear the exam. Wish you all the best. Your most of questions are correct.
ReplyDeleteThis comment has been removed by the author.
DeleteGuys !!
ReplyDeleteWhen we can expect APSET Key?
key wont be released
Deletehi Bhanu,
Deletehow do you came to know that key will not be released?
Regards,
Sateesh Reddy.
for any exam, key will be released in 2-3 days after the exam. so i guess there wont be any key
DeleteI think answer for question no 7 is C. 4 vertices from 6 vertices can be chosen in C(6,4) = 15 ways and number of ways in which 4 vertices can be arranged in a cycle is (4-1)! = 6 ways, so total number of 4 length cycles are 15*6 = 90 ways.
ReplyDeleteI did not know the answer but i got it from internet.. :)
DeleteThe options given some are not matching with orginal i have the questions with option i will post by 5th August
ReplyDeleteHI.. PLEASE ME LET ME KNOW QUESTIONS AND ANSWERS
Deleteapset official key
Deletehttp://netcs2012.blogspot.in/p/apset-july-2012-answer-key.html
I think answer for question (3) is C ( Q and R). but I am not 100 percent sure.
ReplyDeleteThis comment has been removed by the author.
DeleteThanks Sunil...
Deleteapset official key
Deletehttp://netcs2012.blogspot.in/p/apset-july-2012-answer-key.html
HI... HERE U PEOPLE HAVE POSTED SOME QUESTIONS,BUT I WOULD LIKE TO KNOW WHETHER THESE QUESTIONS ARE ONLY FROM PAPER3 OR ALTOGETHER FROM PAPER2 AND PAPER3
ReplyDeleteboth paper-3 and paper-2
DeleteHi Bhanu ,
Deletecan you provide the revised Key , after viewing all the above post so that we can come to an idea about how much marks we can get. since some of the question's key is varying from one person to the other if we could see the above all comments.
Regards,
Sateesh Reddy Nayani.
Hi sateesh,
Deletewe have questions but not in order as per the set exam question paper. i got 10 questions as per set exam question paper. you can find the key for 10 questions in this post. i got 8 correct out of 10 :)
HI sateesh,
DeleteIf u dont mind, can u provide ur key for three papers.
HI
DeleteTODAY I TALKED TO APSET OFFICE, THEY TOLD ME THAT UGC HAVE NOT GIVEN APPROVAL SO FAR FOR THE KEY RELEASE of APSET. ALSO THEY SAID THEY MAY TAKE 45 DAYS TO PUBLISH THE RESULT. BUT AS PER THE PRESS, RESULTS WILL COME BY AUGUST LAST WEEK. SO LET US WAIT FOR THE DIRECT RESULTS ONLY :-)
REGARDS
NAYANI SATEESH REDDY
can anybody give me clarification on this.i have qualified the SLET exam conducted by karnataka,but iam from ANDRAPRADESH.
ReplyDeleteI would like to know whether i am qualified for applying degree college lecturer posts conducting in AP
most probably no... NET is valid for all over india and but set/slet are valid for states only. i am not 100% sure..:)
Deletei do agree with Bhanu's Opinion.
DeleteSLET/SET is only for the state level. you can avail the Qualification of SET/SLET in karnataka only. it is not valid for AP.
Hi sir,
ReplyDeleteWhat is the approximate competition ratio that have applyed for degree lecturers for the last notification. so that we will come to know exactly how competition would be ?
APSET DECLARED KEY at APSET.ORG
Deletehow many marks u r getting Bhanu!
Deletei got 62, 80 and 86 marks in paper-1,2 and 3respectively...
DeleteBut i am expecting 8 marks (4 questions ) from paper-3..
Hi ravindra, please verify following questions from paper-3.
For Question Number: 24. Both (a) and (c) are correct
For Question Number: 25. No answer in the given options
For Question Number: 39. Both (c) and (d) are correct
For Question Number: 73. Answer: (B)
Ravi, what about your marks?
Deletehi Bhanu, i did not write APSET, i have to check NET marks. i am currently out of station. could you please post APSET papers in the blog..!
DeleteHi..
ReplyDeletecan u plz send me some ebook links for net CS.
hi deepak,
Deleteread tandard books and discuss with friends( group study)...
UGC NET JUNE 2012 RELEASED.SO Any update on APSET 2012 KEY?
ReplyDeleteOfficial announcement regarding APSET2012 is there in apset.org.
ReplyDeletecheck it out.
they are going to release question papers along with key on or before 3oth of August.
any revision to the key given above for Paper 3.
ReplyDeletei am attaching the same here? any changes in this? i think the key for 3 paper given above has some corrections. if any corrections please update
PAPER III (Computer Science & Applications)
1 B 26 C 51 D
2 C 27 D 52 C
3 B 28 C 53 A
4 C 29 C 54 B
5 C 30 A 55 B
6 D 31 B 56 B
7 C 32 C 57 C
8 D 33 B 58 C
9 D 34 D 59 D
10 D 35 D 60 B
11 B 36 A 61 B
12 B 37 D 62 A
13 C 38 A 63 C
14 A 39 C 64 D
15 D 40 A 65 A
16 D 41 A 66 A
17 C 42 B 67 A
18 C 43 C 68 D
19 B 44 B 69 A
20 D 45 A 70 A
21 D 46 B 71 A
22 D 47 A 72 B
23 D 48 B 73 B
24 A 49 C 74 C
25 C 50 A 75 A
Hi, Key published by me in this blog is my key not the original key
Deleteapset will release the original key by end of this month...
APSET DECLARED KEY at APSET.ORG
DeleteHi sir,
Deletei got 52 in p1,42 in p2 and 58 in p3 as per key released by APSET.ORG.
i belonges to OC.
As per instructions of APSET i should get 75 marks in p3.
pls let me know if all over pass percentage is low,whether they reduce the cutoff marks.
Hi Madhavi,
DeleteAPSET never decrease the cutoff but they do increase cutoffs.. sorry for you this time.. try next time..
Regards,
Bhanu
i got 62,80 and 86 marks .... hoping for the best
Deletei got 64 58 and 78
ReplyDeletethen you have chances to qualify.. .
Deletecongrates bhanu
ReplyDeleteThanks sunil
DeleteHi Bhanu, Thanks for link and I agree with you the mistakes in the answer key of paper3.
ReplyDeleteAccording to me, The correct answer should be :
For Q24 both A and C option are correct.
For Q39 both C and D option are correct.
For Q46 - B option are correct. ( Can you please cross check it once )
For 73 - B option are correct. ( I am 100% sure about that )
For 75 - C option are correct. ( Please refer Gate 2012 question paper from the IIT website Q15 - http://gate.iitm.ac.in/gate2012/ )
Congratulation for getting good marks. Hope for the best result. Wish you all the best.
Thanks
Jitender Rohilla
Hi Rohilla,
Deletewhat's ur score?
I got 66 52 and 72. i belongs to BC. do u guess what will be the cutoff marks?
ReplyDeleteThis comment has been removed by the author.
DeleteHi surya,
Deleteyou have chances to qualify provided there wont be any increase in cutoff marks...
Hi all,
ReplyDeleteI have got 70, 66 and 78 marks in paper I,II & III respectively. Please let me know my chances of being qualified in APSET. I belong to BC.
prakash where r u from? which subject computer science or other?
Deletepraka, yes .. you have chances of qualifying provided there wont be any increase in cutoffs.. let's hope for the best....
Deleteprakash, there are few mistakes in paper-3... please check and send feedback to apset2012@gmail.com
For Question Number: 24. Both (a) and (c) are correct
For Question Number: 25. No answer in the given options
For Question Number: 39. Both (c) and (d) are correct
for question number: 46 Answer is (B)
For Question Number: 73. Answer: (B)
Bhanu for 46 ans is D not B
DeleteREASON: X^3+1=1X^3+0X^2+0X+1=1001 SO INITIALLY 0000 ZEROS SHOULD APPEND TO GIVEN DIVIDEND,ANS SHOULD BE GIVEN 8BITS+4BITS=12BITS ANS
Hi Bhanu,
ReplyDeleteI am getting I-68,II-44,III-82 respectively. And in Paper-III, For Q.No.24, I wrote (A).
For Q.39, I wrote (C). For Q.No.46, I wrote (B). I verified the answers for the above three questions, what u told is correct.
Hi Prashanth,
Deletecongrats..you have chance of qualifying ...Please send an email to apset2012@gmail.com about your opinion on the wrong questions with answers..
Regards,
Bhanu
Hi Prashanth,
DeleteYou can also send your feedback to APSET office - apset2012@gmail.com
Thanks
Jitender Rohilla
Thanks a lot.
DeleteAPSET is planning to release the Final Key on 15th of September.
Deletehow do u know?
DeleteHi Bhanu,
ReplyDeleteI got 70,70 and 88 in APSET and 72,44 and 82 in NET.
What are all the uses of NET and SET scores.
Where can we use these scores except for research?
APSET is planning to release the results by the end of September
ReplyDeleteAPSET has given in the website that the valuation process is completed.
ReplyDeleteYes, I too have a look just now in the Apset website. So, we can expect the results very soon.
ReplyDeleteany one attach the apset question papers plz
ReplyDeleteUGC-NET has given the result. only 5 for qualified from Osmania University(Computer Science).
ReplyDeleteI called apset office and they told the results will be declared by the end of this month and date is not confirmed
ReplyDeleteapset result will be anytime in nextweek, between 24th to 28th of september
DeleteHi everyone, ugc has specified the eligibility criteria as 65%. Check ugc website. Will the same percentage continue for APSET.
ReplyDeleteThe Lectureship Eligibility criteria for Open Category is Paper-I:40%, Paper-II-40%, Paper-III:50%, Aggregate in Three Papers:65%. Once visit the UGC Website.
ReplyDeletei got 114 questions correct out of 175 in apset that means 65.14% correct.if 65% is cutoff for apset then i will be in ... if apset consider the feedback about keys then i will get 120 questions correct that means 68% correct.. eagerly waiting for the result...
Deleteadvance congratulations
DeleteIs NET and SET cutoff marks are same?
ReplyDeleteI think so.
DeleteHi everyone,
ReplyDeleteI scored 212 marks i.e 60.5% as per APSET initial key. I belong to BC category. For BC category, this time UGC cutoff was 60%. If same cutoff is adopted by APSET, I may qualify. Hoping for the best. All the best to all those who are eagerly waiting for results.
The UGC Committee is likely to visit Hyderabad in the last week of September 2012. They will decide the percentage / aggregates of the qualifying marks and suggest the dates of results. In all probability, the APSET 2012 results will come out by the end of this month.
ReplyDeleteIn A.P.SET the percentage marks will be Overall for all subjects or individual Subject wise.
ReplyDeletei think overall for all subjects
ReplyDeleteOfficial Information: AP-SET Results will be announced before 6th October, 2012.
ReplyDeleteYes. I too have seen this news in APSET website. Thanks for your update. So tension continues....
Deleteyes. but when final key will be released? will final key and result be announce at same day?
DeleteOfficial Information: APSET-2012 Results will be released tomorrow(4th oct) by 11.30pm.
ReplyDeleteAll the Best to everyone.
Official Information: APSET-2012 Results will be released tomorrow(4th oct) by 11.30am (i.e.Morning).
ReplyDeleteAll the Best to everyone.
Results are out. Please use this link
Deletehttps://fc60ca81-a-62cb3a1a-s-sites.googlegroups.com/site/mallikabv/apsetresults.pdf?attachauth=ANoY7coJ48uF6y4EOUrh8wjvPS9AyeZer_Ah2Y5jOnsgU2PtooQX3X-CYUXXqBWMjMChH6tm1FIORq9GM0EvIT8Z5SG5s9XwTrdttXtTqu9NmHeRKMdQWQZI2SFmaKTUXSTUNVGU9oLbM6FGBD0feYd77BgyPUgJaKk6pdwGP10JvVT8kALHE5Pbhh1RV1_WR_xLeM68QaLbuklgtncHFXN7_L_cf4deqA%3D%3D&attredirects=1
for results. I am qualified. All the best to my fellow participants.
http://www.sakshieducation.com/%28S%28jxcycn45a3veavm0cs4h4m45%29%29/ResultsStory.aspx?cid=25&nid=35455
ReplyDeleteI have also cleared APSET Exam. Congratulation Prakash. Bhanu, whats your result
ReplyDeleteThanks and wish you the same.
DeleteCongratulations to all those who are qualified in APSET.
ReplyDeleteCongrats Bhanu!!
ReplyDeleteFriends,
ReplyDeleteDid you observe: No number greater then 11040 - 3207 is not there in the result. May be it is correct. But this is just my observation. i.e No single number is there in between 3207 to 9999 i.e. 11040-3207 to 11040-9999. I do not weather these numbers are valid or not.
Hi Prakash and Rohilla,
ReplyDeleteHow many marks did u get according to the first key.
I got above 65% in first key but did not qualify SET. May be key has changed.
May be narrowly you have missed to qualify. Please check the final key published in apset.org to know your final marks.
DeleteThey have published the final key on there website. Please check with that
ReplyDeleteBhanu wat about ur result?
ReplyDeleteBhanu Has cleared the exam.
ReplyDeleteHi friends, This result is final or cutoff marks will be decrease as given in newspaper that to decrease the cutoff criteria
ReplyDeletefriends, do we need to see the APSET registration number or Roll number in the results.
ReplyDeleteI have got 76 in Paper1, 74 in Paper2 and 102 in Paper2 , So total of 252 ( 72 % ).
ReplyDeleteCongrats Rohilla, I got 74,70 and 96 respectively and total-240(68.5 %) and cleared the exam.
ReplyDeleteThanks. Congrats to you also
ReplyDeleteSir,
ReplyDeleteDo u have any idea on how many people have qualified in our subject.
the other thing is i lost the opportunity to apply for UGC NET of december edition.
earlier i saw in some blog that UGC is going to release the notification in september last week or in october 1st week.
when i checked recently i found everything has finished.
i lost the opportunity to apply for.
pls if u know any information regarding UGC NET notifications and related information pls remember us.there is a lot of people looking for applying and clearing the exam, if you people make it comfortable.
no. UGC NET December 2012 notification not released yet.
ReplyDeletecheck ugc site again.
http://ugcnetonline.in/index.php
even i was also looking at the same site regularly and thats y i lost an opportunity to apply.
ReplyDeletebut suryaji notification has already relased and even the timeout for applying too.
pls check
http://careerquips.blogspot.in/2012/08/csir-ugc-net-dec-2012-notification-form.html
sorry friend! i think you asked for UGC NET not CSIR-UGC-NET. Both exams are different.
DeleteHi, if any one is downloaded the APSET-2012 Computer Sc question papers,please upload and share.
ReplyDeleteThanks
Isn't it ?
ReplyDeleteI dont know exactly the difference between the two.
Anyways can u make me remember whenever the notification is going to be released(UGC NET).
I didnt know about this UGC NET exactly, thats y i hadnt applied on june edition.
whenever APSET notifivation has given, i came to know abt the UGC NET.
ANYWAYS thanks for the clarification Suryaji.
Could u pls tell me when we will expect the notification.
It is already upload on the facebook group UGC NET for computer science or drop ur id, i will mail you those.
ReplyDeleteHi Rohilla,
DeleteCan you plz send the APSET CS papers. my id mallavaram@gmail.com
Thanks
venu
Hi sit,
Deletemy name is malini.
can u send me to my mail id too.
malini_jv@yahoo.co.in
pratibhaOctober 9, 2012 9:43 AM
ReplyDeleteSir,
Do u have any idea on how many people have qualified in our subject.
@ Pratibha, 265 candidates were qualified for APSET in Computer Science subject.
Hi Venu, I have dropped the mail to you. Thanks Jitender
ReplyDeletehi everybody! could u pls tell me the cut off percentage in slet for life science will remain same to other subjects or it will be different like the csir ugc net.i m really confused since i have obtained just 60,50 and 80 in assam slet and m waiting for the final result.
ReplyDeleteHi guys,
ReplyDeleteUGC NET notification for december edition has released.
check it out.
Exam date: 30 th december
hi sir,
ReplyDeletethis is the first time i have been applying for ugc net.
i belong to "GENERAL" category.
i wish to apply for only lecturership.
could u pls tell me whether i have to submit the attested copies of my P.G to the concerned university along with application form and attendance slip.
one more thing whether i have to submit all my educaional certificates from 10 th class to P.G or only P.G certificate is enough.
ReplyDeletealong with application form they mentioned
ReplyDelete"Two self addressed unstamped envelopes of 10" X 4" size."
really without stamps? or it is any print mistake.
no mistake, without stamps only.
DeleteUGC has given Supplementary Results for June-2012.
ReplyDeleteIs there will be change in APSET 2012 results also
ReplyDeleteAPSET follows UGC NET,Delhi rules and regulations. so it has to follow cut-off criteria also. i also think it will give supplementary results soon.....
DeleteLets hope APSET will also give supplementary results soon...
DeleteAPSET MARKS have been displayed on the apset.org http://online.apset.org/loginmark.aspx
ReplyDeleteHi Bhanu, Congratulation for clearing the net exam.
ReplyDeleteI also hope APSET also release supplementary results.But we have to send mail to APSET office or not necessary (regarding to change the cutoff criteria as subject wise)
ReplyDeleteI called APSET office today and they told they have not discussed about supplementary results...
DeleteI also called APSET office they told they have not discussed. Is there will be supplementary results or not, If there I will be get qualify. can any body say?
ReplyDeleteAPSET Certificates will be issued from 26th November.
ReplyDeleteHi friends, I had make a call to APSET office, they told the UGC NET has not discussed with APSET members.
ReplyDeleteSo we will send mail to ugc net, regarding supplementary results for APSET also(subject wise cutoff). please give suggestion for this.
Hi Prakash and Rohilla,
ReplyDeleteHow many marks did u get?
Hey Bhanu Sir, I have cleared Jun 2012 NET exam. Thank you very much. Your blog helped me very much.
ReplyDeleteIs there will be any change in APSET 2012 results?
ReplyDeleteI think there will be no change in results because certificates are also producing.
DeleteAPSET Certificates distribution photos are available in the website.
ReplyDeletehttp://www.apset.org/apset-2012-certificateIssues.htm
Sir I got 194(55.5%) and i am belongs to obc,is it any chances to qualify if supplementary results will be released.Please respond me sir.
ReplyDeleteI got 208 (59.42%). and i am belongs to OBC which cutoff is 60%. within 0.58% i lost. if any changes are there then definitely i will qualify.
ReplyDeleteonce you contact with APSET office whether the supplementary results are there or not
DeleteUn-Official Information:
ReplyDeleteAPSET may release supplementary result after 26th of this month(APSET got approval from UGC)
Hi prashanth...Thanks for the info. If you know could you please tell the supplementary cut-off for open category in computer science.
Delete