J12CSPIII-31-40

 UGC NET Computer Science(Paper-III) Mock Test June -2012      

  HOME  

[1-10]  [11-20]  [21-30] [31-40] [41-50] [51-60] [61-75]

31.The upper bound of computing time of m coloring decision problem is
O(nm)
O(n^m)
O(nmⁿ)
O(n^mmⁿ)

32. The equivalent grammar corresponding to the grammar G : S → aA, A → BB, B → aBb | ε is
S → aA, A → BB, B → aBb
S → a|aA, A → BB, B → aBb | ab
S → a | aA, A → BB | B, B → aBb
S → a | aA, A → BB | B, B → aBb | ab

33.Which one of the following statements is incorrect ?
The number of regions corresponds to the cyclomatic complexity.
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.
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
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 ?
Weight (u, v) ≤12
Weight (u, v) = 12
Weight (u, v) ≥12
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
n states
n + 1 states
n + 2 states
2ⁿ states

36.Number of binary trees formed with 5 nodes are
32
36
120
42

37.Are we building the right product ? This statement refers to
Verification
Validation
Testing
Software quality assurance

38.The following postfix expression is evaluated using a stack 823^/23* + 51* – The top two elements of the stack after first * is evaluated
6, 1
5, 7
3, 2
1, 5

39.The following CFG S → aB | bA, A → a | as | bAA, B → b | bs | aBB generates strings of terminals that have
odd number of a’s and odd number of b’s
even number of a’s and even number of b’s
equal number of a’s and b’s
not equal number of a’s and b’s

40.Consider the following pseudo-code : If (A > B) and (C > D) then A = A + 1 B = B + 1 Endif The cyclomatic complexity of the pseudo-code is
2
3
4
5

  HOME  

[1-10]  [11-20]  [21-30] [31-40] [41-50] [51-60] [61-75]

This page is developed by our student 

Begam Saheba, 4th semester, ICT

Thank you Begam  !!!