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
0
answers
1
[COA] I/o Organization
Consider the following statements: 1. Change program counter value 2. Change page table register context 3. Disable interrupt 4. Initiate I/o on a disk using memory mapped I/o which of the above can be executed in only in system mode? a.) 1,3,4 b)2,3,4 c.)1,2,3 d)2,4,1 Please give valid explanation with your answer.
commented
6 hours
ago
in
CO & Architecture

8
views
co&architecture
interrupts
1
answer
2
testbook
A) 1 & 3 B) 1 & 2 C)2 & 3 D) 1 2,& 3
commented
1 day
ago
in
Databases

12
views
databases
1
answer
3
Percentage
In an election involving two candidates ,68 votes were declare invalid .the wining candidate secure 52 % and wins by 98 votes.the total no. of vote polled is.anyone can help me?
answer selected
1 day
ago
in
Numerical Ability

20
views
2
answers
4
Dstree
Given numbers from 1 to 8. Number 5 is the root of BST.How many number of BST are possible with given constraint.
commented
2 days
ago
in
Programming

26
views
0
answers
5
Counting
http://gateoverflow.in/?qa=blob&qa_blobid=14775353093279358576 I'm unable to understand how the value of K, is equivalent to selecting m integers with repetition allowed, out of n integers (1,2,3,...,n). Kindly explain in detail, preferably visual detail.
commented
2 days
ago
in
Mathematical Logic

22
views
#counting
discretemathematics
1
answer
6
Silly window syndrome
One of the case of Silly window syndrome occurrence is when sender is producing only one byte at a time from transport layer . And for that Nagles solution is " collect it upto RTT time (worst case ) or upto 1 MSS (if before ... side. If this solution will be applied here too then every chat will become an email . Plzz clear this thing ???
commented
2 days
ago
in
Computer Networks

36
views
1
answer
7
computer architecture
Can we have overflow in unsigned numbers ??? We know that in unsigned numbers with n bits we can represent numbers from 0 to 2^n  1.EX: with 4 bits from o to 15.Now if I add 14 + 15 = 29 which we cant represent using ... In unsigned numbers whenever we get an endaround carry there will always be an overflow ..Please correct me if I am wrong....
commented
3 days
ago
in
CO & Architecture

16
views
co&architecture
co&architecture
2
answers
8
Probability puzzles
A grasshopper is sitting on a little stone, which we'll call stone zero. Ahead of him, arranged in a line, are stones one, two, three, et cetera, all the way up to nine. The grasshopper would like to reach that ninth stone, ... he could take one big jump, or two little ones. How many different paths can the grasshopper take to reach his destination?
commented
3 days
ago
in
Probability

36
views
probability
engineeringmathematics
conditionalprobability
3
answers
9
Algorithms
what is the maximum difference between height of two nodes of AVL tree a.1 b.2 c.3 d.none
commented
4 days
ago
in
Algorithms

38
views
1
answer
10
Algorithms
To sort the following numbers which algorithm will suit the best (i) 1 to 100 integers (ii) 0 to 1000000 integers a)bucket sort for both b) (i)radix sort (ii)quick sort c) (i)quick sort (ii)merge sort d) (i) merge sort (ii)quick sort
commented
4 days
ago
in
Algorithms

50
views
0
answers
11
Longest Common Subsequence
For finding longest common subsequence(LCS), standard sources mention that the recursive procedure consisting of the recursive tree occupies O(m+n) space( WITHOUT applying Dynamic Programming). I am unable to understand why is space occupied O(m+n)? Consider the ... k = O(m+n) and hence, space should be k=log(m+n). What's wrong with my logic?
commented
4 days
ago
in
Algorithms

37
views
algorithms
longestcommonsubsequence
dynamicprogramming
0
answers
12
Probbility puzzles
Three men  conveniently named A, B, and C  are fighting a duel with pistols. It's A's turn to shoot. The rules of this duel are rather peculiar: the duelists do not all shoot simultaneously, but instead take turns. A fires at ... a better shot, and hits with probability 0.75  all shots are independent. What's the probability that A wins the duel?
commented
4 days
ago
in
Probability

73
views
probability
conditionalprobability
0
answers
13
distance vector routing
Suppose that forwarding table are all established then, What will be the table for A immediately after the link AE goes down? Is it that the distance to all other nodes is marked infinite? If it not so, then how the table for node A finally gets stabilized?
commented
4 days
ago
in
Computer Networks

9
views
computernetworks
distancevectorrouting
1
answer
14
Flow control
In flow control, the timer used is started when the transmission of the packet starts or when the last bit of the packet is transmitted? Any questions in flow control related to the timer?
commented
4 days
ago
in
Computer Networks

10
views
computernetworks
networkflow
0
answers
15
Ethernet frame
If the length of IPv4 datagram is less than 46 bytes then padding bits are added to it as minimum length allowed in ethernet frame is 46 bytes. Question : At the receiver side, how to determine the length of actual data and padding? Any numericals related to it?
commented
4 days
ago
in
Computer Networks

16
views
1
answer
16
Calculus
The interval in which $f(x) = \cot^{1}x + x$ increases, is (a) $R$ (b)$(0,\infty )$ (c)$R[n\pi]$ (d)None of these
commented
5 days
ago
in
Calculus

19
views
calculus
engineeringmathematics
2
answers
17
#Pondicherry University Entrance  2011 #Qn 68 #M.Tech C.S.E #DS
commented
May 19
in
DS

17
views
2
answers
18
Conditional Probability IITB (RA) 2016
commented
May 19
in
Probability

170
views
probability
conditionalprobability
gate2016admission
admissions
interview
1
answer
19
Probability IITB (RA) 2016
This question was asked in IITB (RA) 2016 admissions. Three person A, B and C each have a bag of five different coloured balls. All three bags have balls from same five colours. A grabs B and C's bag and took two ... two balls and put them in his bag without looking. What is the probability that all three bags have different coloured balls?
commented
May 19
in
Probability

162
views
probability
gate2016admission
admissions
iitbombay
3
answers
20
CSL and Regular language
if L1 = { anbncn  n>= 0 } and L2 = { anbmck  k,n,m>=0} L1 is CSL and L2 is regular. Now L3 = L1.(L2)*. Is L3 is regualar or CSL?
commented
May 11
in
Theory of Computation

151
views
theoryofcomputation
contextsensitive
regularlanguage
2
answers
21
basic aptitude
Ten different letters of alphabet are given, words with 5 letters are formed from these given letters. Then, the number of words which have at least one letter repeated is: A. 69760 B. 30240 C. 99748 D. 42386 i got ans from the method totol words  ... 10*10*9*5!/4! + 10*10*10*10*!0 from this getting different ans where is going wrong ? someone verify pls
commented
May 10
in
Combinatory

68
views
aptitude
engineeringmathematics
1
answer
22
iit kanpur written test
I had been shortlisted for iit kanpur test to be held on 13th may in their campus but i could'nt fill up the form to register myself for th exam.Today i got a mail from IIT kanpur that since i have not confirmed my participation ... arrange tests for me. will i not be allowed to give test now?Can anyone pls suggest something?? THanks in advand.
commented
May 10
in
Written Exam

66
views
iitkanpur
writtentest
mtech
0
answers
23
organization of ALU.
Can anyone explain organization of ALU. Why multiplexer and immediate value is used in ALU implementation ? Why we are not directly load data from register into ALU to perform operation?
commented
May 10
in
CO & Architecture

17
views
co&architecture
1
answer
24
Graph theory and Applications Bondy and Murty Exercise Qn 1.9
commented
May 9
in
Graph Theory

37
views
graphtheory
discretemathematics
3
answers
25
Join Number of Tuples
Suppose you are given relations r(A, B) and s(A, C). Suppose that r has 10000 tuples, and s has 5000 tuples. Suppose attribute r.A has 1001 distinct values, and s.A also has 1001 distinct values. The maximum possible size of the join result is
commented
May 9
in
Databases

101
views
naturaljoin
databases
relationalalgebra
0
answers
26
#SWITCH_CN
Can any one explain why collision is not possible inside a switch and router ? I read it in book that switch and router separate the collision domain and that is why collision is not possible inside a switch and router. But I did not understand the meaning of this...
commented
May 8
in
Computer Networks

52
views
1
answer
27
Hamiltonian circuit
Hamiltonian circuit can be most perfectly related with: A. Greedy approach B. Dynamic programming C. Backtracking D. Branch and bound
commented
May 6
in
Algorithms

48
views
0
answers
28
Selection sort and Insertion sort
commented
May 6
in
Algorithms

156
views
sorting
algorithms
1
answer
29
Relation between k and k1 edge connected graph
commented
May 6
in
Algorithms

47
views
graphtheory
algorithms
theoryofcomputation
1
answer
30
backtracking
Consider the following grammar. S → aB  aAb A → bAb  a B → aB  ε How many back tracks are required to generate the string aab from the above grammar and explain in detail? (a) 1 (b) 2 (c) 3 (d) 4
commented
May 6
in
Compiler Design

45
views
0
answers
31
Paths in a graph
The number of paths of length 5 between two different vertices in K4 (complete graph)?
commented
May 5
in
Graph Theory

41
views
kennethrosen
2
answers
32
thegatebook
22) S1: A formula is valid iff its complement is not satisfiable S2: A formula is satisfiable iff its complement is not valid. Which statement is/are true? a) Only S1 b) Only S2 c) both S1 and S2 d) none
commented
May 5
in
Mathematical Logic

59
views
propositionallogic
mathematicallogic
1
answer
33
Problem with Linked List Code
I was trying to implement the Linked List code in C. It compiles fine but doesn't give any output. What seems to be the error? I think I messed up at passing pointer references as function parameters. My Code ( ... pointer to pointer) to the function.  Return the modified head node by the function. Please read about Reference Semantics.
commented
Apr 26
in
Programming

59
views
algorithms
linkedlists
datastructure
programminginc
1
answer
34
Probability
There are 15 tennis balls in a box, of which 9 have not previously been used. Three of the balls are randomly chosen, played with, and then returned to the box. Later, another 3 balls are randomly chosen from the box. Find the probability that none of these balls has ever been used.
commented
Apr 23
in
Numerical Ability

131
views
probability
engineeringmathematics
discretemathematics
aptitude
2
answers
35
APTITUDE
The sum of all numbers greater than 10,000 formed by using the digits 0,2,4,6,8 no digit being repeated in any number is??
answer selected
Apr 22
in
Numerical Ability

43
views
1
answer
36
Suppose a, b, c > 0 are in geometric progression and a
answer selected
Apr 22
in
Set Theory & Algebra

70
views
settheory&algebra
0
answers
37
GateBook Mock Test_2(Btree)
A Btree of order m is a tree which satisfies the following properties: Every node has at most m children. Every node (except root) has at least ⌈m/2⌉ children maximium no of internal nodes an order 4 B tree can have with 20 keys.
commented
Apr 22
in
Databases

105
views
gatebook_mt2
datastructure
dbms
btree
databases
0
answers
38
theory of computation
Which of the following languages below are NOT recursively enumerable ? L1 = {<M> / M is a TM that accepts all even numbers }. L2 = {<M> / M does not accept all even numbers } L3 = {<M> / M rejects all even numbers } A) Only L1 B) Only L1 and L2 C) Only L1 and L3 D) All of L1,L2 and L3
commented
Apr 21
in
Theory of Computation

102
views
theoryofcomputation
toc
decidability
recursiverecursivelyenumerable
1
answer
39
Let P,Q,R be 3 languages
Let P,Q,R be 3 languages. If P and R are regular and if PQ=R, then a)Q has to be regular b)Q can not be regular c)Q need not be regular d)Q has to be CFL
commented
Apr 15
in
Theory of Computation

36
views
1
answer
40
Calculus
answer selected
Apr 13
in
Mathematical Logic

60
views
#limits
#calculus
22,893
questions
29,196
answers
65,302
comments
27,695
users