Register

NIELIT STA 2021

420 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
rsansiya111 asked Dec 6, 2021
376 views
NIELIT STA 2021
The DoS attack, in which the attacker establishes a large number of half-open or fully open TCP connections at the target host is: Vulnerability attack Bandwidth flooding Connection flooding UDP flooding
The DoS attack, in which the attacker establishes a large number of half-open or fully open TCP connections at the target host is: Vulnerability attackBandwidth flooding...
User Avatar
0 votes
0 votes
1 answer
2
rapidxy asked Dec 14, 2021
395 views
NIELIT STQC STA 2021
Let $C(n,r)= \binom{n}{r}$.The value of $\sum_{k=0}^{20}(2k+1)C(41,2k+1)$ is : A)40(2)^40 B)40(2)^39 C)41(2)^40 D)41(2)^39
Let $C(n,r)= \binom{n}{r}$.The value of $\sum_{k=0}^{20}(2k+1)C(41,2k+1)$ is :A)40(2)^40 B)40(2)^39C)41(2)^40D)41(2)^39
User Avatar
1 votes
1 votes
0 answers
3
rsansiya111 asked Dec 6, 2021
408 views
NIELIT STA 2021
If a hash table is implemented asa search tree, the expected time required to enter n names and make m searches is proportional to: (n + m) $log_{2} n$ (n + m) $log_{2} m$ mn $log_{2} n$ mn $log_{2} m$
If a hash table is implemented asa search tree, the expected time required to enter n names and make m searches is proportional to: (n + m) $log_{2} n$(n + m) $log_{2} m$...
User Avatar
0 votes
0 votes
0 answers
4
rsansiya111 asked Dec 6, 2021
188 views
NIELIT STA 2021
Consider a relation R with attributes {A,B,C} and functional dependency set S ={A → B, A → C}. Then relation R can be decomposed into two relations: R1{A,B} AND R2{A,C} R1{A,B} AND R2{B,C] R1{A,B,C} AND R2{A,C} None of the above
Consider a relation R with attributes {A,B,C} and functional dependency set S ={A → B, A → C}. Then relation R can be decomposed into two relations: R1{A,B} AND R2{A...
User Avatar
Link Copied!