design and implement a data structure and performs the following operation with the help of file (included 1000 student marks in 5 sub. and %also) 1.how many students are fail in all 5 subjects (if >35) 2. delete all student data those are fail in all 5 subjects. 3. update the grace marks (5 no. if exam paper is 100 marks) 4. arrange the student data in ascending order basis of marks. 5.insert double of deleted students with marks in the list.

1483

---

Different Bitwin ADSL & DSL ROUTER? How To Configure

2390

---

Which is the most successful and evolving mammal of the animal kingdom?

646

---

How does data transfer happen from hdfs to hive?

80

---

How many objects of a servlet is created?

778

---

---

What is the difference between mongodb and redis database?

1

---

What kind of database is realm?

480

---

What is S/WAN ?

1470

---

Assume a thread has lock on it, calling sleep() method on that thread will release the lock?

610

---

Assume studentNames and studentIDs are two parallel arrays of size N that hold student data. Write a pseudocode algorithm that sorts studentIDs array in ascending ID number order such that the two arrays remain parallel.

1707

---

Is swift compiled or interpreted?

491

---

how to run servlet program between two computer through internet ?

2532

---

Is there anything that can't be replaced by style sheets?

308

---

What is php and why it is used?

538

---

What is meant by forced commutation?

625

---