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


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More C++ General Interview Questions

Difference between pointer to constant and constant pointer to a constant. Give example.

0 Answers   HAL,


Why namespace is used in c++?

0 Answers  


What is helper in c++?

0 Answers  


Explain one method to process an entire string as one unit?

0 Answers  


Does c++ vector allocate memory?

0 Answers  






Difference between a copy constructor and an assignment operator.

0 Answers  


In the derived class, which data member of the base class are visible?

0 Answers  


What is oop in c++?

0 Answers  


What does 7/9*9 equal ? a) 1 b) 0.08642 c) 0

0 Answers  


Write a program to get the value of sin (x) using a library function , when x is given in degrees.

1 Answers  


What is array in c++ example?

0 Answers  


What is the difference between a template and a macro?

0 Answers  


Categories