我试过第二个第三点......不能解决PLZ帮助我 [英] I`m tried 2nd an 3rd points...can`t solve plz help me

问题描述

我正在开发php-mysql中的Exam Scheduler Web Application。 
第一点已经完成，但第二和第三点我无法理解（如何编写代码）plz帮助我在最后2点解决... 
 
我按照以下步骤操作： 
 
 1.管理课程并注册其中创建一个页面：
 
 1.1。将新课程代码（例如CS101）作为输入并以文本文件（例如CS101.txt）的形式在该课程中注册。该文本文件包含在该课程中注册的学生列表。例如：
 CS101.txt 
 
 BC160300123 
 
 BC160300234 
 
 BC170100345 
 
 BC170100456 
 
 ............ 
 
 1.2。通过提供具有该课程注册学生列表的新文件作为输入来更新现有课程的注册。 
 
 1.3。删除课程及相应的注册。 
 
 2.计算每门课程的非重叠课程列表
在本申请的上下文中，如果没有学生，课程A与课程B不重叠已注册课程A和B.您需要确定每门课程的所有非重叠课程的列表。输出可以是以下形式：
 
 
课程CS101 CS201 ENG101 CS502 
 
非重叠课程列表CS301，CS304，CS504，CS40​​3，CS601， CS606 CS301，CS304，CS504 ENG201，CS302，CS40​​1 CS602 
 
 ...... .. ...... 
 
 3.使用最少天数计算可能的正确时间表
给定每天的n个时段数，计算可能的时间表，并且最小天数。关于正确性：如果所有考试安排在同一天的课程彼此不重叠，则时间表将是正确的。

我尝试了什么：

我尝试了第二名第三名，第一名已经完成，但是第二名第3点我不能理解（怎么写代码）plz帮助这些最后2分... 
 

解决方案

< blockquote>这似乎是一个功课，规则很简单：我们不做作业。



浏览你的材料，将问题分成小块，如果需要，请与您的导师联系，以获得有关作业的帮助。通过这种方式，您可以清楚地了解需要增强的技能，并为您手头的任务提供良好的建议。毕竟，重点在于你学习，而不是我们，所以这一切都是为了给自己投资。



如果你对单个代码块有特定的问题，你可以将问题与您已经制作的所有代码一起发布，只要您能证明您已经付出了努力，人们就会尝试帮助解决个别问题。

I'm developing Exam Scheduler Web Application in php-mysql. 
first point is done but 2nd and 3rd points i can`t understand (how can write the code) plz help me solve in this last 2 points... 

I follow these steps:

1. Manage courses and enrollment in them Create a page that:

1.1. Takes as input a new course code (e.g. CS101) and enrollment in that course in the form of a text file (e.g. CS101.txt). The text file contains a list of students enrolled in that course. For example:
CS101.txt

BC160300123

BC160300234

BC170100345

BC170100456

………….

 1.2.   Updates enrollment in an existing course by giving as input a new file having list of students enrolled in that course.

 1.3.   Delete a course and the corresponding enrollment in it.

2. Calculate list of "Non-overlapping courses" for each course
In the context of this application, a course A is non-overlapping to a course B if there is no student who is enrolled in both the courses A and B. You are required to determine list of all non-overlapping courses for each course. The output can be of the following form:


Course CS101 CS201 ENG101 CS502

List of Non-overlapping Courses CS301, CS304, CS504, CS403, CS601, CS606 CS301, CS304, CS504 ENG201, CS302, CS401 CS602

….. …….

3. Calculate a possible "correct" schedule with minimum number of days
Given ‘n’ number of slots per day, calculate a possible schedule with minimum number of days. Regarding correctness: A schedule will be correct if all the courses whose exams are scheduled on same day are non-overlapping with each other.

What I have tried:

i`m tried 2nd an 3rd points, first point is done but 2nd and 3rd points i can`t understand (how can write the code) plz help in these last 2 points...

解决方案

This seems like a homework and the rule is simple: We don't do homework.

Go through the material you have, split the problem into small pieces and if needed, talk with your instructor to get help with the assignment. This way you both get a clear picture what skills need to be enhanced and you get good advice for the task at hand. After all, the point is that you learn, not us, so it's all about investing to yourself.

If you have specific questions about a single code block, you can post the question along with all the code you have already made and people will try to help to solve the individual problem as long as you can show that you have put effort into it.

这篇关于我试过第二个第三点......不能解决PLZ帮助我的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！