Search results for out-of-syllabus-now

28 votes
6 answers
1
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $n$ vertices, $n$ isA multiple of 4EvenOddCongruent to 0 $mod$ 4...
0 votes
0 answers
2
Solve the following system using Gauss seidal iterative method with initial guess (0, 0, 0) and tolerance 0.001.$\left\{\begin{matrix} 2x_{1}-3x_{2}+x_{3} = 5\\ x_{1}+4x_...
32 votes
4 answers
3
A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). The number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM from 1K × 8 RAM is(A...
10 votes
3 answers
5
19 votes
3 answers
8
Let $G$ be the non-planar graph with the minimum possible number of edges. Then $G$ has9 edges and 5 vertices9 edges and 6 vertices10 edges and 5 vertices10 edges and 6 v...
13 votes
2 answers
15