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

1878

---

When to use rspec and when to use cucumber?

391

---

What is the basic syntax of a sas program?

755

---

Explain how to view shared memory statistics?

624

---

What is apache spark for beginners?

213

---

---

What is an excel template?

375

---

What is c++ map?

660

---

Explain server side state management system.

633

---

What are the advantages of ansible?

1

---

Name at least 5 different types of transformations used in mapping design and state the use of each.?

782

---

How do you run a servlet?

629

---

What is csrf attack in asp.net?

592

---

Is it the relation between friction and power losses ? is it relation among stress, friction and power loses in cicular ring ?

1706

---

What is angular js i18n and l10n language translation?

533

---

correction of sundry creotors

2281

---