Answer / muhammad abdul aleem

Binary Search | Sequential Search
1.Search All | 1.Search
2.Data should be in sorted | 2.Data can be in any order
order |
3. Only 1 When condition | 3. Any no. of when conditions
can be used | can be used.
4. Only '=' relational | 4. Any relational operator.
operator is used |
5. Access is faster | 5. Access is slow
6.Used for only single | 6. used for single/Multi
dimentional array | dimentional array.

Answer / guest

Binary search is search all. sequential search is the
linear serach.

Example for Search all: File contains 100 records. supose
if u r searching for 75 th record, first entire file
divided into two parts, it will check , whether record is
in first half or second.. like that file ds divded into
diffrent parts

sequential serach: if the file contains 100 records, spose
if u r looking for 75th record, it will start serach from
first record...

Answer / shyamendra

Binary search is attampt on file which is in sorted
order.Search All is the key word.Only one 'WHEN'
& 'AND'.Only '=' is used.
While Linear search can be attempt on any
file.Any logical operation is possible.Multiple 'WHEN' are
possible.Index is set to 1 before starting searching.When
table size is small then only we use this.

Answer / boxee

binary search is fast because
it check the element mid
is element is less
it set the beg
mid=(beg+end)/2;
if(value>a[mid])
{
beg=mid+1;
}
else
{
end=mid-1;
}

Answer / muthu

binary search runs in O(logn) time whereas linear search
runs in O(n) times thus binary search has better
performance.

Answer / sahil chawla

HI !!!!
I m Sahil Chawla


It is to be noted that in binary search MID=(start+end)/2
is to be found
but in linear search there is no such condition

Answer / anupam

binary search is performed by calculating mid point whereas sequential search is performed by sorting all elements.prior is the faster.

Answer / pratik gondaliya

with binary serch we can not get output faster because it is difficult to sort the character element.

with linear serch we can get output fastest.

example-: hello my name is pratik

Answer / santhosh

santhosh kumar is a very good boy???

Answer / a.r.rahman(music director

binary and sequensial search is bad.................

The following entries appear in the WORKING-STORAGE SECTION: 01 DATE-TODAY. 05 YY PIC XX VALUE "90". 05 MM PIC XX VALUE "12". 05 DD PIC XX VALUE :31". 01 DATE-EDIT PIC XX/XX/XX. MOVE DATE-TODAY TO DATE-EDIT. (a) 901231 (b) 90/12/31 (c) 31/12/90 (d) 311290

4 Answers   TCS,

01 x pic s9(8) comp. How will the following value be internally allocated '18787'

4 Answers   Steria,

What are various search techniques in cobol? Explain.

0 Answers  

The hierarchy of the execution of logical operators is (a) NOT AND OR (b) AND OR NOT (c) OR AND NOT (d) OR NOT AND

10 Answers   Huawei, IBM, TCS,

what is difference bt COND, REGION & TIME parameters at JOB & EXEC. give an exp.

1 Answers   Syntel,

Write a cobol program making use of the redefine clause.

0 Answers  

I have a Main Program which is calling Sub-Program which is a DB2 pgm. What will happen if I am not closing the cursor used in the Sub-program? Please advise..

3 Answers   iGate,

What are the ways you can generate a copybook?

2 Answers  

Read a flat file and write last but one (I have n records in a file I have to write n-1th) record in another flat file. Could you please provide me the code in COBOL?

1 Answers  

consider the following piece of code 01 GROUP-ITEM 05 AMOUNT-1 PIC 99V9 USAGE COMP VALUE 50 05 AMOUNT-2 PIC 9(4)V99 USAGE COMP MOVE ZERO TO GROUP-ITEM ADD 50 TO AMOUNT-1 what will be the content of AMOUNT-1? a.50 b.100 c.0 d.unpredictable

10 Answers   TCS,

What is Static and Dynamic linking ?

3 Answers  

what is the diff b/w select stsmt and cursor ?

2 Answers