...
April 17, 2024

GATE 2014 [Set-1]

Question 21 Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time of Depth First […]
Do you like it?
0 Read more
April 17, 2024

Question 8517 – Data-Structures

Consider the directed graph given below. Which one of the following is TRUE? Correct Answer: C Question 30 Explanation:  There are no cycles in the graph, […]
Do you like it?
0 Read more
April 17, 2024

Question 8138 – Data-Structures

Consider the following New-order strategy for traversing a binary tree: Visit the root; Visit the right subtree using New-order; Visit the left subtree using New-order; The […]
Do you like it?
0 Read more
April 17, 2024

Question 8518 – Data-Structures

Let P be a quicksort program to sort numbers in ascending order using the first elements as the pivot. Let t1 and t2 be the number of comparisons […]
Do you like it?
0 Read more
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228