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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by Dharmendra Lodhi
User Dharmendra Lodhi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Dharmendra Lodhi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
4
answers
1
ISRO202054
Checksum field in TCP header is ones complement of sum of header and data in bytes ones complement of sum of header, data and pseudo header in $16$ bit words dropped from $\text{IPv6}$ header format better than $\text{md5}$ or $\text{sh1}$ methods
commented
Jan 15
in
Computer Networks

468
views
isro2020
computernetworks
tcp
normal
11
answers
2
GATE19941.11
In a compact single dimensional array representation for lower triangular matrices (i.e all the elements above the diagonal are zero) of size $n \times n$ ... new representation is: $i+j$ $i+j1$ $(j1)+\frac{i(i1)}{2}$ $i+\frac{j(j1)}{2}$
answered
Jul 13, 2019
in
DS

7.9k
views
gate1994
datastructures
arrays
normal
3
answers
3
GATE201943
Consider the augmented grammar given below: $S’ \rightarrow S$ $S \rightarrow \langle L \rangle \mid id$ $L \rightarrow L, S \mid S$ Let $I_0 = \text{CLOSURE} (\{[S’ \rightarrow \cdot S ]\}).$ The number of items in the set $\text{GOTO} (I_0, \langle \: )$ is______
comment edited
Feb 7, 2019
in
Compiler Design

4.2k
views
gate2019
numericalanswers
compilerdesign
grammar
6
answers
4
GATE201923
Consider three concurrent processes $P1$, $P2$ and $P3$ as shown below, which access a shared variable $D$ that has been initialized to $100$ ... maximum possible values of $D$ after the three processes have completed execution are $X$ and $Y$ respectively, then the value of $YX$ is ____
commented
Feb 7, 2019
in
Operating System

4.8k
views
gate2019
numericalanswers
operatingsystem
processsynchronization
5
answers
5
GATE201918
Consider the following C program : #include<stdio.h> int jumble(int x, int y){ x = 2*x+y; return x; } int main(){ int x=2, y=5; y=jumble(y,x); x=jumble(y,x); printf("%d \n",x); return 0; } The value printed by the program is ______________.
commented
Feb 7, 2019
in
Programming

3.3k
views
gate2019
numericalanswers
programminginc
programming
2
answers
6
GATE20193
Which one of the following kinds of derivation is used by LR parsers? Leftmost Leftmost in reverse Rightmost Rightmost in reverse
commented
Feb 7, 2019
in
Compiler Design

3.3k
views
gate2019
compilerdesign
parsing
2
answers
7
In sorting algo which has a running time that is least dependent on initial ordering of inputs
commented
Jan 28, 2019
in
Algorithms

2.6k
views
1
answer
8
ACE TEST SERIES QUESTION
answered
Dec 29, 2018
in
Set Theory & Algebra

64
views
1
answer
9
grade up
Assuming that a pointer take 4 bytes and the size of an integer is 2 bytes. What is the size of the *a in declaration: int (*a) [10][2] ? 4 80 20 40
commented
Dec 26, 2018
in
Programming

120
views
4
answers
10
GATE200530
Let r be a relation instance with schema R = (A, B, C, D). We define $r_1 = \pi_{A, B, C} (R)$ and $r_2=\pi_{A, D} (r)$. Let $s =r_1 \: * \: r_2$ where $*$ denotes natural join. Given that the decomposition of $r$ into $r_1$ and $r_2$ is lossy, which one of the following is TRUE? $s \subset r$ $r \cup s =r$ $r \subset s$ $r*s=s$
commented
Dec 2, 2018
in
Databases

4.1k
views
gate2005
databases
relationalalgebra
naturaljoin
normal
4
answers
11
GATE2014130
Given the following two statements: S1: Every table with two singlevalued attributes is in 1NF, 2NF, 3NF and BCNF. S2: $AB \to C$, $D \to E$, $E \to C$ is a minimal cover for the set of functional dependencies $AB \to C$, $D \to E$, $AB \to E$ ... the following is CORRECT? S1 is TRUE and S2 is FALSE. Both S1 and S2 are TRUE. S1 is FALSE and S2 is TRUE. Both S1 and S2 are FALSE.
commented
Dec 1, 2018
in
Databases

4.1k
views
gate20141
databases
databasenormalization
normal
6
answers
12
GATE199810a
Prove by induction that the expression for the number of diagonals in a polygon of $n$ sides is $\frac{n(n3)}{2}$
commented
Nov 5, 2018
in
Set Theory & Algebra

1.4k
views
gate1998
settheory&algebra
descriptive
relations
1
answer
13
ISI2004MIII: 11
If $\alpha 1,\alpha 2,\dots,\alpha n$ are the positive numbers then $\frac{a1}{a2}+\frac{a2}{a3}+\dots+\frac{an1}{an}+\frac{an}{a1}$ is always $\geq n$ $\leq n$ $\leq n^{\frac{1}{2}}$ None of the above
commented
Nov 4, 2018
in
Set Theory & Algebra

324
views
isi2004
settheory&algebra
numbertheory
2
answers
14
GATE20004
Let $S= \{0, 1, 2, 3, 4, 5, 6, 7\}$ and $⊗$ denote multiplication modulo $8,$ that is, $x ⊗ y= (xy) \mod 8$ Prove that $( \{ 0, 1\}, ⊗)$ is not a group. Write three distinct groups $(G, ⊗)$ where $G ⊂ S$ and $G$ has $2$ elements.
answered
Nov 4, 2018
in
Set Theory & Algebra

1.1k
views
gate2000
settheory&algebra
descriptive
grouptheory
1
answer
15
self doubt
The uPC is not incremented in the following cases : (i)When an end microinstruction is encountered. (ii)When a new instruction is loaded into IR(instruction register) (iii)When a branch microinstruction is encountered and branch condition is satisfied. Someone, please explain the last point. I didn't get why it will not be incremented. These statements are from the standard book
answered
Nov 4, 2018
in
CO and Architecture

18
views
2
answers
16
GATE199214b
Consider the set of integers $\{1,2,3,4,6,8,12,24\}$ together with the two binary operations LCM (lowest common multiple) and GCD (greatest common divisor). Which of the following algebraic structures does this represent? group ring field lattice
answered
Nov 4, 2018
in
Set Theory & Algebra

1.3k
views
gate1992
settheory&algebra
grouptheory
normal
2
answers
17
GATE200540
Let $P, Q$ and $R$ be three atomic propositional assertions. Let $X$ denote $( P ∨ Q ) → R$ and Y denote $(P → R) ∨ (Q → R).$ Which one of the following is a tautology? $X ≡ Y$ $X → Y$ $Y → X$ $¬Y → X$
commented
Nov 2, 2018
in
Mathematical Logic

2k
views
gate2005
mathematicallogic
propositionallogic
normal
3
answers
18
TIFR2017B11
Given that $B(x)$ means "$x$ is a bat", $F(x)$ means "$x$ is a fly", and $E(x, y)$ means "x eats $y$", what is the best English translation of $ \forall x(F(x) \rightarrow \forall y (E(y, x) \rightarrow B(y)))?$ all flies eat bats every fly is eaten by some bat bats eat only flies every bat eats flies only bats eat flies
answered
Nov 1, 2018
in
Mathematical Logic

1.1k
views
tifr2017
firstorderlogic
2
answers
19
Permutations, TIFR2011B30
What does it mean when they say "An array A[1...n] consists of a permutation of numbers 1....n.".? Also I'd be grateful if you give some example.
answered
Nov 1, 2018
in
Numerical Ability

131
views
datastructures
combinatory
arrays
usertifr2011
usermod
generalaptitude
2
answers
20
CMI2013B02
A complete graph on $n$ vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vertex is repeated. Let $G$ be a complete graph on $10$ vertices. Let $u$, $v$, $ w$ be three distinct vertices in $G$. How many simple paths are there from $u$ to $v$ going through $w$?
answered
Oct 27, 2018
in
Graph Theory

881
views
cmi2013
descriptive
graphtheory
graphconnectivity
1
answer
21
TANCET 2016 DEADLOCK
answered
Oct 25, 2018
in
Operating System

42
views
tancet
0
answers
22
valid or Invalid
$ \forall x (P(x) \rightarrow Q(x)) \rightarrow [\exists P(x)] \rightarrow [\forall Q(x)]$ how to check that a statement is valid or invalid ?
commented
Oct 24, 2018
in
Mathematical Logic

116
views
0
answers
23
GateForum Test Series: Databases  Sql
The answer should be D, but C is provided as the answer.
commented
Oct 24, 2018
in
Databases

114
views
gateforumtestseries
databases
sql
1
answer
24
TANCET 2016 Interrupt
answered
Oct 23, 2018
in
CO and Architecture

29
views
tancet
1
answer
25
Indexing
commented
Oct 23, 2018
in
Databases

605
views
databases
indexing
1
answer
26
which one is right. Also pleasse explain in few words.
. Consider an implementation of unsorted circular linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time? Insertion at the front of the linked list Insertion at ... linked list (a) I and II (b) I and III (c) I, II, III and IV (d) None
commented
Oct 22, 2018
in
DS

162
views
3
answers
27
Consider the following statement about indexes
Consider the following statement (i) Primary index is always sparse (ii) Secondary index may or may not be dense Which of the above statement is/are false? A)Only (i) B)Only (ii) C)Both (i) and (ii) D)None of these
commented
Oct 21, 2018
in
Databases

2.1k
views
databases
indexing
0
answers
28
self_doubt
A processor uses 36 bit physical address and 32 bit virtual addresses, with a page frame size of 4 Kbytes. Each page table entry is of size 4 bytes. A three level page table is used for virtual to physical address translation, where the virtual ... table entry of the first, second and third level page tables are respectively. modified from : https://gateoverflow.in/490/gate200867
commented
Oct 21, 2018
in
Operating System

266
views
virtualmemory
operatingsystem
1
answer
29
selfdoubt
can anyone explain how TLB is organized when it is used as Direct mapped and setassosiative or suggest any resource to read ? https://gateoverflow.in/1840/gate200662isro201650
asked
Oct 20, 2018
in
Operating System

31
views
1
answer
30
GATE200662, ISRO201650
A CPU generates $32$bit virtual addresses. The page size is $4$ KB. The processor has a translation lookaside buffer (TLB) which can hold a total of $128$ page table entries and is $4$way set associative. The minimum size of the TLB tag is: $\text{11 bits}$ $\text{13 bits}$ $\text{15 bits}$ $\text{20 bits}$
commented
Oct 20, 2018
in
Operating System

10.4k
views
gate2006
operatingsystem
virtualmemory
normal
isro2016
52,217
questions
59,907
answers
201,098
comments
118,144
users