Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by shivam001
0
votes
41
GATE CSE 2014 Set 1 | Question: 51
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is $\{(i,j) \mid1 \leq i \leq 12, 1 \leq j \leq 12\}$. There is an edge between $(a,b)$ and $(c,d)$ if $|a-c| \leq 1$ and $|b-d| \leq 1$. The number of edges in this graph is______.
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is $\{(i,j) \mid1 \leq i \leq 12, 1 \leq j \leq 12\}$. There is an edge between $...
26.9k
views
answered
Dec 19, 2019
Graph Theory
gatecse-2014-set1
graph-theory
numerical-answers
normal
graph-connectivity
+
–
0
votes
42
GATE CSE 2012 | Question: 38
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to $15$ $30$ $90$ $360$
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to$15$$30$$90$$36...
35.0k
views
answered
Dec 19, 2019
Graph Theory
gatecse-2012
graph-theory
normal
marks-to-all
counting
+
–
1
votes
43
GATE ECE 2014
Above question modification. This is the actual question Boolean expression$:(x+y)(x+\bar{y})+\overline{{(x\bar{y}+\bar{x})}}$ $(A) x$ $(B)y$ $(C)xy$ $(D)x+y$
Above question modification.This is the actual questionBoolean expression$:(x+y)(x+\bar{y})+\overline{{(x\bar{y}+\bar{x})}}$$(A) x$ $(B)y$ $(C)xy$...
2.5k
views
answered
Dec 18, 2019
Digital Logic
digital-logic
boolean-algebra
2014-ece
+
–
0
votes
44
Boolean algebra expression Floyd Digital Logic
Simplify the following expression AB’C + A’BC + A’B’C Solution given is A’C + B’C can someone show me how?
Simplify the following expressionAB’C + A’BC + A’B’CSolution given is A’C + B’C can someone show me how?
1.4k
views
answered
Dec 18, 2019
Digital Logic
digital-logic
boolean-algebra
+
–
0
votes
45
GateBook Test Series: Digital Logic - Boolean Algebra
What is the time complexity for checking whether an assignment of truth values to variables $x_1,\dots ,x_n$ satisfies a given formula $f(x_1\dots,x_n)$? $O(2^n)$ $O(g(n))$ where $g$ is a polynomial $O(log(n))$ None of the above
What is the time complexity for checking whether an assignment of truth values to variables $x_1,\dots ,x_n$ satisfies a given formula $f(x_1\dots,x_n)$?$O(2^n)$$O(g(n))$...
1.3k
views
answered
Dec 18, 2019
Digital Logic
gatebook
digital-logic
boolean-algebra
+
–
0
votes
46
ISI2017-DCG-10
The value of the Boolean expression (with usual definitions) $(A’BC’)’ +(AB’C)’$ is $0$ $1$ $A$ $BC$
The value of the Boolean expression (with usual definitions) $(A’BC’)’ +(AB’C)’$ is$0$$1$$A$$BC$
1.1k
views
answered
Dec 18, 2019
Digital Logic
isi2017-dcg
digital-logic
boolean-algebra
boolean-expression
+
–
0
votes
47
No. of states in the minimal finite automata which accepts the binary strings whose equivalent is divisible by 32 is ________?
No. of states in the minimal finite automata which accepts the binary strings whose equivalent is divisible by 32 is ________?A. 5B. 6C 31D 32
4.4k
views
answered
Dec 10, 2019
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
48
GATE CSE 2003 | Question: 36
How many perfect matching are there in a complete graph of $6$ vertices? $15$ $24$ $30$ $60$
How many perfect matching are there in a complete graph of $6$ vertices?$15$$24$$30$$60$
50.4k
views
answered
Dec 9, 2019
Graph Theory
gatecse-2003
graph-theory
graph-matching
normal
+
–
0
votes
49
TIFR CSE 2019 | Part A | Question: 11
Suppose there are $n$ guests at a party (and no hosts). As the night progresses, the guests meet each other and shake hands. The same pair of guests might shake hands multiple times. for some parties stretch late into the night , and it is hard to keep track.Still, ... $2 \mid \text{Odd} \mid - \mid \text{Even} \mid$
Suppose there are $n$ guests at a party (and no hosts). As the night progresses, the guests meet each other and shake hands. The same pair of guests might shake hands mul...
2.1k
views
answered
Dec 7, 2019
Analytical Aptitude
tifr2019
general-aptitude
analytical-aptitude
logical-reasoning
+
–
0
votes
50
Exam Approach
As I have no prior knowledge of TIFR pattern then any suggestion from any experienced practitioner of TIFR that how much time to be given for Section A and Section B of 15 question each ? Which to pick 1st and which to next ? Any othet points are appreciated :)
As I have no prior knowledge of TIFR pattern then any suggestion from any experienced practitioner of TIFR that how much time to be given for Section A and Section B of...
466
views
answered
Dec 6, 2019
0
votes
51
TIFR Exam Pattern
If anyone had analysed the previous TIFR papers, which subjects/topics of GATE they dont or rarely ask ? Please do share.
If anyone had analysed the previous TIFR papers, which subjects/topics of GATE they dont or rarely ask ?Please do share.
703
views
answered
Dec 6, 2019
0
votes
52
GATE CSE 2016 Set 2 | Question: 10
A processor has $40$ distinct instruction and $24$ general purpose registers. A $32$-bit instruction word has an opcode, two registers operands and an immediate operand. The number of bits available for the immediate operand field is_______.
A processor has $40$ distinct instruction and $24$ general purpose registers. A $32$-bit instruction word has an opcode, two registers operands and an immediate operand. ...
13.7k
views
answered
Dec 5, 2019
CO and Architecture
gatecse-2016-set2
machine-instruction
co-and-architecture
easy
numerical-answers
+
–
9
votes
53
GATE CSE 2007 | Question: 72
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ ... is word addressable. After the execution of this program, the content of memory location $2010$ is: $100$ $101$ $102$ $110$
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ are the general purpose registers.$$\small \begin{array}{|c|l|l||c|} \hline & \text {Instruct...
9.5k
views
answered
Dec 5, 2019
CO and Architecture
gatecse-2007
co-and-architecture
machine-instruction
interrupts
normal
+
–
1
votes
54
GATE CSE 2016 Set 1 | Question: 30
Consider the two cascade $2$ to $1$ multiplexers as shown in the figure . The minimal sum of products form of the output $X$ is $\overline{P} \ \overline {Q}+PQR$ $\overline{P} \ {Q}+QR$ $PQ +\overline{P} \ \overline{Q}R$ $\overline{Q} \ \overline{R} + PQR$
Consider the two cascade $2$ to $1$ multiplexers as shown in the figure . The minimal sum of products form of the output $X$ is $\overline{P} \ \overline {Q}+PQR$$\ove...
9.4k
views
answered
Nov 23, 2019
Digital Logic
gatecse-2016-set1
digital-logic
multiplexer
normal
+
–
0
votes
55
GATE CSE 2001 | Question: 2.11
Consider the circuit shown below. The output of a $2:1$ MUX is given by the function $(ac' + bc)$. Which of the following is true? $f=X_1'+X_2$ $f=X_1'X_2+X_1X_2'$ $f=X_1X_2+X_1'X_2'$ $f=X_1+X_2'$
Consider the circuit shown below. The output of a $2:1$ MUX is given by the function $(ac' + bc)$.Which of the following is true?$f=X_1'+X_2$$f=X_1'X_2+X_1X_2'$$f=X_1X_2+...
11.4k
views
answered
Nov 23, 2019
Digital Logic
gatecse-2001
digital-logic
normal
multiplexer
+
–
0
votes
56
GATE CSE 2016 Set 1 | Question: 8
We want to design a synchronous counter that counts the sequence $0-1-0-2-0-3$ and then repeats. The minimum number of $\text{J-K}$ flip-flops required to implement this counter is _____________.
We want to design a synchronous counter that counts the sequence $0-1-0-2-0-3$ and then repeats. The minimum number of $\text{J-K}$ flip-flops required to implement this ...
52.1k
views
answered
Nov 23, 2019
Digital Logic
gatecse-2016-set1
digital-logic
digital-counter
flip-flop
normal
numerical-answers
+
–
1
votes
57
How to calculate propogation delay for a synchronous counter ?
2.9k
views
answered
Nov 23, 2019
2
votes
58
GATE2010 TF: GA-10
A student is answering a multiple choice examination with $65$ questions with a marking scheme as follows$:$ $i)$ $1$ marks for each correct answer $,ii)$ $-\frac{1}{4}$ for a wrong answer $,iii)$ $-\frac{1}{8}$ for a question that has not been attempted ... gets $37$ marks in the test then the least possible number of questions the student has NOT answered is$:$ $6$ $5$ $7$ $4$
A student is answering a multiple choice examination with $65$ questions with a marking scheme as follows$:$ $i)$ $1$ marks for each correct answer $,ii)$ $-\frac{1}{4}...
2.6k
views
answered
Nov 18, 2019
Quantitative Aptitude
general-aptitude
quantitative-aptitude
gate2010-tf
numerical-computation
+
–
0
votes
59
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 3
Which of the following statements is FALSE? Any DCFL has an equivalent grammar that can be parsed by a SLR(1) parser with end string delimiter Languages of grammars parsed by LR(2) parsers is a strict super set of the languages of ... LL(1) parsers There is no DCFL which is not having a grammar that can be parsed by a LR(1) parser
Which of the following statements is FALSE?Any DCFL has an equivalent grammar that can be parsed by a SLR(1) parser with end string delimiterLanguages of grammars parsed ...
3.2k
views
answered
Nov 16, 2019
Compiler Design
go-cd-1
parsing
+
–
2
votes
60
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 14
Which of the below relations does hold TRUE regarding GRAMMARS? $LL(1) \subset SLR(1) \subset LR(1)$ $SLR(1) \subset \epsilon-\text{free}\; LL(1) \subset LR(1)$ $\epsilon-\text{free}\;LL(1) \subset SLR(1) \subset LR(1)$ $LL(1) \subset SLR(1) = LR(1)$
Which of the below relations does hold TRUE regarding GRAMMARS?$LL(1) \subset SLR(1) \subset LR(1)$$SLR(1) \subset \epsilon-\text{free}\; LL(1) \subset LR(1)$$\epsilon-\t...
1.2k
views
answered
Nov 16, 2019
Compiler Design
go-cd-1
+
–
0
votes
61
Operating Systems concepts(Galvin)
Hello I am reading chapters from Galvin and attempting its back exercises. However, there is nothing to compare my answers to, I mean there are no answers given anywhere. Do you guys have any idea of any answer key thank you
HelloI am reading chapters from Galvin and attempting its back exercises.However, there is nothing to compare my answers to, I mean there are no answers given anywhere.Do...
2.6k
views
answered
Nov 8, 2019
Operating System
operating-system
+
–
3
votes
62
GATE CSE 2015 Set 2 | Question: 25
A computer system implements a $40\;\text{-bit}$ virtual address, page size of $8\;\text{kilobytes}$, and a $128\text{-entry}$ translation look-aside buffer $\text{(TLB)}$ organized into $32$ sets each having $4$ ways. Assume that the $\text{TLB}$ tag does not store any process id. The minimum length of the $\text{TLB}$ tag in bits is ______.
A computer system implements a $40\;\text{-bit}$ virtual address, page size of $8\;\text{kilobytes}$, and a $128\text{-entry}$ translation look-aside buffer $\text{(TLB)}...
21.6k
views
answered
Nov 4, 2019
Operating System
gatecse-2015-set2
operating-system
virtual-memory
easy
numerical-answers
+
–
0
votes
63
single precision number Made easy CBT 2019
how to solve this
how to solve this
982
views
answered
Nov 2, 2019
Digital Logic
floating-point-representation
+
–
1
votes
64
GATE CSE 2014 Set 1 | Question: 31
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types $X, Y,$ and $Z$ to three processes $P0, P1,$ and $P2.$ The table given below presents the current system state. ... be permitted. Only REQ2 can be permitted. Both REQ1 and REQ2 can be permitted. Neither REQ1 nor REQ2 can be permitted.
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types $X, Y,$ and $Z$ to three processes $P0, P1,$ a...
22.4k
views
answered
Oct 31, 2019
Operating System
gatecse-2014-set1
operating-system
resource-allocation
normal
+
–
0
votes
65
cpu scheduling
explanation please...??? and what is the difference between convoy effect and starvation?
explanation please...???and what is the difference between convoy effect and starvation?
3.1k
views
answered
Oct 31, 2019
Operating System
process-scheduling
operating-system
+
–
2
votes
66
GATE CSE 2000 | Question: 12
An instruction pipeline has five stages where each stage take 2 nanoseconds and all instruction use all five stages. Branch instructions are not overlapped. i.e., the instruction after the branch is not fetched till the branch instruction ... 50% of the conditional branch instructions are such that the branch is taken, calculate the average instruction execution time.
An instruction pipeline has five stages where each stage take 2 nanoseconds and all instruction use all five stages. Branch instructions are not overlapped. i.e., the ins...
17.6k
views
answered
Oct 31, 2019
CO and Architecture
gatecse-2000
co-and-architecture
pipelining
normal
descriptive
+
–
1
votes
67
GATE CSE 2014 Set 3 | Question: 43
An instruction pipeline has five stages, namely, instruction fetch (IF), instruction decode and register fetch (ID/RF), instruction execution (EX), memory access (MEM), and register writeback (WB) with stage latencies $1$ ns, $2.2 $ ns, $2$ ... program on the old and the new design are $P$ and $Q$ nanoseconds, respectively. The value of $P/Q$ is __________.
An instruction pipeline has five stages, namely, instruction fetch (IF), instruction decode and register fetch (ID/RF), instruction execution (EX), memory access (MEM), a...
22.3k
views
answered
Oct 20, 2019
CO and Architecture
gatecse-2014-set3
co-and-architecture
pipelining
numerical-answers
normal
+
–
2
votes
68
GATE CSE 2010 | Question: 64
$5$ skilled workers can build a wall in $20$ days; $8$ semi-skilled workers can build a wall in $25$ days; $10$ unskilled workers can build a wall in $30$ days. If a team has $2$ skilled, $6$ semi-skilled and $5$ unskilled workers, how long it will take to build the wall? $20$ days $18$ days $16$ days $15$ days
$5$ skilled workers can build a wall in $20$ days; $8$ semi-skilled workers can build a wall in $25$ days; $10$ unskilled workers can build a wall in $30$ days. If a team...
6.5k
views
answered
Oct 2, 2019
Quantitative Aptitude
gatecse-2010
quantitative-aptitude
normal
work-time
+
–
3
votes
69
GATE2015 EC-2: GA- 8
A tiger is $50$ leaps of its own behind a deer. The tiger takes $5$ leaps per minute to the deer's $4.$ If the tiger and the deer cover $8$ meter and $5$ meter per leap respectively, what distance in meters will the tiger have to run before it catches the deer$?$
A tiger is $50$ leaps of its own behind a deer. The tiger takes $5$ leaps per minute to the deer's $4.$ If the tiger and the deer cover $8$ meter and $5$ meter per leap r...
4.7k
views
answered
Sep 28, 2019
Quantitative Aptitude
gate2015-ec-2
quantitative-aptitude
numerical-answers
speed-time-distance
+
–
3
votes
70
GATE2014 EC-1: GA-9
The exports and imports (in crores of Rs.) of a country from $2000$ to $2007$ are given in the following bar chart. If the trade deficit is defined as excess of imports over exports, in which year is the trade deficit $1/5$th of the exports? $2005$ $2004$ $2007$ $2006$
The exports and imports (in crores of Rs.) of a country from $2000$ to $2007$ are given in the following bar chart. If the trade deficit is defined as excess of imports o...
4.3k
views
answered
Sep 26, 2019
Quantitative Aptitude
gate2014-ec-1
quantitative-aptitude
data-interpretation
bar-graph
normal
+
–
Page:
« prev
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
