The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Questions by pradeepchaudhary
User pradeepchaudhary
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User pradeepchaudhary
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
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
asked
May 22
in
Computer Networks

112
views
0
votes
1
answer
2
analysis of algorithm
asked
May 9
in
Algorithms

60
views
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
asked
Mar 25
in
Computer Networks

37
views
0
votes
0
answers
4
Programming in c
asked
Jan 17
in
Programming

45
views
0
votes
1
answer
5
calculus question
Question Number 4?
asked
Jan 4
in
Calculus

48
views
calculus
+1
vote
1
answer
6
Depth First Search: Finding if The graph is connected
Better Explanation??
asked
Dec 8, 2018
in
DS

51
views
datastructure
dfs
graphalgorithms
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
asked
Oct 11, 2018
in
Databases

52
views
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?
asked
Aug 20, 2018
in
Algorithms

227
views
algorithms
recurrence
timecomplexity
mastertheorem
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)
asked
Aug 19, 2018
in
Programming

51
views
0
votes
2
answers
10
Binary Tree Array Implementation
What must be the ideal size of array if the height of tree is ‘l’? a) 2l1 b) l1 c) l d) 2l
asked
Aug 19, 2018
in
Programming

92
views
binarysearchtree
binarytree
datastructure
0
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
asked
Aug 19, 2018
in
Programming

174
views
linkedlists
datastructure
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)
asked
Aug 19, 2018
in
Programming

41
views
asymptoticnotations
datastructure
0
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)
asked
Aug 19, 2018
in
Programming

112
views
datastructure
binarysearchtree
bst
binarytree
algorithms
0
votes
2
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) nondiagonal elements are 1 s. which one of the following is TRUE? (a) Graph G has no minimum spanning tree (MST) ... n1 (c) Graph G has multiple distinct MSTs, each of cost n1 (d) Graph G has multiple spanning trees of different costs Expain?
asked
Jul 23, 2018
in
Algorithms

81
views
minimumspanningtrees
algorithms
graphalgorithms
0
votes
1
answer
15
Minimum Number of Comparisons Required
Q.13 The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is _________________. (a) 147.1 to 148.1 (b) 140 to 146 (c)145.1 to 146.1 (d) 140 to 148
asked
Jul 14, 2018
in
Algorithms

174
views
algorithms
+1
vote
1
answer
16
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)
asked
Jul 14, 2018
in
Algorithms

79
views
timecomplexity
algorithms
+2
votes
2
answers
17
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(n1) + 1/n, if n>1 = 1, otherwise. The order of the algorithm is— (a) log n (c) n^2 (b) n (d) n*n
asked
Jul 14, 2018
in
Algorithms

420
views
algorithms
timecomplexity
+1
vote
5
answers
18
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 ab = 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?
asked
Jul 9, 2018
in
Algorithms

820
views
algorithms
sorting
timecomplexity
binarysearch
0
votes
2
answers
19
Merge Sort
A list of n string, each of length n, is sorted into lexicographic order using the mergesort algorithm. The worst case running time of this computation is (A) (B) (C) (D)
asked
Jul 8, 2018
in
Algorithms

229
views
mergesort
algorithms
sorting
merging
0
votes
1
answer
20
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
asked
Jul 8, 2018
in
Algorithms

151
views
sorting
algorithms
timecomplexity
heapsort
0
votes
0
answers
21
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?
asked
Jul 8, 2018
in
Algorithms

133
views
heap
0
votes
1
answer
22
GeeksForGeeks Quiz
Q) Consider a situation where swap operation is very costly. Which of the following sorting algorithms should be preferred so that the number of swap operations are minimized in general? (A) Heap Sort (B) Selection Sort (C) Insertion Sort (D) Merge Sort The Answer ... is (B). But My question is Why not (D) Since There is not a Single Swap operation is performed in Merge Sort.
asked
Jul 8, 2018
in
Algorithms

228
views
algorithms
sorting
0
votes
2
answers
23
NORMALIZATION
Given: The Relation R(A,B,C,D,E) having (A,B) as Primary key. The set of functional dependencies: (A,C)>D , (B,D)>E. I want to Know whether the functional dependencies Given above are Partial FD's or Not?
asked
Jun 8, 2018
in
Databases

271
views
databasenormalization
databases
bcnf
functionaldependencies
bcnfdecomposition
+1
vote
0
answers
24
Hacker Earth Normalization Question
A particular database is normalized to satisfy a particular level of normalization (either 1NF or 2NF or 3NF). One of the tables contains, among other fields, a column for the City and a column for the Zip Code. Assuming that there is a manytoone mapping ... , we may conclude that the database is definitely NOT in xNF form. What is the integer x (1, 2, or 3)?
asked
Jun 8, 2018
in
Databases

135
views
databases
databasenormalization
50,645
questions
56,598
answers
195,838
comments
102,143
users