GATE CSE
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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.
Recent activity by mcjoshi
User mcjoshi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User mcjoshi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
Time complexity
f(n)=Ω(n),g(n)=O(n) than what is f(n).g(n)
answer selected
Oct 9
in
Algorithms

47
views
algorithms
timecomplexity
asymptoticnotations
1
answer
2
calculating mod
178 mod 47 =4 how do we calculate such huge values
commented
Oct 8
in
Computer Networks

39
views
1
answer
3
Boolean algrbra
If x=1 in the logic equation [X+Z{Y'+(Z'+XY)}]{X'+Z'(X+Y)}=1 THEN a) Y=Z b) Y=Z' c) Z=0 d) Z=1
answer selected
Sep 29
in
Digital Logic

24
views
2
answers
4
TOC Question
Sorry my BAD, it's an infinite language! The given set {1, 101, 11011,1110111,......} is a Regular Language or CFL?
answer selected
Aug 10
in
Theory of Computation

105
views
theoryofcomputation
finiteautomata
0
answers
5
algorithm
for (int i = 1; i <=m; i += c) { do something } for (int i = 1; i <=n; i += c) { do something  } What will the the tiem complexity of given code pseudococde? A. O (max(m,n)) B. O(min(m,n)) C. O( m+n) D. O(mn) WHICH IS correct A or C
closed
Jun 16
in
Algorithms

48
views
1
answer
6
Programming
#define value 50 main() { printf("%d",value); #define value 500 printf("%d",value*10); } what is the output
commented
Jun 16
in
Programming

84
views
1
answer
7
const pointer
The output of below code is_______________. int main() { int i = 120; int *a = &i; foo(&a); printf("%d ", *a); printf("%d ", *a); } void foo(int **const a) { int j = 210; *a = &j; printf("%d ", **a);
commented
Jun 16
in
Programming

115
views
0
answers
8
Programming
main() { int x=1,y=0,z=5; int a=x && y&&z++; printf("%d",z); } what's the output and how is it evaluated
closed
Jun 15
in
Programming

25
views
0
answers
9
pointers
not able to solve complex pointers question what to do , my friend said to join gate overflow , hope i get some good suggestions :(
commented
Jun 15
in
Algorithms

37
views
2
answers
10
for(i=n/2;i<=n;++i)
i read time taken loop will run is o(n/2) but if n=8 loop becomes for(i=4;i<=8;++i) it print 4,5,6,7,8 , so it runs 5 times then how n/2 can be running time please help :
commented
Jun 15
in
Algorithms

89
views
timecomplexity
3
answers
11
[Discrete Maths] Graph Theory Rosen,Chromatic number
answer selected
Jun 13
in
Mathematical Logic

119
views
graphtheory
discretemathematics
graphconnectivity
graphmatching
2
answers
12
DLC :
Five soldiers A, B, C, D and E volunteer to perform an important military task if their following conditions are satisfied (i) either A or B or both must go (ii) either C or E but both must not go (iii) either both A and C go or neither goes (iv) ... combination of soldiers who can get the arrangement will be a). $ADE$ b). $BD(C + E)$ c). $AC$ d). $ABCD'E'$
answer selected
Jun 9
in
Digital Logic

246
views
digitallogic
minimalcover
booleanalgebra
3
answers
13
Find the number of integral solutions using generating function
commented
Apr 16
in
Combinatory

1.4k
views
permutationsandcombinations
combinational
generatingfunctions
2
answers
14
Cache
Consider a system with 2 level cache. The access times of L1Cache, L2Cache and Main Memory are 1ns, 10ns and 500ns. The hit rate of L1 and L2 caches are 0.8 and 0.9 respectively. What is the average access time ?
commented
Apr 5
in
CO & Architecture

1k
views
3
answers
15
GATE2007IT61
In the waveform (a) given below, a bit stream is encoded by Manchester encoding scheme. The same bit stream is encoded in a different coding scheme in wave form (b). The ... Manchester respectively 0111101000 and Differential Manchester respectively 1000010111 and Integral Manchester respectively 0111101000 and Integral Manchester respectively
commented
Mar 28
in
Computer Networks

1.8k
views
gate2007it
computernetworks
communication
manchesterencoding
normal
1
answer
16
Program (ritchie)
Write a program to determine the ranges of char, short, int, and long variables, both signed and unsigned, by printing appropriate values from standard headers and by direct computation. Harder if you compute them: determine the ranges of the various floatingpoint types.
commented
Mar 15
in
Programming

85
views
programminginc
2
answers
17
TECHTUD, C PROGRAMMING
answer selected
Mar 9
in
Programming

182
views
programminginc
output
2
answers
18
ISRO20158
Minimum number of $2 \times 1$ multiplexers required to realize the following function, $f = \bar{A} \bar{B} C + \bar{A} \bar{B} \bar{C}$ Assume that inputs are available only in true form and Boolean a constant 1 and 0 are available. 1 2 3 7
commented
Mar 9
in
Digital Logic

1.6k
views
isro2015
digitallogic
multiplexer
1
answer
19
ISRO 2013  matrices [Mech]
If A=$\begin{bmatrix} 8 & 5 & \\ 7& 6 & \end{bmatrix}$ then A 121  A 120  is: a) 0 b) 1 c) 120 d) 121
commented
Mar 7
in
Linear Algebra

291
views
engineeringmathematics
isro
isromech
1
answer
20
propositional logic
Determine the truth value of each of these statements if the domain consists of all integers. a) ∀n(n + 1 > n) b) ∃n(2n = 3n) c) ∃n(n = −n) d) ∀n(3n ≤ 4n)
answer selected
Mar 7
in
Mathematical Logic

85
views
propositionallogic
discretemathematics
mathematicallogic
firstorderlogic
engineeringmathematics
3
answers
21
Sorting
A machine took 200 sec to sort 200 names,using bubble sort.In 800 sec,it can approximately sort ? a. 400 names b. 800 names c. 750 names d. 850 names
answer selected
Mar 2
in
Algorithms

631
views
2
answers
22
ISRO 2011ECE Stack
In what order the elements of a pushdown stack are accessed? a. First InFirst Out (FIFO) b. Last In Last Out (LILO) c. Last In First Out (LIFO) d. None of the above
commented
Mar 2
in
DS

126
views
isro
isroece
operatingsystem
isro2011ece
1
answer
23
Testbook live Testseries
Which of the following statements are false ? $1.$ A depthfirst search of a directed graph always produces the same number of tree edges (i.e., independent of the order in which the vertices are provided and independent of ... two vertices will not change. $4.$ Dijkstra's algorithm may not terminate if the graph contains negative weight edges.
edited
Feb 28
in
Algorithms

301
views
algorithms
testseries
2
answers
24
Manipulation of sum
Prove the identity: $$\begin{align*} &\sum_{i=0}^{n}\sum_{j=0}^{i} a_ia_j = \frac{1}{2}\left ( \left ( \sum_{i=0}^{n}a_i \right )^2 + \left ( \sum_{i=0}^{n}a_i^2 \right )\right ) \end{align*}$$
commented
Feb 28
in
Combinatory

139
views
discretemathematics
summation
3
answers
25
GATE2017224
Consider the quadratic equation $x^213x+36=0$ with coefficients in a base $b$. The solutions of this equation in the same base $b$ are $x=5$ and $x=6$. Then $b$= _____
answered
Feb 28
in
Set Theory & Algebra

1.3k
views
gate20172
polynomials
numericalanswers
1
answer
26
AlGO: Madeeasy:TS Greedy Method How to approach
comment edited
Feb 28
in
Algorithms

343
views
algorithms
greedyalgorithm
madeeasytestseries
3
answers
27
GATE2017245
The read access times and the hit ratios for different caches in a memory hierarchy are as given below: Cache Read access time (in nanoseconds) Hit ratio Icache 2 0.8 Dcache 2 0.9 L2cache 8 0.9 The read access time ... fetch and 40% are for memory operand fetch. The average read access time in nanoseconds (up to 2 decimal places) is _________
commented
Feb 26
in
CO & Architecture

2.2k
views
gate20172
co&architecture
cachememory
numericalanswers
1
answer
28
#probability_doubt_in_basic_concept
commented
Feb 25
in
Numerical Ability

114
views
probability
engineeringmathematics
discretemathematics
numericalability
1
answer
29
TesT series question
what is the remainder when 4^250 is divided by 14 2^500 /14 = 2^499 / 7 Applying fermats theorem 2^6 mod 7 =1 (2^498 * 2 ) / 7 = remainder should be 2 is it correct???
commented
Feb 24
in
Numerical Ability

168
views
computernetworks
easy
1
answer
30
Madeeasy test series
An EXOR gate with six variables is as follows Y=A⊕B⊕C⊕D⊕E⊕F The number of min terms in the Boolean expression is_____
answer edited
Feb 23
in
Digital Logic

75
views
digitallogic
2
answers
31
GATE2017221
Consider the set $X=\{a, b, c, d, e\}$ under partial ordering $R=\{(a,a), (a, b), (a, c), (a, d), (a, e), (b, b), (b, c), (b, e), (c, c), (c, e), (d, d), (d, e), (e, e) \}$. The Hasse diagram ... Hasse diagram of the partial order $(X, R)$ is shown below. The minimum number of ordered pairs that need to be added to $R$ to make $(X, R)$ a lattice is ______
answer edited
Feb 23
in
Set Theory & Algebra

1.2k
views
gate20172
discretemathematics
lattice
numericalanswers
3
answers
32
GATE2017250
A message is made up entirely of characters from the set $X=\{P, Q, R, S, T\}$. The table of probabilities for each of the characters is shown below: Character Probability P 0.22 Q 0.34 R 0.17 S 0.19 T 0.08 Total 1.00 If a message of 100 characters over $X$ is encoded using Huffman coding, then the expected length of the encoded message in bits is ______.
answer selected
Feb 23
in
Computer Networks

1.3k
views
gate20172
huffmancode
numericalanswers
5
answers
33
GATE2017125
Consider a twolevel cache hierarchy with $L1$ and $L2$ caches. An application incurs $1.4$ memory accesses per instruction on average. For this application, the miss rate of $L1$ cache is $0.1$; the $L2$ cache experiences, on average, $7$ misses per $1000$ instructions. The miss rate of $L2$ expressed correct to two decimal places is ________.
answer selected
Feb 22
in
CO & Architecture

1.8k
views
gate20171
co&architecture
cachememory
2
answers
34
Evaluate the following definite integral ?
answer selected
Feb 20
in
Calculus

228
views
integration
calculus
engineeringmathematics
integrals
3
answers
35
OS (test series )
Consider a disk with 80 GB. The size of disk block is 8 kB. Number of blocks needed to keep track of free space if the disk is initially empty by using bit map method is _____
commented
Feb 20
in
Operating System

275
views
testseries
operatingsystem
filesystem
2
answers
36
MadeEasy (OS)
Which of the following statements are true? S1 : Using a larger block size in fixed block size file system leads to better disk throughput but poor disk space utilization. S2 : In index allocation of block to a file, the maximum possible size of file depends on ... size of the address of blocks. a).Only S1 b).Only S2 c).Both S1 and S2 d).Neither S1 nor S2
answer selected
Feb 20
in
Operating System

134
views
operatingsystem
madeeasytestseries
filesystem
memor
1
answer
37
ACE booklet II, Page no66,Q.15
answer selected
Feb 20
in
CO & Architecture

203
views
cachememory
hitlatency
co&architecture
2
answers
38
ACE test series(OS):
Consider a $64$bit processor. A process has a $64$ bit logical address space with twolevel paging. The outer table is indexed using 32bits and the inner table using $16$bits. What is the size of outer page table size ? a). $4GB$ b). $8GB$ c). $32MB$ d). $32GB$
answer selected
Feb 20
in
Operating System

641
views
testseries
operatingsystem
memorymanagement
2
answers
39
GATE19901viii
The condition for overflow in the addition of two 2's complement numbers in terms of the carry generated by the two most significant bits is ___________.
commented
Feb 19
in
Digital Logic

431
views
gate1990
descriptive
digitallogic
numberrepresentation
1
answer
40
#Process
What is response time? Is it equal to waiting time in case of nonpreemptive scheduling?
commented
Feb 18
in
Operating System

96
views
27,290
questions
35,142
answers
83,926
comments
33,231
users