The Gateway to Computer Science Excellence
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. For hardcopy of previous year questions please see
here
Recent activity by Soumya29
User Soumya29
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Soumya29
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
PI and EPI in case of Don't care
Consider the below function $f=\sum m(0,1,2,5,8,15)+d(6,7,10)$ In this Prime Implicant count comes7 and Essential Prime Implicant Count comes 2. Please verify.
commented
19 hours
ago
in
Digital Logic

233
views
digitallogic
0
answers
2
Two level of cache
Consider a two level cache system. For 100 memory references 20 misses in 1st level cache,10 misses in second level cache. Miss penalty from second level to memory is 40 cycles. if Total average = 7.6 cycles, then hit time of second level cache ? Assume hit time of second level cache is two times the first level cache? Ans. 4
commented
2 days
ago
in
CO & Architecture

61
views
coandarchitecture
cachememory
1
answer
3
Cache memory  Find Cache size ( given K, line size, tag memory, physical address space )
commented
2 days
ago
in
CO & Architecture

219
views
coandarchitecture
cachememory
0
answers
4
Addressing modes
Instructions are stored in memory. When they are to be executed they are brought into instruction register. Now it is divided as Mode, opcode, operand (log (memory size) is divided in three parts) . In direct addressing, operand represent the effective ... required to address a memory then how such a big instruction is stored in memory whose operand itself has those many bits?
comment edited
2 days
ago
in
CO & Architecture

26
views
addressingmodes
coandarchitecture
1
answer
5
Multilevel Cache Access time
Ans. A
commented
5 days
ago
in
CO & Architecture

45
views
coandarchitecture
cachememory
memorymanagement
1
answer
6
Fork System Call
A process execute the code: main() { fork(); fork() && fork()  fork(); fork(); printf("Hi"); } The number of times "Hi" will be printed is
commented
5 days
ago
in
Operating System

77
views
0
answers
7
interview IIsc
Given a deck of 10 cards numbered 1 to 10. Select 3 cards one by one. Find the probability that selected cards is in increasing order. Eg : {1, 5, 7} or {8, 9, 10} etc
comment moved
6 days
ago
in
Probability

82
views
probability
permutationsandcombinations
1
answer
8
ACE_subject_test_digitalLogic2019
answer selected
6 days
ago
in
Digital Logic

62
views
1
answer
9
kenneth rosen chapter 5 exercise 5.5 ques 51
commented
Aug 11
in
Combinatory

147
views
0
answers
10
made easy test series
Consider a set S={1000,1001,1002,............9999}.The numbers in set 'S' have atleast one digit as 2 and atleast one digit as 5 are _
commented
Aug 11
in
Mathematical Logic

47
views
1
answer
11
MADEEASY
Consider a set S={1000,1001,1002........,9999}. The numbers in set S having atleast one digit as 2 and atleast one digit as 5 are?
answer selected
Aug 10
in
Combinatory

88
views
counting
0
answers
12
Array and Pointer
#include <stdio.h> main() { int arr[5]; printf("%p,%p\n",arr,&arr); } How do both print the same address?
commented
Aug 10
in
Programming

119
views
arrayofpointers
1
answer
13
Made Easy TestEM
In the above question, they have said that set A has elements replaced. But in solution, they have considered the same set for P and Q. I am not able to get it. Please explain
answered
Aug 9
in
Probability

35
views
engineeringmathematics
probability
0
answers
14
work book
Let S be a stack with operations push, pop, top, empty. What is displayed after following segment of code executes . for(i=1; i<=5; i++) s.push(i); while(!s.empty()) printf("%d", s.top()); ans with explanation
commented
Aug 8
in
DS

42
views
stack
1
answer
15
Recursive call of a function
How will this function run for the input 123 (where str points '123' and n=3)? in myAtoiRec(int *str,int n) { if(n==1) return*str'0'; return(10*myAtoiRec(str,n1)+str[n1]'0'); }
commented
Aug 6
in
Programming

69
views
programminginc
1
answer
16
made easy test series
why option B is given wrong?
commented
Aug 6
in
Mathematical Logic

63
views
madeeasytestseries
engineeringmathematics
discretemathematics
1
answer
17
Made Easy
Consider there are two tribes living on the Island: Knights and knaves. Knights always tell truth while Knaves always tells lie. Suppose we counter two random people A and B, upon asking a question to A', A says If B is Knight then I am a Knave . What we can conclude about person A ... and B is Knave b.) A is Knave and B is Knave c.) Both A and B are Knight d.) Both A and B are Knave
answered
Aug 6
in
Mathematical Logic

18
views
madeeasytestseries
0
answers
18
Time complexity
What is the time complexity of the following code? int j = 0; for(i=0;i<n;i++) { for(i=0;i<2n;i++) { while(j<n) { j++; } } } a) O(n$^{4}$) b) O(n$^{3}$) c) O(n$^{2}$) d) O(n) I am getting option O(n$^{2}$) and answer is given O(n) Explain briefly.
commented
Aug 5
in
Algorithms

70
views
timecomplexity
0
answers
19
self doubt
what is output?
commented
Aug 4
in
Operating System

36
views
operatingsystem
system
calls
4
answers
20
GATE2017111
Consider the $C$ struct defined below: struct data { int marks [100]; char grade; int cnumber; }; struct data student; The base address of student is available in register $R1$. The field student.grade can be accessed efficiently using: Postincrement ... mode, $R1$ Index addressing mode, $X(R1)$, where $X$ is an offset represented in $2's$ complement $16bit$ representation
commented
Aug 4
in
CO & Architecture

2.6k
views
gate20171
coandarchitecture
addressingmodes
1
answer
21
Ace algorithms
What is the time complexity? int i,j,k,x=0; for(i=1;i<=n;i++) for(j=1;j<=i*i;j++) { if (j mod i ==0) for(k=1;k<=j;k++) x=x+10; }
answered
Aug 3
in
Algorithms

63
views
1
answer
22
GATE BOOK
Total number of prime implicants in the function F(A, B)=A EOR B
comment edited
Aug 3
in
Digital Logic

45
views
digitallogic
7
answers
23
GATE20184
Let $\oplus$ and $\odot$ denote the Exclusive OR and Exclusive NOR operations, respectively. Which one of the following is NOT CORRECT? $\overline{P \oplus Q} = P \odot Q$ $\bar{P} \oplus Q = P \odot Q$ $\bar{P} \oplus \bar{Q} = P \oplus Q$ $P \oplus \bar{P} \oplus Q = ( P \odot \bar{P} \odot \bar{Q})$
answer selected
Aug 2
in
Digital Logic

1.3k
views
gate2018
digitallogic
normal
booleanexpressions
0
answers
24
me tst series dld 1
The total number of NAND gates required to implement a 4 × 1 multiplexer is (assuming a NAND gates of any number of inputs are available) ________.
comment edited
Aug 2
in
Digital Logic

29
views
1
answer
25
Instruction Addressing
A computer has 170 different operations. Word size is 4 bytes one word instructions requires two address fields. One address for register and one address for memory. If there are 37 registers then the memory size is ______________(in KB). Ans. 256KB
comment edited
Aug 1
in
CO & Architecture

50
views
coandarchitecture
addressingmodes
machineinstructions
1
answer
26
Instruction or Operand Fetch
Consider the following μprogram? Which of the following operation is performed by above μprogram? A. Instruction fetch B. Direct operand fetch C. Interrupt sub program initiation D. Indirect operand fetch. Ans. B Please Specify proper reason. My Doubt is in option B and D why D isnt the answer ?
comment edited
Aug 1
in
CO & Architecture

11
views
coandarchitecture
cpu
1
answer
27
MIT_algorithms
I don't understand How?
comment edited
Jul 30
in
Algorithms

56
views
timecomplexity
algorithms
1
answer
28
Gate_2019_Mock_Paper
how to solve dld tautology questions?
comment edited
Jul 21
in
Digital Logic

96
views
dld
digitallogic
tatology
1
answer
29
Minterm
I had a slight doubt as regards with Minterm. How the output is 1 in the truth table values of the minterms?Please explain in detail.
answered
Jul 19
in
Digital Logic

53
views
digitallogic
0
answers
30
AlgorithmsTime Complexity
What is the time complexity of the below code? for($k=n^{10};k \geq 5;k=k^{\frac{1}{7}},k=k^2$) { $k=k^5;$ $k=k10$ } My answer comes to be $O(log_{\frac{7}{10}}log_5(n^{10}))$ Please verify.
comment edited
Jul 16
in
Algorithms

147
views
timecomplexity
algorithms
asymptoticnotations
3
answers
31
Self Doubt
How to evaluate this quickly? $\large\sum^{20}_{r=0}(1)^r\binom{r+2}{r}\\OR\\\large\sum^{20}_{r=0}(1)^r(r+2)(r+1)$
answer selected
Jul 11
in
Combinatory

83
views
permutationsandcombinations
6
answers
32
GATE20181
Which one of the following is a closed form expression for the generating function of the sequence $\{a_n\}$, where $a_n = 2n +3 \text{ for all } n=0, 1, 2, \dots$? $\frac{3}{(1x)^2}$ $\frac{3x}{(1x)^2}$ $\frac{2x}{(1x)^2}$ $\frac{3x}{(1x)^2}$
comment edited
Jul 11
in
Combinatory

2.6k
views
gate2018
generatingfunctions
normal
4
answers
33
TIFR2010A12
The coefficient of $x^{3}$ in the expansion of $(1 + x)^{3} (2 + x^{2})^{10}$ is. $2^{14}$ $31$ $\left ( \frac{3}{3} \right ) + \left ( \frac{10}{1} \right )$ $\left ( \frac{3}{3} \right ) + 2\left ( \frac{10}{1} \right )$ $\left ( \frac{3}{3} \right ) \left ( \frac{10}{1} \right ) 2^{9}$
answer selected
Jul 10
in
Combinatory

609
views
tifr2010
generatingfunctions
0
answers
34
Set theory
comment edited
Jul 7
in
Mathematical Logic

42
views
8
answers
35
GATE201032
In the sequential circuit shown below, if the initial value of the output $Q_1Q_0$ is $00$. What are the next four values of $Q_1Q_0$? $11$, $10$, $01$, $00$ $10$, $11$, $01$, $00$ $10$, $00$, $01$, $11$ $11$, $10$, $00$, $01$
edited
Jul 6
in
Digital Logic

4.2k
views
gate2010
digitallogic
circuitoutput
normal
0
answers
36
Made Easy Test series Question
closed
Jul 6
in
Digital Logic

145
views
4
answers
37
GATE19962.21
Consider the circuit in Fig.2.21 which has a four bit binary number $b_3b_2b_1b_0$ as input and a five bit binary number, $d_4d_3d_2d_1d_0$ as output. Binary to Hex conversion Binary to BCD conversion Binary to grey code conversion Binary to $radix12$ conversion
comment edited
Jul 4
in
Digital Logic

2.2k
views
gate1996
digitallogic
circuitoutput
normal
9
answers
38
GATE199363
Multiple choices can be correct. Mark all of them. For the initial state of 000, the function performed by the arrangement of the JK flipflops in figure is: Shift Register Mod 3 Counter Mod 6 Counter Mod 2 Counter None of the above
comment edited
Jul 4
in
Digital Logic

2.2k
views
gate1993
digitallogic
circuitoutput
normal
1
answer
39
Self Doubt. Related to https://gateoverflow.in/94634/gate198813ii#c216658.
comment edited
Jul 3
in
Set Theory & Algebra

132
views
discretemathematics
settheory&algebra
functions
0
answers
40
RelationsKenneth Rosen(Ex 7.557)
Consider the equivalence relation R = $\{(x,y) \,  \, xy \,is\,an\,integer\}$ (b) What is the equivalence class of 1/2 for this equivalence relation?
comment reshown
Jul 1
in
Set Theory & Algebra

40
views
kennethrosen
settheory&algebra
relations
38,115
questions
45,622
answers
132,338
comments
49,308
users