# June 2015 - Paper 2

1:

How many strings of 5 digits have the property that the sum of their digits is 7 ?

 A. 66 B. 330 C. 495 D. 99 Answer Report Discuss Option: B Explanation : Click on Discuss to view users comments. Mohamedsohel Shaikh said: (4:09pm on Thursday 2nd July 2015) This answer is written with the following assumptions1. any digit can be ≥ = 02. more that one digit can have same valueRequired number of strings = the number of non-negative integer solutions of equation x1 x2 x3 x4 x5=7The number of non-negative integer solutions of equation x1 x2 ... xn = r is (n r-1)CrHence, the answer is (5 7-1)C7 = 11C7 = 330Answer:-B balraje ksagar said: (1:55pm on Friday 3rd July 2015) Answer is 330 dawider said: (3:28pm on Monday 27th July 2015) How? What is c means(5 7-1)c7 dawinder said: (3:29pm on Monday 27th July 2015) What is c value and why kokz said: (3:00am on Saturday 12th September 2015) what is meant by 11c7=330 how is this Nismon Rio said: (9:06pm on Thursday 19th November 2015) @Kokz 11c7 means find the factorial equation of this..11x10x9x8x7x6x5 / 1 x 2 x 3 x 4 x 5 x 6 x 7.. simplify this equation. u ll get 330 janakiraman said: (6:04am on Wednesday 22nd November 2017) Factorial methods are using solve the problem Write your comments here:
2:
Consider an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die ?
 A. 22 / 36 B. 12 / 36 C. 14 / 36 D. 6 / 36 Answer Report Discuss Option: C Explanation : Click on Discuss to view users comments. Jayant Solanki said: (9:52am on Friday 3rd July 2015) how explaing please. balraje ksagar said: (1:55pm on Friday 3rd July 2015) 14/36 Madhavi said: (6:30pm on Friday 4th September 2015) its 14/36 Write your comments here:
3:
In how many ways can 15 indistinguishable fishes be placed into 5 different ponds, so that each pond contains atleast one fish ?
 A. 1001 B. 3876 C. 775 D. 200 Answer Report Discuss Option: A Explanation : Click on Discuss to view users comments. shyamveer said: (10:23am on Tuesday 25th August 2015) how? Mohd shaliyar said: (11:59pm on Friday 4th September 2015) B is the answer because (n r-1)C(r-1) where n= 15 and r=5 when we put this we get 3876. Deepanjali said: (1:45pm on Tuesday 7th February 2017) what is C?and what is its value. Write your comments here:
4:

Consider the following statements-

(a) Depth - first search is used to traverse a rooted tree.
(b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree.
(c) Huffman's algorithm is used to find an optimal binary tree with given weights.
(d) Topological sorting provides a labelling such that the parents have larger labels than their children.
Which of the above statements are true ?
 A. (a) and (b) B. (c) and (d) C. (a) , (b) and (c) D. (a), (b) , (c) and (d) Answer Report Discuss Option: D Explanation : Click on Discuss to view users comments. Write your comments here:
5:
Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ?
(a) deg (v) >= n / 2 for each vertex of G
(b)  | E(G) | >= 1 / 2 (n-1) (n-2) + 2 edges
(c) deg (v) + deg (w) >= n for every v and w not connected by an edge
 A. (a) and (b) B. (b) and (c) C. (a) and (c) D. (a), (b) and (c) Answer Report Discuss Option: D Explanation : Click on Discuss to view users comments. Write your comments here:

## Suggest an improvement

• This section contains UGC NET  Computer Science June 2015 Solved Paper.
• It has solution and explanation for UGC NET Computer Science Paper
• Here you will find Answer keys for UGC NET Computer Science JUNE 2015  Exam.
• This paper can be used as a reference material
• You can also use UGC NET Computer Science June 2015 Answer Keys to verify your answers.
• All answers are provided with explanation wherever required.