Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Doraemon
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Doraemon
0
votes
1
answer
1
self doubt-swap space
What is swap space in secondary memory?
asked
in
Operating System
Jun 5, 2019
356
views
secondary
memory
0
votes
1
answer
2
navathe-doubt
previous value of X=9 Sf : w1(X, 5); w2(X, 8); a1; cascadeless schedu;e . what problem will the schedule face??
asked
in
Databases
Apr 20, 2019
290
views
databases
cascadeless-schedule
0
votes
0
answers
3
kurose and ross -sellf doubt-tcp
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
in
Computer Networks
Apr 8, 2019
182
views
0
votes
1
answer
4
self doubt-URGENT 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
in
Computer Networks
Apr 8, 2019
400
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
in
Computer Networks
Apr 8, 2019
294
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
in
Theory of Computation
Apr 7, 2019
171
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
in
Theory of Computation
Apr 7, 2019
825
views
finite-automata
theory-of-computation
0
votes
2
answers
8
self doubt
difference between empty language and empty string
asked
in
Theory of Computation
Apr 6, 2019
385
views
theory-of-computation
0
votes
0
answers
9
self doubt-MASKING
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
in
Computer Networks
Apr 4, 2019
164
views
subnet-mask
0
votes
0
answers
10
self doubt-STRICT SOURCE ROUTING
For strict source routing the maximum number of IP addresses, we could give in the options field???
asked
in
Computer Networks
Apr 4, 2019
221
views
0
votes
0
answers
11
self doubt
when a packet goes in the bottom-up manner on the receiver side does each layer checks all the contents of that layer header??
asked
in
Computer Networks
Apr 4, 2019
148
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
in
Computer Networks
Apr 4, 2019
139
views
0
votes
1
answer
13
self doubt-LONGEST MASK MATCHING-NETWORK LAYER
what is the intuition behing longest mask matching when different masks gives the same source ID for a given IP address??
asked
in
Computer Networks
Apr 4, 2019
414
views
0
votes
0
answers
14
FOROUZAN-NETWORK LAYER-VIRTUAL 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
in
Computer Networks
Apr 4, 2019
217
views
network-layer
0
votes
1
answer
15
self doubt
This is the subnet mask of a class-C 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
in
Computer Networks
Apr 2, 2019
266
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
in
Algorithms
Apr 2, 2019
506
views
cut-vertex
0
votes
1
answer
17
self-doubt
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
in
Graph Theory
Mar 31, 2019
651
views
graph-theory
0
votes
0
answers
18
GATE | GATE-CS-2003
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 k-1?? I mean if we have only one component .?Please explain
asked
in
Algorithms
Mar 31, 2019
695
views
graph-algorithm
0
votes
2
answers
19
self doubt
What is the general formula for number of simple graph having n unlabelled vertices ??
asked
in
Graph Theory
Mar 31, 2019
1.3k
views
simple-graph
0
votes
0
answers
20
CLRS CHAPTER 25
FOR THE EXTENDED-SHORTEST-PATH 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
in
Programming in C
Mar 30, 2019
255
views
graph-algorithm
Page:
1
2
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...