Register

GATEbook

274 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · probability made eas...Next → · test book
← Previous in category · Longest Common subse...Next in category → · made easy
Position:
Show:

Related questions

0 0 votes
0 0 answers
1.0k
1.0k views
pps121 asked Dec 7, 2018
1,020 views
GATEBOOK
Please mention proper approach to solve similar questions
0 0 votes
0 0 answers
1.2k
1.2k views
radha gogia asked Nov 16, 2018
1,207 views
Gatebook Test series ques
Answer given is Option A , but here we wil first sort the jobs in order of profit , for each value of deadline scan linearly in the array depending on the value of deadli...
0 0 votes
1 1 answer
429
429 views
amit166 asked Sep 11, 2018
429 views
gatebook
Q2.int A(int){if(n<=2) return 1;elsereturn (A(√n)+n);} time complexity
0 0 votes
2 2 answers
726
726 views
amit166 asked Sep 11, 2018
726 views
gatebook
Q.1 int A(int n){if(n==2) return 1;else{for(int j=1;j<=n;j++)printf(" * ");return(A(√n));}} Time complexity