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 Akriti sood
User Akriti sood
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Akriti sood
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
which of the following is true..??
commented
29 minutes
ago
in
Operating System

82
views
0
answers
2
C. L. Liu 3.38(b)
Among $3n + 1$ objects, $n$ of them are identical. Find the number of ways to select $n$ objects out of these $3n + 1$ objects.
commented
6 hours
ago
in
Combinatory

12
views
1
answer
3
ISI 2016 PCB C3
Consider the following extract from a program, written in a Clike language, that computes the transpose of a matrix. for (i = 0; i < N; i++) for (j = 0; j < N; j++) B[i,j] = A[j,i]; A and B are N N matrices ... bytes Each of A and B is stored starting from the beginning of a page None of the pages allocated to A or B are initially in memory
commented
9 hours
ago
in
Operating System

41
views
demandpaging
pagefault
operatingsystem
4
answers
4
GATE2017213
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the rear node of the queue, respectively. ... (I) only. (B) (II) only. (C) Both (I) and (II). (D) Neither (I) nor (II).
commented
4 days
ago
in
DS

2.3k
views
gate20172
datastructure
2
answers
5
GATE2017131
Let $A$ be $n\times n$ real valued square symmetric matrix of rank 2 with $\sum_{i=1}^{n}\sum_{j=1}^{n}A^{2}_{ij} =$ 50. Consider the following statements. (I) One eigenvalue must be in $\left [ 5,5 \right ]$ (II) The eigenvalue with the largest ... $A$ is/are necessarily CORRECT? (A) Both (I) and (II) (B) (I) only (C) (II) only (D) Neither (I) nor (II)
commented
4 days
ago
in
Linear Algebra

535
views
gate20171
linearalgebra
eigenvalue
normal
1
answer
6
what is the probability that the mother could have had the very long or very short pregnancy
commented
Feb 8
in
Probability

123
views
probability
engineeringmathematics
0
answers
7
stack underflow
A stack of size (1 to N) and the initial position of top pointer is 0. Get (i, S) is a routine to get ith element from stack ‘S’ with respect to top. Then, what is the underflow condition on stack to perform get() operation. top – i < N top – i + 1 ≤ N top – i ≤ 0 top – i + 1 ≤ 0
commented
Feb 5
in
DS

26
views
stack
datastructure
0
answers
8
digital logic
commented
Feb 5
in
Digital Logic

32
views
digitallogic
combinational
0
answers
9
DIGITAL LOGIC Kmap DOUBT
by solving KMAP , i am not getting any of the A or B, ithink there is an extra term ACD in a option and ACD' in b option but given ans. is C. someone confirm this.
commented
Feb 5
in
Digital Logic

38
views
digitallogic
kmap
1
answer
10
Number of RTTs
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 2 KB. The receiver advertise its window at the starting of communication to be 24 KB. Assume ... since after 9 RTTs we would be able to send full 24kb window Can somebody provide some refrence links for this
commented
Feb 5
in
Computer Networks

61
views
computernetworks
2
answers
11
Madeeasy
commented
Jan 30
in
CO & Architecture

96
views
co&architecture
madeeasy_testseries
0
answers
12
Doubts in PIpelining
1. In case of no data forwarding can we use split phase. 2. Should we have to consider data forwarding, According to options? 3. Where we can use split phase??( I know about WBID and EXID) @Pc @Arjun Sir Please answer..
commented
Jan 30
in
CO & Architecture

100
views
#computerorganisationandarchitecture
pipeline
0
answers
13
diameter of a graph
FINDING diameter of a graph i could think of 2 options for finding diameter 1) running BFS from each vertex and then finding longest among then 2) computing all pair shortest paths (by floyd warshall) and then finding longest among them is there any other method or algo?can DFS be used to find diameter? please suggest.
commented
Jan 30
in
Algorithms

81
views
algorithms
3
answers
14
view serializable
$S: R_1(A),R_2(B),W_2(A),W_3(C),R_4(C),R_3(A),W_3(B),R_4(A),W_2(B),W_4(B),W_3(A)$ View serializable or not?
commented
Jan 29
in
Databases

126
views
view_serializable
databases
transactions
concurrency
1
answer
15
clock cycles needed
) Pipeline contains 5 stages: IF, ID, EX, M and W; b) Each stage requires one clock cycle; c) All memory references hit in cache; d) Following program segment should be processed: // ADD TWO INTEGER ARRAYS LW R4 # ... or bypassing when result of the branch instruction (new PC content) is available after WB stage? please show thorugh pipeline diagram
commented
Jan 29
in
CO & Architecture

77
views
co
co&architecture
pipeline
1
answer
16
clock cycles required in pipeline
commented
Jan 29
in
CO & Architecture

118
views
co&architecture
1
answer
17
MADE EASY TEST SERIES
Match ListI with ListII and select the correct answer using the codes given below the lists: ListI ListII A. Stop and Wait ARQ 1. Each frame sent or resent needs a timer, which means that the timer needs to be numbered. B. Goback ... 3 4 1 (d) 2 1 4 Below given snapshot is the solution provided by Made easy. Please point out the errors if any.
commented
Jan 29
in
Computer Networks

48
views
1
answer
18
Pipeline : ans should be 13 or 14?
commented
Jan 29
in
CO & Architecture

79
views
pipeline
1
answer
19
Made Easy
In a particular number system the cubic equation X^3+bX^2+cX190 has roots 5,8 and 9.What is the base of the no system?
commented
Jan 28
in
Digital Logic

74
views
madeeasy_testseries
digitallogic
number
system
1
answer
20
made easy
Three 4 bit shift registers are connected in cascade as shown in figure below. Each register is applied with A 4 bit data 1011 is applied to the shift register 1. What is the minimum number of clock pulses required to get same input data at output are with same clock?
commented
Jan 27
in
Digital Logic

106
views
madeeasy_testseries
digitallogic
1
answer
21
Made EasyCBT2017Q34
commented
Jan 27
in
Algorithms

106
views
madeeasy
cbt2017
2
answers
22
Find number of minimum NAND and NOR gates required
commented
Jan 27
in
Digital Logic

163
views
digitallogic
1
answer
23
Guess the result f SQL statement
commented
Jan 27
in
Databases

19
views
databases
1
answer
24
CIDR (Classless Inter Domain Routing): Select correct statement
commented
Jan 26
in
Computer Networks

41
views
computernetworks
1
answer
25
Made easy test series
Which of the following represents the running time for run (n) function? O(log n) O(log (log (n)) O(log ∗ (n)) O(n) sombody please provide explanation
commented
Jan 25
in
Algorithms

65
views
madeeasy_testseries
algorithms
timecomplexity
1
answer
26
Demand Paging
Suppose: TLB lookup time = 20 ns TLB hit ratio = 80% memory access time = 75 ns swap page time = 500,000 ns 75% of pages are dirty OS uses a 3 level page table What is the effective access time (EAT) if we assume the page fault rate is 15% ?
commented
Jan 25
in
Operating System

204
views
operatingsystem
demandpaging
memorymanagement
multilevelpaging
1
answer
27
Consider a system with the main memory size of 32MB and each process size 4MB
answer selected
Jan 24
in
Operating System

102
views
operatingsystem
0
answers
28
choose the correct one testbook testseries
comment edited
Jan 24
in
Algorithms

55
views
algorithms
testseries
0
answers
29
find the time complexity
What is the time complexity of the following function foo() void foo() { int i, j; for(i = 1; i <= n ; i++) for(j = i; j <= log(i); j++) printf(“gate”); } what is the time complexity? the answer given is nlogn. but I think it should be O(n)
asked
Jan 24
in
Algorithms

66
views
algorithms
0
answers
30
which one is R.E??
Consider the following languages: L1={0^(2k)│k≥0} L2={b∈{0,1}*│b∈L(Mb] ) } Which of the above languages is TM recognizable? please explain second one
asked
Jan 24
in
Theory of Computation

32
views
theoryofcomputation
1
answer
31
find the false onetestbbok live testseries
asked
Jan 23
in
Algorithms

180
views
algorithms
testseries
0
answers
32
predict the outputtestbook livetest
asked
Jan 23
in
Algorithms

44
views
programminginc
1
answer
33
find the time complexitytestbook livetest
answer selected
Jan 23
in
Algorithms

123
views
timecomplexity
algorithm
0
answers
34
type of relation
how is it not transitive?? i mean take any time instant.ie x= 4:00 and y=4:20,z= 4:40..they are transitive..right??
asked
Jan 23
in
Set Theory & Algebra

32
views
relations
engineeringmathematics
3
answers
35
Made EasyCBT2017Q52
Consider the following Node definitions of B Tree and B+ Tree Order P for root node between 1 to 2P keys for other nodes between P to 2P keys If disk block size is of 2048B and key is 20B . Block pointer is 30B . Record Pointer is 25B . Difference between order of B tree with B+ Tree is _______
comment edited
Jan 23
in
Databases

285
views
madeeasy
cbt2017
btree
databases
1
answer
36
When analyzing a recurrence of the form T(n) = a T(nb) + θ(nc),
answer selected
Jan 23
in
Algorithms

41
views
algorithms
recurrence
0
answers
37
Identify MOD of the Counter
Clock Q0 Q1 Q2 State 0 0 0 0 1 1 0 0 1 2 0 1 0 2 3 1 1 0 3 4 0 0 1 4 5 1 0 1 5 At clock t5 or lets say after 5 clock pulses Q0 and Q2 becomes 1 and through NAND gate they will become 0 ... clock to the gate play any significance role? Doubt is similar to the one of the gate questions asked prviously : http://gateoverflow.in/1234/gate200736
comment edited
Jan 23
in
Digital Logic

63
views
digitallogic
counter
flipflop
sequential
combinational
2
answers
38
time required to fins the unknowm integer
answer selected
Jan 22
in
Algorithms

67
views
algorithms
0
answers
39
find the number of rows returned
asked
Jan 22
in
Databases

34
views
databases
0
answers
40
L1 = {aibjck  i≠j or j≠k or i≠k}.
asked
Jan 22
in
Theory of Computation

84
views
theoryofcomputation
20,863
questions
26,022
answers
59,696
comments
22,133
users