The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Answers by shivam001
User shivam001
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User shivam001
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
self_doubt
can we say that: TCP uses only selective/independent acknowledgment not cumulative as it uses selective reject protocol??? and go back N uses both independent and cumulative acknowledgment?
answered
Feb 6
in
Computer Networks

672
views
0
votes
2
GO2019FLT113
For a given $m$ary tree, the relationship between leaf nodes and internal nodes is represented by the graph given below. What is the value of $'m'$? Take necessary approximations to nearest integer if required (Integer type)
answered
Feb 4
in
DS

340
views
go2019flt1
numericalanswers
trees
datastructures
0
votes
3
TIFR2018B1
What is the remainder when $4444^{4444}$ is divided by $9?$ $1$ $2$ $5$ $7$ $8$
answered
Jan 29
in
Combinatory

659
views
tifr2018
modulararithmetic
permutationandcombination
0
votes
4
GATE201921
The value of $3^{51} \text{ mod } 5$ is _____
answered
Jan 29
in
Combinatory

5.9k
views
gate2019
numericalanswers
permutationandcombination
modulararithmetic
0
votes
5
GATE201922
Two numbers are chosen independently and uniformly at random from the set $\{1,2,\ldots,13\}.$ The probability (rounded off to 3 decimal places) that their $4bit$ (unsigned) binary representations have the same most significant bit is _______________.
answered
Jan 23
in
Digital Logic

6.3k
views
gate2019
numericalanswers
digitallogic
numberrepresentation
probability
0
votes
6
Find the number of minimal candidate keys of R?
answered
Jan 14
in
Databases

941
views
databases
0
votes
7
SET OF VIABLE PREFIXES FOR A GIVEN SLR(1) GRAMMAR IS REGULAR LANGUAGE ?
SET OF VIABLE PREFIXES FOR A GIVEN SLR(1) GRAMMAR IS REGULAR LANGUAGE ?
answered
Jan 5
in
Compiler Design

581
views
compilerdesign
0
votes
8
GATE2015254
Let $X$ and $Y$ denote the sets containing 2 and 20 distinct objects respectively and $F$ denote the set of all possible functions defined from $X$ to $Y$. Let $f$ be randomly chosen from $F$. The probability of $f$ being onetoone is ______.
answered
Jan 4
in
Set Theory & Algebra

2.9k
views
gate20152
settheory&algebra
functions
normal
numericalanswers
+2
votes
9
GATE19962.1
Let $R$ denote the set of real numbers. Let $f:R\times R \rightarrow R \times R$ be a bijective function defined by $f(x,y) = (x+y, xy)$. The inverse function of $f$ is given by $f^{1} (x,y) = \left( \frac {1}{x+y}, \frac{1}{xy}\right)$ ... $f^{1}(x,y)=\left [ 2\left(xy\right),2\left(x+y\right) \right ]$
answered
Jan 4
in
Set Theory & Algebra

2.7k
views
gate1996
settheory&algebra
functions
normal
0
votes
10
GO2017Programming128
int foo(int n) { if(n > 10000) return 1; int sum = 0, i; for( i = 0; i < n; i++) { sum += i; } return sum; } The value returned by the above function is $\Theta\left(n^2\right)$ $\Theta\left(n\right)$ $\Theta\left(1\right)$ $\Omega\left(n^2\right)$
answered
Jan 3
in
Programming

481
views
go2017programming1
programming
asymptoticnotations
programminginc
0
votes
11
GO2017Programming121
The value returned by the following code is _____ int foo() { int a[] = { 10, 20, 30, 40, 50, 60 }; int *p = &a[1] , *q = &a[5] ; return qp; }
answered
Jan 3
in
Programming

431
views
go2017programming1
programming
programminginc
numericalanswers
0
votes
12
GATE200951
A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ cylinders. The address of a sector is given as a triple $\langle c, h, s \rangle$, where $c$ is the cylinder number, $h$ is the surface number and $s$ is ... $\langle 400, 16, 29 \rangle$ corresponds to sector number: $505035$ $505036$ $505037$ $505038$
answered
Dec 30, 2019
in
Operating System

6.4k
views
gate2009
operatingsystem
disks
normal
+1
vote
13
GATE19981.32
A computer has six tape drives, with $n$ processes competing for them. Each process may need two drives. What is the maximum value of $n$ for the system to be deadlock free? $6$ $5$ $4$ $3$
answered
Dec 29, 2019
in
Operating System

4.7k
views
gate1998
operatingsystem
resourceallocation
normal
+1
vote
14
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 38 (Page No. 336)
Given a diskblock size of $4\: KB$ and blockpointer address value of $4$ bytes, what is the largest file size (in bytes) that can be accessed using $10$ direct addresses and one indirect block?
answered
Dec 27, 2019
in
Operating System

56
views
tanenbaum
operatingsystem
filesystem
disks
descriptive
0
votes
15
TCP 3 Way Handshaking
In TCP 3 way handshaking mechanism why the data is not started being transmitting from the 3rd step itself I.e. 1. A> B / SYN FROM A 2. A<B / SYN AND ACK FROM B 3. A> B / ACK FROM A.
answered
Dec 21, 2019
in
Computer Networks

269
views
computernetworks
tcp
0
votes
16
GATE2014351
If $G$ is the forest with $n$ vertices and $k$ connected components, how many edges does $G$ have? $\left\lfloor\frac {n}{k}\right\rfloor$ $\left\lceil \frac{n}{k} \right\rceil$ $nk$ $nk+1$
answered
Dec 20, 2019
in
Graph Theory

5.2k
views
gate20143
graphtheory
graphconnectivity
normal
0
votes
17
GATE2014351
If $G$ is the forest with $n$ vertices and $k$ connected components, how many edges does $G$ have? $\left\lfloor\frac {n}{k}\right\rfloor$ $\left\lceil \frac{n}{k} \right\rceil$ $nk$ $nk+1$
answered
Dec 20, 2019
in
Graph Theory

5.2k
views
gate20143
graphtheory
graphconnectivity
normal
0
votes
18
GATE20021.25, ISRO200830, ISRO20166
The maximum number of edges in a nnode undirected graph without self loops is $n^2$ $\frac{n(n1)}{2}$ $n1$ $\frac{(n+1)(n)}{2}$
answered
Dec 20, 2019
in
Graph Theory

5.9k
views
gate2002
graphtheory
easy
isro2008
isro2016
graphconnectivity
0
votes
19
GATE2014151
Consider an undirected graph $G$ where selfloops 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 $ac \leq 1$ and $bd \leq 1$. The number of edges in this graph is______.
answered
Dec 20, 2019
in
Graph Theory

8.9k
views
gate20141
graphtheory
numericalanswers
normal
graphconnectivity
0
votes
20
GATE201238
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$
answered
Dec 19, 2019
in
Graph Theory

12k
views
gate2012
graphtheory
normal
markstoall
counting
0
votes
21
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$
answered
Dec 18, 2019
in
Digital Logic

129
views
digitallogic
booleanalgebra
2014ece
0
votes
22
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?
answered
Dec 18, 2019
in
Digital Logic

224
views
digitallogic
booleanalgebra
0
votes
23
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
answered
Dec 18, 2019
in
Digital Logic

271
views
gatebook
digitallogic
booleanalgebra
0
votes
24
ISI2017DCG10
The value of the Boolean expression (with usual definitions) $(A’BC’)’ +(AB’C)’$ is $0$ $1$ $A$ $BC$
answered
Dec 18, 2019
in
Digital Logic

137
views
isi2017dcg
digitallogic
booleanalgebra
booleanexpression
0
votes
25
No. of states in the minimal finite automata which accepts the binary strings whose equivalent is divisible by 32 is ________?
answered
Dec 11, 2019
in
Theory of Computation

1.2k
views
theoryofcomputation
finiteautomata
0
votes
26
GATE200336
How many perfect matching are there in a complete graph of $6$ vertices? $15$ $24$ $30$ $60$
answered
Dec 9, 2019
in
Graph Theory

5.7k
views
gate2003
graphtheory
graphmatching
normal
0
votes
27
TIFR2019A11
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, they don't shake ... $2 \mid \text{Even} \mid  \mid \text{Odd} \mid$ $2 \mid \text{Odd} \mid  \mid \text{Even} \mid$
answered
Dec 7, 2019
in
Numerical Ability

388
views
tifr2019
generalaptitude
numericalability
logicalreasoning
0
votes
28
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 :)
answered
Dec 7, 2019
in
TIFR

89
views
0
votes
29
TIFR Exam Pattern
If anyone had analysed the previous TIFR papers, which subjects/topics of GATE they dont or rarely ask ? Please do share.
answered
Dec 6, 2019
in
TIFR

166
views
0
votes
30
GATE2016210
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_______.
answered
Dec 5, 2019
in
CO and Architecture

3.5k
views
gate20162
machineinstructions
coandarchitecture
easy
numericalanswers
+3
votes
31
GATE200772
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ ... memory is word addressable. After the execution of this program, the content of memory location $2010$ is: $100$ $101$ $102$ $110$
answered
Dec 5, 2019
in
CO and Architecture

2.8k
views
gate2007
coandarchitecture
machineinstructions
interrupts
normal
0
votes
32
GATE2016130
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$
answered
Nov 23, 2019
in
Digital Logic

3.2k
views
gate20161
digitallogic
multiplexer
normal
0
votes
33
GATE20012.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'$
answered
Nov 23, 2019
in
Digital Logic

2.6k
views
gate2001
digitallogic
normal
multiplexer
0
votes
34
GATE201618
We want to design a synchronous counter that counts the sequence $010203$ and then repeats. The minimum number of $\text{JK}$ flipflops required to implement this counter is _____________.
answered
Nov 23, 2019
in
Digital Logic

18.5k
views
gate20161
digitallogic
digitalcounter
flipflop
normal
numericalanswers
0
votes
35
How to calculate propogation delay for a synchronous counter ?
answered
Nov 23, 2019
in
Digital Logic

262
views
0
votes
36
GATE2010 TF: GA10
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$
answered
Nov 18, 2019
in
Numerical Ability

141
views
generalaptitude
numericalability
gate2010tf
numericalcomputation
0
votes
37
GOCompiler1: Parsing3
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 grammars parsed by LR(1) parsers ... parsed by LL(1) parsers There is no DCFL which is not having a grammar that can be parsed by a LR(1) parser
answered
Nov 16, 2019
in
Compiler Design

392
views
go2019cd1
parsing
Page:
1
2
next »
50,833
questions
57,713
answers
199,428
comments
107,715
users