Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by aditi19
1
answer
1
Kenneth Rosen Edition 7 Exercise 6.2 Question 38 (Page No. 406)
Find the least number of cables required to connect eight computers to four printers to guarantee that for every choice of four of the eight computers, these four computers can directly access four different printers. Justify your answer.
Find the least number of cables required to connect eight computers to four printers to guarantee that for every choice of four of the eight computers, these four compute...
470
views
answered
Jan 21, 2021
Combinatory
kenneth-rosen
discrete-mathematics
counting
pigeonhole-principle
descriptive
+
–
6
answers
2
Peter Linz Edition 4 Exercise 5.1 Question 7 (Page No. 133)
Find context-free grammars for the following languages (with $n ≥ 0, m ≥ 0$). (a) $L =$ {$a^nb^m : n ≤ m + 3$}. (b) $L =$ {$a^nb^m : n ≠ m − 1$ ... $v$ is any prefix of $w$}. (g) $L =$ {$w ∈$ {$a,b$}$^* : n_a (w) = 2n_b(w) + 1$}.
Find context-free grammars for the following languages (with $n ≥ 0, m ≥ 0$).(a) $L =$ {$a^nb^m : n ≤ m + 3$}.(b) $L =$ {$a^nb^m : n ≠ m − 1$}.(c) https://gateo...
931
views
commented
Jun 11, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
context-free-language
context-free-grammar
+
–
2
answers
3
Peter Linz Edition 4 Exercise 3.2 Question 13 (Page No. 88)
Find a regular expression for the following languages on {$a, b$}. (a) $L =$ {$w : n_a (w)$ and $n_b (w)$ are both even}. (b) $L =$ {$w :(n_a (w) - n_b (w))$ mod $3 = 1$}. (c) $L =$ {$w :(n_a (w) - n_b (w))$ mod $3 = 0$}. (d) $L =$ {$w :2n_a (w)+3n_b (w)$ is even}.
Find a regular expression for the following languages on {$a, b$}.(a) $L =$ {$w : n_a (w)$ and $n_b (w)$ are both even}.(b) $L =$ {$w :(n_a (w) - n_b (w))$ mod $3 = 1$}.(...
551
views
answered
Jun 7, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
regular-expression
+
–
1
answer
4
Peter Linz Edition 4 Exercise 3.1 Question 16 (Page No. 76)
Give regular expressions for the following languages on $Σ =$ {$a, b, c$}. (a) all strings containing exactly one $a$, (b) all strings containing no more than three $a$'s, (c) Peter Linz Edition 4 Exercise 3.1 Question 16.c ... 16.d (Page No. 76) (e) all strings in which all runs of $a$'shave lengths that are multiples of three.
Give regular expressions for the following languages on $Σ =$ {$a, b, c$}.(a) all strings containing exactly one $a$,(b) all strings containing no more than three $a$’...
1.6k
views
answer edited
Jun 7, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-expression
+
–
1
answer
5
Michael Sipser Edition 3 Exercise 2 Question 9 (Page No. 155)
Give a context-free grammar that generates the language $A=\{a^{i}b^{j}c^{k}\mid i=j$ $\text{or}$ $ j=k$ $\text{where}$ $ i,j,k\geq 0\}.$ Is your grammar ambiguous$?$ Why or why not$?$
Give a context-free grammar that generates the language $A=\{a^{i}b^{j}c^{k}\mid i=j$ $\text{or}$ $ j=k$ $\text{where}$ $ i,j,k\geq 0\}.$ Is your grammar ambiguous$?$ Why...
555
views
commented
May 20, 2020
Theory of Computation
michael-sipser
theory-of-computation
context-free-language
ambiguous
grammar
+
–
2
answers
6
Segmented Paging
Consider a process of 200 KB which has 2 segments each segment size is 256 KB ,Calculate overhead in segmented paging.The page table entry is 4B, segment table entry is 2 B ,Page size is 2KB.
Consider a process of 200 KB which has 2 segments each segment size is 256 KB ,Calculate overhead in segmented paging.The page table entry is 4B, segment table entry is 2...
1.6k
views
commented
Jan 20, 2020
Operating System
segmentation
+
–
8
answers
7
GATE CSE 2005 | Question: 36
In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal node is: $nk$ $(n-1)k + 1$ $n(k-1) +1$ $n(k-1)$
In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal node is:$nk$$(n-1)k + 1$$n(k-1) +1$$n(k-1)...
23.1k
views
commented
Dec 20, 2019
DS
gatecse-2005
data-structures
tree
normal
+
–
2
answers
8
Ullman (Compiler Design) Edition 2 Exercise 5.2 Question 3 (Page No. 317)
Suppose that we have a production $A\rightarrow BCD$. Each of the four nonterminals $A, B, C,$ and $D$ have two attributes: $s$ is a synthesized attribute, and $i$ is an inherited attribute. For each of the sets of rules below, tell whether the rules are consistent ... $A.s=D.i,B.i=A.s+C.s,C.i=B.s,$ and $D.i=B.i+C.i.$
Suppose that we have a production $A\rightarrow BCD$. Each of the four nonterminals $A, B, C,$ and $D$ have two attributes: $s$ is a synthesized attribute, and $i$ is an ...
8.2k
views
commented
Dec 9, 2019
Compiler Design
ullman
compiler-design
syntax-directed-translation
+
–
7
answers
9
GATE CSE 2018 | Question: 51
A processor has $16$ integer registers $\text{(R0, R1}, \ldots ,\text{ R15)}$ and $64$ floating point registers $\text{(F0, F1}, \ldots , \text{F63)}.$ It uses a $2\text{- byte}$ instruction format. There are four categories of ... $\text{(1F)}.$ The maximum value of $\text{N}$ is _________.
A processor has $16$ integer registers $\text{(R0, R1}, \ldots ,\text{ R15)}$ and $64$ floating point registers $\text{(F0, F1}, \ldots , \text{F63)}.$ It uses a $2\text{...
24.3k
views
commented
Nov 25, 2019
CO and Architecture
gatecse-2018
co-and-architecture
machine-instruction
instruction-format
numerical-answers
2-marks
+
–
4
answers
10
GATE CSE 2004 | Question: 64
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ ... }\\\hline \end{array} The total number of clock cycles required to execute the program is $29$ $24$ $23$ $20$
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$\begin{array}{|l|l|c|} \hline \text {Instruction} & \text...
19.7k
views
commented
Nov 25, 2019
CO and Architecture
gatecse-2004
co-and-architecture
machine-instruction
normal
+
–
2
answers
11
GATE-ECE-2018
Consider a binary channel code in which each codeword has a fixed length of 5 bits. The Hamming distance between any pair of distinct codewords in this code is at least 2. The maximum number of codewords such a code can contain is _________.
Consider a binary channel code in which each codeword has a fixed length of 5 bits. The Hamming distance between any pair of distinct codewords in this code is at least 2...
3.7k
views
answer selected
Nov 19, 2019
Digital Logic
usergate2018
digital-logic
hamming-code
+
–
4
answers
12
GATE CSE 2001 | Question: 1.14
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using Randomized quicksort? $O(n)$ $O(n \log n)$ $O(n^2)$ $O(n!)$
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using Randomized quicksort?$O...
13.7k
views
commented
Nov 11, 2019
Algorithms
gatecse-2001
algorithms
sorting
time-complexity
easy
+
–
1
answer
13
Use quantifiers to express:->There is exactly one person whom everybody loves
Let L(x, y) be the statement "x loves y," where the do­main for both x and y consists of all people in the world. Use quantifiers to express: Q->There is exactly one person whom everybody ... z=x) ) Can anyone explain the answer and how to solve these questions i mean how to analyze these questions??
Let L(x, y) be the statement "x loves y," where the do­main for both x and y consists of all people in the world. Use quantifiers to express: Q->There is exactly one ...
7.5k
views
commented
Nov 9, 2019
1
answer
14
Ullman (Compiler Design) Edition 2 Exercise 6.2 Question 2 (Page No. 370)
Translate the following arithmetic expression into: $a=b[i]+c[j]$ $a[i]=b\ast c-b\ast d$ $x=f(y+1)+2$ $x=\ast p + \&y$ A Syntax tree Quadruples Triples Indirect triples
Translate the following arithmetic expression into:$a=b[i]+c[j]$$a[i]=b\ast c-b\ast d$$x=f(y+1)+2$$x=\ast p + \&y$ A Syntax treeQuadruplesTriplesIndirect triples
8.0k
views
commented
Nov 7, 2019
Compiler Design
ullman
compiler-design
three-address-code
intermediate-code
descriptive
+
–
1
answer
15
Data Structures Resource
Hello everyone. Can anyone suggest me a good book for Data Structures for GATE. Horowitz and Weiss are available in .chm format and its really difficult to read from them. Any other suggestions. Also, I have a good knowledge of C, but i have to formally study it for GATE. Any suggestions for this too?
Hello everyone.Can anyone suggest me a good book for Data Structures for GATE. Horowitz and Weiss are available in .chm format and its really difficult to read from them....
982
views
commented
Oct 23, 2019
DS
data-structures
programming-in-c
+
–
2
answers
16
Gatebook Test
500
views
answered
Oct 22, 2019
1
answer
17
Gatebook Test
450
views
answered
Oct 22, 2019
0
answers
18
Eigen Values Doubt
Let there is a 2*2 Matrix and their eigen values are A and B. The eigen values of $(A+7I)^{-1}$ ?
Let there is a 2*2 Matrix and their eigen values are A and B. The eigen values of $(A+7I)^{-1}$ ?
519
views
commented
Oct 22, 2019
Linear Algebra
eigen-value
engineering-mathematics
linear-algebra
+
–
1
answer
19
Andrew S. Tanenbaum Edition 5th Exercise 8 Question 32 (Page No. 874)
The Diffie-Hellman key exchange is being used to establish a secret key between Alice and Bob. Alice sends Bob (227, 5, 82). Bob responds with (125). Alice’s secret number, x, is 12, and Bob’s secret number, y, is 3. Show how Alice and Bob compute the secret key.
The Diffie-Hellman key exchange is being used to establish a secret key betweenAlice and Bob. Alice sends Bob (227, 5, 82). Bob responds with (125). Alice’ssecret numbe...
1.7k
views
answered
Oct 21, 2019
Computer Networks
computer-networks
tanenbaum
network-security
cryptography
+
–
1
answer
20
Andrew S. Tanenbaum Edition 5th Exercise 8 Question 18 (Page No. 873)
Alice and Bob use RSA public key encryption in order to communicate between them. Trudy finds out that Alice and Bob shared one of the primes used to determine the number n of their public key pairs. In other words, Trudy found out that na = pa × q and nb = pb × q. How can Trudy use this information to break Alice’s code?
Alice and Bob use RSA public key encryption in order to communicate between them.Trudy finds out that Alice and Bob shared one of the primes used to determine thenumber n...
1.0k
views
answered
Oct 21, 2019
Computer Networks
computer-networks
network-security
rsa-security-networks
tanenbaum
+
–
2
answers
21
Andrew S. Tanenbaum Edition 5th Exercise 8 Question 17 (Page No. 873)
Using the RSA public key cryptosystem, with a = 1, b = 2 . . . y = 25, z = 26. (a) If p = 5 and q = 13, list five legal values for d. (b) If p = 5, q = 31, and d = 37, find e. (c) Using p = 3, q = 11, and d = 9, find e and encrypt ‘‘hello’’.
Using the RSA public key cryptosystem, with a = 1, b = 2 . . . y = 25, z = 26.(a) If p = 5 and q = 13, list five legal values for d.(b) If p = 5, q = 31, and d = 37, find...
2.3k
views
commented
Oct 21, 2019
Computer Networks
computer-networks
tanenbaum
network-security
rsa-security-networks
+
–
11
answers
22
GATE CSE 2014 Set 3 | Question: 27
Every host in an $\textsf{IPv4}$ network has a $1\text{-second}$ resolution real-time clock with battery backup. Each host needs to generate up to $1000$ ... globally unique ID for this purpose. After what period (in seconds) will the identifiers generated by a host wrap around?
Every host in an $\textsf{IPv4}$ network has a $1\text{-second}$ resolution real-time clock with battery backup. Each host needs to generate up to $1000$ unique identifie...
21.8k
views
commented
Oct 16, 2019
Computer Networks
gatecse-2014-set3
computer-networks
ip-addressing
numerical-answers
normal
+
–
1
answer
23
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 36 (Page No. 609)
In a network whose max segment is 128 bytes, max segment lifetime is 30 sec, and has 8-bit sequence numbers, what is the maximum data rate per connection?
In a network whose max segment is 128 bytes, max segment lifetime is 30 sec, andhas 8-bit sequence numbers, what is the maximum data rate per connection?
1.3k
views
answered
Oct 14, 2019
Computer Networks
computer-networks
tanenbaum
transport-layer
+
–
1
answer
24
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 33 (Page No. 609)
A TCP machine is sending full windows of 65,535 bytes over a 1-Gbps channel that has a 10-msec one-way delay. What is the maximum throughput achievable? What is the line efficiency?
A TCP machine is sending full windows of 65,535 bytes over a 1-Gbps channel thathas a 10-msec one-way delay. What is the maximum throughput achievable? What isthe line ef...
1.1k
views
answered
Oct 14, 2019
Computer Networks
computer-networks
tanenbaum
transport-layer
tcp
+
–
2
answers
25
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 31 (Page No. 609)
Suppose that the TCP congestion window is set to 18 KB and a timeout occurs. How big will the window be if the next four transmission bursts are all successful? Assume that the maximum segment size is 1 KB.
Suppose that the TCP congestion window is set to 18 KB and a timeout occurs. Howbig will the window be if the next four transmission bursts are all successful? Assumethat...
1.0k
views
answered
Oct 14, 2019
Computer Networks
computer-networks
transport-layer
tanenbaum
congestion-control
+
–
2
answers
26
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 28 (Page No. 608)
The maximum payload of a TCP segment is 65,495 bytes. Why was such a strange number chosen?
The maximum payload of a TCP segment is 65,495 bytes. Why was such a strangenumber chosen?
1.0k
views
answered
Oct 14, 2019
Computer Networks
computer-networks
transport-layer
descriptive
tcp
tanenbaum
+
–
1
answer
27
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 22 (Page No. 608)
What is the total size of the minimum TCP MTU, including TCP and IP overhead but not including data link layer overhead?
What is the total size of the minimum TCP MTU, including TCP and IP overhead butnot including data link layer overhead?
901
views
answered
Oct 14, 2019
Computer Networks
computer-networks
tanenbaum
transport-layer
tcp
descriptive
+
–
1
answer
28
Ullman (Compiler Design) Edition 2 Exercise 6.2 Question 1 (Page No. 370)
Translate the arithmetic expression $a + -(b + c)$ into: A syntax tree. Quadruples. Triples. Indirect triples
Translate the arithmetic expression $a + -(b + c)$ into:A syntax tree.Quadruples.Triples.Indirect triples
11.0k
views
answered
Oct 10, 2019
Compiler Design
ullman
compiler-design
three-address-code
intermediate-code
descriptive
+
–
2
answers
29
Ullman (Compiler Design) Edition 2 Exercise 6.1 Question 1 (Page No. 362)
Construct the DAG for the expression $((x + y)-((x + y)\ast(x -y))) + ((x+y)\ast(x-y))$
Construct the DAG for the expression$((x + y)-((x + y)\ast(x -y))) + ((x+y)\ast(x-y))$
2.6k
views
answered
Oct 10, 2019
Compiler Design
ullman
compiler-design
three-address-code
directed-acyclic-graph
descriptive
+
–
1
answer
30
Andrew S. Tanenbaum Edition 5th Exercise 5 Question 33 (Page No. 492)
A router has the following (CIDR) entries in its routing table: Address/Mask Next hop 135.46.56.0/22 Interface 0 135.46.60.0/22 Interface 1 192.53.40.0/23 Router 1 default Router 2 For each of the following IP addresses, what does the router do if a ... 135.46.63.10 (b) 135.46.57.14 (c) 135.46.52.2 (d) 192.53.40.7 (e) 192.53.56.7
A router has the following (CIDR) entries in its routing table: Address/MaskNext hop135.46.56.0/22Interface 0135.46.60.0/22Interface 1192.53.40.0/23Router 1defaultRouter...
5.2k
views
answered
Oct 6, 2019
Computer Networks
computer-networks
tanenbaum
ip-addressing
subnetting
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register