UGCNET Computer Science June 2014 Paper II

Q1. Infrared signals can be used for short range communication in a closed area using _____________ propagation.

(A) ground

(B) sky

(D) space

Ans .

Explanation :

Q2. A bridge has access to ___________________ address in the same network.

(A) Physical

(B) Network

(D) Application

Ans .

(A) Physical

Explanation :

Q3. The minimum frame length for 10 Mbps Ethernet is _________ bytes and maximum is ___________ bytes.

(A) 64 & 128

(B) 128 & 1518

(D) 64 & 1518

Ans .

(D) 64 & 1518

Explanation :

Q4. The bit rate of a signal is 3000 bps. If each signal unit carries 6 bits, the baud rate of the signal is ___________

(A) 500 baud/sec

(B) 1000 baud/sec

(D) 18000 baud/sec

Ans .

(A) 500 baud/sec

Explanation :

Q5. Match the following:

(A) iv v ii iii i

(B) v iv i ii iii

(D) i ii iv iii v

Ans .

(A) iv v ii iii i

Explanation :

Q6. A grammar G is LL(1) if and only if the following conditions hold for two distinct productions A → α | β
I. First (α) ∩ First (β) ≠ {a} where a is some terminal symbol of the grammar.
II. First (α) ∩ First (β) ≠ λ
III. First (α) ∩ Follow(A) = φ if λ є First (β)

(A) I and II

(B) I and III

(D) I, II and III

Ans .

(D) I, II and III

Explanation :

Q7. Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar ?

(A) Removing left recursion alone.

(B) Removing the grammar alone

(D) None of the above

Ans .

(D) None of the above

Explanation :

Q8. A shift reduce parser suffers from

(A) shift reduce conflict only

(B) reduce reduce conflict only

(D) shift handle and reduce handle conflicts

Ans .

Explanation :

Q9. The context free grammar for language L = {anbmck | k = |n - m|, n≥0,m≥0,k≥0} is

(A) S→S1S3, S1→aS1c |S2|λ, S2→aS2b|λ, S3→aS3b|S4| λ, S4→bS4c|λ

(D) S→S1|S3, S1→aS1c |S2|λ, S2→aS2b|λ, S3→aS3b|S4| λ, S4→bS4c|λ

Ans .

(D) S→S1|S3, S1→aS1c |S2|λ, S2→aS2b|λ, S3→aS3b|S4| λ, S4→bS4c|λ

Explanation :

Q10. The regular grammar for the language L = {w |na(w) and nb(w) are both even, wє{a, b}*} is given by : (Assume, p, q, r and s are states)

(B) p→aq|br, q→bs|ap
r→as|bp, s→ar|bq,
p and s are initial and final states

(D) p→aq|br, q→bs|ap
r→as|bp, s→ar|bq,
p is both initial and final states.

Ans .

Explanation :

Q11. KPA in CMM stands for

(A) Key Process Area

(B) Key Product Area

(D) Key Performance Area

Ans .

(A) Key Process Area

Explanation :

Q12. Which one of the following is not a risk management technique for managing the risk due to unrealistic schedules and budgets?

(A) Detailed multi source cost and schedule estimation

(B) Design Cost

(D) Information hiding

Ans .

(D) Information hiding

Explanation :

Q13. ________________ of a system is the structure or structures of the system which comprise software elements, the externally visible properties of these elements and the relationship amongst them.

(A) Software construction

(B) Software evolution

(D) Software reuse

Ans .

Explanation :

Q14. In function point analysis, the number of complexity adjustment factors is

(A) 10

(B) 12

(D) 20

Ans .

Explanation :

Q15. Regression testing is primarily related to

(A) Functional testing

(B) Development testing

(D) Maintenance testing

Ans .

(D) Maintenance testing

Explanation :

Q16. How many different truth tables of the compound propositions are there that involve the propositions p & q ?

(A) 2

(B) 4

(D) 16

Ans .

(D) 16

Explanation :

Q17. A Boolean function F is called self-dual if and only if How many Boolean functions of degree n are self-dual ?

(A) 2n

(B) (2)2^n

(D) (2)2^n-1

Ans .

(D) (2)2^n-1

Explanation :

Q18. Which of the following statement(s) is(are) not correct ?
i. The 2's complement of 0 is 0.
ii. In 2's complement, the left most bit cannot be used to express a quantity.
iii. For an n-bit word (2's complement) which includes the sign bit, there are 2n1 positive integers, 2n+1 negative integers and one 0 for a total of 2n unique states.
iv. In 2's complement the significant information is contained in the 1's of positive numbers and 0's of the negative numbers.

(A) i and iv

(B) i and ii

(D) iv

Ans .

Explanation :

Q19. The notation ∃ !xp(x) denotes the proposition "there exists a unique x such that P(x) is true".
Give the truth values of the following statements :
I. ∃ !xP(x) → ∃ xP(x)
II. ∃ !x ¬ P(x) → ¬ ∀ xp(x)

(A) Both I and II are true

(B) Both I and II are false

(D) I-true, II-false

Ans .

(A) Both I and II are true

Explanation :

Q20. Give a compound proposition involving propositions p, q and r that is true when exactly two of p, q and r are true and is false otherwise.

(A) (p ∨ q ∧ ¬r) ∧ (p ∧ ¬q ∧ r) ∧ (¬p ∧ q ∧ r)

(B) (p ∧ q ∧ ¬r) ˄ (p ∨ q ∧ ¬r) ∧ (¬p ∧ q ∧ r)

(D) (p ∧ q ∧ ¬r) ∨ (p ∧ ¬q ∧ r) ∨ (¬p ∧ q ∧ r)

Ans .

(D) (p ∧ q ∧ ¬r) ∨ (p ∧ ¬q ∧ r) ∨ (¬p ∧ q ∧ r)

Explanation :

Q21. Consider the graph given below as : Which one of the following graph is isomorphic to the above graph?

(A)

(B)

(C)

(D)

Ans .

Explanation :

Q22. The upper bound and lower bound for the number of leaves in a BTree of degree K with height h is given by:

(A) Kh and 2ΓK/2˥h-1

(B) K*h and 2ʟK/2˩h-1

(D) K*h and 2ΓK/2˥h-1

Ans .

(A) Kh and 2ΓK/2˥h-1

Explanation :

Q23. Consider a complete bipartite graph km,n. For which values of m and n does this, complete graph have a Hamilton circuit

(A) m=3, n=2

(B) m=2, n=3

(D) m=n≥3

Ans .

Explanation :

Q24. Big-O estimates for the factorial function and the logarithm of the factorial function i.e. n! and log n! is given by

(A) O(n!) and O(n log n)

(B) O(nn) and O(n log n)

(D) O(nn) and O(log n!)

Ans .

(B) O(nn) and O(n log n)

Explanation :

Q25. How many cards must be chosen from a deck to guarantee that atleast
i. two aces of two kinds are chosen.
ii. two aces are chosen.
iii. two cards of the same kind are chosen.
iv. two cards of two different kinds are chosen

(A) 50, 50, 14, 5

(B) 51, 51, 15, 7

(D) 51, 51, 14, 5

Ans .

(A) 50, 50, 14, 5

Explanation :

Q26. Match the following with respect to the mobile computing technologies :

(A) iii iv ii i

(B) iv i ii iii

(D) ii i iv iii

Ans .

(B) iv i ii iii

Explanation :

Q27. Object Request Broker (ORB) is
I. A software program that runs on the client as well as on the application server.
II. A software program that runs on the client side only.
III. A software program that runs on the application server, where most of the components reside.

(A) I,II and III

(B) I & II

(D) I only

Ans .

(D) I only

Explanation :

Q28. A software agent is defined as
I. A software developed for accomplishing a given task.
II. A computer program which is capable of acting on behalf of the user in order to accomplish a given computational task.
III. An open source software for accomplishing a given task.

(A) I

(B) II

(D) All of the above

Ans .

(B) II

Explanation :

Q29. Match the following:

(A) iii iv ii i

(B) iv iii i ii

(D) iv iii ii i

Ans .

Explanation :

Q30. SET, an open encryption and security specification model that is designed for protecting credit card transactions on the internet, stands for

(A) Secure Electronic Transaction

(B) Secular Enterprise for Transaction

(D) Secured Electronic Termination

Ans .

(A) Secure Electronic Transaction

Explanation :

Q31. In a paged memory management algorithm, the hit ratio is 70%. If it takes 30 nanoseconds to search Translation Look-aside Buffer (TLB) and 100 nanoseconds (ns) to access memory, the effective memory access time is

(A) 91 ns

(B) 69 ns

(D) 160 ns

Ans .

(D) 160 ns

Explanation :
The percentage of times that a page number is found in the associative registers is called the hit ratio. A 70% hit ratio means that we find the desired page number in the associative registers 70% of the time. If it takes 30 nanoseconds to search the associative registers, and 100 nanoseconds to access memory, then a mapped memory access takes 130 nanoseconds when the page number is in the associative registers. If we fail to find the page number in the associative registers (30 nanoseconds), then we must first access memory for the page table and frame number (100 nanoseconds), and then access the desired byte in memory (100 nanoseconds), for a total of 230 nanoseconds.
Effective access time = 0.70 x 130 + .30 x 230 = 91 + 69= 160

Q32. Match the following:

(A) i iii ii iv

(B) iv iii ii i

(D) ii iii iv i

Ans .

(D) ii iii iv i

Explanation :

Q33. Consider a system with five processes P0 through P4 and three resource types R1, R2 and R3. Resource type R1 has 10 instances, R2 has 5 instances and R3 has 7 instances. Suppose that at time T0, the following snapshot of the system has been taken :
Assume that now the process P1 requests one additional instance of type R1 and two instances of resource type R3. The state resulting after this allocation will be

(A) Ready State

(B) Safe State

(D) Unsafe State

Ans .

(B) Safe State

Explanation :

Q34. Match the following:

(A) iii iv ii i

(B) iii ii iv i

(D) i iv ii iii

Ans .

(B) iii ii iv i

Explanation :

Q35. Which of the following out commands will output "onetwothree"?

(A) for val; do echo-n $val; done < one two three

(B) for one two three; do echo-n-; done

(D) for n in one two three {echo-n $n}

Ans .

Explanation :

Q36. Merge sort makes two recursive calls. Which statement is true after these two recursive calls finish, but before the merge step?

(A) The array elements from a heap

(B) Elements in each half of the array are sorted amongst themselves.

(D) All of the above

Ans .

(B) Elements in each half of the array are sorted amongst themselves.

Explanation :

Q37. A text is made up of the characters α, β, γ, δ and σ with the probability 0.12, 0.40, 0.15, 0.08 and 0.25 respectively. The optimal coding technique will have the average length of

(A) 1.7

(B) 2.15

(D) 3.8

Ans .

(B) 2.15

Explanation :

Q38. Searching for an element in the hash table requires O(1) time for the ____________ time, whereas for direct addressing it holds for the ____________ time.

(A) worst-case, average

(B) worst-case, worst-case

(D) best, average

Ans .

Explanation :

Q39. An algorithm is made up of 2 modules M1 and M2. If time complexity of modules M1 and M2 are h(n) and g(n) respectively, the time complexity of the algorithm is

(A) min (h(n),g(n))

(B) max (h(n),g(n))

(D) h(n) * g(n)

Ans .

(B) max (h(n),g(n))

Explanation :

Q40. What is the maximum number of parenthesis that will appear on the stack at any one time for parenthesis expression given by
( () (()) (()) )

(A) 2

(B) 3

(D) 5

Ans .

(B) 3

Explanation :

Q41. Match the following:

(A) iii iv i ii

(B) iii iv ii i

(D) iv iii i ii

Ans .

(B) iii iv ii i

Explanation :

Q42. When we pass an array as an argument to a function, what actually gets passed ?

(A) Address of the array

(B) Values of the elements of the array

(D) Number of elements of the array

Ans .

Explanation :

Q43. While (87) printf("computer");
The above C statement will

(A) print "computer" 87 times

(B) print "computer" 0 times

(D) print "computer" infinite times

Ans .

(D) print "computer" infinite times

Explanation :

Q44. A friend function can be used to

(A) avoid arguments between classes.

(B) allow access to classes whose source code is unavailable

(D) None of the above

Ans .

Explanation :

Q45. Which of the following is the correct value returned to the operating system upon the successful completion of a program?

(A) 0

(B) 1

(D) Program do not return a value.

Ans .

(A) 0

Explanation :

Q46. Manager's salary details are hidden from the employee. This is called as

(A) Conceptual level data hiding

(B) Physical level data hiding

(D) Local level data hiding

Ans .

Explanation :

Q47. Which of the following statements is false ?

(A) Any relation with two attributes is in BCNF.

(B) A relation in which every key has only one attribute is in 2NF.

(D) A prime attribute can be transitively dependent on a key in BCNF relation.

Ans .

(D) A prime attribute can be transitively dependent on a key in BCNF relation.

Explanation :

Q48. A clustering index is created when ___________

(A) primary key is declared and ordered

(B) no key ordered

(D) there is no key and no order

Ans .

(A) primary key is declared and ordered

Explanation :

Q49. Let R ={A, B, C, D, E, F} be a relation schema with the following dependencies C→F ,E→A,EC→D,A→B
Which of the following is a key for R ?

(A) CD

(B) EC

(D) AC

Ans .

(B) EC

Explanation :

Q50. Match the following:

(A) ii i iii iv

(B) i ii iv iii

(D) iv i ii iii

Ans .

(D) iv i ii iii

Explanation :

upscfever.com

UGCNET Computer Science June 2014 Paper II

UPSCFEVER - POPULAR PAGES

Join The Movement

Discussions and Comments