Register

madeeasy testseries

286 views
0 votes
0 votes

how the formula came?

User Avatar

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
gautamcse27 asked Oct 18, 2016
334 views
madeeasy testseries
consider the following pseudo code main() { int t1=0,t2=0,t3=0; t1=fork(); t2=fork(); if(t1!=0) { t3=fork(); printf("0"); } } The total number of processes that will be created by the above program execution are__
consider the following pseudo codemain(){int t1=0,t2=0,t3=0;t1=fork();t2=fork();if(t1!=0){ t3=fork();printf("0");}}The total number of processes that will be created by t...
User Avatar
0 votes
0 votes
0 answers
2
nihal_chourasiya asked Oct 11, 2023
214 views
madeeasy testseries
0.5028 0.2604 0.4792 0.6305
0.50280.26040.47920.6305
User Avatar
0 votes
0 votes
1 answer
3
nihal_chourasiya asked Oct 9, 2023
220 views
madeeasy testseries
User Avatar
0 votes
0 votes
1 answer
4
Gaurav Kadyan asked Aug 14, 2023
259 views
Madeeasy testseries
For merging two unsorted list of size m and n into sorted list of size m+n. The time complexity in terms of number of comparison for this is
For merging two unsorted list of size m and n into sorted list of size m+n. The time complexity in terms of number of comparison for this is
User Avatar
Link Copied!