The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
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
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
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
2
answers
1
GATEBOOK2019LA118
If $E=\begin{bmatrix} 1 & 2 & 1 & 0 \\ 3 & 4 & 0 & 1 \\ 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \end{bmatrix}$ then $E^{1}$ ...
commented
Jan 1
in
Linear Algebra

108
views
gb2019la1
1
answer
2
ACE TEST SERIES QUESTION
answered
Dec 29, 2018
in
Set Theory & Algebra

34
views
1
answer
3
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

99
views
4
answers
4
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

2.6k
views
gate2005
databases
relationalalgebra
naturaljoin
normal
4
answers
5
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

2.7k
views
gate20141
databases
databasenormalization
normal
4
answers
6
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.1k
views
gate1998
settheory&algebra
descriptive
relations
1
answer
7
ISI2004MIII11
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

243
views
isi2004
settheory&algebra
numbertheory
2
answers
8
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

742
views
gate2000
settheory&algebra
descriptive
groups
1
answer
9
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 & Architecture

15
views
2
answers
10
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

808
views
gate1992
settheory&algebra
groups
normal
2
answers
11
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

1.4k
views
gate2005
mathematicallogic
propositionallogic
normal
3
answers
12
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

722
views
tifr2017
firstorderlogic
1
answer
13
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

49
views
datastructure
permutationsandcombinations
arrays
usertifr2011
usermod
generalaptitude
2
answers
14
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

448
views
cmi2013
descriptive
graphtheory
counting
1
answer
15
TANCET 2016 DEADLOCK
answered
Oct 25, 2018
in
Operating System

28
views
tancet
0
answers
16
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

60
views
0
answers
17
Gateforum test series
The answer should be D, but C is provided as the answer.
commented
Oct 24, 2018
in
Databases

64
views
gateforumtestseries
databases
1
answer
18
TANCET 2016 Interrupt
answered
Oct 23, 2018
in
CO & Architecture

14
views
tancet
1
answer
19
Indexing
commented
Oct 23, 2018
in
Databases

524
views
databases
indexing
1
answer
20
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

145
views
3
answers
21
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

979
views
databases
indexing
0
answers
22
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

151
views
virtualmemory
operatingsystem
1
answer
23
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

21
views
1
answer
24
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

7.4k
views
gate2006
operatingsystem
virtualmemory
normal
isro2016
0
answers
25
Galvin #page fault service time #memory management #disk access
comment edited
Oct 19, 2018
in
Operating System

114
views
pagefault
operatingsystem
effectivememoryaccess
pagereplacement
page
0
answers
26
#OS Fork () tell the O/P?
A process executes the following segment of code : for(i = 1; i <= n; i++) fork (); fork (); The number of new processes created is
commented
Oct 19, 2018
in
Operating System

131
views
fork
operatingsystem
1
answer
27
#virtualgate
they have given b as the answer...i think answer is d....plz check!
commented
Oct 19, 2018
in
Theory of Computation

56
views
3
answers
28
GATE2005IT62
Two shared resources $R_1$ and $R_2$ are used by processes $P_1$ and $P_2$. Each process has a certain priority for accessing each resource. Let $T_{ij}$ denote the priority of $P_i$ for accessing $R_j$. A process $P_i$ can snatch a resource $R_h$ from process $P_j$ ... ensures that $P_1$ and $P_2$ can never deadlock? (I) and (IV) (II) and (III) (I) and (II) None of the above
answered
Oct 18, 2018
in
Operating System

1.8k
views
gate2005it
operatingsystem
resourceallocation
normal
4
answers
29
GATE198911a
A system of four concurrent processes, $P, Q, R$ and $S$, use shared resources $A, B$ and $C$. The sequences in which processes, $P, Q, R$ and $S$ request and release resources are as follows: Process P: 1. P requests A ... . What strategies can be used to prevent deadlocks in a system of concurrent processes using shared resources if preemption of granted resources is not allowed?
answered
Oct 18, 2018
in
Operating System

512
views
descriptive
gate1989
operatingsystem
resourceallocation
3
answers
30
GATE2006IT55
Consider the solution to the bounded buffer producer/consumer problem by using general semaphores $S, F,$ and $E$. The semaphore $S$ is the mutual exclusion semaphore initialized to $1$. The semaphore $F$ ... and Signal $(F)$ in the Consumer process (I) only (II) only Neither (I) nor (II) Both (I) and (II)
commented
Oct 16, 2018
in
Operating System

2.7k
views
gate2006it
operatingsystem
processsynchronization
normal
2
answers
31
Fragmentation
Consider a TCP message that contains 1024 bytes of data and 20 bytes of TCP header is passed to IP for delivery across two networks interconnected by a router (i.e., it travels from the source host to a router to the destination host). The first network has ... the IP layer at the destination for TCP message, in the best case is _________ bytes. (Assume all IP headers are 20 bytes)
answered
Oct 16, 2018
in
Computer Networks

97
views
fragmentation
computernetworks
0
answers
32
digital logic full adder
Q:min number of NAND gate required to realize Full Adder circuit? (NAND gate is 2 input NAND gate) A7 B8 C9 D10
commented
Oct 16, 2018
in
Digital Logic

29
views
1
answer
33
What is the state of the process when it has multiple threads ?
When we have a multiple threads in a system which may be have different states like running , blocked ,ready then can we define the overall state of the process ? Because we will have PCB corresponding to a process so what will be the state of the process in it ? I am taking into consideration multiprocessor system .
commented
Oct 16, 2018
in
Operating System

27
views
operatingsystem
0
answers
34
Process state
A printf or malloc takes the process to what state? Running Ready Suspended Terminated
commented
Oct 16, 2018
in
CO & Architecture

14
views
5
answers
35
GATE200381
Suppose we want to synchronize two concurrent processes $P$ and $Q$ using binary semaphores $S$ and $T$. The code for the processes $P$ and $Q$ is shown below. Process P: Process Q: while(1) { while(1) { W: Y: print '0'; print '1'; print '0'; print '1'; X: Z: } } Synchronization statements ... $1$ $V(S)$ at $W, V(T)$ at $X, P(S)$ at $Y, P(T)$ at $Z, S$ and $T$ initially $1$
commented
Oct 16, 2018
in
Operating System

2.8k
views
gate2003
operatingsystem
processsynchronization
normal
2
answers
36
GATE200218a
Draw the process state transition diagram of an OS in which (i) each process is in one of the five states: created, ready, running, blocked (i.e., sleep or wait), or terminated, and (ii) only nonpreemptive scheduling is used by the OS. Label the transitions appropriately.
commented
Oct 15, 2018
in
Operating System

1.3k
views
gate2002
operatingsystem
processsynchronization
normal
descriptive
0
answers
37
MIT assignment
A geosynchronous satellite has a halfduplex channel with a transmission rate of 10 kbps and a propagation delay of 0.25 sec each way. With a data packet size of 1000 bits and a loss probability p of 0.001 ,(A) what is the expected transmission time of ... parameters are the same as part (a), what is the longest channel propagation delay for which we can still use stopandwait?
comment reshown
Oct 15, 2018
in
Computer Networks

114
views
computernetworks
networkflow
flowcontrolmethods
stopandwait
data
datalinklayer
3
answers
38
Jam Signal
Consider two nodes A and B on the same ethernet segment, and suppose the propagation delay between two nodes is 225 bit times. Suppose at time both nodes A and B begin to transmit a frame. Assume both nodes transmit a 50 bit jam signal after detection a collision. For 107 bits per set ethernet , find the time at which both nodes A and B sense an idle channel(in microsec) ?
answered
Oct 15, 2018
in
Computer Networks

545
views
computernetworks
2
answers
39
Context switches in round robin
Here what are the number of context switches ? Is it 5 or 6? Do we consider context switch before P1 (i.e during the start) ?
comment edited
Oct 14, 2018
in
Operating System

1.1k
views
operatingsystem
roundrobin
contextswitch
1
answer
40
self doubt
I have a doubt regarding the no of context switches needed in any scheduling algorithm. assume we have 5 processes, which require 4, 6, 7,5 and 1 time units and arrive at times 0, 1, 2,3, and 5 respectively. How many context switches are needed if the ... 4 I wanted to ask how SRTF work internally (as i know it will check firstly for next process arrival time then it will go ahed)
commented
Oct 14, 2018
in
Operating System

46
views
srtf
47,197
questions
51,426
answers
178,313
comments
66,727
users