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 pradeepchaudhary
2
votes
1
answer
1
networks TCP
Calculate the effective throughput for transferring a 1000 KB file assuming TCP using slow start congestion control technique. Given the round trip time 100 ms, and maximum segment size is 1460 bytes. Assume there are no losses and both the bandwidth and the receiver window size is infinite. (A) 5MBPS (B) 10Mbps (C) 1MBPS (D) 1Mbps
Calculate the effective throughput for transferring a 1000 KB file assuming TCP usingslow start congestion control technique. Given the round trip time 100 ms, and maximu...
3.2k
views
asked
May 22, 2019
0
votes
1
answer
2
analysis of algorithm
864
views
asked
May 9, 2019
Algorithms
recurrence-relation
time-complexity
geeksforgeeks-test-series
+
–
0
votes
0
answers
3
Networking : Flow Control Methods
What is the effect on line utilization if we increase the number of frames for a constant message size? Lower line efficiency Higher line efficiency No change in line efficiency No relation between line efficiency and frame size
What is the effect on line utilization if we increase the number of frames for a constant message size? Lower line efficiencyHigher line efficiencyNo change in line effic...
453
views
asked
Mar 25, 2019
0
votes
0
answers
4
Programming in c
287
views
asked
Jan 17, 2019
0
votes
1
answer
5
calculus question
Question Number 4?
Question Number 4?
291
views
asked
Jan 4, 2019
Calculus
calculus
+
–
1
votes
0
answers
6
Depth First Search: Finding if The graph is connected
Better Explanation??
Better Explanation??
313
views
asked
Dec 8, 2018
DS
data-structures
depth-first-search
graph-algorithms
+
–
0
votes
1
answer
7
Relational Algebra Fundamental Operation
6. Which is a unary operation: a) Selection operation b) Primitive operation c) Projection operation d) Generalized selection
6. Which is a unary operation:a) Selection operationb) Primitive operationc) Projection operationd) Generalized selection
461
views
asked
Oct 11, 2018
0
votes
0
answers
8
Master's Theorem Recurrence Relation
T (n) = T (n/2) + 2n Using Master's Method What is the Complexity Of This Recurrence Relation? Or Using AnyOther Method?
T (n) = T (n/2) + 2nUsing Master's Method What is the Complexity Of This Recurrence Relation?Or Using AnyOther Method?
899
views
asked
Aug 20, 2018
Algorithms
algorithms
recurrence-relation
time-complexity
master-theorem
+
–
0
votes
1
answer
9
Binary Tree Height
What is the time complexity for finding the height of the binary tree? a) h = O(loglogn) b) h = O(nlogn) c) h = O(n) d) h = O(log n)
What is the time complexity for finding the height of the binary tree?a) h = O(loglogn)b) h = O(nlogn)c) h = O(n)d) h = O(log n)
14.4k
views
asked
Aug 19, 2018
Programming in C
binary-tree
+
–
1
votes
2
answers
10
Binary Tree Array Implementation
What must be the ideal size of array if the height of tree is ‘l’? a) 2l-1 b) l-1 c) l d) 2l
What must be the ideal size of array if the height of tree is ‘l’?a) 2l-1b) l-1c) ld) 2l
2.7k
views
asked
Aug 19, 2018
Programming in C
binary-search-tree
binary-tree
data-structures
+
–
1
votes
1
answer
11
Linked List
What kind of linked list is best to answer question like “What is the item at position n?” a) Singly linked list b) Doubly linked list c) Circular linked list d) Array implementation of linked list
What kind of linked list is best to answer question like “What is the item at position n?”a) Singly linked listb) Doubly linked listc) Circular linked listd) Array im...
1.8k
views
asked
Aug 19, 2018
Programming in C
linked-list
data-structures
algorithms
+
–
0
votes
1
answer
12
Time Complexity
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list? a) O(1) b) O(n) c) θ(n) d) θ(1)
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?a) O(1)b) O(n)c)...
809
views
asked
Aug 19, 2018
Programming in C
asymptotic-notation
data-structures
+
–
1
votes
1
answer
13
Binary Search Tree
8. What are the worst case and average case complexities of a binary search tree? a) O(n), O(n) b) O(logn), O(logn) c) O(logn), O(n) d) O(n), O(logn)
8. What are the worst case and average case complexities of a binary search tree?a) O(n), O(n)b) O(logn), O(logn)c) O(logn), O(n)d) O(n), O(logn)
19.1k
views
asked
Aug 19, 2018
Programming in C
data-structures
binary-search-tree
binary-tree
algorithms
+
–
0
votes
3
answers
14
Spanning Tree
2) An undirected graph G has n nodes. Its adjacency matrix is given by an n n square matrix whose (i) diagonal elements are 0 s and (ii) non-diagonal elements are 1 s. which one of the following is TRUE? (a) Graph G has no minimum spanning tree (MST) ... n-1 (c) Graph G has multiple distinct MSTs, each of cost n-1 (d) Graph G has multiple spanning trees of different costs Expain?
2) An undirected graph G has n nodes. Its adjacency matrix is given by an n × n square matrix whose (i) diagonal elements are 0‘s and (ii) non-diagonal elements are 1�...
1.1k
views
asked
Jul 23, 2018
Algorithms
minimum-spanning-tree
algorithms
graph-algorithms
+
–
1
votes
1
answer
15
TIme complexity
Q.14 What is the time complexity of the following recursive function? int Dosomething (int n) { if(n≤2) return 1; else return (Dosomething (floor(sqrt(n))) + n); (a) Ѳ(n 2 ) (c) Ѳ(log 2 n) (b) Ѳ(nlog 2 n) (d) Ѳ(log 2 log 2 n)
Q.14 What is the time complexity of the following recursive function?int Dosomething (int n) {if(n≤2)return 1;elsereturn (Dosomething (floor(sqrt(n))) + n);(a) Ѳ(n 2 )...
1.3k
views
asked
Jul 14, 2018
Algorithms
time-complexity
algorithms
+
–
2
votes
2
answers
16
Time Complexity Of the Algorithm
Q.6 The time complexity of an algorithm T(n), where n is the input size, is given by— T(n)= T(n-1) + 1/n, if n>1 = 1, otherwise. The order of the algorithm is— (a) log n (c) n^2 (b) n (d) n*n
Q.6 The time complexity of an algorithm T(n), where n is the input size, is given by— T(n)= T(n-1) + 1/n, if n>1 = 1, otherwise.The order of the algorithm is�...
9.2k
views
asked
Jul 14, 2018
Algorithms
algorithms
time-complexity
recurrence-relation
+
–
4
votes
7
answers
17
Searching
Q) Consider a sorted array of n numbers. What would be the time complexity of the best known algorithm to find a pair a and b such that |a-b| = k , k being a positive integer. a) O(logn) b) O(n) c)O(nlogn) d)O(n^2) Which of the option is Correct And Why?
Q) Consider a sorted array of n numbers. What would be the time complexity of the best known algorithm to find a pair a and b such that |a-b| = k , k being a positive int...
12.6k
views
asked
Jul 9, 2018
Algorithms
algorithms
sorting
time-complexity
binary-search
+
–
0
votes
3
answers
18
Merge Sort
A list of n string, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is (A) (B) (C) (D)
A list of n string, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is(A) (B) (C) (D)...
1.5k
views
asked
Jul 8, 2018
Algorithms
merge-sort
algorithms
sorting
merging
+
–
0
votes
1
answer
19
Sorting:
You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate? 1)QuickSort 2)MergeSort 3)HeapSort 4)Selection Sort Explain? How
You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate?1)QuickSort2)MergeSort3)HeapSort4)Selection Sort...
3.3k
views
asked
Jul 8, 2018
Algorithms
sorting
algorithms
time-complexity
heap-sort
+
–
0
votes
0
answers
20
Heap Sort :
Q) Suppose we are sorting an array of eight integers using heapsort, and we have just finished some heapify (either maxheapify or minheapify) operations. The array now looks like this: (16 14 15 10 12 27 28 ) How many heapify operations have been performed on root of heap?
Q) Suppose we are sorting an array of eight integers using heapsort, and we have just finished some heapify (either maxheapify or minheapify) operations.The array now loo...
2.0k
views
asked
Jul 8, 2018
Algorithms
binary-heap
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register