Ghostwriting CS programming, ghostwriting campus route guide system, J2EE ghostwriting
Teaching planning system
1. Problem Description
Each major in the university requires a teaching plan. Assuming that any major has a fixed length of study, each
academic year contains two semesters, and the length of each semester and the upper limit of credits are equal. The courses offered by each major
are determined, and the arrangement of the courses at the opening time must satisfy the prerequisite relationship. The prerequisite
courses for each course are determined, and there may or may not be any number of courses. Each course occupies exactly one semester. Try to design a teaching planning program under
this premise.
2. Basic requirements
(1) Input parameters include: total number of semesters, total number of courses, upper limit of credits in one semester, course number of each course
(fixed 3-digit alphanumeric string), credits and course number of direct prerequisite courses.
(2) Allow the user to specify one of the following two scheduling strategies: one is to make the student's study load in each semester as
uniform as possible; the other is to make the courses as concentrated as possible in the first few semesters.
(3) If there is no solution to the problem according to the given conditions, report appropriate information; otherwise, output the teaching plan to
the file specified by the user. The table format of the plan is designed by yourself.
3. Test data
Total number of semesters: 6; Credit limit: 10; There are 12 courses in this major
. 2, 3. The prerequisites for the courses are listed in the table below.
Course Number Course Title Prerequisites
C01 Fundamentals of Programming None
C02 Discrete Mathematics C1
C03 Data Structures C1, C2
C04 Assembly Language C1
C05 Language Design and Analysis C3, C4
C06 Computer Principles C11
C07 Compilation principle C5, C3
C08 Operating system C3, C6
C09 Advanced mathematics without
C10 Linear algebra C9
C11 General physics C9
C12 Numerical analysis C9, C10, C1
(The test data can also be based on the prerequisite relationship of the courses in the network engineering teaching plan
as test data)
4. To realize the prompt
, the total number of semesters should not exceed 12 and the total number of courses should not exceed 100. If the entered prerequisite course number is not in
the sequence of courses offered by the major, it will be treated as an error. A correspondence between internal course numbers and course numbers should be established
.
19. Results Statistical Analysis System
1. The problem description
gives the score table of m courses of n students, and the information of each student consists of student number, name
and grades of each subject. Conduct statistical analysis on students' test scores and print statistical tables.
2. Basic requirements
1. Input the grades of each student's multiple courses through the keyboard, and create a corresponding file input.dat.
2. To process the data in the file input.dat, the following functions are required:
i. Sort by the grades of each course, and generate the corresponding file output.
ii. Calculate the grade point average for each person, sort by grade point average, and generate a file.
iii. Find the average score, the highest score, the lowest score, the number of students who failed, the number of students who scored 60~69
points, the number of students who scored 70~79 points, the number of students who scored 80~89 points, and the number of students who scored more than 90 points for each course.
iv. Inquire about a person's grades in various courses based on their name or student number, and the case of duplicate names can also be handled.
3. Beautiful interface.
3. Test Data
Student Number Name Math English Computer
001 Wang Fang 78 77 90
002 Zhang Qiang 89 67 88
003 Li Hao 56 66 78
004 Oriole Bing 89 86 85
005 Li Hao 67 88 76
006 Chen Lifeng 45 54 67
007 Shang Xiao 78 76 70
4. The selected content sets different weights for the grades of each subject.
20. Article editing
1. Problem description: Enter a page of text, and the program can count the number of characters, numbers, and spaces.
2. Basic requirements: Statically store one page of articles, each line no more than 80 characters, a total of N lines; requirements
(1) Count the number of Chinese and English letters and spaces and the total number of words in the entire article;
(2) Count a certain The number of times a string appears in the article, and output the number of times;
(3) Delete a substring and move the following characters forward.
3. Input and output:
the form and range of input data: uppercase and lowercase English letters, any number and
punctuation .
Output form: (1) output the characters input by the user in separate lines; (2) output "all letters
", "numbers", "spaces", "total words in the article" in 4 lines (3) output delete a certain number of characters The
article ;
4. Implementation hint: the storage structure uses a linear table, and several sub-functions are used to realize the corresponding functions;
21. The design and implementation of the hash table
1. Problem description Design a hash table to implement a telephone number search system .
2. Basic requirements
1) Assume that each record has the following data items: phone number, user name, address;
2) Input each record from the file, and build a hash table with the phone number and user name as the keywords; (
assuming the person name is Chinese name The Chinese Pinyin form of zhoukunxiao)
3) Use a certain method to resolve the conflict; (Hash function can be
constructed , and use the linear detection and re-hash method or the chain address method to deal with the conflict)
4) Find and Display records for a given phone number;
5) Find and display records for a given user name.
3. The test data
is recorded by 40 students in the class.
4. Selected content
(1) Select the applicable ones from the centralized hash function construction methods introduced in the textbook and design several different
hash functions, and compare their address collision rates (you can use a larger record set for experiments ).
(2) Study the characteristics of these 40 personal names, and try to find a hash function, so that there
must be no address conflict for different pinyin names.
(3) Under the premise that the hash function is determined, try various methods to deal with the conflict, and examine
the change of the average search length and the aggregation of keywords in the created hash table.
22. Tourist area guide map system
1. Problem description:
Suppose a tourist area has n tourist attractions (n≥10), and each tourist attraction is adjacent to m adjacent
tourist , m<n ) are connected by direct roads (with corresponding distances), please design a simple
tour guide system for tourist areas.
In the form of (Vi , Vj , d) input from the keyboard to establish the tourist attractions map of the tourist area, where: Vi and
Vj represent two different tourist attractions, d represents the road distance between these two attractions; the tourist attractions picture
The adjacency matrix storage structure is used.
2. Basic requirements: (
1) Output of tourist attraction map: output the tourist attraction map in the form of adjacency matrix and adjacency linked list respectively.
(2) Adjacent scenic spots query: Assuming that for each scenic spot, there is a simple information query, and it is required to give
all the scenic spots adjacent to the scenic spot (with direct roads) and the corresponding distance.
(3) Scenic spot route query: Suppose that for each scenic spot, there is a scenic spot route query, and it is required to give
the shortest simple path and distance from the scenic spot to any other scenic spot.
⑷ Comprehensive query of scenic spots route: For any two scenic spots in the tourist area, find the shortest
simple .
⑸ Determination of the best tourist route: Assuming that the entrance of the tourist area is also the exit, please determine an optimal tourist
route, which must pass through all the tourist attractions (some scenic spots can be repeatedly passed) and take the shortest way.
(6) Design a menu, and the above operation requirements are used as the main menu items in the menu.
23. Campus route guide system
1. The problem description
uses an undirected network to represent the floor plan of the campus scenic spots of Dongguan University of Technology. The vertices in the figure represent the main scenic
spots the number, name, introduction and other information of the scenic spots. The edges in the figure represent the roads between the scenic spots and store the
information such as the length of the path. . It is required to be able to answer questions about the introduction of attractions, tour routes, etc.
2. Basic requirements
(1) Query the relevant information of each scenic spot;
(2) Query the shortest path between any two scenic spots in the graph.
(3) Query all paths between any two scenic spots in the graph.
(4) Add, delete and update information about scenic spots and roads.
3. Selected content
(1) Find the best (shortest) tour route for multiple scenic spots.
(2) Distinguish between motor vehicle lanes and sidewalks.
(3) Realize the simulation interface of the tour guide map.
33 / 43
24. Map navigation query system (shortest path problem)
1. Problem description: Design a system to realize map management and shortest path query
2. Basic requirements:
1. Ability to add, delete and modify map point and edge information ;
2. It can find out the shortest path scheme by giving two points;
3. Better interactive interface;
4. Permanent saving and reading of map information. (Map data format)
3. Data structure:
Design appropriate data structure to organize data, design algorithm to achieve requirements
http://www.6daixie.com/contents/14/1355.html
The core members of the team mainly include Silicon Valley engineers, BAT front-line engineers, top 5 master and doctoral students in China, and are proficient in German and English! Our main business scope is to do programming assignments, course design and so on.
Our field of direction: window programming, numerical algorithm, AI, artificial intelligence, financial statistics, econometric analysis, big data, network programming, WEB programming, communication programming, game programming, multimedia linux, plug-in programming program, API, image processing, embedded/MCU database programming, console process and thread, network security, assembly language hardware Programming software design engineering standards and regulations. The ghostwriting and ghostwriting programming languages or tools include but are not limited to the following:
C/C++/C# ghostwriting
Java ghostwriting
IT ghostwriting
Python ghostwriting
Tutored programming assignments
Matlab ghostwriting
Haskell ghostwriting
Processing ghostwriting
Building a Linux environment
Rust ghostwriting
Data Structure Assginment
MIPS ghostwriting
Machine Learning homework ghostwriting
Oracle/SQL/PostgreSQL/Pig database ghostwriting/doing/coaching
web development, website development, website work
ASP.NET website development
Finance Insurance Statistics Statistics, Regression, Iteration
Prolog ghostwriting
Computer Computational method
Because professional, so trustworthy. If necessary, please add QQ: 99515681 or email: [email protected]
WeChat: codinghelp