Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

1. A student has to get at least C credits to get a degree such that there are k categories of courses (e.g. core, mathematics,

image text in transcribed

1. A student has to get at least C credits to get a degree such that there are k categories of courses (e.g. core, mathematics, natural science, and general education) such that at least ri credits should be earned from the courses in category i. Some courses have prerequisites which must be satisfied before taking those courses. A student cannot register for more than a credits in any semester. Suggest a tree search to find all ways to take courses to graduate (graduation paths) after exactly p semesters by getting exactly C credits, while meeting the given constraints, assuming that the student will get grades needed to satisfy the prerequisites and maintain the GPA (grade point average) needed to graduate. Two graduation paths differ if the sets of courses for at least one semester in these paths differ. Describe what states in individual nodes in the search tree will have, how children of a node will be generated, how the number of nodes can be controlled to save memory, and what the termination condition will be. 1. A student has to get at least C credits to get a degree such that there are k categories of courses (e.g. core, mathematics, natural science, and general education) such that at least ri credits should be earned from the courses in category i. Some courses have prerequisites which must be satisfied before taking those courses. A student cannot register for more than a credits in any semester. Suggest a tree search to find all ways to take courses to graduate (graduation paths) after exactly p semesters by getting exactly C credits, while meeting the given constraints, assuming that the student will get grades needed to satisfy the prerequisites and maintain the GPA (grade point average) needed to graduate. Two graduation paths differ if the sets of courses for at least one semester in these paths differ. Describe what states in individual nodes in the search tree will have, how children of a node will be generated, how the number of nodes can be controlled to save memory, and what the termination condition will be

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Oracle9i Database Administrator Implementation And Administration

Authors: Carol McCullough-Dieter

1st Edition

0619159006, 978-0619159009

More Books

Students also viewed these Databases questions

Question

3. Develop a case study.

Answered: 1 week ago