10-07-2012

Daily 10 questions(10-07-2012)

1. An Abstract Data Type (ADT) is:

(a) same as an abstract class

(b) a data type that cannot be instantiated

(c) a data type type for which only the operations defined on it can be used, but none else

(d) all ofthe above

2. A common property of logic programming languages and functional languages is:

(a) both are procedural languages

(b) both are based on 2k-calculus

(c) both are declarative

(d) both use Horn-clauses

3. An undirected graph G has n nodes. Its adjacency matrix is given by an n x n square

matr4ix whose (i) diagonal elements are 0’s and (ii) non-diagonal elements are l’s. which one

of the following is TRUE?

(a) Graph G has no minimum spanning tree (MST)

(b) Graph G has a unique MST of cost n-i

(c) Graph G has multiple distinct MSTs, each of cost n-i

(d) Graph G has multiple spanning trees of different costs

4. Let G be a simple graph with 20 vertices and 100 edges. The size of the minimum vertex

cover of G is 8. then, the size of the maximum independent set of G is:

(a) 12

(b) 8

(c) Less than 8

(d) More than 12

5. The hexadecimal representation of 6578 is:

(a) 1AF

(b) D78

(c) D71

(d) 32F

6. The switching expression corresponding to f(A,B,C,D)= (1,4,5,9,11,12) is:

(a) BC’D’ + A’C’D + AB’D

(c) ACD’ + A’BC’ + AC’D’

(b) ABC’+ACD+B’C’D

(d) A’BD + ACD’ + BCD’

7. The address resolution protocol (ARP) is used for:

(a) Finding the IP address from the DNS

(b) Finding the IP address of the default gateway

(c) Finding the IP address that corresponds to a MAC address

(d) Finding the MAC address that corresponds to an IP address

8. Consider the regular language L =(111+11111)*. The minimum number of

states in any DFA accepting this languages is:

(A) 3

(B) 5

(C) 8

(D) 9

9. L={aa,ab,ba,bb} minimum number of states required to implement using DFA are

(A) 2

(B) 3

(C) 4

(D) 5

10. Which one of the following graphs is NOT planar?

Key
1.
2.C
3.
4.
5.
6.A
7.
8.D
9.C
10. Looks like something wrong with the question