Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
1. Problem Statement Suppose you are department coordinator and have been given the responsibility of maintaining the student records with fields - University ID, Name, Year of Admission and marks. Using a BST store the student information and perform the required operations. Requirements: 1. Create a BST data structure for storing student details. The details should be read from a file "inputps01.txt". The program should create BST with a single node containing details such as . Each student details are in single line where the details are separated by ",". In the output file "outputPS01.txt", enter the total number of student records that are created. 2. Search and list all the details of students from the prompt file. The file "prompts PS01.txt" contain the list of IDs with a tag "ID:". The program should be written to search the BST for each ID from the same file and the corresponding details should be written into the file "outputPS01.txt". If a ID is not present in the BST, the program should write "Not Found" in the file. 3. Search for all students for a given year. 3. List the ID, name and marks in order for a particular batch (highest marks to lowest) Sample Input: Input should be taken in through a file called "inputPS01.txt" which has the fixed format mentioned below using the "/" as a field separator:

1. Problem Statement Suppose you are department coordinator and have been given the responsibility of maintaining the student records with fields - University ID, Name, Year of Admission and marks. Using a BST store the student information and perform the required operations. Requirements: 1. Create a BST data structure for storing student details. The details should be read from a file "inputps01.txt". The program should create BST with a single node containing details such as . Each student details are in single line where the details are separated by ",". In the output file "outputPS01.txt", enter the total number of student records that are created. 2. Search and list all the details of students from the prompt file. The file "prompts PS01.txt" contain the list of IDs with a tag "ID:". The program should be written to search the BST for each ID from the same file and the corresponding details should be written into the file "outputPS01.txt". If a ID is not present in the BST, the program should write "Not Found" in the file. 3. Search for all students for a given year. 3. List the ID, name and marks in order for a particular batch (highest marks to lowest) Sample Input: Input should be taken in through a file called "inputPS01.txt" which has the fixed format mentioned below using the "/" as a field separator:

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
1. Problem Statement Suppose you are department coordinator and have been given the responsibility of maintaining the student records with fields - University ID, Name, Year of Admission and marks. Using a BST store the student information and perform the required operations. Requirements: 1. Create a BST data structure for storing student details. The details should be read from a file "inputps01.txt". The program should create BST with a single node containing details such as <ID> <name> <Year of Admission><Marks>. Each student details are in single line where the details are separated by ",". In the output file "outputPS01.txt", enter the total number of student records that are created. 2. Search and list all the details of students from the prompt file. The file "promptsPS01.txt" contain the list of IDs with a tag “ID:”. The program should be written to search the BST for each ID from the same file and the corresponding details should be written into the file "outputPS01.txt". If a ID is not present in the BST, the program should write "Not Found" in the file. 3. Search for all students for a given year. 3. List the ID, name and marks in order for a particular batch (highest marks to lowest) Sample Input: Input should be taken in through a file called "input PS01.txt" which has the fixed format mentioned below using the "/" as a field separator:
Transcribed Image Text:1. Problem Statement Suppose you are department coordinator and have been given the responsibility of maintaining the student records with fields - University ID, Name, Year of Admission and marks. Using a BST store the student information and perform the required operations. Requirements: 1. Create a BST data structure for storing student details. The details should be read from a file "inputps01.txt". The program should create BST with a single node containing details such as <ID> <name> <Year of Admission><Marks>. Each student details are in single line where the details are separated by ",". In the output file "outputPS01.txt", enter the total number of student records that are created. 2. Search and list all the details of students from the prompt file. The file "promptsPS01.txt" contain the list of IDs with a tag “ID:”. The program should be written to search the BST for each ID from the same file and the corresponding details should be written into the file "outputPS01.txt". If a ID is not present in the BST, the program should write "Not Found" in the file. 3. Search for all students for a given year. 3. List the ID, name and marks in order for a particular batch (highest marks to lowest) Sample Input: Input should be taken in through a file called "input PS01.txt" which has the fixed format mentioned below using the "/" as a field separator:
Expert Solution
steps

Step by step

Solved in 5 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS