The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Questions by Doraemon
User Doraemon
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Doraemon
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
answer
1
self doubtswap space
What is swap space in secondary memory?
asked
Jun 5
in
Operating System

42
views
secondary
memory
0
votes
1
answer
2
navathedoubt
previous value of X=9 Sf : w1(X, 5); w2(X, 8); a1; cascadeless schedu;e . what problem will the schedule face??
asked
Apr 20
in
Databases

31
views
databases
cascadelessschedule
0
votes
0
answers
3
kurose and ross sellf doubttcp
For the last event what is the importance of the statement “Immediately send ACK, provided that segment starts at the lower end of gap.”
asked
Apr 8
in
Computer Networks

5
views
0
votes
1
answer
4
self doubtURGENT POINTER
The flag field contains 6 bits. The ACK bit is used to indicate that the value carried in the acknowledgment field is valid; that is, the segment contains an acknowledgment for a segment that has been successfully received. The RST, SYN, and FIN bits are ... the last byte of the data, but why about the starting byte of the urgent data??Why is this field not present??
asked
Apr 8
in
Computer Networks

22
views
0
votes
0
answers
5
self doubt(TCP)
Suppose we have an application A1 and 2 application from different applications wants to connect with it then does the computer containing the values have 2 threads of application A1 or it calls the fork() system call and creates a child process??
asked
Apr 8
in
Computer Networks

22
views
0
votes
0
answers
6
REQUEST FOR SOLUTION LINK
Can anyone provide me with the link for the solution of Peter Linz TOC book.
asked
Apr 7
in
Theory of Computation

9
views
0
votes
0
answers
7
Finite Automata
For an DFA having exactly 2 a’s and more than 3 b’s what is the minimum number of states???
asked
Apr 7
in
Theory of Computation

56
views
finiteautomata
theoryofcomputation
0
votes
2
answers
8
self doubt
difference between empty language and empty string
asked
Apr 6
in
Theory of Computation

47
views
theoryofcomputation
0
votes
0
answers
9
self doubtMASKING
If a host A finds that host B is in the same network using masking but actually B is not in the same network as A . Now when A sends the packet what will happen??
asked
Apr 4
in
Computer Networks

14
views
subnetmask
0
votes
0
answers
10
self doubtSTRICT SOURCE ROUTING
For strict source routing the maximum number of IP addresses, we could give in the options field???
asked
Apr 4
in
Computer Networks

16
views
0
votes
0
answers
11
self doubt
when a packet goes in the bottomup manner on the receiver side does each layer checks all the contents of that layer header??
asked
Apr 4
in
Computer Networks

6
views
0
votes
0
answers
12
self doubt
An ISP has a block 80.70.56.0/21: It has to give 2 organizations 500 addresses, 2 organizations 250 addresses, 3 organizations 50 addresses. WHICH SENTENCE IS CORRECT: 1>“THE NETWORK IS SUBNETTED ” 2>”WE ARE ALLOCATIONG THE ADDRESSES”
asked
Apr 4
in
Computer Networks

3
views
0
votes
1
answer
13
self doubtLONGEST MASK MATCHINGNETWORK LAYER
what is the intuition behing longest mask matching when different masks gives the same source ID for a given IP address??
asked
Apr 4
in
Computer Networks

31
views
0
votes
0
answers
14
FOROUZANNETWORK LAYERVIRTUAL CIRCUITS
What is the importance of having the field LABEL in the datagram as well as the router if we already know the outgoing port number?? Is’nt it an overhead in virtual circuits?
asked
Apr 4
in
Computer Networks

11
views
networklayer
0
votes
0
answers
15
self doubt
This is the subnet mask of a classC network 255.255.255.192 The number of hosts in the original network before subnetting is 2^2 *(2^6) – 2?? And what about the number of IP address (2^2)*(2^6) ??
asked
Apr 2
in
Computer Networks

15
views
0
votes
0
answers
16
Self doubt
The time complexity required to find the number of cut vertex in a undirected simple graph is?If adjacency list representation is given? Is O(V+E) OR O(E)
asked
Apr 2
in
Algorithms

47
views
cutvertex
0
votes
1
answer
17
selfdoubt
A graph with alternating edges and vertices is called a walk (we can repeat the number of vertices and edges any number of times) . A walk in which no edges are repeated is called a trial. A trial in which no vertices are repeated is called a path. A trial in which only the starting and ending vertices are repeated is called a circuit. Are the definitions correct??
asked
Mar 31
in
Graph Theory

30
views
graph
0
votes
0
answers
18
GATE  GATECS2003
Let G be an arbitrary graph with n nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie between (A) k and n (B) k – 1 and k + 1 (C) k – 1 and n – 1 (D) k + 1 and n – k The answer is C . how is it k1?? I mean if we have only one component .?Please explain
asked
Mar 31
in
Algorithms

40
views
graphalgorithms
0
votes
2
answers
19
self doubt
What is the general formula for number of simple graph having n unlabelled vertices ??
asked
Mar 31
in
Graph Theory

63
views
simplegraph
0
votes
0
answers
20
CLRS CHAPTER 25
FOR THE EXTENDEDSHORTESTPATH if we want to find the distance between 1>4 and the 1>5 +5>4 gives the shortest path and if 1>5 gets its shortest path as 1>2>5 and 5>4 gets its shortest path as 5>3>4 then how will we get it?? as one of the operands is always from the initial array.
asked
Mar 30
in
Programming

18
views
graphalgorithms
+1
vote
1
answer
21
CLRS Chapter22 Figure22.6
What are the strongly connected components in the above figure ?
asked
Mar 30
in
Algorithms

53
views
stronglyconnectedcomponents
dfs
graphalgorithms
0
votes
0
answers
22
self doubt
A directed acyclic graph has no connected components. TRUE OR FALSE???
asked
Mar 30
in
Programming

17
views
dag
0
votes
0
answers
23
self doubt
For multiplication method in hashing the formula is h(k)=m* (KA mod 1); m=2^p, k=key , 0<A<1 My question is how does it actually works. Please explain in a detailed way.
asked
Mar 29
in
Programming

12
views
multiplicationmethod
hashing
0
votes
2
answers
24
self doubt
What advantage does top down approch have over bottom up approach in case of dynamic programming??
asked
Mar 26
in
Algorithms

181
views
dynamicprogramming
0
votes
0
answers
25
self doubt
We know that in a graph E=O(V^2) now V=$omega$($\sqrt{E}$) or V=O($\sqrt{E}$) which one is correct ??
asked
Mar 23
in
Algorithms

30
views
0
votes
0
answers
26
SHELDON AND ROSS
Twelve percent of all US households are in California. A total of 3.3 percent of all US households earn over 250000 per year, while a total of 6.3 percent California households earn over 250000 per year. If a randomly chosen US household earns over 250,000 per year, ... 10^(3)/(0.033)=0.2291 But the answer given in the instructors manual is .2066 What is wrong with my logic??
asked
Mar 22
in
Probability

52
views
probability
sheldonross
0
votes
0
answers
27
selfdoubt
How do we perform 0 – 1 in 2’s complement subtraction using 1bit register??
asked
Mar 21
in
CO and Architecture

27
views
numbersystem
0
votes
1
answer
28
selfdoubt
Consider 2 tables R1 and R2 . If we perform a cross product between them the condition that should be satisfied for not generating spurious tuples is both should have a common element which should be a 1>primary key 2>candidate key 3>super key In one of the tables which of the three is correct??
asked
Mar 19
in
Databases

37
views
databases
databasenormalization
0
votes
0
answers
29
Subject Topic CO & Architecture
how is this executed MOV X, R ; μ[x]←R using IF, ID, OF,PO, WB
asked
Mar 18
in
CO and Architecture

53
views
coandarchitecture
pipelining
50,645
questions
56,585
answers
195,786
comments
101,834
users