-
7.
-
8.
-
9.
last reply by CpjJwWHV • 12 years ago • asked in Computer Science And Engineering, 2011
View Comments [10 Reply]
-
10.
last reply by CpjJwWHV • 12 years ago • asked in Computer Science And Engineering, 2011
View Comments [19 Reply]
-
11.
Consider the following circuit involving three D-type flip-flops used in a certain type of counter configuration.
[1] If at some instance prior to the occurrence of the clock edge, P, Q and R have a value 0, 1 and 0 respectively, what shall be the value of PQR after the clock edge? [2 marks]
(A) 000
(B) 001
(C) 010
(D) 011[2] If all the flip-flops were reset to 0 at power on, what is the total number of distinct outputs (states) represented by PQR generated by the counter? [2 marks]
(A) 3
(B) 4
(C) 5
(D) 6last reply by CpjJwWHV • 13 years ago • asked in Computer Science And Engineering, 2011
View Comments [5 Reply]
-
12.
An undirected graph G(V, E) contains n(n >2) nodes named v1,v2,....vn. Two nodes vivj connected if and only if 0 < | i - j | < 2. Each edge (vi, vj) is assigned a weight i+j. A sample graph with n = 4 is shown below.
[1] What will be the cost of the minimum spanning tree (MST) of such a graph with n nodes?
[2 marks]
(A) (11n2 -5n)/12
(B) n2 - n + 1
(C) 6n-11
(D) 2n+1
[2] The length of the path from v5 to v6 in the MST of previous questions with n = 10 is
[2 marks]
(A) 11
(B) 25
(C) 31
(D) 41last reply by CpjJwWHV • 13 years ago • asked in Computer Science And Engineering, 2011
View Comments [8 Reply]