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
Questions by vijay_jr
2
votes
1
answer
1
Regular Language
Let $L\mid$ be a regular language and $L_1| = \{x|\mid\text{there exist y}\mid \text{so that xy} \in L| \text{ and} \mid x \mid = 2 \mid y\mid \mid \}$ ... but $L_2|$ is not. $L_2|$ is regular but $L_1|$ is not. Both $L_1|$ and $L_2|$ are regular. Both $L_1|$ and $L_2|$ are not regular.
Let $L\mid$ be a regular language and$L_1| = \{x|\mid\text{there exist y}\mid \text{so that xy} \in L| \text{ and} \mid x \mid = 2 \mid y\mid \mid \}$$L_2| = \{x|\mid\tex...
2.0k
views
asked
Feb 2, 2018
Theory of Computation
theory-of-computation
regular-language
finite-automata
+
–
1
votes
1
answer
2
Test_series
If an idempotent matrix is also Skew-Symmetric then it must be a Null matrix an involuntary matrix an identity matrix Harmitian matrix
If an idempotent matrix is also Skew-Symmetric then it must bea Null matrixan involuntary matrixan identity matrix Harmitian matrix
1.0k
views
asked
Jan 21, 2018
Mathematical Logic
engineering-mathematics
matrix
+
–
1
votes
0
answers
3
Test-Series
212
views
asked
Jan 10, 2018
Programming in C
programming-in-c
+
–
1
votes
0
answers
4
counting
a+b+c<=12 a,b,c $\in Z^{+}$ No. of solution ?
a+b+c<=12a,b,c $\in Z^{+}$No. of solution ?
432
views
asked
Jan 3, 2018
Mathematical Logic
combinatory
counting
discrete-mathematics
+
–
0
votes
1
answer
5
Stop & Wait Protocol
Assume a network that does not drop, duplicate, or corrupt any packets and that you are using a stop-and-wait protocol between two endpoints, A and B. The time it takes for a packet to get from A to B is uniformly distributed between 10 and 20ms. The ... the time you will not have to retransmit it due to a timeout. What is the largest possible timeout you can choose (in ms)?
Assume a network that does not drop, duplicate, or corrupt any packets and that you are using a stop-and-wait protocol between two endpoints, A and B. The time it takes f...
784
views
asked
Dec 14, 2017
Computer Networks
stop-and-wait
computer-networks
+
–
0
votes
0
answers
6
Stanford(Computer Networks)
Assume the configuration below: A ---------------- B --------------- C where A-B has an MTU of 1500 bytes and B-C has an MTU of 400 bytes. Assume that link layer frames require 30 bytes of overhead, an IP header is 20 bytes ... header) that A sends, how many bytes must B send to C (including link layer and IP header overhead)? 1050 bytes 1133 bytes 1135 bytes 1450 bytes
Assume the configuration below:A B - Cwhere A-B has an MTU of 1500 bytes and B-C has an MTU of 400 bytes.Assume that link layer frames require 30 bytes of overhea...
856
views
asked
Dec 11, 2017
Computer Networks
computer-networks
ip-fragmentation
+
–
0
votes
0
answers
7
Stanford(Computer Networks)
Suppose that you have two nodes communicating with an AP that are hidden terminals to one another. The AP, except for acknowledgments, remains silent and there are no other transmitters in the network. The two nodes are both transmitting ... start transmitting at exactly the same time, what is the minimum number of backoffs before a packet is delivered successfully?
Suppose that you have two nodes communicating with an AP that are hidden terminals to one another. The AP, except foracknowledgments, remains silent and there are no othe...
483
views
asked
Dec 11, 2017
Computer Networks
computer-networks
csma-ca
wireless-lan
+
–
1
votes
1
answer
8
Stanford(Automata Theory)
The operation DM(L) is defined as follows: Throw away every even-length string from L. For each odd-length string, remove the middle character. For example, if L = {001, 1100, 10101}, then DM(L) = {01, 1001}. That is, even-length string 1100 is deleted, ... the language of regular expression ((0+1)(0+1))*. DM(L2) is regular; it is the language of regular expression (0+1)*.
The operation DM(L) is defined as follows:Throw away every even-length string from L.For each odd-length string, remove the middle character.For example, if L = {001, 110...
1.7k
views
asked
Dec 5, 2017
Theory of Computation
theory-of-computation
finite-automata
regular-expression
+
–
1
votes
1
answer
9
Stanford(Computer Networks)
You just turned on a four port Ethernet switch (it hasn't learned any addresses yet) and connected a host to each port. You send packet #1 from 00:11:22:33:44:55 to 66:77:88:99:00:11 which arrives at port 1 of your switch. Next, packet #2 is sent from 22: ... 66:77:88:99:00:11 with port 1 Packet #2 is only sent out on port 1 Packet #2 is sent out on ports 1, 2, 4
You just turned on a four port Ethernet switch (it hasn’t learned any addresses yet) and connected a host to each port. You send packet #1 from 00:11:22:33:44:55 to 66:...
955
views
asked
Dec 4, 2017
Computer Networks
computer-networks
network-switching
+
–
0
votes
0
answers
10
Stanford(Quiz)
Network A consists of a hub with twenty ports, each connected to exactly one end host. Network B is identical, except the hub is replaced by a switch. Which of the following are true? If the end hosts in both networks try to send the same ... can be successfully transferred simultaneously between the end hosts. The nodes in Network B can be further apart than the nodes in Network A.
Network A consists of a hub with twenty ports, each connected to exactly one end host. Network B is identical, except the hub is replaced by a switch. Which of the follow...
943
views
asked
Dec 4, 2017
Computer Networks
computer-networks
network-switching
routers-bridge-hubs-switches
+
–
0
votes
1
answer
11
Doubt!
You generate a perfectly random key K. You send two messages, M1 and M2, encrypted with K (C1 = K xor M1 and C2 = K xor M2). Does sending C2 leak information about M1 and M2?
You generate a perfectly random key K. You send two messages, M1 and M2, encrypted with K (C1 = K xor M1 and C2 = K xor M2). Does sending C2 leak information about M1 and...
359
views
asked
Dec 2, 2017
Computer Networks
cryptography
network-security
+
–
4
votes
1
answer
12
Stanford(Regular expression)
This DFA accepts a certain language L. In this problem we shall consider certain other languages that are defined by their tails, that is, languages of the form (0+1)*w, for some particular string w of 0's and 1's. Call this language L(w). Depending on w, ... . B). L(110101) is contained in L. C). L(1111001) is contained in L. D). L(110101) is disjoint from L.
This DFA accepts a certain language L. In this problem we shall consider certain other languages that are defined by their tails, that is, languages of the form (0+1)*w, ...
1.4k
views
asked
Dec 2, 2017
Theory of Computation
regular-expression
theory-of-computation
regular-language
+
–
5
votes
1
answer
13
Stanford (Automata Theory)
The finite automaton above accepts no word of length zero, no word of length one, and only two words of length two (01 and 10). There is a fairly simple recurrence equation for the number N(k) of words of length k that this automaton accepts. Discover this recurrence ... by identifying the correct value of N(k) for some particular k. N(12)=10 N(12)=44 N(12)=50 N(13)=16
The finite automaton above accepts no word of length zero, no word of length one, and only two words of length two (01 and 10). There is a fairly simple recurrence equati...
1.9k
views
asked
Nov 27, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
0
answers
14
OS-(How to approach?)
A disk has 8 equidistant tracks. The diameters of the innermost and outermost tracks are 1 cm and 8 cm respectively. The innermost track has a storage capacity of 10 MB. If the disk has 20 sectors per track and is currently at the end of the 5th sector ... of 6000 rpm, how much time will it take to read 1 MB contiguous data starting from the sector 4 of the outer most track?
A disk has 8 equidistant tracks. The diameters of the innermost and outermost tracks are 1 cm and 8 cm respectively. The innermost track has a storage capacity of 10 MB.I...
402
views
asked
Nov 16, 2017
Operating System
operating-system
disk-scheduling
+
–
0
votes
1
answer
15
how to prove?
If abc(a+b+c)=3, prove that (a+b)(b+c)(c+a)≥8
If abc(a+b+c)=3, prove that (a+b)(b+c)(c+a)≥8
247
views
asked
Apr 14, 2017
Others
engineering-mathematics
+
–
1
votes
0
answers
16
Explanation needed!!
You roll a fair four-sided die. If the result is 1 or 2, you roll once more but otherwise, you stop. What is the probability that the sum total of your rolls is at least 4? 9/8 9/16 3/5 1/16
You roll a fair four-sided die. If the result is 1 or 2, you roll oncemore but otherwise, you stop. What is the probability that the sum total of yourrolls is at least 4?...
882
views
asked
Apr 4, 2017
2
votes
1
answer
17
Testbook Question
number of boxes in the grid number of lines on the side of grid number of squares that can be made in the grid number of possible paths to top-left to bottom-right of the grid
number of boxes in the gridnumber of lines on the side of gridnumber of squares that can be made in the gridnumber of possible paths to top-left to bottom-right of the gr...
393
views
asked
Jan 12, 2017
0
votes
1
answer
18
Testbook question, Answer please
286
views
asked
Jan 12, 2017
Programming in C
programming-in-c
+
–
3
votes
2
answers
19
Testbook question
b*2 b*c-2 b+c*2 none of these
b*2b*c-2b+c*2none of these
397
views
asked
Jan 11, 2017
Programming in C
programming-in-c
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register