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
Recent activity 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
1
answer
1
UPPCL AE 2018:47
answered
Mar 5, 2019
in
Digital Logic

47
views
uppcl2018
2
answers
2
Array
Tell me the difference : &(arr+1) and &arr+1
commented
Feb 18, 2019
in
Programming

269
views
programminginc
pointers
arrays
1
answer
3
#admission
If a student can get following which should he pursue according to your perception: 1: IIT MADRAS MS 2:IIIT BANGALORE Mtech 3:IIT DHANBAD Mtech 4:IIT Hyderabad RA please mention your perception and in addition if possible add Placement,Research opportunity and Package ?
commented
Feb 18, 2019
in
IISc/IITs

261
views
5
answers
4
GATE201938
Let $G$ be any connected, weighted, undirected graph. $G$ has a unique minimum spanning tree, if no two edges of $G$ have the same weight. $G$ has a unique minimum spanning tree, if, for every cut of $G$, there is a unique minimumweight edge crossing the cut. Which of the following statements is/are TRUE? I only II only Both I and II Neither I nor II
commented
Feb 8, 2019
in
Graph Theory

3.9k
views
gate2019
engineeringmathematics
discretemathematics
graphtheory
graphconnectivity
9
answers
5
GATE201830
Let $G$ be a simple undirected graph. Let $T_D$ be a depth first search tree of $G$. Let $T_B$ be a breadth first search tree of $G$. Consider the following statements. No edge of $G$ is a cross edge with respect to $T_D$. (A cross edge in $G$ is between ... then $\mid ij \mid =1$. Which of the statements above must necessarily be true? I only II only Both I and II Neither I nor II
commented
Feb 1, 2019
in
Graph Theory

6.3k
views
gate2018
graphtheory
graphsearch
normal
3
answers
6
paging
Q. Suppose you have a computer system with a 48bit logical address, page size of 16KB and 4 bytes per page table entry. If we have a 48MB program such that the entire program and all necessary page tables are in memory. Assume that each page table at diff level fits in a single page.How much memory is used by program, including its page tables?
commented
Jan 31, 2019
in
Operating System

2.4k
views
paging
operatingsystem
pagetable
memorymanagement
virtualmemory
1
answer
7
Cache Organization
Can any one help me out with this question : This was asked in MadeEasy CBT held on 23rd jan
commented
Jan 28, 2019
in
CO and Architecture

188
views
cachememory
coandarchitecture
effectivememoryaccess
computerarchitecture
1
answer
8
Applied Course 2019 Mock143
The postorder traversal of a binary search tree is $25, 33, 30, 35, 42, 48, 40, 60, 58, 50$. The inorder traversal of the same tree is $25, 30, 33, 35, 40, 42, 48, 50, 58, 60$. What is the length of the longest path from one leaf to another leaf. (Note: Length of longest path means total number of nodes present in that path).
commented
Jan 24, 2019
in
Others

87
views
appldcourse2019mock1
numericalanswers
1
answer
9
Applied Course 2019 Mock141
All bookstores sell stationary items. All convenience stores sell stationary items. Which of the following conclusions might be TRUE? All bookstores are convenience stores. All convenience stores are bookstores. I II Both I and II Neither I nor II
commented
Jan 24, 2019
in
Mathematical Logic

129
views
appldcourse2019mock1
2
answers
10
Applied Course 2019 Mock130
Consider the following program code, where pow() is the exponentiation function. f (int n) { if (n <= 1) return 1; return f(n1) + g(n) + g(pow(2, n1)); } g (int n) { if (n <= 1) return 1; return 1 + g(n/2); } What is the worstcase time complexity of $f(n)$? $O(2^n)$ $O(n^2)$ $O(2^n \log (n))$ $O( \log ^n (n))$
commented
Jan 24, 2019
in
Others

104
views
appldcourse2019mock1
1
answer
11
Applied Course 2019 Mock14
A number $5k89k2$ can be divided by $18$ if $k$ is $8$ $6$ $1$ More than one value possible
commented
Jan 24, 2019
in
Others

96
views
appldcourse2019mock1
1
answer
12
Applied Course 2019 Mock18
The last sentence has been deleted from the following paragraph. From the given options, choose that one that completes the paragraph in the most appropriate way. For decades, psychologists believed that men experienced depression at only a fraction ... as a characteristic attribute of depression. Men's irritability is usually seen as a telling sign of medical problems.
commented
Jan 24, 2019
in
Others

75
views
appldcourse2019mock1
5
answers
13
GATE2016233
Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\large\tau_1,\tau_2$ and $\large\tau_3$ such that $\large\tau_1 =\dfrac{3 \tau_2}{4}=2\tau_3$. If the longest pipeline stage is split into two pipeline stages of equal latency , the new frequency is __________ $\text{GHz}$, ignoring delays in the pipeline registers.
commented
Jan 24, 2019
in
CO and Architecture

6.8k
views
gate20162
coandarchitecture
pipelining
normal
numericalanswers
1
answer
14
MadeEasy Test Series: Discrete Mathematics  Graph Thoery
The number of labelled subgraphs possible for the graph given below.
commented
Jan 22, 2019
in
Graph Theory

341
views
madeeasytestseries
discretemathematics
graphtheory
1
answer
15
made easy test series question on MST
commented
Jan 17, 2019
in
Algorithms

66
views
0
answers
16
Probability_#52
Consider the following probability mass function of a random variable X $p(X,q)=\{q\,\,if\,X=0 \\\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,1q\,\,\,if\,X=1\\ 0\,\,otherwise$ If q=0.4, the variance of X is.?
commented
Jan 16, 2019
in
Probability

122
views
probability
1
answer
17
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 ??
commented
Jan 16, 2019
in
Computer Networks

270
views
3
answers
18
GATE2014330
Consider the relational schema given below, where eId of the relation dependent is a foreign key referring to empId of the relation employee. Assume that every employee has at least one associated dependent in the dependent relation. employee (empId, empName, empAge) ... age is greater than that of some dependent. all dependents. some of his/her dependents. all of his/her dependents.
commented
Jan 11, 2019
in
Databases

3.3k
views
gate20143
databases
relationalalgebra
normal
0
answers
19
TOC(Undecidability)
L1 = { <M>  M halts on $\epsilon$ } L2 = { <M>  $\epsilon$ $\in$ L(M) } Which one is RE or not RE
comment edited
Jan 9, 2019
in
Theory of Computation

120
views
theoryofcomputation
decidability
1
answer
20
UPPCL AE 2018:21
comment edited
Jan 7, 2019
in
CO and Architecture

108
views
uppcl2018
0
answers
21
GO2019FLT143
Ginmans Stack are a kind of special data structure in which if there are odd number of elements then the middle most element is popped out and printed on the screen. In case of even number of elements the recently popped out element is again pushed back either on the top or bottom of the stack randomly. ... i, ii ii, iii iii, iv ii, iv
comment edited
Jan 4, 2019
in
DS

253
views
go2019flt1
datastructures
stack
2
answers
22
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

253
views
go2019flt1
statistics
variance
probability
1
answer
23
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

177
views
go2019flt1
algorithms
heap
2
answers
24
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

325
views
go2019flt1
fork
operatingsystem
processandthreads
1
answer
25
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

129
views
go2019flt1
sql
databases
2
answers
26
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

188
views
go2019flt1
relationalalgebra
databases
1
answer
27
GO2019FLT153
A class of first year B.tech students is composed of four batches A, B, C and D, each consisting of $30$ students. It is found that the sessional marks of students in Engineering Drawing in batch C have a mean of $6.6$ and standard deviation of $2.3$. The mean and the standard ... Due to this, the marks of a student in batch C are changed from $8.5$ to $6.0$ $7.0$ $8.0$ $9.0$
comment edited
Jan 4, 2019
in
Probability

208
views
go2019flt1
statistics
probability
1
answer
28
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

194
views
go2019flt1
turingrecognizablelanguages
theoryofcomputation
1
answer
29
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

205
views
go2019flt1
lrparser
compilerdesign
1
answer
30
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

409
views
go2019flt1
numericalanswers
primeimplicants
digitallogic
1
answer
31
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

164
views
go2019flt1
numericalanswers
coandarchitecture
1
answer
32
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

259
views
go2019flt1
numericalanswers
pipelining
coandarchitecture
1
answer
33
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

219
views
go2019flt1
sorting
algorithms
1
answer
34
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

108
views
go2019flt1
operatingsystem
resourceallocation
1
answer
35
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

225
views
go2019flt1
numericalanswers
pagefault
operatingsystem
2
answers
36
GO2019FLT134
Let $G$ be a graph of order $n$ in which every vertex has degree equal to $d$. How large must $d$ be in order to guarantee that $G$ is connected? $\frac{n}{2}$ $\lceil (n1)/2 \rceil$ $\lfloor (n+1)/2 \rfloor$ $(n1)/2$
comment moved
Jan 3, 2019
in
Graph Theory

380
views
go2019flt1
graphtheory
graphconnectivity
1
answer
37
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

264
views
go2019flt1
networksecurity
computernetworks
1
answer
38
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

254
views
go2019flt1
adder
digitalcircuits
digitallogic
1
answer
39
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

205
views
go2019flt1
probability
numericalability
5
answers
40
TIFR2013A9
There are $n$ kingdoms and $2n$ champions. Each kingdom gets $2$ champions. The number of ways in which this can be done is: $\frac{\left ( 2n \right )!}{2^{n}}$ $\frac{\left ( 2n \right )!}{n!}$ $\frac{\left ( 2n \right )!}{2^{n} . n!}$ $\frac{n!}{2}$ None of the above.
comment edited
Dec 7, 2018
in
Combinatory

957
views
tifr2013
permutationandcombination
discretemathematics
normal
ballsinbins
50,737
questions
57,324
answers
198,408
comments
105,173
users