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.
Questions 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
+3
votes
2
answers
1
What is the expected length of the cycle containing vertex 1?
asked
1 day
ago
in
Graph Theory

155
views
expectation
graphtheory
engineeringmathematics
0
votes
0
answers
2
L={<M>  M is a turing machine and it takes less than 481 steps on some input>
asked
2 days
ago
in
Theory of Computation

33
views
theoryofcomputation
turingmachine
0
votes
2
answers
3
L={<M> : M is a TM that accepts all even numbers }
asked
2 days
ago
in
Theory of Computation

54
views
theoryofcomputation
decidability
0
votes
2
answers
4
hoe many different choices for classes does we have? ________
asked
4 days
ago
in
Combinatory

71
views
combinations
permutation
+1
vote
0
answers
5
what is the probability that the mother could have had the very long or very short pregnancy
asked
5 days
ago
in
Probability

62
views
probability
engineeringmathematics
0
votes
0
answers
6
findthe probability that all the customers that arrive at the shop within the first 10 minutes, all bought product A?
asked
5 days
ago
in
Probability

28
views
engineeringmathematics
probability
+1
vote
0
answers
7
pagetable and modes
what is the mode used when page tables of a process are loaded and modified?KERNEL /USER? are page tables of the process also stored in process control block??
asked
5 days
ago
in
Operating System

36
views
operatingsystem
0
votes
1
answer
8
switch case output in case of expressions
asked
5 days
ago
in
Programming

25
views
programminginc
0
votes
0
answers
9
self soubt
while (++x){ } here ++x is executed first and then condition is checked or first condition is checked then ++x
asked
5 days
ago
in
Programming

15
views
programminginc
+1
vote
1
answer
10
find the output
include <stdio.h> int main() { int a[][3] = {1, 2, 3, 4, 5, 6}; int (*ptr)[3] = a; printf("%d %d ", (*ptr)[1], (*ptr)[2]); ++ptr; printf("%d %d\n", (*ptr)[1], (*ptr)[2]); return 0; } (a) 2 3 5 6 (b) 2 3 4 5 (c) 4 5 0 0 (d) none of the above
asked
6 days
ago
in
Programming

41
views
programminginc
+2
votes
1
answer
11
find the output
#include int main() { char *x; x = (char *) &a; a = 512; x[0] = 1; x[1] = 2; printf("%d\n",a); return 0; } What is the output of above program? (a) Machine dependent b) 513 (c) 258 (d) Compiler Error
asked
6 days
ago
in
Programming

59
views
programminginc
0
votes
0
answers
12
In the following program where is the variable a getting defined and where it is getting declared?
asked
6 days
ago
in
Programming

33
views
programminginc
0
votes
1
answer
13
Is there any difference between following declarations?
asked
6 days
ago
in
Programming

21
views
programminginc
+1
vote
0
answers
14
self doubt
just confused in these things we are perfoming a/b if we have two INT variables a=6 and b=2 in which scenario we will get answe as 3 3.0 similarly ,if they are float then when will we get 3 3.0 if we have two floats as a=3.2 and b= 1.1 then what will be the answer on division
asked
6 days
ago
in
Programming

26
views
programminginc
0
votes
1
answer
15
betweenB trees and B+ trees,which one is suited for random and which one is suited for sequential access??
asked
6 days
ago
in
Databases

33
views
databases
binarytree
0
votes
0
answers
16
What is left in a 4entry, fully associative, MRU cache
asked
Jan 11
in
CO & Architecture

30
views
co&architecture
+2
votes
2
answers
17
then time required to read 500KB of data in milliseconds is _______.
asked
Jan 10
in
CO & Architecture

101
views
co&architecture
+2
votes
1
answer
18
clock cycles required in pipeline
asked
Jan 8
in
CO & Architecture

85
views
co&architecture
0
votes
1
answer
19
pipeline diagram
LW R4 # 400 LW R1, 0 (R4) pls show the pipeline diagram for these two instructions with operand forwarding and without operand forwarding case
asked
Jan 8
in
CO & Architecture

35
views
co&architecture
+1
vote
1
answer
20
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
asked
Jan 8
in
CO & Architecture

45
views
co
co&architecture
pipeline
+4
votes
1
answer
21
How many memory accesses required by the following instructions?
asked
Jan 8
in
CO & Architecture

152
views
co&architecture
0
votes
1
answer
22
which can be done in parallel
I1: MAR < (PC) I2: MBR < memory I3 : PC < PC + 1 I4: IR < MBR Which one of the following instructions can be done in same time unit? can we perform I2 and I3 in same time??i guees yes because I2 is transferring data from memroy to buffer register while I3 is inc PC I3 and I4 can also be run parallely. pls confirm this
asked
Jan 8
in
CO & Architecture

55
views
co&architecture
+1
vote
1
answer
23
sorted array in dijkstra
What is the time complexity to implement Dijkstra's algorithm using a sorted array instead of heap for a Priority Queue? for sorted array let V be the number of nodes and E be the number of edges 1)extract min operation it will take ... be sorted..so it will take VlogV time if we use merge sort.so ,total time is E*VLOGV please verify this.
asked
Jan 5
in
Algorithms

73
views
algorithms
timecomplexity
0
votes
1
answer
24
Consider a heap ‘H’. Each key in a heap is randomly increased or decreased by 1.
asked
Jan 5
in
Algorithms

60
views
algorithms
timecomplexity
+2
votes
1
answer
25
find the total time
Consider the following program foo(n) { if (n == 1) P(n) else Q() + foo(n1); } What is the time complexity for the given function, if the function P' and function Q' take O(n) and O(1) unit of time respectively. O(n) O(n2) O(nlogn) O(logn)  ... so,T(n) =O(n) +K*C (T(1) =O(n)) hence,T(n) =O(n) +N1*C so,T(n) = O(n) is this correct??
asked
Jan 5
in
Algorithms

41
views
algorithms
timecomplexity
0
votes
1
answer
26
What is the time taken by the server to send the file to all clients
asked
Jan 5
in
Computer Networks

37
views
computernetworks
+1
vote
0
answers
27
what should be the data rate of B
asked
Jan 5
in
Computer Networks

97
views
computernetworks
+1
vote
0
answers
28
Compute the fraction of the bandwidth that is wasted on overhead
asked
Jan 4
in
Computer Networks

37
views
computernetworks
0
votes
1
answer
29
basic doubt in transmission time
asked
Jan 4
in
Computer Networks

43
views
computernetworks
+2
votes
1
answer
30
What is the average routing delay if N packets arrive simultaneously every NL/R seconds.
asked
Jan 4
in
Programming

38
views
computernetworks
Page:
1
2
3
4
5
6
7
next »
18,898
questions
23,865
answers
51,932
comments
20,186
users