2. Define a structure Marks which includes subject name and marks. Using
ragged array, write a ‘C’ program to read M Marks for N number of
students. The number of students(N) is dynamic. Also, number of
subjects a student can take may vary(dynamic). Display the content of
the ragged array after input. Find and display the largest marks scored by
each student.
struct Marks
{
char sub_name[20];
float marks;
};
3. Lab Questions
1) Implement an ascending priority queue.
Note: An ascending priority queue is a collection of items into which
items can be inserted arbitrarily and from which only the smallest item
can be removed. If apq is an ascending priority queue, the operation
pqinsert(apq,x) inserts element x into apq and pqmindelete(apq)
removes the minimum element from apq and returns its value.
3) Write a program to check whether given string is a palindrome
using a dequeue.
![Define a structure Marks which includes subject name and marks. Using
ragged array, write a ‘C’ program to read M Marks for N number of
students. The number of students(N) is dynamic. Also, number of
subjects a student can take may vary(dynamic). Display the content of
the ragged array after input. Find and display the largest marks scored by
each student.
struct Marks
{
char sub_name[20];
float marks;
};](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)