- Due In 40 Min 1 (76.29 KiB) Viewed 27 times
due in 40 min
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
due in 40 min
due in 40 min
A- [10 points] Declare a self-referential structure StudentNode for a linked list having one data a field called GPA (float), and one pointer to StudentNode called next. B - (20 points) Write a non-recursive function that counts all the GPAs that are less than or equal to 2 in your linked list starting from the head of the list. Example: If the list is 1.9->2->3.5->4->1.8, the function should return 3. C- [20 points) Write a recursive function that prints all the GPAs that are higher or equal to 3.5 in your linked list starting from the head of the list. Example: If the list is 1.9->2->3.5->4->1.8, the function should print: 3.5->4.
A- [10 points] Declare a self-referential structure StudentNode for a linked list having one data a field called GPA (float), and one pointer to StudentNode called next. B - (20 points) Write a non-recursive function that counts all the GPAs that are less than or equal to 2 in your linked list starting from the head of the list. Example: If the list is 1.9->2->3.5->4->1.8, the function should return 3. C- [20 points) Write a recursive function that prints all the GPAs that are higher or equal to 3.5 in your linked list starting from the head of the list. Example: If the list is 1.9->2->3.5->4->1.8, the function should print: 3.5->4.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!