Dark Mode

Recent questions tagged algorithms

0 votes

0 answers

1

self doubt
Determine the number of spanning tree in the following graph ?

Çșȇ ʛấẗẻ asked in Algorithms Mar 10

by Çșȇ ʛấẗẻ

67 views

0 votes

0 answers

2

Self Doubt
Determine the number of the spanning treess in the following graph ???

Çșȇ ʛấẗẻ asked in Algorithms Mar 10

by Çșȇ ʛấẗẻ

37 views

0 votes

0 answers

3

Self doubt
Determine the number of the spanning treess in the following graph ???

Çșȇ ʛấẗẻ asked in Algorithms Mar 10

by Çșȇ ʛấẗẻ

27 views

1 vote

1 answer

4

Spanning Tree
Determine the number of the spanning treess in the following graph ???

Çșȇ ʛấẗẻ asked in Algorithms Mar 10

by Çșȇ ʛấẗẻ

71 views

0 votes

0 answers

5

Numerical Method Analysis : Help...
Use LU Decomposition method to solve the following system. $\left\{\begin{matrix} & x_{1} +x_{2}-x_{3} =1 \\ & x_{1} +2x_{2}-2x_{3} =0 \\ & -2x_{1} +x_{2}+x_{3} =1 \end{matrix}\right.$ ...

kidussss asked in Linear Algebra Mar 8

43 views

0 votes

0 answers

6

Numerical Method Analysis : Help...
Solve the following system using Gauss elimination with partial pivoting. $\left\{\begin{matrix} &2x_{1}+x_{2}+x_{3}=10\\ & 3x_{1}+2x_{2}+3x_{3}=18 \\ & 5x_{1}+4x_{2}+2x_{3}=9 \end{matrix}\right.$ ...

kidussss asked in Linear Algebra Mar 8

30 views

0 votes

0 answers

7

Numerical Method Analysis : Help...
Use Secant method to find roots of: $x^3-2x^2+3x-5=0$ $x+1 = 4sinx$ $e^x = x + 2$

kidussss asked in Linear Algebra Mar 8

29 views

0 votes

0 answers

8

Numerical Method Analysis : Help....
Use NR method to find a root of the equation with tolerance x=0.00001. $x^3-2x-5=0$ $e^x-3x^2=0$

kidussss asked in Linear Algebra Mar 8

21 views

0 votes

0 answers

9

Numerical Method Analysis : Help...
Use Bisection method to find all roots of $x^3 – 5x + 3 = 0$

kidussss asked in Linear Algebra Mar 8

34 views

0 votes

0 answers

10

Numerical Method Analysis : Help...
Use Bisection method to find the root of the following equation with tolerance 0.001. $x^4 - 2x^3 - 4x^2 + 4x + 4 = 0$ $x^3 – e^x + sin(x) = 0$

kidussss asked in Linear Algebra Mar 8

39 views

0 votes

2 answers

11

Chose the correct big- Θ expression to describe: T(N) = T(N / 2) + Log(N/2); T(1) = 1
I

ahmed malik asked in Algorithms Mar 5

94 views

3 votes

1 answer

12

GATE CSE 2023 | Question: 10
An algorithm has to store several keys generated by an adversary in a hash table. The adversary is malicious who tries to maximize the number of collisions. Let $k$ be the number of keys, $m$ be the number of slots in the hash ... a carefully chosen constant. Universal hashing method. If $k$ is a prime number, use Division method. Otherwise, use Multiplication method.

admin asked in Algorithms Feb 15

by admin

1.3k views

3 votes

0 answers

13

GATE CSE 2023 | Question: 19
Let $f$ and $g$ be functions of natural numbers given by $f(n)=n$ and $g(n)=n^{2}.$ Which of the following statements is/are $\text{TRUE}?$ $f \in O(g)$ $f \in \Omega(g)$ $f \in o(g)$ $f \in \Theta(g)$

admin asked in Algorithms Feb 15

by admin

1.3k views

3 votes

1 answer

14

GATE CSE 2023 | Question: 44
Consider functions $\textsf{Function_1}$ and $\textsf{Function_2}$ ... $f_{1}(n) \in \omega\left(f_{2}(n)\right)$ $f_{1}(n) \in O(n)$

admin asked in Algorithms Feb 15

by admin

1.3k views

1 vote

1 answer

15

GATE CSE 2023 | Question: 46
Let $U=\{1,2,3\}$. Let $2^{U}$ denote the powerset of $U$. Consider an undirected graph $G$ whose vertex set is $2^{U}$. For any $A, B \in 2^{U},(A, B)$ is an edge in $G$ if and only if (i) $A \neq B$, and (ii) ... $A$ is denoted by $\mathcal{B}(A)$. If $\emptyset$ denotes the empty set, then the cardinality of $\mathcal{B}(\emptyset)$ is ______________.

admin asked in Algorithms Feb 15

by admin

873 views

0 votes

0 answers

16

GATE CSE 2023 | Memory Based Question: 37
Time complexity f( ) { while(n>1) { for (i = 1 to n) { } n = n/2 } } g ( ) { for (i = 1 to 100n) { } } $f(x)=O(g(x))$ $f(x)=\theta(g(x))$ $f(x)=o(g(x))$ $f(x)=\omega(g(x))$

GO Classes asked in Algorithms Feb 6

548 views

3 votes

0 answers

17

Number of possible permutations that can be obtained using stack for input seq
Number of possible permutations that can be obtained using stack if the input sequence is 1, 2, 3, 4, 5 (in the order) is

h4kr asked in Algorithms Jan 31

by h4kr

138 views

0 votes

1 answer

18

TestBook TestSeries Finding number of records under join of 2 tables
Assume a relation R' having 200 records. These records are stored in blocks having block factor as 20. Consider another relation S' having 120 records and all these records are stored in 30 blocks. These two tables have to be joined ... the total number of block access required to join R and S ? A. 2430 B. 6010 C. 6120 D. 1230

Sahil_Lather asked in Databases Jan 29

by Sahil_Lather

74 views

Page:

1
2
3
4
5
6
...
110
next »

Recent questions tagged algorithms