Register
Filter

Answers by pradeepchaudhary

0 votes
3
Andrew S. Tanenbaum Edition 5th Exercise 4 Question 20 (Page No. 352)
How many frames per second can gigabit Ethernet handle? Think carefully and take into account all the relevant cases. Hint: the fact that it is gigabit Ethernet matters.
How many frames per second can gigabit Ethernet handle? Think carefully and takeinto account all the relevant cases. Hint: the fact that it is gigabit Ethernet matters.
0 votes
5
Operation systems 2019
If the memory is 768 MB and the block’s size is 384 Bytes, what will be the size of the bitmap in Bytes? I think it should be 2^21 Bytes, but I’m not quite sure. Could you show me also your solution?
If the memory is 768 MB and the block’s size is 384 Bytes, what will be the size of the bitmap in Bytes?I think it should be 2^21 Bytes, but I’m not quite sure.Could ...
2 votes
6
Programming Stack (ACE)
Runtime stack doesnot contain (A) Local variables (B) Static Variables (C) Parameter Passed (D) Return Address
Runtime stack doesnot contain(A) Local variables(B) Static Variables(C) Parameter Passed(D) Return Address
3 votes
7
cpu scheduling
In which of the following case CPU utilization will be higher? (a) If all the processes are I/O bound (b) Is all the processes are equally CPU bound and I/O bound (c) If all the processes are CPU bound (d) Both (B) and (C)
In which of the following case CPU utilization will be higher?(a) If all the processes are I/O bound(b) Is all the processes are equally CPU bound and I/O bound(c) If all...
0 votes
8
self doubt
Can we solve fractional knapsack using dynamic programming?
Can we solve fractional knapsack using dynamic programming?
2 votes
9
#DBMS ER Model - Minimum Number of tables
What are minimum number of tables required for the following given ER models such that they satisfy 1NF ?
What are minimum number of tables required for the following given ER models such that they satisfy 1NF ?
0 votes
10
GATE 2013 MA Calculus
0 votes
11
B + TREE DELETION
CAN SOMEONE PLZ EXPLAIN TO ME DELETION IN B+ TREES?? I AM NOT ABLE TO UNDERSTAND CLEARLY.
CAN SOMEONE PLZ EXPLAIN TO ME DELETION IN B+ TREES?? I AM NOT ABLE TO UNDERSTAND CLEARLY.
0 votes
12
Self doubt
Consider a B+ tree in which the maximum number of keys in a Internal node is 5 and maximum number of keys in a leaf node is 4. What is the minimum number of keys in any non-root node?
Consider a B+ tree in which the maximum number of keys in a Internal node is 5 and maximum number of keys in a leaf node is 4. What is the minimum number of keys in any n...
3 votes
13
B+ tree doubt
Consider a B+ -tree in which the maximum no. of keys in a root is 11. What will be minimum no. of keys in a non-root node? What will be the same in a B-Tree Please also refer the source from where clear-cut formulae are given
Consider a B+ -tree in which the maximum no. of keys in a root is 11. What will be minimum no. of keys in a non-root node? What will be the same in a B-TreePlease also re...
2 votes
17
GATE IT 2007 | Question: 28
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collides with an existing one exceed $0.5$. $5$ $6$ $7$ $10$
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collide...
1 votes
18
double hashing
can any one explain double hashing example
can any one explain double hashing example
1 votes
20
turing machine
is this halting problem thats why undecidable??
is this halting problem thats why undecidable??
0 votes
21
shortest path
Let P be a shortest path from some vertex s to some other vertex t in a directed graph. If the weight of each edge in the graph is increased by one, P will still be a shortest path from s to t. T/F
Let P be a shortest path from some vertex s to some other vertex t in a directed graph. If the weight of each edge in the graph is increased by one, P will still be a sho...
0 votes
23
Bellman Ford Shortest path
Is the below statement correct: Bellman Ford finds all negative weight cycles in the graph. This is true or false?
Is the below statement correct:Bellman Ford finds all negative weight cycles in the graph.This is true or false?
1 votes
26
Which sorting algorithm can be used to sort a random linked list with minimum time complexity ?
Which sorting algorithm can be used to sort a random linked list with minimum time complexity ? A)mergesort B)quicksort C)radixsort D)insertionsort E)heapsort
Which sorting algorithm can be used to sort a random linked list with minimum time complexity ?A)mergesortB)quicksortC)radixsortD)insertionsortE)heapsort
2 votes
28
TOC SELF DOUBT
Which of the following is true:? 1) For a given grammar, there is one and only one language. 2) For a given language, there is one and only one grammar. Please explain with example.
Which of the following is true:?1) For a given grammar, there is one and only one language.2) For a given language, there is one and only one grammar.Please explain with ...
0 votes
29
switch case
int main() { int a =50; switch(a) { default: a=45; case 49: a++; case 50: a--; case 51: a =a+1; } printf("%d",a); } my doubt is the default case is not executed here why??, what is a value of a the end??
int main() { int a =50; switch(a) { default: a=45; case 49: a++; case 50: a ; case 51: a =a+1; } printf("%d",a); }my doubt is the default case is not executed here why??,...
Page: