gatebook

Niharika 1 asked Feb 2, 2017

213 views

See all

Please log in or register to answer this question.

Related questions

3 votes

0 answers

Ayush Upadhyaya asked Nov 15, 2018

952 views

GATEBOOK-DSA4_8
Consider a sorted array A of n integer elements, A[0]...A[n − 1]. A search operation is to be performed on this array using .Binary search algorithm. If the element being searched is in fact the last element of the array, what is the difference between the index of element ... This is my answer.But it matches none of the options. Where I went wrong?

Consider a sorted array A of n integer elements, A[0]...A[n − 1].A search operation is to be performed on this array using .Binary search algorithm. If the element bein...

Ayush Upadhyaya

952 views

Ayush Upadhyaya asked Nov 15, 2018

0 votes

0 answers

Tridhara Chakrabarti asked Dec 12, 2017

285 views

Gatebook test
Consider the following code. int a = 1; int b = 1; Function foo() { print(a); } Function bar(int x, int y){ int a = 0; foo() ; x = 0 ; b = b-y; r = Y+1; } Function foobar() { int r = 1 ; bar(r,b); print(b); print(r); ... So how will the function bar( int x,int y) access the variable 'r'?..it is local to fooBar()..i think this will throw compilation error..can anyone verify.

Consider the following code. int a = 1;int b = 1;Function foo() {print(a); }Function bar(int x, int y){int a = 0;foo() ;x = 0 ;b = b-y;r = Y+1;}Function foobar() {int r =...

Tridhara Chakrabarti

285 views

Tridhara Chakrabarti asked Dec 12, 2017

1 votes

0 answers

biranchi asked Jan 24, 2017

528 views

Loop invariants [GateBook]

biranchi

528 views

biranchi asked Jan 24, 2017

6 votes

2 answers

Sayan Das 1 asked Aug 27, 2016

1,429 views

Gatebook exam
Consider the following exponential search algorithm(ES). The array of n elements have to be searched is divided in to logn parts. The ith part is from index to. to search an element search all the parts one by one from left to right using binary search algorithm. What is the worst case complexity of above searching algorithm?

Consider the following exponential search algorithm(ES). The array of n elements have to be searched is divided in to logn parts. The ith part is from index to. to searc...

Sayan Das 1

1.4k views

Sayan Das 1 asked Aug 27, 2016

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

gatebook

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0