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
Top Searched Tags
boolean-algebra
graph-matching
gateoverflow
interview
activation-records
software-engineering
interrupts
c
dfa
transactions gate2003
gate2016-1
cs books
co-and-architecture gate2004
gate2014-3 hashing
hazards
gate2019
gate 2019
computer-networks isro2014
gate2004
indexing
view_serializable
iit-madras
tuple-relational-calculus
isro2015
gate2018 algorithms
pure_aloha
set-theory
dangling-else-problem
digital-logic gate1997
graph-theory
closest-word
+2
votes
7
answers
1
GATE2019-50
What is the minimum number of $2$-input NOR gates required to implement a $4$ -variable function expressed in sum-of-minterms form as $f=\Sigma(0,2,5,7, 8, 10, 13, 15)?$ Assume that all the inputs and their complements are available. Answer: _______
commented
11 minutes
ago
in
Digital Logic
by
Vipin Rai
Junior
(
525
points)
|
3k
views
gate2019
numerical-answers
digital-logic
canonical-normal-form
0
votes
3
answers
2
DS and programming
#include <stdio.h> int arr[] = { 10, 20, 30, 40, 50 }; static int count ; inc() { return ++count; } int main() { arr[count++]=inc(); printf("%d ", arr[count]); printf("%d ", arr[0]); } i am thinking it will print 30 2
commented
37 minutes
ago
in
Programming
by
Shaik Masthan
Veteran
(
55.8k
points)
|
131
views
data-structure
programming-in-c
output
+4
votes
1
answer
3
UGCNET-Dec2014-II-39
For the implementation of a paging scheme, suppose the average process size be $x$ bytes, the page size be $y$ bytes, and each page entry requires $z$ bytes. The optimum page size that minimizes the total overhead due to the page table and the internal fragmentation loss is given by $\frac{x}{2}$ $\frac{xz}{2}$ $\sqrt{2xz}$ $\frac{\sqrt{xz}}{2}$
commented
1 hour
ago
in
Operating System
by
rajatmyname
Active
(
1.3k
points)
|
1.4k
views
ugcnetdec2014ii
operating-system
paging
+4
votes
1
answer
4
ISRO2007-28
The level of aggregation of information required for operational control is Detailed Aggregate Qualitative None of the above
commented
2 hours
ago
in
IS&Software Engineering
by
vinay chauhan
Junior
(
765
points)
|
1.8k
views
isro2007
non-gate
0
votes
0
answers
5
Computer Network
20 Gbps link each user using 5Gbps when active<20% time the user is active> Max. users that the network can be used by? Using circuit switching?
asked
2 hours
ago
in
Computer Networks
by
manisha11
Active
(
1.9k
points)
|
9
views
computer-networks
0
votes
0
answers
6
#programming
https://www.sanfoundry.com/c-program-checks-strings-anagrams/ what is the meaning of line number 32?
commented
3 hours
ago
in
Programming
by
himgta
Active
(
3.6k
points)
|
26
views
0
votes
1
answer
7
ISI 2017 PCB C3 (A)
Let R(A, B, C) be a relation with primary key (A) and S(A, D, E) a relation with primary key (A, D). Each of the relations has n tuples. If the number of tuples in R natural join S is m, then determine the number of tuples in R natural left outer join S.
commented
9 hours
ago
in
Databases
by
Priyadrasta Raut
(
313
points)
|
84
views
userisi2017
usermod
databases
0
votes
0
answers
8
Karumanchi
There is a singly linked list. We have a pointer to a particular node(it is not tail node). what is the time and space complexity required to delete this node? my approach is... As there is no previous pointer so we traverse the list from the starting to just ... complexity as O(n) and space complexity O(1). but in the book the time complexity is mentioned O(1) where am I going wrong?
commented
9 hours
ago
in
DS
by
Meet2698
(
121
points)
|
66
views
time-complexity
linked-lists
data-structure
+1
vote
2
answers
9
gate 2019 answer key
Gate answer key says the answer of 2 Input NOR Gate as 4.
answered
11 hours
ago
in
GATE
by
mradul
(
59
points)
|
486
views
gate-2019
+2
votes
6
answers
10
GATE2019-46
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at random. The expected value of the distance between $a$ and $b$ in $T$ (ie., the number of edges in the unique path between $a$ and $b$) is (rounded off to $2$ decimal places) _________.
answer edited
12 hours
ago
in
DS
by
pratekag
(
457
points)
|
3.7k
views
gate2019
numerical-answers
data-structure
binary-tree
0
votes
1
answer
11
Predictive
Construct the predictive parsing table for the grammar and tell whether the grammar is LL(1) or not S --> (L) / a L --> L, S / S
answered
13 hours
ago
in
Compiler Design
by
Priyadrasta Raut
(
313
points)
|
21
views
0
votes
1
answer
12
Data Hazards
Find the data hazards(RAW,WAW,WAR) in the given instructions
commented
13 hours
ago
in
CO & Architecture
by
Priyadrasta Raut
(
313
points)
|
70
views
data-hazards
co-and-architecture
hazards
data-dependences
0
votes
0
answers
13
Data Communications AND Networking by BEHROUZ A. FOROUZAN (5th Edition)
The LLC provides a single link-layer control protocol for all IEEE LANs. This means LLC protocol can provide interconnectivity between different LANs because it makes the MAC sublayer transparent. Does this mean that all the LANs use ... . But don't we see that the frame format of alll are different. So, how is it possbile?
asked
14 hours
ago
in
Computer Networks
by
superak96
(
165
points)
|
20
views
computer-networks
llc
ethernet
0
votes
2
answers
14
UGCNET-june2009-ii-08
To employ multi-access in GSM, users are given different: (A) time slots (B) bandpass filters (C) handsets (D) frequency bands
commented
14 hours
ago
in
Computer Networks
by
rajatmyname
Active
(
1.3k
points)
|
210
views
ugcnetjune2009ii
0
votes
0
answers
15
Peter Linz
Construct a DFA on {0, 1} where every 00 is followed immediately by 1
commented
14 hours
ago
in
Theory of Computation
by
arya_stark
Active
(
1.6k
points)
|
35
views
theory-of-computation
peter-linz
finite-automata
regular-languages
0
votes
1
answer
16
Pumping Lemma for CFG
Consider the language, L = {1k 0i 1i 0j 1j 0k | i,j,k>0}. Is this language context free? I tried to find this using pumping lemma, By intution, If we consider , by the definition of pumping lemma for CFG, u and y to be 1k and 0k ... in 0j and if the pump up the variables, surely string generated after pumping up wont be in the given language right? Am I missing something?
answered
14 hours
ago
in
Theory of Computation
by
Priyadrasta Raut
(
313
points)
|
160
views
theory-of-computation
lemma
pumping
pumping-lemma
+3
votes
4
answers
17
GATE2019-22
Two numbers are chosen independently and uniformly at random from the set {1,2,….,13}. The probability (rounded off to 3 decimal places) that their 4-bit (unsigned) binary representations have the same most significant bit is _______________.
commented
14 hours
ago
in
Digital Logic
by
Ahabnnc
Junior
(
779
points)
|
3.5k
views
gate2019
numerical-answers
digital-logic
number-representation
probability
+37
votes
6
answers
18
GATE2015-1-33
Consider the following pseudo code, where $x$ and $y$ are positive integers. begin q := 0 r := x while r ≥ y do begin r := r - y q := q + 1 end end The post condition that needs to be satisfied after the program terminates is $\{ r = qx + y \wedge r < y\}$ $\{ x = qy + r \wedge r < y\}$ $\{ y = qx + r \wedge 0 < r < y\}$ $\{ q + 1 < r - y \wedge y > 0\}$
answered
15 hours
ago
in
Programming
by
ShamikBanerjee
(
379
points)
|
2.9k
views
gate2015-1
programming
loop-invariants
normal
0
votes
2
answers
19
Gate 2019
Are the gate keys out yet. If not, any info on when will they be out?
answered
15 hours
ago
in
GATE
by
mkagenius
(
277
points)
|
213
views
gate-2019
0
votes
1
answer
20
Linear Algebra-METest
If the determinant of the below matrix is 245, what is the value of X? $\begin{bmatrix} 0 & 4& 2 &1 \\ 3& -1 & 0 & 2\\ 5&2 & x& 4\\ 6& 1 & -1 & 0 \end{bmatrix}$ ... , because by keeping 6 in place of x I am getting determinant as 245(Result verified by computer program). Please let me know where I am going wrong?
answered
15 hours
ago
in
Linear Algebra
by
Meet2698
(
121
points)
|
104
views
linear-algebra
engineering-mathematics
+16
votes
4
answers
21
GATE2000-5
A multiset is an unordered collection of elements where elements may repeat any number of times. The size of a multiset is the number of elements in it, counting repetitions. What is the number of multisets of size $4$ that can be constructed from n distinct elements so that at least one element occurs exactly twice? How many multisets can be constructed from n distinct elements?
answered
16 hours
ago
in
Combinatory
by
Priyadrasta Raut
(
313
points)
|
1.1k
views
gate2000
permutations-and-combinations
normal
descriptive
+1
vote
2
answers
22
Barc exam cse cut off 2017
Anyone have any idea about barc online exam cut off 2017
answered
16 hours
ago
in
BARC
by
Vineet Kumar 1
(
225
points)
|
430
views
cutoffs
0
votes
0
answers
23
Set theory
consider A={1,2,3,...........n} how many number of multisets are possible for A: 1:n^2 2:2^n 3:n^n 4;none
commented
16 hours
ago
in
Set Theory & Algebra
by
Priyadrasta Raut
(
313
points)
|
46
views
0
votes
1
answer
24
Time Complexity
I am unable to Find its time complexity using Iterative method… Will any one help me out with this . Thank you :)
answered
17 hours
ago
in
Algorithms
by
Priyadrasta Raut
(
313
points)
|
74
views
time-complexity
algorithms
asymptotic-notations
0
votes
1
answer
25
made easy cbt
Consider a machine with byte addressable main memory of 30 bits, block size of 16 bytes and 4-way set associative cache of size 256 byte. For choosing the block to be replaced, use last recently used scheme. The number of cache misses for the following sequence of block addresses is 12, 28, 18, 15, 19, 31, 39, 15, 7, 15 is ________. what is last recently used?
answered
18 hours
ago
in
Operating System
by
Piyush mishra
(
383
points)
|
25
views
0
votes
2
answers
26
UGCNET-Nov2017-III-17
Find the normalization transformation that maps a window whose lower left corner is at (1, 1) and upper right corner is at (3, 5) onto a viewport that is the entire normalized device screen.
answered
19 hours
ago
in
Others
by
MonikaV
(
23
points)
|
466
views
+1
vote
2
answers
27
UGCNET-Nov2017-iii-17
answered
19 hours
ago
in
Others
by
MonikaV
(
23
points)
|
372
views
ugcnetnov2017-iii
0
votes
0
answers
28
Central limit theorem
(Central Limit Theorem) Let X1, X2, . . . , X81 be i.i.d., each with expected value µ = E(Xi) = 5, and variance σ2 = Var(Xi) = 4. Approximate P(X1 + X2 +· · · X81 > 369), using the central limit theorem.
asked
20 hours
ago
in
Probability
by
Na462
Loyal
(
8.6k
points)
|
12
views
probability
0
votes
1
answer
29
NIELIT 2018-28
For the function $(z) = \frac{1}{z^2(e^z-1)}, z=0$ is a pole of order: $1$ $2$ $3$ None of these
answered
20 hours
ago
in
Others
by
Asim Siddiqui 4
Junior
(
697
points)
|
41
views
nielit-2018
+1
vote
1
answer
30
UGCNET-Nov2017-III-16
Find the equation of the circle x2+y2=1 in terms of x'y' coordinates, assuming that the xy coordinate system results from a scaling of 3 units in the x' direction and 4 units in the y' direction. (1) 3(x')2+4(y')2 = 1 (2)$\left ( \frac{x'}{3} \right )$2 + $\left ( \frac{y'}{4} \right )$2 = 1 (3) (3x')2 + (4y')2=1 (4) $\frac{1}{3}$(x')2 + $\frac{1}{4}$(y')2 = 1
answered
20 hours
ago
in
Others
by
MonikaV
(
23
points)
|
276
views
0
votes
1
answer
31
Kenneth rosen Q.36 Ex.2.3
Let f be a function from the set A to the set B.Let S and T be subsets of A.Show that $f(S\cup T)=f(S)\cup f(T)$ $f(S\cap T)\subseteq f(S)\cap f(T)$ Show that inclusion in part b can be proper
commented
20 hours
ago
in
Set Theory & Algebra
by
prashant jha 1
Active
(
4.1k
points)
|
29
views
kenneth-rosen
set-theory&algebra
0
votes
0
answers
32
NPTEL CODING ASSIGNMENT
Consider a matrix M of integers. Divide M into 4 sub-matrices. These sub-matrices are called as Quadrants. Report the Quadrant number which has the smallest minimum-element. If two or more quadrants have same smallest minimum, report the smallest ... than 1 and less than 12 OUTPUT FORMAT: Print in a separate line, the quadrant number with the smallest minimum-element.
commented
21 hours
ago
in
Programming
by
himgta
Active
(
3.6k
points)
|
23
views
0
votes
0
answers
33
Grewal
Suppose avg waiting time of a process to get chance in a queue is 5 min. What will the probability that process get chance at first minute is ________________
asked
21 hours
ago
in
Probability
by
srestha
Veteran
(
108k
points)
|
15
views
probability
+1
vote
2
answers
34
Programming and DS (C O/P)
For n=2 the P is coming as 3,but none of the option is satisfying?
answered
21 hours
ago
in
Programming
by
Priyadrasta Raut
(
313
points)
|
114
views
programming-in-c
output
+1
vote
4
answers
35
Searching
Q) Consider a sorted array of n numbers. What would be the time complexity of the best known algorithm to find a pair a and b such that |a-b| = k , k being a positive integer. a) O(logn) b) O(n) c)O(nlogn) d)O(n^2) Which of the option is Correct And Why?
answered
21 hours
ago
in
Algorithms
by
Chivesh Upneja
(
11
points)
|
395
views
algorithms
sorting
time-complexity
binary-search
0
votes
2
answers
36
What is the type of loading?
Routine is not loaded until it is called.All routine are kept on disk in a relocatable load format.The main program is loaded into memory and is executed.This type of loading is called as _________ A)Static Loading B)Dynamic Loading C)Dynamic Linking D)Overlays Kindly give explanation /attach references if any.
answered
21 hours
ago
in
Operating System
by
layan Eysa
(
11
points)
|
467
views
0
votes
1
answer
37
MCA ARRAY ADDRESS CALCULATION
Find the address of the position [10, 11, 12] of array A in column major order? Given Dimension is A[1:10, -5:15, -10:15], w is two word count, and Base address is 200.
answered
21 hours
ago
in
DS
by
omprakash889
(
23
points)
|
13
views
0
votes
1
answer
38
Conditional Probability
A multiple choice exam has 4 choices for each question. A student has studied enough so that the probability they will know the answer to a question is 0.5, the probability that they will be able to eliminate one choice is 0.25, otherwise ... the test to measure what the student knows. If the student answers a question correctly what's the probability they knew the answer?
commented
22 hours
ago
in
Probability
by
prashant jha 1
Active
(
4.1k
points)
|
78
views
conditional-probability
probability
0
votes
0
answers
39
Probability mass function
Suppose that the cdf of X is given by: F(a) ={ 0 for a < 0 1/5 for 0 ≤ a < 2 2/5 for 2 ≤ a < 4 1 for a ≥ 4. } Determine the pmf of X.
asked
22 hours
ago
in
Probability
by
Na462
Loyal
(
8.6k
points)
|
14
views
engineering-mathematics
random-variable
+1
vote
0
answers
40
Probability density function
Let R be the rate at which customers are served in a queue. Suppose that R is exponential with pdf f(r) = 2e^(−2r) on [0, ∞). Find the pdf of the waiting time per customer T = 1/R.
asked
23 hours
ago
in
Probability
by
Na462
Loyal
(
8.6k
points)
|
7
views
engineering-mathematics
probability
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Official keys are out now.
JEST 2019 MEMORY BASED QUESTION PAPER
Relax... But....
Barc : Arjun Sir
JEST Sample Question
All categories
General Aptitude
1.5k
Engineering Mathematics
7.1k
Digital Logic
2.7k
Programming & DS
4.9k
Algorithms
4.2k
Theory of Computation
5.3k
Compiler Design
2.1k
Operating System
4k
Databases
4k
CO & Architecture
3.5k
Computer Networks
4k
Non GATE
1.4k
Others
1.5k
Admissions
556
Exam Queries
553
Tier 1 Placement Questions
23
Job Queries
69
Projects
18
Follow @csegate
Recent activity
Recent Blog Comments
Yeah the Answer for the question no.50 is given...
Only one question that is "no.of NOR gates"...
Hey, I'm new here, but can you explain to me why...
How to challenge the key???
47,904
questions
52,285
answers
182,218
comments
67,720
users