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 abhishek14893
1
answer
1
Theory Of computation
How many maximum number of production rules are possible in regular grammar equivalent to a given n state DFA, over the input alphabet {a,b,c} where q1 is always the initial state? Answer: 6n + 1
How many maximum number of production rules are possible in regular grammar equivalent to a given n state DFA, over the input alphabet {a,b,c} where q1 is always the init...
687
views
answered
Jan 10, 2019
Theory of Computation
theory-of-computation
finite-automata
+
–
1
answer
2
UGC NET CSE | September 2013 | Part 2 | Question: 25
If F and G are Boolean functions of degree n. Then, which of the following is true? F $\leq$ F + G and F G $\leq$ F G $\leq$ F + G and F G $\geq$ G F $\geq$ F + G and F G $\leq$ F G $\geq$ F + G and F G $\leq$ F
If F and G are Boolean functions of degree n. Then, which of the following is true?F $\leq$ F + G and F G $\leq$ FG $\leq$ F + G and F G $\geq$ GF $\geq$ F + G and F G $\...
2.2k
views
commented
Sep 4, 2018
Set Theory & Algebra
functions
ugcnetsep2013ii
+
–
5
answers
3
UGC NET CSE | December 2015 | Part 2 | Question: 6
Which of the following arguments are not valid? "If Gora gets the job and works hard, then he will be promoted. if Gora gets promotion, then he will be happy. He will not be happy, therefore, either he will not get the job or he will not work hard. ... $n^2 > 1$, then $n>1$. i and iii ii and iii i,ii, and iii i and ii
Which of the following arguments are not valid?"If Gora gets the job and works hard, then he will be promoted. if Gora gets promotion, then he will be happy. He will not ...
6.3k
views
commented
Aug 28, 2018
Mathematical Logic
ugcnetcse-dec2015-paper2
discrete-mathematics
mathematical-logic
+
–
1
answer
4
Kenneth Rosen Edition 6th Exercise 1.1 Question 19 (Page No. 18)
Write each of these statements in the form if p, then q in English. [Hint: Refer to the list of common ways to express conditional statements.] It snows whenever the wind blows from the northeast. The apple trees will bloom ... if you bought your CD player less than 90 days ago. Jan will go swimming unless the water is too cold.
Write each of these statements in the form “if p, then q” in English. [Hint: Refer to the list of common ways to express conditional statements.]It snows whenever the...
6.9k
views
commented
Aug 27, 2018
Mathematical Logic
mathematical-logic
discrete-mathematics
kenneth-rosen
+
–
1
answer
5
UGC NET CSE | September 2013 | Part 3 | Question: 1
Which of the following is a correct predicate logic statement for Every Natural number has one successor ? $\forall x \exists y (succ(x,y) \wedge (\exists z\; succ(x, z) \Rightarrow equal (y,z)))$ ... $\forall x \exists y (succ(x,y))$
Which of the following is a correct predicate logic statement for “Every Natural number has one successor”?$\forall x \exists y (succ(x,y) \wedge (\exists z\; succ(x,...
2.5k
views
commented
Aug 27, 2018
Mathematical Logic
first-order-logic
ugcnetcse-sep2013-paper3
+
–
1
answer
6
MadeEasy Test Series: Digital Logic - Number Representation
Consider the addition of the two numbers 10001110 and 10000000 in an 8-bit ALU. Which of the following best summarizes the result and the status of the Z(zero), S(sign), C(carry) and O(overflow) flags? Assume that the numbers are represented in 2's Complement format ... = 0, O =1, S = 0 d) Sum = 100001110, Z = 0, C = 1, O =1, S = 0
Consider the addition of the two numbers 10001110 and 10000000 in an 8-bit ALU. Which of the following best summarizes the result and the status of the Z(zero), S(sign), ...
625
views
commented
Aug 9, 2017
CO and Architecture
made-easy-test-series
digital-logic
number-representation
+
–
3
answers
7
Digital logic : Find the value of f
I know , this is pretty basic question , still could not get it right I got the answer as $B + \overline{C}$ Am I doing something terribly stupid here ?
I know , this is pretty basic question , still could not get it rightI got the answer as $B + \overline{C}$Am I doing something terribly stupid here ?
788
views
commented
Jul 29, 2017
Digital Logic
digital-logic
combinational-circuit
+
–
2
answers
8
No. of Half Adders
How many half adders are required to realize the following $4$ functions? $f_1=A\oplus B\oplus C$ $f_2=\overline{A}BC+A\overline{B}C$ $f_3=AB\overline{C}+(\overline{A}+\overline{B})C$ $f_4=ABC$
How many half adders are required to realize the following $4$ functions?$f_1=A\oplus B\oplus C$$f_2=\overline{A}BC+A\overline{B}C$$f_3=AB\overline{C}+(\overline{A}+\over...
1.2k
views
answer edited
Jul 21, 2017
Digital Logic
combinational-circuit
+
–
7
answers
9
GATE CSE 2016 Set 2 | Question: 07
Consider an eight-bit ripple-carry adder for computing the sum of $A$ and $B$, where $A$ and $B$ are integers represented in $2$'s complement form. If the decimal value of $A$ is one, the decimal value of $B$ that leads to the longest latency for the sum to stabilize is ___________
Consider an eight-bit ripple-carry adder for computing the sum of $A$ and $B$, where $A$ and $B$ are integers represented in $2$'s complement form. If the decimal value o...
19.4k
views
commented
Jul 20, 2017
Digital Logic
gatecse-2016-set2
digital-logic
adder
normal
numerical-answers
+
–
3
answers
10
Which of the following decomposition is NOT lossless?
Suppose we have a relation $R(X, Y, Z, W)$ with the FD's: $X \to Y, Y \to Z, Z \to W$ Which one of the following decompositions is not lossless (i.e., for some instance of $R$, the natural join of the decomposed relations is not equal to $R$? ... $R_{1}(X, W), R_{2}(Y, W), R_{3}(Z, W)$ None of the above (that is they are all lossless)
Suppose we have a relation $R(X, Y, Z, W)$ with the FD's:$$X \to Y, Y \to Z, Z \to W$$Which one of the following decompositions is not lossless (i.e., for some instance o...
836
views
commented
Jul 10, 2017
Databases
databases
database-normalization
+
–
2
answers
11
SELECTIVE REPEAT - CN
Window size: 3 Every 3rd packet get lost. Total packet to send: 7 What would be total no. Of transmission? Use selective repeat
Window size: 3Every 3rd packet get lost.Total packet to send: 7What would be total no. Of transmission? Use selective repeat
1.9k
views
answered
Jul 4, 2017
2
answers
12
from swp
in what protocol or protocols, it is possible for the sender to receive an ack for a packet that falls outside of its current window a. stop and wait b. selective repeat c.gbn d. all of the above
in what protocol or protocols, it is possible for the sender to receive an ack for a packet that falls outside of its current window a. stop and wait b. select...
1.1k
views
answered
Jun 28, 2017
Computer Networks
computer-networks
sliding-window
+
–
2
answers
13
ISRO-2013-19
What is the maximum number of characters (7 bits + parity) that can be transmitted in a second on a $19.2$ Kbps line. This asynchronous transmission requires $1$ start bit and $1$ stop bit. $192$ $240$ $1920$ $1966$
What is the maximum number of characters (7 bits + parity) that can be transmitted in a second on a $19.2$ Kbps line. This asynchronous transmission requires $1$ start bi...
5.5k
views
answered
Jun 28, 2017
Computer Networks
isro2013
serial-communication
+
–
2
answers
14
Peterson Davie 3.38c
Suppose an $IP$ packet is fragmented into $10$ fragments, each with a $1$% (independent) probability of loss. To a reasonable approximation, this means there is a $10$% chance of losing the whole packet due to loss of a fragment. What is the ... loss of the whole packet if the packet is transmitted twice, (c) Explain how use of the Ident field might be applicable here.
Suppose an $IP$ packet is fragmented into $10$ fragments, each with a $1$% (independent) probability of loss. To a reasonable approximation, this means there is a $10$% c...
696
views
answered
Jun 28, 2017
Computer Networks
peterson-davie
descriptive
difficult
+
–
2
answers
15
Peterson Davie 3.38a
Suppose an $IP$ packet is fragmented into $10$ fragments, each with a $1$% (independent) probability of loss. To a reasonable approximation, this means there is a $10$% chance of losing the whole packet due to loss of a fragment. What is ... of the whole packet if the packet is transmitted twice, (a) Assuming all fragments received must have been part of the same transmission?
Suppose an $IP$ packet is fragmented into $10$ fragments, each with a $1$% (independent) probability of loss. To a reasonable approximation, this means there is a $10$% c...
514
views
answered
Jun 28, 2017
Computer Networks
peterson-davie
descriptive
difficult
+
–
4
answers
16
Ckt switching
is the total time in ckt switching is more than the packet switching
is the total time in ckt switching is more than the packet switching
2.0k
views
answered
Jun 27, 2017
Computer Networks
network-switching
+
–
1
answer
17
propagation delay
Two hosts are connected via a packet switch with 107 bits per second links. Each link has a propagation delay of 20 microseconds. The switch begins forwarding a packet 35 microseconds after it receives the same. If 100 bits of data are to be transmitted ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is _____.
Two hosts are connected via a packet switch with 107 bits per second links. Each link has a propagation delay of 20 microseconds. The switch begins forwarding a packet 35...
2.0k
views
commented
Jun 27, 2017
Computer Networks
computer-networks
network-switching
+
–
1
answer
18
Calculating frame length when bit rate, propagation delay(in bits) and length of link is given.
Assume CSMA/CD protocol. Find the least frame length in bytes for a 2 Mbps bit rate and 1.5km long network where propagation delay is 4.25 nano seconds per metre _______
Assume CSMA/CD protocol. Find the least frame length in bytes for a 2 Mbps bit rate and 1.5km long network where propagation delay is 4.25 nano seconds per metre _______
2.3k
views
commented
Jun 26, 2017
Computer Networks
computer-networks
frame
csma-cd
+
–
3
answers
19
Delay - Computer Networks
We wish to send a message of size $150,000$ bytes over the network. There are four hops, each of length $20km$ and running at $100 Mb/s$. Before sending we split the message into $1500$ byte packets. What is the end-to-end delay of the message? ... . # The delay over each of the links is identical. # Net queueing delay is zero. # Net nodal processing delay is zero.
We wish to send a message of size $150,000$ bytes over the network. There are four hops, each of length $20km$ and running at $100 Mb/s$. Before sending we split the mess...
2.3k
views
answered
Jun 26, 2017
Computer Networks
computer-networks
delay
+
–
3
answers
20
Question on hamming code with even parity
Please check how the correct answer is B.
Please check how the correct answer is B.
5.0k
views
comment edited
Jun 26, 2017
Computer Networks
computer
computer-networks
hamming-code
+
–
5
answers
21
MadeEasy Test Series: Computer Networks - Congestion Control
Initially (as slow start ) full window 12MSS cwnd = 1MSS ssthresh = 6MSS 1MSS sent after 1st RTT -> cwnd = 2 , and so on subsequent RTT -> 4 , 5 ,6, 7, 8,9,10,11,12 so 11RTT so answer should be 110ms but none of the option matches
Initially (as slow start )full window 12MSScwnd = 1MSSssthresh = 6MSS1MSS sent after 1st RTT - cwnd = 2 ,and so on subsequent RTT - 4 , 5 ,6, 7, 8,9,10,11,12so 11RTTso an...
1.6k
views
answered
Jun 26, 2017
Computer Networks
made-easy-test-series
computer-networks
congestion-control
+
–
1
answer
22
Testing Connectivity/LoopBack Address
A system is connected to n/w 192.168.1.0 with IP 192.168.1.2 . System will check its connectivity to Internet by sending control packet SIP- 192.168.1.2 DIP- ? 192.168.1.0 192.168.1.1 127.1.1.1 127.0.0 ... ? Nothing going through the loopback adapter goes out to the Internet, or leaves your system. The loopback adapter is completely contained within the system
A system is connected to n/w 192.168.1.0 with IP 192.168.1.2 . System will check its connectivity to Internet by sending control packetSIP- 192.168.1.2DIP- ?192.168.1.019...
891
views
answer edited
Jun 20, 2017
Computer Networks
network-addressing
computer-networks
ip-addressing
+
–
5
answers
23
A host with IP address 10.100.100.100 wants to use loopback testing,WHAT are the source and destination addresses?
1. 10.100.100.100 & 10.100.100.1002. 10.100.100.100 & 255.255.255.2553. 10.100.100.100 & 127.1.100.14. 127.100.100.100 & 10.100.100.100
5.2k
views
answer edited
Jun 20, 2017
Computer Networks
network-addressing
+
–
9
answers
24
GATE CSE 2015 Set 2 | Question: 52
$\text{Host A}$ sends a $\text{UDP}$ datagram containing $8880\text{ bytes}$ of user data to $\text{host B}$ over an $\text{Ethernet LAN}.$ Ethernet frames may carry data up to $1500\text{ bytes (i.e. MTU = 1500 bytes)}.$ Size of $\text{UDP}$ ... be the contents of offset field in the last fragment? $6$ and $925$ $6$ and $7400$ $7$ and $1110$ $7$ and $8880$
$\text{Host A}$ sends a $\text{UDP}$ datagram containing $8880\text{ bytes}$ of user data to $\text{host B}$ over an $\text{Ethernet LAN}.$ Ethernet frames may carry data...
25.8k
views
commented
Jun 17, 2017
Computer Networks
gatecse-2015-set2
computer-networks
ip-packet
normal
+
–
2
answers
25
class c network subnet problem
A class c n/w has been connected to a router with mask 255.255.255.49. a packet with ip 195.200.180.173 arrived at router.find the no of subnet in the network.
A class c n/w has been connected to a router with mask 255.255.255.49. a packet with ip 195.200.180.173 arrived at router.find the no of subnet in the network.
596
views
answered
Jun 17, 2017
Computer Networks
computer-networks
network-addressing
+
–
3
answers
26
CN: Go Back N
Station A needs to send a message consisting of 15 packets to station B' using a sling window (window size 4) and go-back-N error control strategy. All packets are ready and immediately available for transmission. If every 6th packet that A' transmits gets lost (but no Acks from ... of packets that A' will transmit for sending the message to B' ? (a) 29 (b) 33 (c) 27 (d) 25
Station A needs to send a message consisting of 15 packets to station ‘B’ using a sling window (window size 4) and go-back-N error control strategy. All packets are r...
2.1k
views
commented
Jun 12, 2017
Computer Networks
go-back-n
sliding-window
computer-networks
+
–
2
answers
27
Generating Function
Find the coefficient of $x^{83}$ in $(x^5+ x^8+ x^{11}+ x^{14}+ x^{17})^{10} ?$
Find the coefficient of $x^{83}$ in $(x^5+ x^8+ x^{11}+ x^{14}+ x^{17})^{10} ?$
2.4k
views
commented
Jan 19, 2017
Combinatory
generating-functions
combinatory
+
–
3
answers
28
GATE CSE 1994 | Question: 26
A queue $Q$ containing $n$ items and an empty stack $S$ are given. It is required to transfer all the items from the queue to the stack, so that the item at the front of queue is on the TOP of the stack, and the order of all other ... which can be performed on the queue and stack are Delete, Insert, Push and Pop. Do not assume any implementation of the queue or stack.
A queue $Q$ containing $n$ items and an empty stack $S$ are given. It is required to transfer all the items from the queue to the stack, so that the item at the front of ...
7.5k
views
commented
Nov 30, 2016
DS
gate1994
data-structures
queue
stack
normal
descriptive
+
–
2
answers
29
Given two R union compatible relation R1 (A, B) and R2 (C, D) what is the result of the operation
Given two R union compatible relation R1 (A, B) and R2 (C, D) what is the result of the operation R1 A= C AB = D R2? a) R1⋃R2 b) R1 ⨯ R2 c) R1 – R2 d) R1 ∩R2 How to solve these kind of questions
Given two R union compatible relation R1 (A, B) and R2 (C, D) what is the result of the operationR1 A= C AB = D R2?a) R1⋃R2 b) R1 ⨯ R2 ...
6.9k
views
answered
Nov 8, 2016
Databases
relational-algebra
+
–
3
answers
30
Relation between Intersection and natural inner join on common column
When , then the cost of computing is (A) the same as R S (B) greater the R S (C) less than R S (D) cannot say anything
When , then the cost of computing is(A) the same as R S (B) greater the R S(C) less than R S (D) cannot say anything
1.7k
views
answer edited
Nov 7, 2016
Databases
natural-join
referential-integrity
databases
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register