1 votes
4
To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is:QueueStackHeapB-Tree
2 votes
6
The expenditure on the project _____ as follows: equipment Rs.$20$ lakhs, salaries Rs.$12$ lakhs, and contingency Rs.$3$ lakhs.break downbreakbreaks downbreaks
1 votes
8
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ?$8$$16$$32$$64$None of the above
2 votes
12
What is the value of $ \displaystyle\lim_{n \to \infty}\left(1 - \frac{1}{n}\right)^{2n}$ ?$0$$e^{-2}$$e^{-1/2}$$1$
2 votes
13
Let $T(n) = T(n-1) + \frac{1}{n} , T(1) = 1 ;$ then $T(n) = ? $$O(n^{2})$$O(logn)$$O(nlogn)$$O(n^{2}logn)$
0 votes
14
Obtain the eigen values of the matrix$$A=\begin {bmatrix} 1 & 2 & 34 & 49 \\ 0 & 2 & 43 & 94 \\ 0 & 0 & -2 & 104 \\ 0 & 0 & 0 & -1 \end{bmatrix}$$
1 votes
16
What is a discrete set?
0 votes
17
If a relation has no functional dependency than what is the normal form of this relation???
3 votes
18
In a resident – OS computer, which of the following systems must reside in the main memory under all situations?AssemblerLinkerLoaderCompiler
0 votes
20
Give a relational algebra expression using only the minimum number of operators from $(∪, −)$ which is equivalent to $R$ $∩$ $S.$
0 votes
21
what is the output of printf("%d",printf("gate19")?
1 votes
23
How to find log n base2+ log n base 3+ log n base4+........log n base n?
1 votes
27
The correct matching for the following pairs is$$\begin{array}{ll|ll}\hline \text{A.} & \text{All pairs shortest path} & \text{1.} & \text{Greedy} \\\hline \text{B.} & \...
7 votes
28
The set of all recursively enumerable languages is:closed under complementationclosed under intersectiona subset of the set of all recursive languagesan uncountable set
0 votes
29