Register

NIELIT STA 2021

314 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
1 answer
1
rsansiya111 asked Dec 6, 2021
384 views
NIELIT STA 2021
Worst Case scenario in case of linear search algorithm is_______________. Item is somewhere in the middle of the array Item is not in the array at all Item is the last element in the array Item is the last element in the array or is not there at all
Worst Case scenario in case of linear search algorithm is_______________.Item is somewhere in the middle of the arrayItem is not in the array at allItem is the last eleme...
User Avatar
0 votes
0 votes
1 answer
2
rsansiya111 asked Dec 6, 2021
558 views
NIELIT STA 2021
Which of the following is not a stable sorting algorithms ? Insertion sort Selection sort Bubble sort Merge sort
Which of the following is not a stable sorting algorithms ? Insertion sortSelection sort Bubble sortMerge sort
User Avatar
0 votes
0 votes
1 answer
3
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
4
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
Link Copied!