Register
Filter

Recent questions

#58861
12.2k
views
11 answers
56 votes
GATE CSE 2004 | Question: 81
Let $G_1=(V,E_1)$ and $G_2 =(V,E_2)$ be connected graphs on the same vertex set $V$ ... have a cut-edge (bridge)has chromatic number strictly greater than those of $G_1$ and $G_2$
User Avatar
#58862
9.9k
views
4 answers
31 votes
GATE CSE 2004 | Question: 80
A point is randomly selected with uniform probability in the $X-Y$ plane within the rectangle with corners at $(0,0), (1,0), (1,2)$ and $(0,2).$ If $p$ is the ... {3}\right)$\quad 1$\left(\dfrac{4}{3}\right)$\left(\dfrac{5}{3}\right)$
User Avatar
#58863
14.9k
views
8 answers
87 votes
GATE CSE 2004 | Question: 79
How many graphs on $n$ labeled vertices exist which have at least $\frac{(n^2 - 3n)}{ 2}$ ... \right)}C_n$^{{\large\sum\limits_{k=0}^n}.\left(\frac{n^2-n}{2}\right)}C_k$
User Avatar
#58864
7.8k
views
6 answers
26 votes
GATE CSE 2004 | Question: 78
Two $n$ bit binary strings, $S_1$ and $S_2$ are chosen randomly with uniform probability. The probability that the Hamming distance between these strings (the number of bit positions where the ... $\dfrac{1}{2^{d}}$
User Avatar
#58865
13.1k
views
7 answers
38 votes
GATE CSE 2004 | Question: 77
The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is$2$3$4$5$
User Avatar
#58866
10.0k
views
4 answers
35 votes
GATE CSE 2004 | Question: 76
In an $M \times N$ matrix all non-zero entries are covered in $a$ rows and $b$ columns. Then the maximum number of non-zero entries, such that no two are on the same row or column, ... b$\leq \max(a, b)$\leq \min(M-a, N-b)$\leq \min(a, b)$
User Avatar
#58867
17.3k
views
9 answers
65 votes
GATE CSE 2004 | Question: 75
Mala has the colouring book in which each English letter is drawn two times. She wants to paint each of these $52$ prints with one of $k$ colours, such that the ... $ that satisfies this requirement?$9$8$7$6$
User Avatar
#58868
9.3k
views
4 answers
35 votes
GATE CSE 2004 | Question: 74
An examination paper has $150$ multiple choice questions of one mark each, with each question having four choices. Each incorrect answer fetches $-0.25$ marks. ... $2550$7525$9375$
User Avatar
#58869
13.4k
views
8 answers
44 votes
GATE CSE 2004 | Question: 73
The inclusion of which of the following sets into ... 1, 3\}$\{1\}, \{1, 3\}, \{1, 2, 3, 4\}, \{1, 2, 3, 5\}$
User Avatar
#58870
7.0k
views
4 answers
40 votes
GATE CSE 2004 | Question: 72
The following is the incomplete operation table of a $4-$ ... e\; b$c\; b\; a\; e$c\; b\; e\; a$c\; e\; a\; b$
User Avatar
#58871
8.8k
views
4 answers
28 votes
GATE CSE 2004 | Question: 71
How many solutions does the following system of linear equations have?$-x + 5y = -1$x - y = 2$x + 3y = 3$infinitely manytwo distinct solutionsuniquenone
User Avatar
#58872
8.0k
views
5 answers
33 votes
GATE CSE 2004 | Question: 70
The following propositional statement is $\left(P \implies \left(Q \vee R\right)\right) \implies \left(\left(P \wedge Q \right)\implies R\right)$ satisfiable but not valid valid a contradiction None of the above
User Avatar
#58873
21.0k
views
3 answers
36 votes
GATE CSE 2004 | Question: 69
A 4-stage pipeline has the stage delays as $150$, $120$, $160$ and $140$ $nanoseconds$, respectively. Registers that are used between the stages have a ... }$\text{160.5 microseconds}$\text{165.5 microseconds}$\text{590.0 microseconds}$
User Avatar
#58874
27.9k
views
10 answers
52 votes
GATE CSE 2004 | Question: 68
A hard disk with a transfer rate of $10$ Mbytes/second is constantly transferring data to memory using DMA. The processor runs at $600$ MHz, and takes $300$ and $900$ clock ... $1.0\%$0.5\%$0.1\%$
User Avatar
#58875
13.9k
views
2 answers
39 votes
GATE CSE 2004 | Question: 67
The microinstructions stored in the control memory of a processor have a width of $26$ bits. Each microinstruction is divided into three fields: a micro-operation field of $13$ bits, a ... $8, 5, 256$5, 8, 2048$10, 3, 512$
User Avatar
#58876
19.6k
views
5 answers
28 votes
GATE CSE 2004 | Question: 66
Let $A = 1111 1010$ and $B = 0000 1010$ be two $8-bit$ $2’s$ complement numbers. Their product in $2’s$ complement is$1100 0100$1001 1100$1010 0101$1101 0101$
User Avatar
#58877
15.7k
views
3 answers
17 votes
GATE CSE 2004 | Question: 65
Consider a small two-way set-associative cache memory, consisting of four blocks. For choosing the block to be replaced, use the least recently used (LRU) scheme. The number of cache ... $.$2$3$4$5$
User Avatar
#58878
29.7k
views
4 answers
70 votes
GATE CSE 2004 | Question: 63
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ ... $1020$1024$1028$
User Avatar
#58879
34.0k
views
17 answers
81 votes
GATE CSE 2004 | Question: 62
A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs ... implemented using two-level AND-OR logic.4 time units6 time units10 time units12 time units
User Avatar
#58880
19.8k
views
5 answers
46 votes
GATE CSE 2004 | Question: 61
Consider the partial implementation of a $2-bit$ counter using $T$ flip-flops following the sequence $0-2-3-1-0,$ as shown below.To complete the circuit, the input $X$ should be$Q_2^c$Q_2 + Q_1$\left(Q_1 + Q_2\right)^c$Q_1 \oplus Q_2$
User Avatar
Page: