# Questions by manisha11

1 vote
1
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
2
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; }
1 vote
3
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?
4
Given an algorithm to tell whether a regular language L contains at least 100 strings
5
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 problem: never swap ... operating-system buffers and process memory then occur only when the process is swapped in. Note that this double buffering itself adds overhead.
6
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
7
Turing machine, language A = {a+b=c | a, b, c are sequences of 1's; |c| = |a| + |b|; |a| >= 0 and |b| > 0}.
8
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
9
(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?
1 vote
10
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 propagation of ... parameter (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.
11
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, CSMA/CD ... has 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
12
13
14
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?
15
Value of Z, for SRTF ques? So that WT avg is 1ms?
16
What does additional memory for tags refer to in Direct Mapping, Associative Mapping and Set- Associative Mapping?
17
$\lim_{x\rightarrow \frac{\pi }{2}}cosx^{cosx}$ can we straight away say $0^{0}=0$ ?