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 once_2019
0
votes
0
answers
1
exam query-UPPCL
There is no option for choice of exam city in uppcl form.On what basis they will allocate centers.Any idea ?
There is no option for choice of exam city in uppcl form.On what basis they will allocate centers.Any idea ?
353
views
asked
Nov 28, 2018
0
votes
0
answers
2
how long does it take for a bit to travel from the beginning to the end of the network?
Suppose the length of a 10Base5 cable is 2500 m. If the speed of propagation in a thick coaxial cable is 200,000,000 m/s, how long does it take for a bit to travel from the beginning to the end of the network? ... 500 meters? A. 26.5 micro seconds B. 52.5 microseconds C. 47.5 micro seconds D. 37.5 micro seconds
Suppose the length of a 10Base5 cable is 2500 m. If the speed of propagation in a thick coaxial cable is 200,000,000 m/s, how long does it take for a bit to travel from t...
4.7k
views
asked
Oct 7, 2018
Computer Networks
computer-networks
+
–
0
votes
1
answer
3
data link layer
An upper-layer packet is split into 5 frames, each of which has an 90% chance of arriving undamaged. If no error control is done by the data link protocol, how many times must the message be sent on average to get the entire thing through? A. 2.1 B. 1.9 C. 1.7 D. 2.4
An upper-layer packet is split into 5 frames, each of which has an 90% chance of arriving undamaged. If no error control is done by the data link protocol, how many times...
845
views
asked
Oct 7, 2018
Computer Networks
computer-networks
data-link-layer
+
–
0
votes
1
answer
4
data structure
210
views
asked
Aug 4, 2018
Programming in C
data-structures
+
–
0
votes
1
answer
5
logic and predicate
392
views
asked
Jul 14, 2018
0
votes
1
answer
6
regular expressions
408
views
asked
Jul 8, 2018
Theory of Computation
theory-of-computation
regular-expression
+
–
0
votes
2
answers
7
Time complexity
To construct binary search tree either from preorder or postorder what is the efficient time complexity ? can we construct unique BST along with post and preorder ?Then what is the significance of using PRE+INORDER or POST+INORDER
To construct binary search tree either from preorder or postorder what is the efficient time complexity ?can we construct unique BST along with post and preorder ?Then wh...
599
views
asked
Jul 8, 2018
Programming in C
time-complexity
+
–
0
votes
1
answer
8
trees data structure
Is the root node an internal node?
Is the root node an internal node?
631
views
asked
Jun 24, 2018
Programming in C
data-structures
tree
programming-in-c
+
–
1
votes
1
answer
9
Time complexity
show how to sort n number in the range [0,n^2-1] in O(n)time?
show how to sort n number in the range [0,n^2-1] in O(n)time?
312
views
asked
May 8, 2018
Algorithms
time-complexity
algorithms
+
–
1
votes
1
answer
10
hashing
A hash table is used when number of keys actually stored it any point of time is small as compared to the number of possible keys. please explain this line with suitable example.
A hash table is used when number of keys actually stored it any point of time is small as compared to the number of possible keys.please explain this line with suitable e...
289
views
asked
May 5, 2018
Programming in C
hashing
data-structures
+
–
0
votes
1
answer
11
Asymtotic notation
Big Omega question : 5n+3>=C2n for which value of c and n condition satisfies?
Big Omega question :5n+3>=C2n for which value of c and n condition satisfies?
236
views
asked
Apr 17, 2018
Algorithms
asymptotic-notation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register