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 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
+1
vote
1
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
in
Linear Algebra

330
views
engineeringmathematics
linearalgebra
0
votes
2
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 9
in
CO and Architecture

204
views
coandarchitecture
cachememory
–1
vote
3
GATE201418
The base (or radix) of the number system such that the following equation holds is____________. $\frac{312}{20} = 13.1$
answered
Jan 2
in
Digital Logic

2.3k
views
gate20141
digitallogic
numberrepresentation
numericalanswers
normal
+1
vote
4
Self doubt
#include<stdio.h> int main() { fork() && fork (); printf(“Forked”); } Explain the output of code with proper reason.
answered
Dec 29, 2018
in
Operating System

58
views
operatingsystem
+1
vote
5
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
answered
Dec 28, 2018
in
Computer Networks

116
views
computernetworks
+1
vote
6
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

221
views
0
votes
7
MADEEASY
answered
Dec 2, 2018
in
Algorithms

60
views
0
votes
8
Serializability and strict schedules
Answer is given as D. Not serializable, agreed. But how is it strict??
answered
Nov 18, 2018
in
Databases

359
views
strictschedule
0
votes
9
GATE200669
Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. Assume no null values and no foreign keys or integrity constraints. Assume that amounts 6000, ... Plan 1 executes faster than Plan 2 for all databases For x = 9000, Plan I executes slower than Plan 2 for all databases
answered
Nov 2, 2018
in
Databases

3.6k
views
gate2006
databases
sql
normal
+13
votes
10
GATE2008IT75
Student (schoolid, schrollno, sname, saddress) School (schoolid, schname, schaddress, schphone) Enrolment(schoolid schrollno, erollno, examname) ExamResult(erollno, examname, marks) Consider the following tuple relational calculus query. { ... other schools with a pass percentage above 35% over all exams taken together schools with a pass percentage above 35% over each exam
answered
Oct 15, 2018
in
Databases

4.1k
views
gate2008it
databases
relationalcalculus
normal
0
votes
11
GATE200715,ISRO201626
Consider the following segment of Ccode: int j, n; j = 1; while (j <= n) j = j * 2; The number of comparisons made in the execution of the loop for any $n > 0$ is: $\lceil \log_2n \rceil +1$ $n$ $\lceil \log_2n \rceil$ $\lfloor \log_2n \rfloor +1$
answered
Sep 22, 2018
in
Algorithms

9.4k
views
gate2007
algorithms
timecomplexity
normal
isro2016
+10
votes
12
GATE201050
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$ ... is the minimum possible weight of a spanning tree $T$ in this graph such that vertex 0 is a leaf node in the tree $T$? $7$ $8$ $9$ $10$
answered
Aug 26, 2018
in
Algorithms

5.2k
views
gate2010
algorithms
spanningtree
normal
+6
votes
13
GATE200823
Which of the following statements is true for every planar graph on $n$ vertices? The graph is connected The graph is Eulerian The graph has a vertexcover of size at most $\frac{3n}{4}$ The graph has an independent set of size at least $\frac{n}{3}$
answered
Aug 16, 2018
in
Graph Theory

3k
views
gate2008
graphtheory
normal
graphplanarity
0
votes
14
GATE199322
Write a concurrent program using $\text{parbeginparend}$ and semaphores to represent the precedence constraints of the statements $S_1$ to $S_6$, as shown in figure below.
answered
Jul 28, 2018
in
Operating System

1.8k
views
gate1993
operatingsystem
processsynchronization
normal
+3
votes
15
GATE199111,a
Consider the following scheme for implementing a critical section in a situation with three processes $P_i, P_j$ and $P_k$. Pi; repeat flag[i] := true; while flag [j] or flag[k] do case turn of j: if flag [j] then begin flag [i] := false; ... turn := j; flag [i] := false noncritical section until false; Does the scheme ensure mutual exclusion in the critical section? Briefly explain.
answered
Jul 27, 2018
in
Operating System

885
views
gate1991
processsynchronization
normal
operatingsystem
+1
vote
16
GATE19878a
Consider the following proposal to the "readers and writers problem." Shared variables and semaphores: aw, ar, rw, rr : interger; mutex, reading, writing: semaphore: initial values of variables and states of semaphores: ar=rr=aw=rw=0 ... a group of readers make waiting writers starve? Can writers starve readers? Explain in two sentences why the solution is incorrect.
answered
Jul 25, 2018
in
Operating System

465
views
gate1987
operatingsystem
processsynchronization
50,645
questions
56,559
answers
195,717
comments
101,599
users