UGC NET Computer Science Solved Paper -III June2012
1. Consider the following pseudocode segment :
K:=0
for i1:= 1 to n
for i2:= 1 to i1
:
:
:
for im:= 1 to im–1
K:= K+1
The value of K after the execution of this code shall be
(A) C(n + m – 1, m)
(B) C(n – m + 1, m)
(C) C(n + m – 1, n)
(D) C(n – m + 1, n)
Explanation:
2. In Delta Rule for error minimization
(A) weights are adjusted w.r.to change in the output
(B) weights are adjusted w.r.to difference between desired output and actual output
(C) weights are adjusted w.r.to difference between input and output
(D) none of the above
3. The concept of pipelining is most effective in improving performance if the tasks being performed in different stages :
(A) require different amount of time
(B) require about the same amount of time
(C) require different amount of time with time difference between any two tasks being same
(D) require different amount with time difference between any two tasks being different
4. What is Granularity ?
(A) The size of database
(B) The size of data item
(C) The size of record
(D) The size of file
5. Suppose that a given application is run on a 64-processor machine and that 70 percent of the application can be parallelized. Then the expected performance improvement using Amdahl’s law is
(A) 4.22
(B) 3.22
(C) 3.32
(D) 3.52
Hint: S(N) = 1/(1-P)+P/N where P = portion of parallel N= no.of.processor : 1/((1-0.7)+(0.7/64))
6. If two fuzzy sets A and B are given with membership functions
μA(x) = {0.2, 0.4, 0.8, 0.5, 0.1}
μB(x) = {0.1, 0.3, 0.6, 0.3, 0.2}
Then the value of μ A∩B will be
(A) {0.9, 0.7, 0.4, 0.8, 0.9}
(B) {0.2, 0.4, 0.8, 0.5, 0.2}
(C) {0.1, 0.3, 0.6, 0.3, 0.1}
(D) {0.7, 0.3, 0.4, 0.2, 0.7}
Note: All the above answer given is wrong. Even answer key given in UGC NET portal is wrong
Hint: The answer should be {0.9, 0.7, 0.4, 0.7, 0.9}. i.e A∩B = 1-(min[μA,μB])
7. Match the following :
(i) OLAP (a) Regression
(ii) OLTP (b) Data Warehouse
(iii) Decision Tree (c) RDBMS
(iv) Neural Network (d) Classification
(i) (ii) (iii) (iv)
(A) (b) (c) (a) (d)
(B) (b) (c) (d) (a)
(C) (c) (b) (a) (d)
(D) (c) (b) (d) (a)
8. Which level of Abstraction describes what data are stored in the Database ?
(A) Physical level
(B) View level
(C) Abstraction level
(D) Logical level
9. The problem that occurs when one transaction updates a database item and then the transaction fails for some reason is ________.
(A) Temporary Select Problem
(B) Temporary Modify Problem
(C) Dirty Read Problem
(D) None
10. In an image compression system 16384 bits are used to represent 256 × 256 image with 256 gray levels. What is the compression ratio for this system ?
(A) 1
(B) 2
(C) 4
(D) 8
11. X.25 is ________ Network.
(A) Connection Oriented Network
(B) Connection Less Network
(C) Either Connection Oriented or Connection Less
(D) Neither Connection Oriented nor Connection Less
12. Which of the following can be used for clustering of data ?
(A) Single layer perception
(B) Multilayer perception
(C) Self organizing map
(D) Radial basis function
13. Which of the following is scheme to deal with deadlock ?
(A) Time out
(B) Time in
(C) Both (A) & (B)
(D) None of the above
14. If the pixels of an image are shuffled then the parameter that may change is
(A) Histogram
(B) Mean
(C) Entropy
(D) Covariance
15. The common property of functional language and logical programming language :
(A) Both are declarative
(B) Both are based on λ-calculus
(C) Both are procedural
(D) Both are functional
16. Given the following statements :
(i) The power of deterministic finite state machine and nondeterministic finite state machine are same.
(ii) The power of deterministic pushdown automaton and nondeterministic pushdown automaton are same.
Which of the above is the correct statement(s) ?
(A) Both (i) and (ii)
(B) Only (i)
(C) Only (ii)
(D) Neither (i) nor (ii)
17. Let Q(x, y) denote “x + y = 0” and let there be two quantifications given as
(i) ∃y∀xQ(x,y)
(ii)∀x∃yQ(x, y)
where x & y are real numbers. Then which of the following is valid ?
(A) (i) is true & (ii) is false.
(B) (i) is false & (ii) is true.
(C) (i) is false & (ii) is also false.
(D) both (i) & (ii) are true.
18. Consider a schema R(A, B, C, D) and functional dependencies A→B and C→D. Then the decomposition R1(A, B) and R2(C, D) is
(A) Dependency preserving but not lossless join
(B) Dependency preserving and lossless join
(C) Lossless Join but not dependency preserving
(D) Lossless Join
Hint: R1∩R2 gives nullset {} so its lossy join or not lossless join
19. The quantiser in an image-compression system is a
(A) lossy element which exploits the psychovisual redundancy
(B) lossless element which exploits the psychovisual redundancy
(C) lossy element which exploits the statistical redundancy
(D) lossless element which exploits the statistical redundancy
20. Data Warehouse provides
(A) Transaction Responsiveness
(B) Storage, Functionality Responsiveness to queries
(C) Demand and Supply Responsiveness
(D) None of the above
21. A* algorithm uses f ‘ = g + h’ to estimate the cost of getting from the initial state to the goal state, where g is a measure of the cost of getting from initial state to the current node and the function h’ is an estimate of the cost of getting from the current node to the goal state. To find a path involving the fewest number of steps, we should set
(A) g = 1
(B) g = 0
(C) h’ = 0
(D) h’ = 1
22. The transform which possesses the highest ‘energy compaction’ property is
(A) Slant transform
(B) Cosine transform
(C) Fourier transform
(D) Karhunen-Loeve transform
23. Which one of the following prolog programs correctly implement “if G succeeds then execute goal P else execute goal q ?”
(A) if-else (G, P, q) :- !, call(G), call(P). if-else (G, P, q) :- call(q).
(B) if-else (G, P, q) :- call(G), !, call(P). if-else (G, P, q) :- call(q).
(C) if-else (G, P, q) :- call(G), call(P), !. if-else (G, P, q) :- call(q).
(D) All of the above
24. The _______ memory allocation function modifies the previous allocated space.
(A) calloc( )
(B) free( )
(C) malloc( )
(D) realloc( )
25. Which is not the correct statement(s) ?
(i) Every context sensitive language is recursive.
(ii) There is a recursive language that is not context sensitive.
(A) (i) is true, (ii) is false.
(B) (i) is true and (ii) is true.
(C) (i) is false, (ii) is false.
(D) (i) is false and (ii) is true.
26. The mechanism that binds code and data together and keeps them secure from outside world is known as
(A) Abstraction
(B) Inheritance
(C) Encapsulation
(D) Polymorphism
27. Identify the addressing modes of below instructions and match them :
(a) ADI (1) Immediate addressing
(b) STA (2) Direct addressing
(c) CMA (3) Implied addressing
(d) SUB (4) Register addressing
(A) a – 1, b – 2, c – 3, d – 4
(B) a – 2, b – 1, c – 4, d – 3
(C) a – 3, b – 2, c – 1, d – 4
(D) a – 4, b – 3, c – 2, d – 1
28. Which one of the following is not a Greibach Normal form grammar ?
(i) S → a | bA | aA | bB
A → a
B → b
(ii) S → a | aA | AB
A → a
B → b
(iii) S → a | A | aA
A → a
(A) (i) and (ii)
(B) (i) and (iii)
(C) (ii) and (iii)
(D) (i), (ii) and (iii)
29. Which of the following IP address class is a multicast address ?
(A) Class A
(B) Class B
(C) Class C
(D) Class D
30. While unit testing a module, it is found that for a set of test data, maximum 90% of the code alone were tested with a probability of success 0.9. The reliability of the module is
(A) atleast greater than 0.9
(B) equal to 0.9
(C) atmost 0.81
(D) atleast 1/0.81
31. The upper bound of computing time of m coloring decision problem is
(A) O(nm)
(B) O(nm)
(C) O(nmn)
(D) O(nmmn)
32. The equivalent grammar corresponding to the grammar G : S → aA, A → BB, B → aBb | ∈ is
(A) S → aA, A → BB, B → aBb
(B) S → a|aA, A → BB, B → aBb | ab
(C) S → a | aA, A → BB | B, B → aBb
(D) S → a | aA, A → BB | B, B → aBb | ab
33. Which one of the following statements is incorrect ?
(A) The number of regions corresponds to the cyclomatic complexity.
(B) Cyclometric complexity for a flow graph G is V(G) = N – E + 2, where E is the number of edges and N is the number of nodes in the flow graph.
(C) Cyclometric complexity for a flow graph G is V(G) = E – N + 2, where E is the number of edges & N is the number of nodes in the flow graph.
(D) Cyclometric complexity for a flow graph G is V(G) = P + 1, where P is the number of predicate nodes contained in the flow graph G.
34. Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shortest path from source vertex s to u has weight 53 and shortest path from s to v has weight 65. Which statement is always true ?
(A) Weight (u, v) < 12
(B) Weight (u, v) = 12
(C) Weight (u, v) > 12
(D) Weight (u, v) > 12
35. Consider the regular expression (a + b) (a + b) … (a + b) (n-times). The minimum number of states in finite automaton that recognizes the language represented by this regular expression contains
(A) n states
(B) n + 1 states
(C) n + 2 states
(D) 2n states