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 Pratik Gawali
User Pratik Gawali
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Pratik Gawali
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
4
answers
1
GATE2014154
Given the following schema: employees(empid, firstname, lastname, hiredate, deptid, salary) departments(deptid, deptname, managerid, locationid) You want to display the last names and hire dates of all latest hires in their respective departments ... of pairwise comparison. It generates an error because of the GROUP BY clause cannot be used with table joins in a subquery.
commented
Oct 25, 2019
in
Databases

4.5k
views
gate20141
databases
sql
normal
2
answers
2
GATE200859
A client process P needs to make a TCP connection to a server process S. Consider the following situation: the server process S executes a $\text{socket()}$, a $\text{bind()}$ and a $\text{listen()}$ system call in that order, following which it is preempted ... $\text{connect()}$ system call returns an error $\text{connect()}$ system call results in a core dump
commented
Sep 25, 2019
in
Computer Networks

6.2k
views
gate2008
computernetworks
sockets
normal
2
answers
3
GATE2007 EE
Let $x$ and $y$ be two vectors in a $3$ dimensional space and $<x,y>$ denote their dot product. Then the determinant $det\begin{bmatrix}<x,x> & <x,y>\\ <y,x> & <y,y>\end{bmatrix}$ is zero when $x$ and $y$ are linearly ... $x$ and $y$ are linearly independent is nonzero for all nonzero $x$ and $y$ is zero only when either $x$ or $y$ is zero
answered
Sep 11, 2019
in
Linear Algebra

533
views
engineeringmathematics
linearalgebra
1
answer
4
Gate 2019
What is the answer for the question given a statement about beggars?
commented
Feb 6, 2019
in
Verbal Ability

463
views
1
answer
5
Self Doubt
What does 256 M×4−bit DRAM chips means?
asked
Jan 23, 2019
in
CO and Architecture

29
views
0
answers
6
Self Doubt
3NF Decomposition for the relation R(A,B,C): A $\rightarrow$ BC B $\rightarrow$ C such that it is lossless and dependency preserving. [It is said that 3NF decomposition is possible for any relation but I couldn't find decomposition for the above]
commented
Jan 20, 2019
in
Databases

43
views
0
answers
7
MadeEasy Subject Test 2019: Algorithms  Time Complexity
commented
Jan 15, 2019
in
Algorithms

162
views
algorithms
timecomplexity
madeeasytestseries
madeeasytestseries2019
2
answers
8
Test Series
Consider a 4way set associative cache that has 8lines, with perfect LRU cache replacement and supports a block size of 16bytes. For the following memory access pattern (shown as byte addresses), find the hit ratio? 3, 5, 6, 21, 32, 14, 5, 10, 11, 12
answered
Jan 10, 2019
in
CO and Architecture

217
views
coandarchitecture
cachememory
0
answers
9
Self Doubt: What is the strategy to color a graph with minimum colors?
I know the fact that if a graph has a complete subgraph, say Kn, at least n will be the chromatic number. But what is the strategy for coloring vertices of a graph so that we need minimum colors? Many times it has happened that the order in which I color leads to more number of colors.
asked
Jan 6, 2019
in
Graph Theory

17
views
1
answer
10
MadeEasy Test Series Mathematical Logic  Propositional Logic
Consider two wellformed formula in proposition logic: Which of the following is correct? F1 is satisfiable, F2 is valid F1 is unsatisfiable, F1 is satisfiable F1 is unsatisfiable, F2 is valid F1 and F2 both are unsatisfiable
answer selected
Jan 5, 2019
in
Mathematical Logic

119
views
discretemathematics
madeeasytestseries
propositionallogic
3
answers
11
GATE201418
The base (or radix) of the number system such that the following equation holds is____________. $\frac{312}{20} = 13.1$
answered
Jan 2, 2019
in
Digital Logic

3.2k
views
gate20141
digitallogic
numberrepresentation
numericalanswers
normal
0
answers
12
Does each ACK packet also include window size in TCP connection?
While solving a question I ran through the following statement: RcvWindow is the part of the receiver's buffer that's changing all the time depending on the processing capability at the receiver's side and the network traffic ... window size is also conveyed with ACK? If not then how does sender knows about the changed window size?
commented
Dec 30, 2018
in
Computer Networks

103
views
computernetworks
tcp
1
answer
13
Self doubt
#include<stdio.h> int main() { fork() && fork (); printf(“Forked”); } Explain the output of code with proper reason.
answer edited
Dec 29, 2018
in
Operating System

84
views
operatingsystem
1
answer
14
Scaling Factor
Header field need scaling factor, , when it’s size is small, that is ok But why fragment offset field also need scaling factor? https://gateoverflow.in/1548/gate201337
commented
Dec 29, 2018
in
Computer Networks

244
views
computernetworks
0
answers
15
Why 1Kbps bandwidth is 1000 bits per sec and not 1024 bits per sec?
While solving numerical problems of computer networks, I saw bandwidth of 1Kbps was taken as 1000bps. I was getting wrong answers as I was calculating using 1024bps. What is reason for taking K as 1000 and not 1024 in bandwidth?
asked
Dec 26, 2018
in
Computer Networks

147
views
4
answers
16
GATE2014128
Consider a selective repeat sliding window protocol that uses a frame size of $1$ $\text{KB}$ to send data on a $1.5$ $\text{Mbps}$ link with a oneway latency of $50$ $\text{msec}$. To achieve a link utilization of $60\%$, the minimum number of bits required to represent the sequence number field is ________.
commented
Dec 26, 2018
in
Computer Networks

10.7k
views
gate20141
computernetworks
slidingwindow
numericalanswers
normal
2
answers
17
made easy test series
which of the following data structure is efficient to implement priority queue with basic operations such as insertion,deletion and searching? A)linked list B)Heap C)Sorted array D)Unsorted array
answered
Dec 22, 2018
in
Programming

354
views
3
answers
18
Static Scoping  Dynamic Scoping: GATE 1989
Indicate results of the following program if the language uses i)Static scope rule and ii) Dynamic scope rules (GATE1989) var x,y:integer; procedure A(var z:integer); var x:integer; begin x:=1; B; z:=x; end; procedure B; begin x:=x+1; end; begin x:=5; A(y); write(y) end;
commented
Dec 17, 2018
in
Programming

754
views
1
answer
19
Memory allocation
Consider 900 KB memory is managed using variable partitions but no compaction. It currently has three process occupied partition of sizes 212 KB, 114 KB and 100 KB respectively. What is the smallest allocation request that could be denied?
commented
Dec 16, 2018
in
Operating System

552
views
operatingsystem
memorymanagement
memoryallocation
1
answer
20
GATE19888ii
Consider the two program segments below: for i:=1 to f(x) by 1 do S end i:=1; While i<=f(x) do S i:=i+1 end Under what conditions are these two programs equivalent? Treat $S$ as any sequence of statement and f as a function.
commented
Dec 12, 2018
in
Programming

532
views
gate1988
programming
descriptive
loopinvariants
4
answers
21
GATE200768, ISRO201673
The message $11001001$ is to be transmitted using the CRC polynomial $x^3 +1$ to protect it from errors. The message that should be transmitted is: $11001001000$ $11001001011$ $11001010$ $110010010011$
commented
Dec 11, 2018
in
Computer Networks

8.9k
views
gate2007
computernetworks
errordetection
crcpolynomial
normal
isro2016
0
answers
22
Made easy Test series
commented
Dec 10, 2018
in
Operating System

99
views
0
answers
23
MadeEasy Test Series: Operating System  Process Schedule
Consider four process all are arriving at time zero, with total execution time of 20, 10, 10 and 20 unit respectively. Each process spends the first 20% of execution time doing CPU, the next 60%of doing I/O computation and the last ... CPU burst doesn't this line makes it LTF (non preemptive) ?? because they solve this by LRTF(preemptive ).
commented
Dec 10, 2018
in
Operating System

133
views
operatingsystem
processschedule
madeeasytestseries
0
answers
24
Does page fault service time include memory access time as well?
In some questions solution includes, EMAT = (1p)(memory access time) + p* page fault service time while in others, EMAT = (1p) (memory access time) + p*( memory access time + page fault service time) I am very confused if the page fault service time includes memory access time when the page is loaded from the disk.
commented
Dec 9, 2018
in
Operating System

253
views
1
answer
25
MadeEasy Test Series: Operating System  Memory Management
Consider five memory partitions of size 100 KB, 500 KB, 200 KB, 450 KB and 600 KB in same order. If sequence of requests for blocks of size 212 KB, 417 KB, 112 KB and 426 KB in same order come, then which of the following ... efficient use of memory? A) BEST FIT B) FIRST FIT C) NEXT FIT D) BOTH NEXT FIT AND BEST FIT RESULTS IN SAME
commented
Dec 9, 2018
in
Operating System

1.8k
views
madeeasytestseries
operatingsystem
memorymanagement
2
answers
26
Made Easy Test Series
What is worst case time complexity to delete middle element from the min heap of n distinct elements? O(logn) O(n) O(nlogn) O($n^{2}$)
commented
Dec 3, 2018
in
Algorithms

423
views
1
answer
27
MADEEASY
answered
Dec 3, 2018
in
Algorithms

77
views
2
answers
28
MadeEasy Test Series: Algorithms  Dynamic Programming
Let the difference between the maximum possible profit for $0/1$ knapsack and fractional knapsack with capacity $20$ be $X$. What is the value of $X$ Item a b c d e f g h i j Profit 7 10 3 3 26 19 18 17 5 4 Weight 3 5 2 1 12 10 9 9 4 1 How to solve for $0/1$ knapsack for the maximum profit in the faster way ???
commented
Nov 26, 2018
in
Algorithms

271
views
madeeasytestseries
algorithms
dynamicprogramming
4
answers
29
Gate20002.19
Let $G$ be an undirected graph. Consider a depthfirst traversal of $G$, and let $T$ be the resulting depthfirst search tree. Let $u$ be a vertex in $G$ and let $v$ be the first new (unvisited) vertex visited after visiting $u$ in the traversal. Which of the following statement is ... leaf in $T$ If $\{u, v\}$ is not an edge in $G$ then $u$ and $v$ must have the same parent in $T$
commented
Nov 24, 2018
in
Algorithms

6.5k
views
gate2000
algorithms
graphalgorithms
normal
3
answers
30
GATE200935
The running time of an algorithm is represented by the following recurrence relation: $T(n) = \begin{cases} n & n \leq 3 \\ T(\frac{n}{3})+cn & \text{ otherwise } \end{cases}$ Which one of the following represents the time complexity of the algorithm? $\Theta(n)$ $\Theta(n \log n)$ $\Theta(n^2)$ $\Theta(n^2 \log n)$
commented
Nov 19, 2018
in
Algorithms

3.1k
views
gate2009
algorithms
recurrence
timecomplexity
normal
52,315
questions
60,438
answers
201,786
comments
95,270
users