CN117574008B - Course data arrangement processing method and device, server and storage medium - Google Patents

Course data arrangement processing method and device, server and storage medium Download PDF

Info

Publication number
CN117574008B
CN117574008B CN202410061542.3A CN202410061542A CN117574008B CN 117574008 B CN117574008 B CN 117574008B CN 202410061542 A CN202410061542 A CN 202410061542A CN 117574008 B CN117574008 B CN 117574008B
Authority
CN
China
Prior art keywords
data
array
section
arrays
ending
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202410061542.3A
Other languages
Chinese (zh)
Other versions
CN117574008A (en
Inventor
康刘颖
黄武
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chengdu Techman Software Co Ltd
Original Assignee
Chengdu Techman Software Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chengdu Techman Software Co Ltd filed Critical Chengdu Techman Software Co Ltd
Priority to CN202410061542.3A priority Critical patent/CN117574008B/en
Publication of CN117574008A publication Critical patent/CN117574008A/en
Application granted granted Critical
Publication of CN117574008B publication Critical patent/CN117574008B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/957—Browsing optimisation, e.g. caching or content distillation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06316—Sequencing of tasks or work
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/20—Education
    • G06Q50/205—Education administration or guidance
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Economics (AREA)
  • General Physics & Mathematics (AREA)
  • Educational Administration (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Databases & Information Systems (AREA)
  • Educational Technology (AREA)
  • General Health & Medical Sciences (AREA)
  • Data Mining & Analysis (AREA)
  • Primary Health Care (AREA)
  • General Engineering & Computer Science (AREA)
  • Development Economics (AREA)
  • Health & Medical Sciences (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a course data arrangement processing method, a course data arrangement processing device, a server and a storage medium. The method comprises the following steps: acquiring data to be arranged according to date attributes in the data arrangement instruction; generating a data set to be arranged according to the sequencing result corresponding to the starting section and the ending section of the data to be arranged; according to the sequence of data to be arranged in the data set to be arranged, the data to be arranged in the data set to be arranged are matched one by one, and a plurality of groups of arrays to be arranged are generated; stacking the arrays to be arranged according to the sequencing result corresponding to the total number of the sections of the arrays to be arranged, generating a stacking array, and determining a segmentation value; and dividing the stacked array according to the dividing value to generate an arrangement result. By arranging all course data, a visual stacked school timetable is generated, the course arranging state is visually displayed, the technical problem that the observed data is single and not visual in the prior art is solved, and the visual and comprehensive technical effect of course arrangement checking is realized.

Description

Course data arrangement processing method and device, server and storage medium
Technical Field
The present invention relates to the field of data processing technologies, and in particular, to a course data arrangement processing method, apparatus, server, and storage medium.
Background
With the development of the network age, education informatization is greatly promoted. Many schools have established informationized teaching systems, and online teaching is an emerging teaching mode, which becomes a beneficial supplement to traditional offline teaching. After the school introduces the school desk into the teaching system, an intuitive and complete school desk can help teachers, students and school administrators to more intuitively know the course arrangement condition. The paper curriculum schedule is inconvenient to view in time, and the visual curriculum schedule can facilitate teachers and school administrators to view the curriculum schedule quickly, and the school administrators can adjust the curriculum according to the curriculum schedule.
The conventional web-side curriculum schedule performs plane display aiming at the curriculum information of a certain teaching week in a certain classroom, and needs to be positioned to the appointed classroom and the appointed teaching week before displaying the curriculum arrangement condition of the appointed classroom in the current week, and each curriculum is at most displayed.
However, in the process of implementing the technical scheme of the invention in the embodiment of the application, the inventor of the application finds that at least the following technical problems exist in the above technology:
after course information is imported into a school timetable, a school administrator cannot quickly overview course arrangement conditions of the whole school classrooms, cannot intuitively know which times have no course plans, cannot quickly find the time for course arrangement when the courses need to be temporarily added, and students and teachers can only check the course arrangement conditions of one classroom at the week at a time, cannot overview the courses of all classrooms, and the checked data are single and not intuitive.
Disclosure of Invention
In view of the above problems, the embodiment of the invention solves the technical problems of single display data and inadequate visual viewing of the school timetable in the prior art by providing a processing method, a device, a server and a storage medium for course data arrangement, and achieves the visual and comprehensive technical effects of course data.
The embodiment of the application provides a course data arrangement processing method, device, server and storage medium.
In a first aspect, the present invention provides a method for processing course data arrangement, including the following steps:
acquiring data to be arranged according to a date attribute in a data arrangement instruction, wherein the data to be arranged comprises the date attribute, a start section and an end section;
generating a data set to be arranged according to the ordering result corresponding to the starting section and the ending section of the data to be arranged;
according to the sequence of the data to be arranged in the data to be arranged, the data to be arranged in the data to be arranged are matched one by one to generate a plurality of groups of arrays to be arranged, and the beginning section of the current data to be arranged in each array to be arranged is larger than the ending section of the previous data to be arranged;
stacking the arrays to be arranged according to a sequencing result corresponding to the total of the sections of the arrays to be arranged, generating a stacking array, and determining a dividing value, wherein the dividing value is determined according to the starting section and the ending section of the arrays to be arranged;
and dividing the stacked array according to the dividing value to generate an arrangement result.
Preferably, generating the data set to be arranged according to the sorting result corresponding to the start section and the end section of the data to be arranged includes:
dividing the data to be arranged into at least one sample set to be arranged according to the starting times of the data to be arranged;
sequencing the data to be arranged in each data set to be arranged according to the preset sequence of ending the times to generate at least one data partition to be arranged;
determining partition values respectively corresponding to the data partitions to be arranged according to the starting times corresponding to the data partitions to be arranged, wherein the partition values are the starting times of the corresponding data partitions to be arranged;
and merging all the data to be arranged of all the data partitions to be arranged according to the preset sequence of the partition values to generate a data set to be arranged.
Preferably, according to the order of the data to be arranged in the data set to be arranged, the data to be arranged in the data set to be arranged is matched one by one, and a plurality of groups of arrays to be arranged are generated, including:
judging whether the starting section corresponding to the nth data to be arranged is larger than the ending section corresponding to any data to be arranged before the nth data to be arranged according to the sequence of the data to be arranged in the data set to be arranged, wherein N is an integer, N is more than 0 and less than or equal to N, and N is the number value of the data to be arranged in the data set to be arranged;
if yes, determining at least one piece of alternative data, wherein the ending section of the alternative data is smaller than the starting section corresponding to the current data to be arranged;
determining target data according to the candidate data, wherein in all the candidate data, the difference between the ending section corresponding to the target data and the starting section corresponding to the nth data to be arranged is the smallest;
sequentially storing the target data and the nth data to be arranged into an empty array to generate an array to be stacked;
updating the data set to be arranged according to the array to be stacked, wherein the updated data set to be arranged does not comprise the data to be arranged in the array to be stacked;
if not, generating an array to be stacked according to the nth data to be arranged;
judging whether the quantity of the data to be arranged in the data set to be arranged is 0;
if yes, generating a plurality of groups of arrays to be arranged according to all the arrays to be stacked.
Preferably, stacking the to-be-arranged arrays according to a sorting result corresponding to the total number of the sections of the to-be-arranged arrays, generating a stacked array, and determining a segmentation value, including:
respectively determining the total node of each array to be arranged, wherein the total node is the starting node, the ending node and the node sum between the starting node and the ending node;
stacking the arrays to be arranged according to the sequence from the large sum to the small sum of the sections to generate a stacking array;
determining the segmentation value according to the starting section and the ending section of the first data to be arranged in each array to be arranged, wherein the starting section of the first data to be arranged in all the arrays to be arranged is smaller than the segmentation value, and the ending section is smaller than or equal to the segmentation value;
preferably, dividing the stacked array according to the division value, generating an arrangement result includes:
determining the corresponding identification and full data position information of each array to be arranged in the stacking array, wherein the full data position information is used for indicating the position of the data to be arranged in the corresponding array to be arranged;
determining the first data to be arranged in each array to be arranged, wherein the starting section number of the first data to be arranged is larger than the dividing value, and determining the position of all data corresponding to the data to be arranged;
dividing each array to be arranged in the stacking array according to the full data position corresponding to the data to be arranged in each array to be arranged, and generating the arrangement result;
in a second aspect, the present invention also provides a course data arrangement apparatus, including:
the data arrangement module is used for obtaining data to be arranged according to the date attribute in the data arrangement instruction, wherein the data to be arranged comprises the date attribute, a start section and an end section.
And the partitioning module is used for generating a data set to be arranged according to the sequencing result corresponding to the starting section and the ending section of the data to be arranged.
The matching module is used for matching the data to be arranged of the data set to be arranged one by one according to the sequence of the data to be arranged in the data set to be arranged, generating a plurality of groups of data to be arranged, wherein the starting section of the current data to be arranged in each data to be arranged is larger than the ending section of the previous data to be arranged.
And the stacking module is used for stacking the arrays to be arranged according to the sequencing result corresponding to the total number of the sections of the arrays to be arranged, generating a stacking array, and determining a dividing value, wherein the dividing value is determined according to the starting section and the ending section of the arrays to be arranged.
And the generating module is used for dividing the stacked array according to the dividing value and generating an arrangement result.
In a third aspect, the present invention also provides a server, including:
one or more processors.
And a storage device for storing one or more programs.
The one or more programs, when executed by the one or more processors, cause the one or more processors to implement any of the methods of course data arrangement.
In a fourth aspect, the present invention also provides a storage medium containing computer executable instructions which, when executed by a computer processor, are adapted to carry out any one of the methods of course data arrangement processing.
One or more technical solutions provided in the embodiments of the present application at least have the following technical effects or advantages:
through the way of ordering, combining, stacking and dividing all course data, a visual stacking school timetable is generated, the courses are displayed in pages to the greatest extent, the course arranging condition is displayed visually by the arrangement effect of the course data, the technical problem that the observed data are single and not visual in the prior art is solved, and the visual and comprehensive technical effect of checking course arrangement is realized.
Drawings
FIG. 1 is a flowchart of a method for processing course data configuration according to an embodiment of the present invention;
FIG. 2 is a flowchart of a method for generating a partition of data to be arranged according to an embodiment of the present invention;
FIG. 3 is a flowchart of a method for generating multiple groups of arrays to be arranged according to an embodiment of the present invention;
FIG. 4 is a flowchart of a method for generating a stacked array according to an embodiment of the present invention;
FIG. 5 is a flowchart of a method for generating an arrangement result according to an embodiment of the present invention;
FIG. 6 is a schematic diagram of course data configuration results according to an embodiment of the present invention;
FIG. 7 is a block diagram of a course data arrangement apparatus according to an embodiment of the present invention;
FIG. 8 is a block diagram of a server according to an embodiment of the present invention;
Detailed Description
According to the course data arrangement processing method, device, server and storage medium, the technical problems that in the prior art, the display data of the school timetable is single and visual viewing is not enough are solved, and visual and comprehensive technical effects of course data are achieved.
In order to better understand the above technical solutions, the following detailed description will refer to the accompanying drawings and specific embodiments.
Example 1
In this embodiment, the stacked data to be arranged is divided by determining the division value, and different courses are divided according to the division value, so that the final arrangement result is more visual.
FIG. 4 is a flow chart of a method for generating a stacked array according to an embodiment of the present invention.
S4.1, respectively determining the total of the section numbers corresponding to the groups to be arranged, wherein the total of the section numbers is the section numbers of the beginning section numbers, the ending section numbers and the section numbers between the beginning section numbers and the ending section numbers.
In this embodiment, after generating multiple groups of to-be-arranged arrays, a total node sum corresponding to each to-be-arranged array is first determined, where the total node sum refers to a starting node, an ending node, and a total node sum between the starting node and the ending node of the to-be-arranged data in the corresponding to-be-arranged array.
Illustratively, the accumulation of the segments of [1-6, 8-9] is: 1+2+3+4+5+6+8+9=38, the pitch accumulation of [1-5] is 15, the pitch accumulation of [1-4] is 10, the pitch accumulation of [2-5] is 14, the pitch accumulation of [2-4] is 9, the pitch accumulation of [3-6, 8] is 26, and the pitch accumulation of [3-4] is 7.
S4.2, stacking the arrays to be arranged according to the sequence of the total of the sections from large to small to generate a stacking array.
In this embodiment, after determining the total number of the sections of each array to be arranged, the arrays to be arranged are stacked according to the order of the total number of the sections from large to small to generate a stacked array, specifically, the array to be arranged with the largest total number of the sections in the stacked array is located at the uppermost layer, and the array to be arranged with the smallest total number of the sections is located at the bottommost layer.
Illustratively, the last stacked array is [ [1-6, 8-9], [3-6, 8], [1-5], [2-5], [1-4], [2-4], [3-4] ]. Specifically, [1-6, 8-9] is located at the uppermost layer.
S4.3, determining a segmentation value according to the beginning segmentation and the ending segmentation of the first data to be arranged in each array to be arranged, wherein the beginning segmentation of the first data to be arranged in all the arrays to be arranged is smaller than the segmentation value, and the ending segmentation is smaller than or equal to the segmentation value.
In this embodiment, after generating the stacked array, first, the start section and the end section corresponding to the first data to be arranged of all the arrays to be arranged are obtained, then the alternative segmentation values are confirmed according to all the start sections, and finally in the alternative segmentation values, the segmentation values are confirmed according to all the end sections. Specifically, the alternative split value is greater than all beginning segments and the split value is greater than or equal to all ending segments. The segmentation value is not unique.
For example, 6, 7 and 8 are all greater than the beginning node of the first data to be arranged of all the arrays to be arranged and greater than or equal to the ending node of the first data to be arranged of all the arrays to be arranged, so 6, 7 and 8 can be all used as the dividing values.
S5, dividing the stacked array according to the dividing value to generate an arrangement result.
In this embodiment, the final arrangement result is obtained by dividing each array to be arranged by using the dividing value. Furthermore, the arrangement result can be rendered, so that the final course page is more visual.
Fig. 5 is a flowchart of a method for generating an arrangement result according to an embodiment of the present invention.
S5.1, determining the corresponding identification and the full data position information of each array to be arranged in the stacked array, wherein the full data position information is used for indicating the position of the data to be arranged in the corresponding array to be arranged.
In this embodiment, after determining the partition value, a representation is determined for each array to be arranged, and the identifiers of the different arrays to be arranged are different. The identifier is specifically used for uniquely identifying one array to be arranged, and according to the identifier, all data contents of the array to be arranged can be determined. The identification may be an letter or a number.
In this embodiment, after determining the partition value, a piece of full data location information is determined for each piece of data to be arranged, where the full data location information refers to location information of the data to be arranged in the array to be arranged. Specifically, the full data location information may be determined according to the location of the data to be arranged in the array to be arranged.
S5.2, determining first data to be arranged, of which the initial section is larger than the dividing value, in each array to be arranged, and determining all data positions corresponding to the data to be arranged.
In this embodiment, after determining the identifier and the full data position information corresponding to each to-be-arranged array, first, determining the first to-be-arranged data with the starting node number greater than the partition value in each to-be-arranged array, and then determining the full data position of the to-be-arranged data. Specifically, each determined data to be arranged is located in a different array to be arranged, and in the corresponding array to be arranged, the starting section of each determined data to be arranged is larger than the starting section of the data to be arranged before the determined data to be arranged.
S5.3, dividing each array to be arranged in the stacked array according to the full data position corresponding to the data to be arranged in each array to be arranged, and generating an arrangement result.
In this embodiment, after determining the corresponding full data position of the data to be arranged, firstly, the data before the corresponding full data position is placed in the curriculum schedule, and then, the data after the corresponding full data position is placed in the curriculum schedule, so as to generate the arrangement result. Specifically, the arrangement result is the final school timetable display result.
Illustratively, FIG. 6 shows a schematic diagram of course data arrangement results according to an embodiment of the present invention. As shown in FIG. 6, the course data arrangement result is shown, specifically, the uppermost to-be-arranged arrays are 1-6 and 8-9, the number of layers of the current stacked array is 7 in the upper right corner of the 1-6 pages, the current number of layers is the first layer, in the actual page, 1-6 course pages are clicked, other stacked arrays are shown according to the stacking layers, specifically 3-6, 1-5, 2-5, 1-4, 2-4 and 3-4, all the remaining stacked arrays are not completely shown in FIG. 6, in actual operation, the pull-down page can view all course arrangements, and when 8-9 pages are clicked, 8-9 times of course information and 8 th times of course information are sequentially shown. The user can intuitively see all courses corresponding to the current section.
According to the embodiment of the invention, the visual stacking school timetable is generated by means of sorting, combining, stacking and dividing all the course data, the courses are displayed in the page to the maximum extent, the course arrangement effect of the course data intuitively displays the course arrangement state, the technical problem that the observed data is single and not intuitive in the prior art is solved, and the visual and comprehensive technical effect of viewing course arrangement is realized.
Example two
Fig. 7 is a block diagram of a course data arrangement apparatus according to an embodiment of the present invention. As shown in fig. 7, the apparatus includes:
the obtaining module 201 is configured to obtain data to be arranged according to a date attribute in the data arrangement instruction, where the data to be arranged includes the date attribute, a start section and an end section.
The partition module 202 is configured to divide the data to be arranged into N data partitions to be arranged according to the ordering result corresponding to the start section and the end section of the data to be arranged, and determine partition values corresponding to the data partitions to be arranged, where the partition values are used to indicate the start section of the data partitions to be arranged.
The matching module 203 is configured to match the data to be arranged of different data partitions to be arranged to generate multiple groups of arrays to be arranged, where a starting node of the current data to be arranged in each array to be arranged is greater than an ending node of the previous data to be arranged.
The stacking module 204 is configured to stack the to-be-arranged arrays according to the ordering result corresponding to the sum of the sections of the to-be-arranged arrays, generate a stacked array, determine a division value, and determine the division value according to the beginning section and the ending section of the to-be-arranged arrays.
The generating module 205 is configured to split the stacked array according to the split value, and generate an arrangement result.
Example III
Fig. 8 shows a schematic structural diagram of a server according to an embodiment of the present invention, and as shown in fig. 8, the server includes a processor 60, a memory 61, an input device 62 and an output device 63; the number of processors 60 in the server may be one or more, one processor 60 being taken as an example in fig. 8; the processor 60, the memory 61, the input means 62 and the output means 63 in the server may be connected by a bus or other means, in fig. 6 by way of example.
The memory 61 is a computer-readable storage medium that can be used to store software programs, computer-executable procedures, and modules, such as modules corresponding to the course data arrangement method in the embodiment of the present invention. The processor 60 executes various functional applications of the server and data processing, i.e., implements the course data arrangement method described above, by running software programs, instructions, and modules stored in the memory 61.
The memory 61 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, at least one application program required for functions; the storage data area may store data created according to the use of the terminal, etc. In addition, memory 61 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid-state storage device. In some examples, memory 61 may further comprise memory remotely located relative to processor 60, which may be connected to a server via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The input device 62 is operable to receive input numeric or character information and to generate key signal inputs related to user settings and function control of the server. The output 63 may comprise a display device such as a display screen.
Example IV
A fourth embodiment of the present invention also provides a storage medium containing computer-executable instructions, which when executed by a computer processor, are configured to perform a method of processing a course data arrangement, the method comprising:
and acquiring data to be arranged according to the date attribute in the data arrangement instruction, wherein the data to be arranged comprises the date attribute, the beginning section and the ending section.
Dividing the data to be arranged into N data partitions to be arranged according to the ordering results corresponding to the beginning section and the ending section of the data to be arranged, and determining partition values corresponding to the data partitions to be arranged respectively, wherein the partition values are used for indicating the beginning section of the data partitions to be arranged.
And matching the data to be arranged of different data partitions to be arranged to generate a plurality of groups of arrays to be arranged, wherein the starting section of the current data to be arranged in each array to be arranged is larger than the ending section of the previous data to be arranged.
And stacking the arrays to be arranged according to the sequencing result corresponding to the total number of the sections of the arrays to be arranged, generating a stacking array, determining a dividing value, and determining the dividing value according to the starting section and the ending section of the arrays to be arranged.
And dividing the stacked array according to the dividing value to generate an arrangement result.
It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following claims be interpreted as including the preferred embodiments and all such alterations and modifications as fall within the scope of the invention.
It will be apparent to those skilled in the art that various modifications and variations can be made to the present invention without departing from the spirit or scope of the invention. Thus, it is intended that the present invention also include such modifications and alterations insofar as they come within the scope of the appended claims or the equivalents thereof.

Claims (6)

1. The course data arrangement processing method is characterized by comprising the following steps:
acquiring data to be arranged according to a date attribute in a data arrangement instruction, wherein the data to be arranged comprises the date attribute, a start section and an end section;
generating a data set to be arranged according to the ordering result corresponding to the starting section and the ending section of the data to be arranged;
according to the sequence of the data to be arranged in the data to be arranged, the data to be arranged in the data to be arranged are matched one by one to generate a plurality of groups of arrays to be arranged, and the beginning section of the current data to be arranged in each array to be arranged is larger than the ending section of the previous data to be arranged;
stacking the arrays to be arranged according to a sequencing result corresponding to the total of the sections of the arrays to be arranged, generating a stacking array, and determining a dividing value, wherein the dividing value is determined according to the starting section and the ending section of the arrays to be arranged;
dividing the stacked array according to the dividing value to generate an arrangement result;
wherein, according to the sequencing result corresponding to the beginning section and the ending section of the data to be arranged, generating a data set to be arranged comprises:
dividing the data to be arranged into at least one sample set to be arranged according to the starting times of the data to be arranged;
sequencing the data to be arranged in each data set to be arranged according to the preset sequence of ending the times to generate at least one data partition to be arranged;
determining partition values respectively corresponding to the data partitions to be arranged according to the starting times corresponding to the data partitions to be arranged, wherein the partition values are the starting times of the corresponding data partitions to be arranged;
combining all data to be arranged of all the data partitions to be arranged according to the preset sequence of the partition values to generate a data set to be arranged;
according to the sequence of the data to be arranged in the data set to be arranged, the data to be arranged in the data set to be arranged are matched one by one, and a plurality of groups of arrays to be arranged are generated, including:
judging whether the starting section corresponding to the nth data to be arranged is larger than the ending section corresponding to any data to be arranged before the nth data to be arranged according to the sequence of the data to be arranged in the data set to be arranged, wherein N is an integer, N is more than 0 and less than or equal to N, and N is the number value of the data to be arranged in the data set to be arranged;
if yes, determining at least one piece of alternative data, wherein the ending section of the alternative data is smaller than the starting section corresponding to the current data to be arranged;
determining target data according to the candidate data, wherein in all the candidate data, the difference between the ending section corresponding to the target data and the starting section corresponding to the nth data to be arranged is the smallest;
sequentially storing the target data and the nth data to be arranged into an empty array to generate an array to be stacked;
updating the data set to be arranged according to the array to be stacked, wherein the updated data set to be arranged does not comprise the data to be arranged in the array to be stacked;
if not, generating an array to be stacked according to the nth data to be arranged;
judging whether the quantity of the data to be arranged in the data set to be arranged is 0;
if yes, generating a plurality of groups of arrays to be arranged according to all the arrays to be stacked.
2. The method of claim 1, wherein stacking the arrays to be arranged according to the ordering result corresponding to the sum of the orders of the arrays to be arranged, generating a stacked array, and determining the split value comprises:
respectively determining the total node of each array to be arranged, wherein the total node is the starting node, the ending node and the node sum between the starting node and the ending node;
stacking the arrays to be arranged according to the sequence from the large sum to the small sum of the sections to generate a stacking array;
determining the segmentation value according to the starting section and the ending section of the first data to be arranged in each array to be arranged, wherein the starting section of the first data to be arranged in all the arrays to be arranged is smaller than the segmentation value, and the ending section is smaller than or equal to the segmentation value.
3. The method of claim 2, wherein partitioning the stacked array according to the partition values generates an arrangement result, comprising:
determining the corresponding identification and full data position information of each array to be arranged in the stacking array, wherein the full data position information is used for indicating the position of the data to be arranged in the corresponding array to be arranged;
determining the first data to be arranged in each array to be arranged, wherein the starting section number of the first data to be arranged is larger than the dividing value, and determining the position of all data corresponding to the data to be arranged;
and dividing each array to be arranged in the stacking array according to the full data position corresponding to the data to be arranged in each array to be arranged, and generating the arrangement result.
4. A course data arrangement apparatus, comprising:
the data arrangement module is used for obtaining data to be arranged according to the date attribute in the data arrangement instruction, wherein the data to be arranged comprises the date attribute, a start section and an end section;
the partitioning module is used for generating a data set to be arranged according to the sequencing results corresponding to the starting section and the ending section of the data to be arranged;
the matching module is used for matching the data to be arranged of the data set to be arranged one by one according to the sequence of the data to be arranged in the data set to be arranged, so as to generate a plurality of groups of arrays to be arranged, wherein the starting section of the current data to be arranged in each array to be arranged is larger than the ending section of the previous data to be arranged;
the stacking module is used for stacking the arrays to be arranged according to the sequencing result corresponding to the total number of the sections of the arrays to be arranged, generating a stacking array, and determining a dividing value, wherein the dividing value is determined according to the starting section and the ending section of the arrays to be arranged;
the generation module is used for dividing the stacked array according to the dividing value to generate an arrangement result;
wherein, according to the sequencing result corresponding to the beginning section and the ending section of the data to be arranged, generating a data set to be arranged comprises:
dividing the data to be arranged into at least one sample set to be arranged according to the starting times of the data to be arranged;
sequencing the data to be arranged in each data set to be arranged according to the preset sequence of ending the times to generate at least one data partition to be arranged;
determining partition values respectively corresponding to the data partitions to be arranged according to the starting times corresponding to the data partitions to be arranged, wherein the partition values are the starting times of the corresponding data partitions to be arranged;
combining all data to be arranged of all the data partitions to be arranged according to the preset sequence of the partition values to generate a data set to be arranged;
according to the sequence of the data to be arranged in the data set to be arranged, the data to be arranged in the data set to be arranged are matched one by one, and a plurality of groups of arrays to be arranged are generated, including:
judging whether the starting section corresponding to the nth data to be arranged is larger than the ending section corresponding to any data to be arranged before the nth data to be arranged according to the sequence of the data to be arranged in the data set to be arranged, wherein N is an integer, N is more than 0 and less than or equal to N, and N is the number value of the data to be arranged in the data set to be arranged;
if yes, determining at least one piece of alternative data, wherein the ending section of the alternative data is smaller than the starting section corresponding to the current data to be arranged;
determining target data according to the candidate data, wherein in all the candidate data, the difference between the ending section corresponding to the target data and the starting section corresponding to the nth data to be arranged is the smallest;
sequentially storing the target data and the nth data to be arranged into an empty array to generate an array to be stacked;
updating the data set to be arranged according to the array to be stacked, wherein the updated data set to be arranged does not comprise the data to be arranged in the array to be stacked;
if not, generating an array to be stacked according to the nth data to be arranged;
judging whether the quantity of the data to be arranged in the data set to be arranged is 0;
if yes, generating a plurality of groups of arrays to be arranged according to all the arrays to be stacked.
5. A server, comprising:
one or more processors;
a storage means for storing one or more programs;
when executed by the one or more processors, causes the one or more processors to implement a method of course data arrangement as claimed in any one of claims 1 to 3.
6. A storage medium containing computer executable instructions which, when executed by a computer processor, are for performing a method of processing a course data arrangement as claimed in any one of claims 1 to 3.
CN202410061542.3A 2024-01-16 2024-01-16 Course data arrangement processing method and device, server and storage medium Active CN117574008B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202410061542.3A CN117574008B (en) 2024-01-16 2024-01-16 Course data arrangement processing method and device, server and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202410061542.3A CN117574008B (en) 2024-01-16 2024-01-16 Course data arrangement processing method and device, server and storage medium

Publications (2)

Publication Number Publication Date
CN117574008A CN117574008A (en) 2024-02-20
CN117574008B true CN117574008B (en) 2024-04-02

Family

ID=89892207

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202410061542.3A Active CN117574008B (en) 2024-01-16 2024-01-16 Course data arrangement processing method and device, server and storage medium

Country Status (1)

Country Link
CN (1) CN117574008B (en)

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101984427A (en) * 2010-10-29 2011-03-09 刘健 Campus study room query system and method
CN106204378A (en) * 2016-07-26 2016-12-07 天闻数媒科技（湖南）有限公司 The processing method of a kind of lesson data arrangement and system
CN106934741A (en) * 2017-02-20 2017-07-07 深圳国泰安教育技术股份有限公司 The method and device of the construction of curriculum
CN111967949A (en) * 2020-09-22 2020-11-20 武汉博晟安全技术股份有限公司 Leaky-Conv & Cross-based safety course recommendation engine sorting algorithm
CN113537746A (en) * 2021-07-07 2021-10-22 湖北君子泰科技有限公司 Automatic course arrangement method and system
CN113610678A (en) * 2021-08-04 2021-11-05 西安电子科技大学广州研究院 New college entrance examination teaching class shift dividing method based on heuristic method and self-adaptive strategy
CN114331390A (en) * 2022-03-03 2022-04-12 北京和气聚力教育科技有限公司 Class scheduling system, class scheduling method, class scheduling equipment and storage medium
CN114781806A (en) * 2022-03-07 2022-07-22 国科温州研究院(温州生物材料与工程研究所) Multi-combination course arrangement method and device based on multi-objective evolutionary algorithm and readable medium
CN115829234A (en) * 2022-11-10 2023-03-21 武汉天天互动科技有限公司 Automatic supervision system based on classroom detection and working method thereof

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101984427A (en) * 2010-10-29 2011-03-09 刘健 Campus study room query system and method
CN106204378A (en) * 2016-07-26 2016-12-07 天闻数媒科技（湖南）有限公司 The processing method of a kind of lesson data arrangement and system
CN106934741A (en) * 2017-02-20 2017-07-07 深圳国泰安教育技术股份有限公司 The method and device of the construction of curriculum
CN111967949A (en) * 2020-09-22 2020-11-20 武汉博晟安全技术股份有限公司 Leaky-Conv & Cross-based safety course recommendation engine sorting algorithm
CN113537746A (en) * 2021-07-07 2021-10-22 湖北君子泰科技有限公司 Automatic course arrangement method and system
CN113610678A (en) * 2021-08-04 2021-11-05 西安电子科技大学广州研究院 New college entrance examination teaching class shift dividing method based on heuristic method and self-adaptive strategy
CN114331390A (en) * 2022-03-03 2022-04-12 北京和气聚力教育科技有限公司 Class scheduling system, class scheduling method, class scheduling equipment and storage medium
CN114781806A (en) * 2022-03-07 2022-07-22 国科温州研究院(温州生物材料与工程研究所) Multi-combination course arrangement method and device based on multi-objective evolutionary algorithm and readable medium
CN115829234A (en) * 2022-11-10 2023-03-21 武汉天天互动科技有限公司 Automatic supervision system based on classroom detection and working method thereof

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Teaching Course on Algorithms and Data Structures during the Coronavirus Pandemic;Michal Varga et al.;《2020 18th International Conference on Emerging eLearning Technologies and Applications (ICETA)》;20210322;730-738 *
职业院校项目实训安排管理系统开发与应用;陈定樑;《中国优秀硕士学位论文全文数据库 信息科技辑》;20120215;I138-324 *

Also Published As

Publication number Publication date
CN117574008A (en) 2024-02-20

Similar Documents

Publication Publication Date Title
US10621281B2 (en) Populating values in a spreadsheet using semantic cues
CN109637238B (en) Method, device, equipment and storage medium for generating exercise questions
CN104820677A (en) Layer display method and system of discipline
CN115544241B (en) Intelligent pushing method and device for online operation
CN109584127B (en) Teaching resource management method and system for experiment teaching
CN106599291B (en) Data grouping method and device
CN109710747B (en) Information processing method and device and electronic equipment
CN104866174A (en) Information displaying method and apparatus
CN117574008B (en) Course data arrangement processing method and device, server and storage medium
CN113934839A (en) Method, equipment and storage medium for volume grouping according to knowledge points
CN110321882A (en) A kind of education resource acquisition methods, device, learning terminal and storage medium
CN112907155A (en) Method for evaluating student work product
CN109977197B (en) Electronic exercise processing method, device, equipment and storage medium
CN112598547A (en) Education topic generation method and device based on automatic production line and electronic equipment
CN111831919A (en) Course planning method, device, storage medium and system
CN109471935B (en) Questionnaire survey object determining method and device, electronic equipment and storage medium
CN111309371A (en) Query method and device
KR102496948B1 (en) System and method for knowledge space-based learning location and route recommendation and recording medium storing program for executing the same, and computer program stored in recording medium for executing the same
CN113902596B (en) Post-class service method and system using information matching
CN113053184B (en) Method for online teaching interaction and device for same
WO1999015944A2 (en) Method and apparatus for searching and displaying data
US20230367796A1 (en) Narrative Feedback Generator
CN112016607A (en) Error cause analysis method based on deep learning
US20140295396A1 (en) Device and method for learning support
CN112052669B (en) Method and device for generating title name

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant