COMPUTING NETWORK NODE ADJUSTMENTS

• US 20140280205A1
• Filed: 03/14/2013
• Published: 09/18/2014
• Est. Priority Date: 03/14/2013
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: BHALLA, Amit, AWADHIYA, Parag, TIWARI, Arun
• Granted Patent: US 10,394,767 B2
• Time in Patent Office: Days
• US Class Current: 707/748
• CPC Class Codes: G06F 16/211 Schema design and management

Abstract

A method of computing relative rankings for multiple course trajectories may include accessing a data structure. The data structure may include a first node that may represent a first course and a plurality of nodes that may represent courses that are available after completing the first course. Each of the plurality of nodes may be associated with a weight, and the plurality of nodes may include a second node representing a second course. The method may also include receiving a first grade for a student for the first course and receiving a second grade for the student for the second course. The method may additionally include adjusting the weight associated with the second node using the first grade and the second grade. The method may further include providing a ranking of the plurality of courses using the weights of the plurality of courses.

Claims

1. A method of computing relative rankings for multiple course trajectories, the method comprising:

accessing a data structure comprising;

a first node representing a first course; and

a plurality of nodes representing courses that are available after completing the first course, wherein;

each of the plurality of nodes is associated with a weight; and

the plurality of nodes comprises a second node representing a second course;

receiving a first grade for a student for the first course;

receiving a second grade for the student for the second course;

adjusting the weight associated with the second node using the first grade and the second grade; and

providing a ranking of the plurality of courses using the weights of the plurality of courses.

2. The method of claim 1 wherein:

the data structure comprises a tree data structure that is organized into a plurality of parent-child relationships; and

each of the plurality of nodes is a child of the first node.

3. The method of claim 2 wherein the course represented by the first node comprises a prerequisite for each of the courses represented by the plurality of nodes.

4. The method of claim 1 wherein adjusting the weight comprises:

determining that the first grade is higher than the second grade; and

reducing the weight associated with the second node.

5. The method of claim 1 wherein adjusting the weight comprises:

determining that the first grade is lower than the second grade; and

increasing the weight associated with the second node.

6. The method of claim 1 further comprising using a balancing factor to adjust the weight associated with the second node.

7. The method of claim 1 wherein the ranking of the plurality of courses comprises a relative recommendation of courses after the first course.

8. The method of claim 1 further comprising causing the courses associated with each of the plurality of nodes to be displayed in an order based on the rankings.

9. The method of claim 8 further comprising:

determining that no students have enrolled in a third course associated with a third node; and

causing an indication to be displayed communicating that no students have enrolled in the third course instead of displaying the weight associated with the third node.

10. A computer-readable memory comprising a sequence of instructions which, when executed by one or more processors, causes the one or more processors to compute relative rankings for multiple course trajectories by:

accessing a data structure comprising;

a first node representing a first course; and

a plurality of nodes representing courses that are available after completing the first course, wherein;

each of the plurality of nodes is associated with a weight; and

the plurality of nodes comprises a second node representing a second course;

receiving a first grade for a student for the first course;

receiving a second grade for the student for the second course;

adjusting the weight associated with the second node using the first grade and the second grade; and

providing a ranking of the plurality of courses using the weights of the plurality of courses.

11. The computer-readable memory according to claim 10 wherein:

the data structure comprises a tree data structure that is organized into a plurality of parent-child relationships; and

each of the plurality of nodes is a child of the first node.

12. The computer-readable memory according to claim 11 wherein the course represented by the first node comprises a prerequisite for each of the courses represented by the plurality of nodes.

13. The computer-readable memory according to claim 10 wherein adjusting the weight comprises:

determining that the first grade is higher than the second grade; and

reducing the weight associated with the second node.

14. The computer-readable memory according to claim 10 wherein adjusting the weight comprises:

determining that the first grade is lower than the second grade; and

increasing the weight associated with the second node.

15. The computer-readable memory according to claim 10 wherein the instructions further cause the one or more processors to compute relative rankings for multiple course trajectories by using a balancing factor to adjust the weight associated with the second node.

16. A system comprising:

one or more processors; and

a memory communicatively coupled with and readable by the one or more processors and comprising a sequence of instructions which, when executed by the one or more processors, cause the one or more processors to compute relative rankings for multiple course trajectories by;

accessing a data structure comprising;

a first node representing a first course; and

a plurality of nodes representing courses that are available after completing the first course, wherein;

each of the plurality of nodes is associated with a weight; and

the plurality of nodes comprises a second node representing a second course;

receiving a first grade for a student for the first course;

receiving a second grade for the student for the second course;

adjusting the weight associated with the second node using the first grade and the second grade; and

providing a ranking of the plurality of courses using the weights of the plurality of courses.

17. The system of claim 16 wherein:

the data structure comprises a tree data structure that is organized into a plurality of parent-child relationships; and

each of the plurality of nodes is a child of the first node.

18. The system of claim 17 wherein the course represented by the first node comprises a prerequisite for each of the courses represented by the plurality of nodes.

19. The system of claim 16 wherein adjusting the weight comprises:

determining that the first grade is higher than the second grade; and

reducing the weight associated with the second node.

20. The system of claim 16 wherein the instructions further cause the one or more processors to compute relative rankings for multiple course trajectories by using a balancing factor to adjust the weight associated with the second node.