Hughes Software systems Paper

The Questions are follows
1. Number of null pointers in any binary tree = n+1^M
2. max(t1,t2,…tn) = pipelining^M3. 50% -DBETXXXXXX – density^M
1) find the probability of getting a number with 7 between 100 and
999 (both inclusive).
ans:FreshersHome.com
2) There are 10 items in a box, out of which 3 are defective.
2 balls are taken one after the other. what is the probability
that both of them are defective?
Ans: 1/15 or 6/90

3) Context free grammar is accepted by
a) finite automata
b)push down automata
c) two way bounded automata
d) both b and c

25) order of deleting an node from a linked list. (pointer is to an
arbitrary node)
a)0(1)
b)0(n)

26) A chocolate of size nXn is given and is to be made into pices of
>size
1×1. At a time both horizontal and a vertical cut is done. Find the
order of complexity
a) 0(n2)
b) o(nlogn)
c) o(logn)
Ans : a

27) A directed graph is represented by adjacency list. To find the
complexity of indegree of the node. e – edge n- vertices’s
a) o(e+n)

28) No of leaf nodes given. find the no of nodes with degree 2.

29) AX = B . A is mXn and B is mX1 and several options given like
a) there is a unique solution if rank of A is same as rank of
augmented matrix [A b]
b) there are multiple solutions