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 aditi19
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.
answered
in
Combinatory
Jan 21, 2021
454
views
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$}.
commented
in
Theory of Computation
Jun 11, 2020
914
views
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}.
answered
in
Theory of Computation
Jun 7, 2020
540
views
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.
answer edited
in
Theory of Computation
Jun 7, 2020
1.6k
views
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$?$
commented
in
Theory of Computation
May 20, 2020
551
views
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.
commented
in
Operating System
Jan 20, 2020
1.6k
views
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)$
commented
in
DS
Dec 20, 2019
23.0k
views
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.$
commented
in
Compiler Design
Dec 9, 2019
7.9k
views
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 _________.
commented
in
CO and Architecture
Nov 25, 2019
24.2k
views
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$
commented
in
CO and Architecture
Nov 25, 2019
19.6k
views
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 _________.
answer selected
in
Digital Logic
Nov 19, 2019
3.7k
views
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!)$
commented
in
Algorithms
Nov 11, 2019
13.6k
views
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??
commented
in
Mathematical Logic
Nov 9, 2019
7.5k
views
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
commented
in
Compiler Design
Nov 7, 2019
7.8k
views
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?
commented
in
DS
Oct 23, 2019
967
views
data-structures
programming-in-c
2
answers
16
Gatebook Test
answered
in
Linear Algebra
Oct 22, 2019
489
views
1
answer
17
Gatebook Test
answered
in
Linear Algebra
Oct 22, 2019
436
views
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}$ ?
commented
in
Linear Algebra
Oct 22, 2019
516
views
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.
answered
in
Computer Networks
Oct 21, 2019
1.7k
views
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?
answered
in
Computer Networks
Oct 21, 2019
1.0k
views
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’’.
commented
in
Computer Networks
Oct 21, 2019
2.2k
views
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?
commented
in
Computer Networks
Oct 16, 2019
21.7k
views
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?
answered
in
Computer Networks
Oct 14, 2019
1.3k
views
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?
answered
in
Computer Networks
Oct 14, 2019
1.0k
views
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.
answered
in
Computer Networks
Oct 14, 2019
987
views
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?
answered
in
Computer Networks
Oct 14, 2019
1.0k
views
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?
answered
in
Computer Networks
Oct 14, 2019
870
views
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
answered
in
Compiler Design
Oct 10, 2019
10.5k
views
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))$
answered
in
Compiler Design
Oct 10, 2019
2.5k
views
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
answered
in
Computer Networks
Oct 6, 2019
5.0k
views
computer-networks
tanenbaum
ip-addressing
subnetting
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:...