Assume an array of structure is in order by studentID field of the record, where student IDs go from 101 to 500. Write the most efficient pseudocode algorithm you can to find the record with a specific studentID if every single student ID from 101 to 500 is used and the array has 400 elements. Write the most efficient pseudocode algorithm you can to find a record with a studentID near the end of the IDs, say in the range from 450 to 500, if not every single student ID in the range of 101 to 500 is used and the array size is only 300

2267

What is a unnitialised pointer?

1138

What is a storage class? Mention the storage classes in c++.

1071

Can there be at least some solution to determine the number of arguments passed to a variable argument list function?

1061

what you know about c++?

1199

What do you mean by ‘void’ return type?

1103

What are the benefits of oop in c++?

1315

Define macro.

1135

Why do we need constructors in c++?

1160

What is a c++ object?

1254

What is object oriented programming (oop)?

1171

What are the five basic elements of a c++ program?

1162

What does flush do c++?

1120

What do you mean by a template?

1114

How do you find out if a linked-list has an end?

1178