Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by preeti0448
0
votes
1
Doubt
What is Dijkstra's algorithm running time using sorted array?
What is Dijkstra's algorithm running time using sorted array?
482
views
answered
Aug 31, 2022
Algorithms
dijkstras-algorithm
+
–
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$?
Let $G$ be the directed, weighted graph shown in below figureWe are interested in the shortest paths from $A$.Output the sequence of vertices identified by the Dijkstra�...
7.6k
views
answered
Aug 30, 2022
Algorithms
gate1996
algorithms
graph-algorithms
normal
dijkstras-algorithm
descriptive
+
–
0
votes
3
asymptotic notations
√logx = O(loglogx) is it true or false? and explain why?
√logx = O(loglogx) is it true or false?and explain why?
311
views
answered
May 2, 2022
Algorithms
asymptotic-notation
+
–
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?
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?
582
views
answered
May 2, 2022
Algorithms
algorithms
asymptotic-notation
made-easy-test-series
+
–
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)
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)
577
views
answered
May 2, 2022
Algorithms
asymptotic-notation
algorithms
time-complexity
+
–
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 ??
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 ??
650
views
answered
May 2, 2022
Algorithms
algorithms
asymptotic-notation
+
–
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)$.
Prove that $n!=\omega(2^n)$ and $n!=o(n^n)$.
369
views
answered
May 2, 2022
Algorithms
cormen
algorithms
asymptotic-notation
descriptive
+
–
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.
Consider the following statements about propositional formulas.$\left ( p\wedge q \right )\rightarrow r$ and $\left ( p \rightarrow r \right )\wedge \left ( q\rightarrow ...
885
views
answered
Mar 14, 2022
Mathematical Logic
tifr2021
mathematical-logic
propositional-logic
+
–
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
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 y...
545
views
answered
Mar 14, 2022
Mathematical Logic
discrete-mathematics
mathematical-logic
propositional-logic
engineering-mathematics
kenneth-rosen
+
–
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.
Perform the arithmetic operations (+42) + (-13) and (-42) – (-13) using binary signed 2’s complement representation for the negative numbers.
8.9k
views
answered
Mar 10, 2022
Digital Logic
digital-logic
morris-mano
number-representation
+
–
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)$
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)...
9.7k
views
answered
Mar 7, 2022
Digital Logic
gatecse-2005
digital-logic
number-representation
easy
isro2009
isro2015
+
–
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
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 fol...
2.1k
views
answered
Feb 28, 2022
Linear Algebra
eigen-value
engineering-mathematics
linear-algebra
+
–
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
$\underset{x \to \infty}{\lim} \left( 1 + \dfrac{1}{x^2} \right) ^x$ equals$-1$$0$$1$Does not exist
494
views
answered
Feb 27, 2022
Calculus
isi2015-dcg
calculus
limits
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register