Answer Posted / 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;
}

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

9020

---

What is the problem of ordered sequential files access?

1111

---

How do we get current date from system with century in COBOL?

1324

---

What rules are followed by the search verb.

1051

---

What is the local-storage section?

1105

---

What is the difference between a binary search and a sequential search what are the pertinent cobol?

1095

---

if we have " ibm mainframe ",in that how to remove first and last leading space eg:"ibm mainframe" like that the answer we need

1293

---

2 input fles: 2 flat files, with different number of records. both are having unique key for each record and already sorted in ascending order . match these files using unique key and in output only matching key value has to be written. please procide cobol logic

2548

---

In COBOL, what is the different between index and subscript?

1188

---

What is the difference between binary search and sequential search?

1047

---

what is difference between cobol and cobol/400

22737

---

can anybody post me about file-aid and changemen tools pls and give me reference if any mainframe guys are there

2324

---

Define static linking and dynamic linking.

1113

---

example for sub strings ? and refernce modifications whit output pls

2269

---

how can we apply for HSBC exam(Mainframe) in India??? i went to their site and was told to submit my CV ,. etc..( totally confusing...)

2337

---