Register

Vani online test series

469 views
1 votes
1 votes

They have give option c as the answer. But for me both option b and d seems correct? Can someone please clarify.

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

1 votes
1 votes
1 answer
1
Human asked Oct 8, 2018
622 views
Vani online test series
how the answer is 23699? For column major order I get answer as 80039. Even if i go by row major order the answer I get is 23599
how the answer is 23699?For column major order I get answer as 80039.Even if i go by row major order the answer I get is 23599
User Avatar
0 votes
0 votes
1 answer
2
Hirak asked May 25, 2019
685 views
VANI Question Bank :DBMS
Minimum number of tables required to represent the relation R where the $A_n$ stands for the primary key of each entity is ___________
Minimum number of tables required to represent the relation R where the $A_n$ stands for the primary key of each entity is ___________
User Avatar
1 votes
1 votes
1 answer
3
Human asked Sep 26, 2018
475 views
Vani test series question
https://gateoverflow.in/?qa=blob&qa_blobid=16020532755515515346 Shouldnt the answer be option d? How option c?
https://gateoverflow.in/?qa=blob&qa_blobid=16020532755515515346Shouldnt the answer be option d? How option c?
User Avatar
2 votes
2 votes
1 answer
4
Hirak asked May 21, 2019
1,248 views
Vani Qs Bank Algorithms
.Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]=i. Ans should be O(log n) right by doing binary search ??
.Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]=i.Ans should be O(log n) right by do...
User Avatar
Link Copied!