Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for isro2017+algorithms
29
votes
7
answers
1
GATE CSE 1994 | Question: 1.7, ISRO2017-14
The recurrence relation that arises in relation with the complexity of binary search is: $T(n) = 2T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$ $T(n) = T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$ $T(n) = T\left(\frac{n}{2}\right)+\log n$ $T(n) = T\left(\frac{n}{2}\right)+n$
The recurrence relation that arises in relation with the complexity of binary search is:$T(n) = 2T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$$T(n) = T\left(\fra...
Kathleen
18.0k
views
Kathleen
asked
Oct 4, 2014
Algorithms
gate1994
algorithms
recurrence-relation
easy
isro2017
+
–
10
votes
8
answers
2
ISRO2017-17
Which of the following data structure is useful in traversing a given graph by breadth first search? Stack Queue List None of the above
Which of the following data structure is useful in traversing a given graph by breadth first search?StackQueueListNone of the above
Arjun
13.2k
views
Arjun
asked
May 9, 2017
Algorithms
isro2017
data-structures
graph-algorithms
breadth-first-search
easy
+
–
15
votes
7
answers
3
GATE CSE 2004 | Question: 30, ISRO2017-10
The problem $\text{3-SAT}$ and $\text{2-SAT}$ are both in $\text{P}$ both $\text{NP}$ complete $\text{NP}$-complete and in $\text{P}$ respectively undecidable and $\text{NP}$ complete respectively
The problem $\text{3-SAT}$ and $\text{2-SAT}$ are both in $\text{P}$both $\text{NP}$ complete$\text{NP}$-complete and in $\text{P}$ respectivelyundecidable and $\text{NP}...
Kathleen
11.7k
views
Kathleen
asked
Sep 18, 2014
Algorithms
gatecse-2004
algorithms
p-np-npc-nph
easy
isro2017
out-of-gate-syllabus
+
–
14
votes
3
answers
4
ISRO2017-80
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to be a. $O(n\log n)$ b. $O\left( n^{3/2}\right)$ c. $O( n^3 )$ d. $O(n)$
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to bea. $O(n\log n)$b. $O\left( n^{3/2}\right)$c. $O( n^3 )...
sh!va
4.2k
views
sh!va
asked
May 7, 2017
Algorithms
isro2017
relations
algorithms
time-complexity
+
–
10
votes
5
answers
5
ISRO2017-15
Which one of the following in-place sorting algorithms needs the minimum number of swaps? Insertion Sort Quick Sort Heap Sort Selection Sort
Which one of the following in-place sorting algorithms needs the minimum number of swaps?Insertion SortQuick SortHeap SortSelection Sort
sh!va
4.8k
views
sh!va
asked
May 7, 2017
Algorithms
isro2017
algorithms
sorting
+
–
9
votes
5
answers
6
ISRO2017-49
The number of swappings needed to sort the numbers $8 , 22, 7, 9, 31, 5, 13$ in ascending order using bubble sort is $11$ $12$ $13$ $10$
The number of swappings needed to sort the numbers $8 , 22, 7, 9, 31, 5, 13$ in ascending order using bubble sort is$11$$12$$13$$10$
sh!va
7.8k
views
sh!va
asked
May 7, 2017
Algorithms
isro2017
algorithms
sorting
+
–
5
votes
3
answers
7
ISRO2017-76
Which of the following algorithms solves the all pair shortest path problem? Prim's algorithm Dijkstra's algorithm Bellman ford algorithm Floyd warshalls algorithm
Which of the following algorithms solves the all pair shortest path problem?Prim's algorithmDijkstra's algorithmBellman ford algorithmFloyd warshalls algorithm
sh!va
4.4k
views
sh!va
asked
May 7, 2017
Algorithms
isro2017
algorithms
graph-algorithms
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register