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 manisha11
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by manisha11
1
vote
1
answer
1
B TRees DBMS Self doubt
In case of B Trees we split a node on insertion in case of overflow, is there any possible case in which this may lead to underflow also? as a key is promoted to parent the children formed may have subtrees, which may be broken such that we get underflow somewhere? just a thought
asked
in
Databases
Jun 7, 2019
349
views
b-tree
4
votes
4
answers
2
C Program Output and Explaination
void fun(int *p) { int q = 10; p = &q; z } int main() { int r = 20; int *p = &r; fun(p); printf("%d", *p); return 0; }
asked
in
Programming
May 30, 2019
1.2k
views
programming-in-c
1
vote
1
answer
3
pda self doubt
The language accepted by a DPDA with a final state is more compared to the DPDA with empty stack. DPDA with empty stack accepts LR(0) grammar. Can someone explain in depth/or give good reference links?
asked
in
Theory of Computation
May 13, 2019
420
views
pushdown-automata
pushdown-automata
0
votes
1
answer
4
self doubt dfa
Given an algorithm to tell whether a regular language L contains at least 100 strings
asked
in
Theory of Computation
May 12, 2019
219
views
theory-of-computation
0
votes
0
answers
5
Operating system swapping process
Please help me explaining this in simpler words: If we were to swap out process P1 and swap in process P2, the I/O operation might then attempt to use memory that now belongs to process P2. There are two main solutions to this ... system buffers and process memory then occur only when the process is swapped in. Note that this double buffering itself adds overhead.
asked
in
Operating System
May 9, 2019
545
views
operating-system
process-scheduling
0
votes
3
answers
6
Self Doubt CPU
In Multi-processing Operating Systems: (a) Maximum utilization of CPU can be achieved (b) Maximum throughput is achieved (c) Maximum security can be achieved (d) Not suitable for Real time Applications
asked
in
Operating System
May 7, 2019
840
views
process-scheduling
operating-system
0
votes
0
answers
7
turing machine self doubt a+b=c
Turing machine, language A = {a+b=c | a, b, c are sequences of 1's; |c| = |a| + |b|; |a| >= 0 and |b| > 0}.
asked
in
Theory of Computation
Apr 27, 2019
156
views
theory-of-computation
self-doubt
0
votes
0
answers
8
selfdoubt
Show how to do the following statement c = a[2] + b[0] a) using register direct, imm, register indirect b) using register direct, imm, absolute addressing c) using register direct, imm, register indirect with displacement
asked
in
CO and Architecture
Mar 13, 2019
187
views
co-and-architecture
addressing-modes
register-allocation
0
votes
0
answers
9
selfdoubt
Show this by following ways : c = a[2] + b[0] a) using register direct, imm, register indirect b) using register direct, imm, absolute addressing c) using register direct, imm, register indirect with displacement
asked
in
CO and Architecture
Mar 13, 2019
23
views
gb2019-gt-coa
0
votes
0
answers
10
Computer Network
(Public Key Notation) Alice and Bob are spouses and each making their own wills. They want to send a copy to their attorney Charlie that only Charlie can read and that shows Alice’s will signed by Alice and seen by Bob and Bob’s will signed by Bob and seen by Alice. Using the notation in the slides. What would be the notation of a message that accomplishes this task?
asked
in
Computer Networks
Feb 23, 2019
365
views
computer-networks
1
vote
0
answers
11
computer network
A Go-Back-5 ARQ scheme is employed on a 200 meters cable between two nodes A and B to send frames of size 10,000 bits with bit rate 1 Mbps and bit error probability of 10$^{-5}$. Headers and acknowledgements are 20 bytes each. The Speed of ... (except for the cable length), what is the maximum distance between the two nodes for which S&W will be as efficient as a GBN.
asked
in
Computer Networks
Feb 23, 2019
636
views
computer-networks
sliding-window
go-back-n
0
votes
1
answer
12
Computer Networks
Assume a 10Mbps Ethernet has two nodes, A and B, connected by a 360m cable with three repeaters in between, and they each have one frame of 1,024 bits to send to each other. Further assume that the signal propagation speed across the cable is 2*10^8 m/sec ... an 8-bit processing delay in addition to a store-and-forward delay. At what time, in seconds, is A's packet delivered at B
asked
in
Computer Networks
Feb 23, 2019
1.0k
views
computer-networks
0
votes
0
answers
13
Digital
asked
in
Digital Logic
Feb 22, 2019
133
views
digital-logic
0
votes
0
answers
14
DLD cse
asked
in
Digital Logic
Feb 22, 2019
257
views
digital-logic
0
votes
1
answer
15
Computer Network
20 Gbps link each user using 5Gbps when active<20% time the user is active> Max. users that the network can be used by? Using circuit switching?
asked
in
Computer Networks
Feb 20, 2019
324
views
computer-networks
0
votes
0
answers
16
gate 2019
Value of Z, for SRTF ques? So that WT avg is 1ms?
asked
in
Operating System
Feb 4, 2019
640
views
usergate2019
usermod
0
votes
0
answers
17
Self Doubt
What does additional memory for tags refer to in Direct Mapping, Associative Mapping and Set- Associative Mapping?
asked
in
CO and Architecture
Jan 5, 2019
115
views
co-and-architecture
cache-memory
direct-mapping
0
votes
1
answer
18
self doubt
$\lim_{x\rightarrow \frac{\pi }{2}}cosx^{cosx}$ can we straight away say $0^{0}=0$ ?
asked
in
Calculus
Jan 5, 2019
218
views
calculus
0
votes
0
answers
19
self doubt
If A = {1,2,3 …. n} then how many multisets of size 4 are possible ,such that atleast of the elements appears twice.
asked
in
Mathematical Logic
Jan 2, 2019
166
views
graph-theory
0
votes
0
answers
20
self doubt
In an undirected graph a self loop counts to how many edges? I read somewhere that in case of undirected graph we consider self loop to have 2 edges?
asked
in
Mathematical Logic
Jan 2, 2019
174
views
maths
Page:
1
2
3
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
I am not sure about others but I would pay 2X...
@DebRC Yes. This, time stamp and comparing...
Small feedback for next year. It would be great...
Pip box does not detect latex code properly. $$...
GO Classes CN Test-4 is here.