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 arch
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by arch
1
answer
1
self doubt
when we convert er model into relational model in 1 to many relationship why we add reltionship atribute to many side entity? like in this image we relationship in employee table why cant we add relationship with department table
asked
in
Databases
Oct 5, 2018
604
views
1
answer
2
forouzan
Assume the propagation delay in a broadcast network is 5 μs and the frame transmission time is 10 μs. a. How long does it take for the first bit to reach the destination? b. How long does it take for the last bit to reach the destination after the first bit has arrived? c. How long is the network involved with this frame (vulnerable to collision)?
asked
in
Computer Networks
Sep 14, 2018
3.5k
views
0
answers
3
forouzan
Assume that the probability that a bit in a data unit is corrupted during transmission is p. Find the probability that x number of bits are corrupted in an nbit data unit for each of the following cases. a. n = 8, x = 1, p = 0.2 b. n = 16, x = 3, p = 0.3 c. n = 32, x = 10, p = 0.4
asked
in
Computer Networks
Sep 13, 2018
1.0k
views
1
answer
4
self doubt
i have one doubt , as we know ip address has given to every device which has been connected to internet as well as ip is unique then why we using data link address for forwarding we can use ip address for forwarding(doing by router) and completely eliminate the data link layer. why we need one extra layer (data link layer) as forwarding of packet also done by router.
asked
in
Computer Networks
Sep 13, 2018
185
views
1
answer
5
forouzan
Assume we want to connect two isolated hosts together to let each host communicate with the other. Do we need a link-layer switch between the two? Explain.
asked
in
Computer Networks
Sep 12, 2018
2.3k
views
0
answers
6
frouzen
A path in a digital circuit-switched network has a data rate of 1 Mbps. The exchange of 1000 bits is required for the setup and teardown phases. The distance between two parties is 5000 km. Answer the following questions if the propagation speed is 2 108 m: a. ... of data for each of the above cases and compare them. What can you infer? someone please explain the meaning of last part (d)
asked
in
Computer Networks
Sep 12, 2018
1.2k
views
0
answers
7
forouzan
can some plz explain "Two Isolated Single-Bit Errors" "If a generator cannot divide xt +1 (t between 0 and n -1), then all isolated double errors can be detected." not able to get this line.
asked
in
Computer Networks
Aug 22, 2018
471
views
0
answers
8
forouzan
Which signal has a wider bandwidth, a sine wave with a frequency of 100 Hz or a sine wave with a frequency of 200 Hz?
asked
in
Computer Networks
Aug 19, 2018
537
views
4
answers
9
GATE CSE 1992 | Question: 01-i
The Boolean function in sum of products form where K-map is given below (figure) is _______
commented
in
Digital Logic
May 17, 2018
5.2k
views
gate1992
digital-logic
k-map
normal
fill-in-the-blanks
3
answers
10
GATE CSE 2000 | Question: 9
Design a logic circuit to convert a single digit BCD number to the number modulo six as follows (Do not detect illegal input): Write the truth table for all bits. Label the input bits $I_1, I_2, \ldots$ with $I_1$ as the least significant bit. ... Draw one circuit for each output bit using, altogether, two two-input AND gates, one two-input OR gate and two NOT gates.
commented
in
Digital Logic
May 17, 2018
2.9k
views
gatecse-2000
digital-logic
min-no-gates
descriptive
2
answers
11
GATE CSE 2000 | Question: 18
Consider the following program is pseudo-Pascal syntax program main; var x: integer; procedure Q (z: integer); begin z := z+x; writeln(z); end; procedure P (y: integer); var x: integer; begin x := y+2; Q(x); writeln(x); ... is call-by-value and the scope rule is static scoping? the parameter passing mechanism is call-by-reference and the scope rule is dynamic scoping?
commented
in
Programming in C
Apr 4, 2018
3.0k
views
gatecse-2000
programming
parameter-passing
normal
out-of-syllabus-now
descriptive
4
answers
12
TIFR CSE 2017 | Part A | Question: 5
How many distinct ways are there to split $50$ identical coins among three people so that each person gets at least $5$ coins? $3^{35}$ $3^{50}-2^{50}$ $\binom{35}{2}$ $\binom{50}{15} \cdot 3^{35}$ $\binom{37}{2}$
commented
in
Combinatory
Jan 15, 2018
4.1k
views
tifr2017
combinatory
discrete-mathematics
normal
balls-in-bins
0
answers
13
self doubt
please someone explain this i dont understand the solution
asked
in
Theory of Computation
Jan 3, 2018
109
views
1
answer
14
TIFR CSE 2010 | Part B | Question: 40
Which of the following statement is FALSE? All recursive sets are recursively enumerable. The complement of every recursively enumerable sets is recursively enumerable. Every Non-empty recursively enumerable set is the range of some totally recursive function. All finite sets are recursive. The complement of every recursive set is recursive.
commented
in
Theory of Computation
Jan 2, 2018
2.5k
views
tifr2010
theory-of-computation
recursive-and-recursively-enumerable-languages
1
answer
15
CMI2012-B-05b
Given an undirected weighted graph $G = (V, E)$ with non-negative edge weights, we can compute a minimum cost spanning tree $T = (V, E')$. We can also compute, for a given source vertex $s \epsilon V$ , the shortest paths from s to ... claim the statement is true or a counterexample if the statement is false. All the shortest paths from $s$ to the other vertices are unchanged.
commented
in
Algorithms
Dec 26, 2017
1.2k
views
cmi2012
descriptive
algorithms
graph-algorithms
minimum-spanning-tree
0
answers
16
graph theory
if graph have articulation point then will it be hamiltonian graph?
asked
in
Algorithms
Dec 24, 2017
208
views
0
answers
17
operating system
meeting progress implies solution is deadlock free? (true / false)
commented
in
Operating System
Dec 23, 2017
368
views
0
answers
18
general
does anyone have ecil previous year paper? if someone have please share.
asked
in
Compiler Design
Dec 21, 2017
128
views
1
answer
19
true data dependency
asked
in
CO and Architecture
Dec 19, 2017
1.5k
views
8
answers
20
ME-Quick Sort
commented
in
Algorithms
Dec 19, 2017
2.3k
views
algorithms
made-easy-test-series
quick-sort
numerical-answers
2
answers
21
MadeEasy Test Series: Operating System - Disks
A certain hard disk rotates at 6000 rpm. It has 1 KB per sector and average 64 sectors/track and has a seek time of 5 msec. Which of the following statements is/are true? S1 : The data transfer rate of the drive is 6400 KBPs. S2 : The ... S3 : The time required to read 800 successive sectors is 0.0052 sec. Only S1 and S2 Only S2 and S3 Only S2 Only S1
commented
in
Operating System
Dec 13, 2017
1.5k
views
made-easy-test-series
operating-system
disk
0
answers
22
cn swp
commented
in
Computer Networks
Dec 13, 2017
607
views
1
answer
23
cn mac
A 8-node network runs the carrier sense Multiple Access (CSMA) MAC protocol. The maximum data rate of the network is 10 Megabits/s. Including retries, each node sends traffic according to some unknown random process at an average rate of 1 Megabit/s ... packets. What fraction of packets sent by the nodes (including retries) experience a collision?_________% (correct to two decimal places).
commented
in
Computer Networks
Dec 12, 2017
1.1k
views
2
answers
24
cn data rate
commented
in
Computer Networks
Dec 12, 2017
432
views
0
answers
25
tcp ack
asked
in
Computer Networks
Dec 11, 2017
310
views
0
answers
26
slotted aloha
asked
in
Computer Networks
Dec 11, 2017
385
views
1
answer
27
wrap around time
commented
in
Computer Networks
Dec 11, 2017
1.3k
views
computer-networks
tcp
wrap-around-time
2
answers
28
NET Jan 17 paper 2 Q 27
The maximum size of the data that the application layer can pass on to the TCP layer below is ____________ a)216 bytes b)216 +TCP header length c) 216 + TCP header length d)215 bytes
commented
in
Computer Networks
Dec 10, 2017
647
views
1
answer
29
Madeeasy testseries
commented
in
Computer Networks
Dec 10, 2017
591
views
0
answers
30
slotted aloha
6000 stations are competing for use of single slotted aloha channel. The average station makes 30 requests/hr ,where each request is for 500 us(micro sec) duration. calculate normalized total traffic on channel
asked
in
Computer Networks
Dec 10, 2017
409
views
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:...