Dark Mode

Answers by preeti0448

0 votes

1

Doubt
What is Dijkstra's algorithm running time using sorted array?

answered in Algorithms Aug 31, 2022

246 views

0 votes

2

GATE CSE 1996 | Question: 17
Let $G$ be the directed, weighted graph shown in below figure We are interested in the shortest paths from $A$. Output the sequence of vertices identified by the Dijkstra's algorithm for single source shortest path when the algorithm is started at node $A$ Write down ... vertices in the shortest path from $A$ to $E$ What is the cost of the shortest path from $A$ to $E$?

answered in Algorithms Aug 30, 2022

5.7k views

0 votes

3

asymptotic notations
√logx = O(loglogx) is it true or false? and explain why?

answered in Algorithms May 2, 2022

200 views

0 votes

4

made easy test
Given below are 4 functions $999999n$ $0.99999 n logn$ $1.000001^{n}$ $n^{2}$ The increasing order of the above functions in terms of their asymptotic complexity is?

answered in Algorithms May 2, 2022

314 views

0 votes

5

Asymptotic notation
Let f(n) =O(n), g(n)=Ώ(n) and h(n)=Θ(n). Then g(n)+f(n).h(n) is _____? a- Ω($n^{2}$) b- Θ($n^{2}$) c-Ω(n) d-Θ(n)

answered in Algorithms May 2, 2022

393 views

0 votes

6

Big oh
Any condition for f(n) and g(n) or any value we can take??? I m confused becoz in big oh right side part must b greater than equal ??

answered in Algorithms May 2, 2022

308 views

0 votes

7

Cormen Edition 3 Exercise 3.2 Question 3 (Page No. 60)
Prove that $n!=\omega(2^n)$ and $n!=o(n^n)$.

answered in Algorithms May 2, 2022

238 views

0 votes

8

TIFR CSE 2021 | Part B | Question: 1
Consider the following statements about propositional formulas. $\left ( p\wedge q \right )\rightarrow r$ and $\left ( p \rightarrow r \right )\wedge \left ( q\rightarrow r \right )$ are $\textit{not }$ ... values $p$ and $q$, $\text{(i)}$ can be either true or false, while $\text{(ii)}$ is always false.

answered in Mathematical Logic Mar 14, 2022

589 views

0 votes

9

kenneth h rosen chapter 1 excercise 1.3 question 47
Show that p NAND q is logically equivalent to ¬(p ∧ q). how to prove this and i prove using truth table which is easy but how to prove using logical identities ? thank you

answered in Mathematical Logic Mar 14, 2022

224 views

2 votes

10

Morris Mano Edition 3 Exercise 1 Question 18 (Page No. 34)
Perform the arithmetic operations (+42) + (-13) and (-42) – (-13) using binary signed 2’s complement representation for the negative numbers.

answered in Digital Logic Mar 10, 2022

2.1k views

0 votes

11

GATE CSE 2005 | Question: 16, ISRO2009-18, ISRO2015-2
The range of integers that can be represented by an $n$ bit $2’s$ complement number system is: $-2^{n-1} \text{ to } (2^{n-1} -1)$ $-(2^{n-1} -1) \text{ to } (2^{n-1} -1)$ $-2^{n-1} \text{ to } 2^{n-1}$ $-(2^{n-1} +1) \text{ to } (2^{n-1} -1)$

answered in Digital Logic Mar 7, 2022

8.3k views

0 votes

12

eigen values and determinents
Let A be a 4 × 4 matrix with real entries such that -1, 1, 2, -2 are its eigen values. If B = A4 - 5A2 + 5I where I denotes 4 × 4 identity matrix, then which of the following is correct? (det(X) represents determinant of X) (A) det(A + B) = 0 (B) det(B) = 1 (C) trace of A + B is 4 (D) all of these

answered in Linear Algebra Feb 28, 2022

1.2k views

0 votes

13

ISI2015-DCG-56
$\underset{x \to \infty}{\lim} \left( 1 + \dfrac{1}{x^2} \right) ^x$ equals $-1$ $0$ $1$ Does not exist

answered in Calculus Feb 27, 2022

245 views