Questions by manisha11 - GATE Overflow

+1 vote

0 answers

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 Jun 7, 2019 in Databases | 66 views

+2 votes

3 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 May 30, 2019 in Programming | 267 views

+1 vote

0 answers

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 May 13, 2019 in Theory of Computation | 49 views

0 votes

1 answer

4

self doubt dfa
Given an algorithm to tell whether a regular language L contains at least 100 strings

asked May 12, 2019 in Theory of Computation | 56 views

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 May 9, 2019 in Operating System | 69 views

0 votes

2 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 May 7, 2019 in Operating System | 228 views

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 Apr 27, 2019 in Theory of Computation | 16 views

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 Mar 13, 2019 in CO and Architecture | 49 views

0 votes

0 answers

9

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 Feb 23, 2019 in Computer Networks | 75 views

+1 vote

0 answers

10

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 Feb 23, 2019 in Computer Networks | 130 views

0 votes

1 answer

11

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 Feb 23, 2019 in Computer Networks | 196 views

0 votes

0 answers

12

Digital

asked Feb 22, 2019 in Digital Logic | 41 views

0 votes

0 answers

13

DLD cse

asked Feb 22, 2019 in Digital Logic | 75 views

0 votes

1 answer

14

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 Feb 20, 2019 in Computer Networks | 128 views

0 votes

1 answer

15

gate 2019
Value of Z, for SRTF ques? So that WT avg is 1ms?

asked Feb 4, 2019 in Operating System | 411 views

0 votes

0 answers

16

Self Doubt
What does additional memory for tags refer to in Direct Mapping, Associative Mapping and Set- Associative Mapping?

asked Jan 5, 2019 in CO and Architecture | 16 views

0 votes

1 answer

17

self doubt
$\lim_{x\rightarrow \frac{\pi }{2}}cosx^{cosx}$ can we straight away say $0^{0}=0$ ?

asked Jan 5, 2019 in Calculus | 54 views

0 votes

0 answers

18

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 Jan 2, 2019 in Mathematical Logic | 40 views

0 votes

0 answers

19

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 Jan 2, 2019 in Mathematical Logic | 31 views

+1 vote

1 answer

20

dbms transactions
Number of serial schedules but not conflict to schedule (S) S: r1(A),r2(A),r3(A),r4(A),w1(B),w2(B),w3(B),w4(B)

asked Dec 17, 2018 in Databases | 149 views

0 votes

1 answer

21

MadeEasy Test Series: Compiler Design - Intermediate Code
a x b x c + d - a + e x f - g + h order of precedence : x>+>- ; with x is left associative and +, - as right. Min number of variables required in TAC? Should'nt the expression be expressed as : ((a x b) x c) + d - a + (e x f) - g + h (((a x b) x c) + (d - (a + (e x f)) - (g + h)))

asked Nov 18, 2018 in Compiler Design | 154 views

0 votes

1 answer

22

MadeEasy Test Series: Compiler Design - Grammar

asked Nov 18, 2018 in Compiler Design | 46 views

0 votes

0 answers

23

Self Doubt

asked Nov 18, 2018 in Compiler Design | 33 views

0 votes

0 answers

24

Self Doubt
If you do every problem in this book, then you will learn discrete mathematics. You learned discrete mathematics. Therefore, you did every problem in this book. The above argument is A Valid and Satisfiable B Valid but not satisfiable C Invalid D Tautology

asked Nov 5, 2018 in Mathematical Logic | 35 views

0 votes

1 answer

25

Self Doubt
formulas represent the sentence, 'He will come on the 8:15 or the 9:15 train; if the former, he will have time to visit us', where p means 'He will come on the 8:15' q means 'He will come on the 9:15' r means 'He will have time to visit us'

asked Oct 29, 2018 in Mathematical Logic | 47 views

0 votes

1 answer

26

Compiler self doubt
Can we comment/compare the number of GOTO moves in LALR and CLR CLR and SLR?

asked Oct 21, 2018 in Compiler Design | 56 views

0 votes

1 answer

27

Thoeory of computation
Equality and completeness problem for DCFL and CFL undecidable?

asked Oct 21, 2018 in Theory of Computation | 100 views

0 votes

2 answers

28

Memory Management
Dynamically Linked Libraries imply more page faults than static? Why?

asked Oct 3, 2018 in Operating System | 64 views

0 votes

1 answer

29

Self Doubt
#include<stdio.h> int main() { int *p; p = (int *)malloc(20); printf("%d\n", sizeof(p)); free(p); return 0; } malloc(20) reserves 20 bytes, why output is 8?

asked Sep 17, 2018 in Programming | 55 views

0 votes

1 answer

30

Self Doubt
If the jobs are non-premptive, then the avg waiting and avg response time will be the same? w.r.t any scheduling algo?

asked Sep 16, 2018 in Operating System | 38 views