Register
Filter

Recent activity by amit166

4 answers
3
GATE DS&AI 2024 | GA Question: 3
How many $4$-digit positive integers divisible by $3$ can be formed using only the digits $\{1,3,4,6,7\}$, such that no digit appears more than once in a number? $24$ $48$ $72$ $12$
How many $4$-digit positive integers divisible by $3$ can be formed using only the digits $\{1,3,4,6,7\}$, such that no digit appears more than once in a number?$24$$48$$...
5 answers
5
#cpcb
Select the function(s) which is/are $O(n log n)$: $2n\log n+3n$ $10n\log n^2$ $1+\sqrt n$ $2n^2-3n$
Select the function(s) which is/are $O(n log n)$:$2n\log n+3n$$10n\log n^2$$1+\sqrt n$$2n^2-3n$
1 answer
11
Graph theory self doubt
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
2 answers
12
Digital Logic, Essential Prime Implicants
The number of essential prime implicants in the function f(a, b, c, d) = Σ(1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 15) is ________.
The number of essential prime implicants in the function f(a, b, c, d) = Σ(1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 15) is ________.
1 answer
15
#gate questions
which one true 1. Determining whether context-free grammar is un-decidable 2. Whether a given grammar is context-free is decidable
which one true1. Determining whether context-free grammar is un-decidable2. Whether a given grammar is context-free is decidable
0 answers
17
#testbook
1 answer
18
UNACADEMY TEST
L={ a^x b^y | x≠y AND x≠2y } Is This CFL? If Yes Than How
L={ a^x b^y | x≠y AND x≠2y } Is This CFL? If Yes Than How
2 answers
19
#ACE acedmy test series
In a host size for PDU of network layer is 17076 bytes, MTU size for that network is 200 bytes and IPv4 header size is 20 bytes .find number of IP fragments
In a host size for PDU of network layer is 17076 bytes, MTU size for that network is 200 bytes and IPv4 header size is 20 bytes .find number of IP fragments
1 answer
20
#testbook
Time complexity=$\sum_{i=1}^{n}[\log (\frac{n}{i})] is$
Time complexity=$\sum_{i=1}^{n}[\log (\frac{n}{i})] is$
2 answers
21
CMI-2021-DataScience-A: 2
The roots of the polynomial $p(x)=x^{4}-2x^{3}-2x^{2}+8x-8$ are: $1, -1, 2, 2+3 i$ $1+i, 1-i, 2, -2$ $1, -1+i, 2, 2+3 i$ $1+i, -1+i, 2, -2$
The roots of the polynomial $p(x)=x^{4}-2x^{3}-2x^{2}+8x-8$ are:$1, -1, 2, 2+3 i$$1+i, 1-i, 2, -2$$1, -1+i, 2, 2+3 i$$1+i, -1+i, 2, -2$
1 answer
25
uppcl 2021
what is the average-case time complexity for finding the height of the Binary tree.
what is the average-case time complexity for finding the height of the Binary tree.
1 answer
26
UPPCL AE 2018:55
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in the list that is larger than the second minimum in the list is $\Theta(n \log n)$ $\Theta(n/ \log n)$ $\Theta(1)$ $\Theta(\log n)$
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in the list that is larger than the second minimum in the list is$\Theta(n ...
4 answers
28
#university exam
What will be the complexity of merging two circular single linked list? You can consider the sizes of the linked lists are n1 and n2, respectively.
What will be the complexity of merging two circular single linked list? You can consider the sizes of the linked lists are n1 and n2, respectively.
0 answers
29
#unversity exam
If there are ‘n’ processes in a system, with the time-quanta less than the CPU burst times of all these processes in a given round, then the number of preemptions is at least: (A) 2n (B) n (C) 2n–1 (D) n–1
If there are ‘n’ processes in a system, with the time-quanta less than the CPU burst times of allthese processes in a given round, then the number of preemptions is a...
0 answers
30
math book
$\int_{0}^{1}\tan^{-1} (1-\frac{1}{x})$ d(x) find
$\int_{0}^{1}\tan^{-1} (1-\frac{1}{x})$ d(x) find