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 chauhansunil20th
User chauhansunil20th
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User chauhansunil20th
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
UPPCL AE 2018:47
answered
Mar 5, 2019
in
Digital Logic

47
views
uppcl2018
+1
vote
2
Cache Organization
Can any one help me out with this question : This was asked in MadeEasy CBT held on 23rd jan
answered
Jan 28, 2019
in
CO and Architecture

185
views
cachememory
coandarchitecture
effectivememoryaccess
computerarchitecture
0
votes
3
A system uses SelectiveRepeat protocol.(Applied gate mock  3)
A system uses SelectiveRepeat protocol with a window size of 4.If each packet carries 5000 bits of data, then the time taken to transfer 5 million bits of data, if the distance between sender and receiver is 2500 Km, the propagation speed ... .25s I think answer should be around 7.5 to 7.8.. Can any one explain what the answer is ??
answered
Jan 16, 2019
in
Computer Networks

269
views
+6
votes
4
GO2019FLT144
For two data sets, each of size $5$, the variances are given to be $4$ and $5$ and the corresponding means are given to be $2$ and $4$ respectively. The variance of the combined data is? $11/2$ $6$ $13/2$ $5/2$
answered
Jan 4, 2019
in
Probability

244
views
go2019flt1
statistics
variance
probability
0
votes
5
GO2019FLT145
Consider the following modified Heapify and Build_heap procedure. void Heapify(int* A, int i, int n) { int left=2*i+1; int right=2*i+2; int mid=i; if (left<=n && right <=n) { if ((A[left] > A[right] && A[left]< A[i])  A[left]<A[right] && A[left] >A[i]) mid= ... $6 \: 8 \: 1 \: 9 \: 4$ $9 \: 6 \: 1 \: 8 \: 4$ $6 \: 9 \: 1 \: 8 \: 4$
answered
Jan 4, 2019
in
Algorithms

172
views
go2019flt1
algorithms
heap
0
votes
6
GO2019FLT112
Consider a parent process $P$ that has forked a child process $C$. $C$ has again forked another child process $D$. Now $P$ terminates while $C$ and $D$ are still running. In this case, which of the following statements is true? $P$ ... becomes a zombie process, until adopted by the parent process of $P$ $P$ immediately becomes an orphan process, until adopted by its parent
answered
Jan 4, 2019
in
Operating System

319
views
go2019flt1
fork
operatingsystem
processandthreads
+1
vote
7
GO2019FLT127
A single query in DBMS can be executed through different algorithms or rewritten in different forms and structures. The most optimal pathway of getting the correct output among all these algorithms can be obtained by the process of query optimization. ... Employee where columnB >3000 and columnC<3000; select columnA from Employee; The given query is already in optimized form.
answered
Jan 4, 2019
in
Databases

123
views
go2019flt1
sql
databases
+3
votes
8
GO2019FLT149
Consider the following two relational schemas: MovieExec(name, address, cert, netWorth) Studio(name, address, presC) Suppose we wish to require that one must have a net worth of at least $1000000$ Rupees to be president of a movie studio. The join operation if required can be performed ... P, Q and S P, Q and R Q and R P and S
answered
Jan 4, 2019
in
Databases

181
views
go2019flt1
relationalalgebra
databases
+1
vote
9
GO2019FLT156
Consider the following language $L$: $L=\{<M,x,k> \mid M \text{ is a Turing Machine and M does not halt on x within k steps} \}$ The language family to which $L$ belongs is not closed under? Intersection Homomorphism Set Difference Complementation
answered
Jan 4, 2019
in
Theory of Computation

189
views
go2019flt1
turingrecognizablelanguages
theoryofcomputation
+5
votes
10
GO2019FLT157
Which of the following statements on Viable Prefixes is incorrect? A viable prefix does not extend past the right end of the handle For any contextfree grammar, the set of viable prefixes is a regular language A viable prefix by default is a suffix of the handle As long as a parser has viable prefixes on the stack no parsing error has been detected
answered
Jan 4, 2019
in
Compiler Design

199
views
go2019flt1
lrparser
compilerdesign
+7
votes
11
GO2019FLT158
Let $f(A, B, C, D)=\Pi (2, 3, 5, 9, 11, 12, 13)$ The total number of prime implicants and essential prime implicants are denoted by $P$ and $Q$ respectively. What is the value $Q \% P$ where $'\%'$ denotes the modulo operator?
answered
Jan 4, 2019
in
Digital Logic

401
views
go2019flt1
numericalanswers
primeimplicants
digitallogic
+1
vote
12
GO2019FLT160
A program runs in $20s$ in machine A with a clock speed of $200MHz$. A computer architecture wants to build a machine B which will run this program in $6$ seconds. The architect has delivered that a substantial increase in clock rate is possible, but this will ... as many as clock cycles as machine A for this program. What clock rate should be targeted for a best design? (In $MHz$)
answered
Jan 4, 2019
in
CO and Architecture

159
views
go2019flt1
numericalanswers
coandarchitecture
+3
votes
13
GO2019FLT161
A $5$ stage pipeliine is used to overlap all the instructions except the branch instructions. The target of the branch can't be fetched till the current instruction is completed. What is the Throughput (in MIPS) of the system if $20\%$ of the instrucitons are branch ... delay. The pipeline clock rate is $0.1 \: GHz$. Branch penalty is $4$ cycles. (Upto $2$ decimal place).
answered
Jan 4, 2019
in
CO and Architecture

251
views
go2019flt1
numericalanswers
pipelining
coandarchitecture
+2
votes
14
GO2019FLT162
Which of the following sorting algorithms performs efficiently to sort a singly linked list containing $\log n$ nodes and the corresponding time complexity is? $\text{Insertion sort, } O(\log ^2 n)$ $\text{Merge sort, } \Theta (( \log n) \log (\log n ))$ $\text{Heap sort, } \Theta ( \log ^2)(\log n ))$ $\text{Quick sort, } O ( \log 2)(\log n ))$
answered
Jan 4, 2019
in
Algorithms

215
views
go2019flt1
sorting
algorithms
+1
vote
15
GO2019FLT163
A system is having user processes $P_1, P_2, \dots , P_N$ each requiring $Q_N, Q_{N1}, \dots , Q_1$ number of resource instances of resource $R$. The minimum number of resource instances of $R$ to guarantee that deadlock will not occur is $NQ_N  N+1$ $NQ_1 + N1$ $(Q_1 + Q_2 + … + Q_N) + N – 1$ $(Q_1 + Q_2 + … + Q_N) + 1 – N$
answered
Jan 4, 2019
in
Operating System

101
views
go2019flt1
operatingsystem
resourceallocation
+6
votes
16
GO2019FLT164
Consider the $2$ dimensional array $A$: int A[][]=new int[100][100]; where $A[0][0]$ is at location $800$ in a paged memory system with pages of size $800 bytes$. Each int type needs 4 bytes and A is stored in rowmajor order. A small process that manipulates the matrix resides ... and other $2$ are initially empty? for (int i=0;i<100;i++) for (int j=0;j<100; j++) A[j][i]=1;
answered
Jan 4, 2019
in
Operating System

218
views
go2019flt1
numericalanswers
pagefault
operatingsystem
+1
vote
17
GO2019FLT122
Which of the following is TRUE with respect to DiffieHellman Key exchange algorithm? It can be used for encryption or decryption purpose It doesn't suffer from man in the middle attack It suffers from bucket brigade attack It is an example of private key cryptography algorithm
answered
Jan 3, 2019
in
Computer Networks

255
views
go2019flt1
networksecurity
computernetworks
+5
votes
18
GO2019FLT114
Let $S(x,y,z)$ and $C(x,y,z)$ represents the Sum & Carry function of a full adder circuit. Which of the following options best represents $S(x,y,z)$ and $C(x,y,z)$ respectively? $x \oplus y \oplus z, y( x \oplus z)+xy$ $x \oplus y \oplus z, y(x+y+z)$ $x \odot y \odot z, z(x+y)+xy$ $\text{None of these}$
answered
Jan 3, 2019
in
Digital Logic

249
views
go2019flt1
adder
digitalcircuits
digitallogic
+4
votes
19
GO2019FLT15
A book contains $100$ pages. A page is chosen at random. What is the chance that the sum of the digits on the page is equal to $8$? $0.08$ $0.09$ $0.90$ $0.10$
answered
Jan 3, 2019
in
Numerical Ability

203
views
go2019flt1
probability
numericalability
50,741
questions
57,231
answers
197,991
comments
104,578
users