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
- 0 Answers
- 1785 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
What is a try block?
What is the difference between "overloading" and "overridding"?
What is the difference between Class and Structure?
40 Answers HP, IBM, Samsung, TCS,
Why do we need c++?
What is dangling pointers?and what is memory leak?
How do you clear a buffer in c++?
How are Structure passing and returning implemented by the compiler?
What you know about structures in C++?
0 Answers Agilent, ZS Associates,
Can recursive program be written in C++?
What are manipulators used for?
Write about the members that a derived class can add?
class X { private: int a; protected: X(){cout<<"X constructor was called"<<endl;} ~X(){cout<<"X destructor was called"<<endl} }; Referring to the code above, which one of the following statements regarding "X" is TRUE? a) X is an abstract class. b) Only subclasses of X may create X objects. c) Instances of X cannot be created. d) X objects can only be created using the default copy constructor. e) Only friends can create instances of X objects.
STL 
