UGC-NET COMPUTER JUNE (PAPER - II) 2015

How many strings of 5 digits(in ascending order) have the property that the sum of their digits is 7 (Example 00007 is a 5 digits string)?

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?

In how many ways can 15 indistinguishable fish be placed into 5 different ponds, so that each pond contains atleast one fish?

Consider the following statements: (a) Depth-first search is used to traverse a rooted tree. (b) Pre-order, Post-order and In-order 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?

Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G)? (a) for each vertex of G (b) edges (c) for every and not connected by an edge

Consider the following statements: (a) Boolean expressions and logic networks correspond to labeled acyclic diagraphs. (b) Optimal Boolean expressions may not correspond to the simplest networks. (c) Choosing essential blocks first in a Karnaugh map and then greedily choosing the largest remaining blocks to cover may not give an optimal expression. Which of these statement(s) is/are correct?