Descriptor
| Computer Science | 2 |
| Higher Education | 2 |
| Matrices | 2 |
| Algebra | 1 |
| Algorithms | 1 |
| College Mathematics | 1 |
| Credit Courses | 1 |
| Data Analysis | 1 |
| Educational Planning | 1 |
| Enrollment Projections | 1 |
| Learning Activities | 1 |
| More ▼ | |
Author
| Kalman, Dan | 1 |
| Kieft, Raymond N. | 1 |
Publication Type
| Guides - Classroom - Teacher | 1 |
| Journal Articles | 1 |
Education Level
Audience
| Practitioners | 1 |
| Teachers | 1 |
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Peer reviewedKieft, Raymond N. – College and University, 1977
A methodology for forecasting enrollments at the individual unit level is presented. It can be used to produce detailed enrollment projections (e.g., by class level by semester by year) or more aggregate information (e.g., academic or fiscal year total enrollment), and it does not require the typical institution to obtain new data. (LBH)
Descriptors: Computer Science, Credit Courses, Data Analysis, Educational Planning
Peer reviewedKalman, Dan – Mathematics Magazine, 1990
Presented is a scheduling algorithm that uses all the busses at each step for any rectangular array. Included are two lemmas, proofs, a theorem, the solution, and variations on this problem. (KR)
Descriptors: Algebra, Algorithms, College Mathematics, Computer Science


