Java project, computer programming, Programming Languages

Assignment Help:
NOTE: You will only submit the University.java and EmptyFileException.java files (inside P3.zip/tar)

NOTE on null objects:. From Project 1: Since the array of students in the Course class might have no objects (null), remember to do a null check when traversing the array.

UPDATE March 23rd: There was a slight error in the "university.txt" file provided for part A. Please make sure you work with the latest version.

NOTE: You should NOT modify any classes other than University.java.
Description:

For this project you will be storing and retrieving the Sakai system implemented in project 1.
You will first need to download the solution to project 1.
There are two parts to the project:

PART A:. This part involves writing out all the information to a file. Modify the University.java file by adding this method:
public boolean writeToFile(String filename):
-The method should write out all the information to the filename passed in. If successfully written it returns true, otherwise false.
-The file format is as follows: (parentheses indicate the information has to be written out)

University Name: (university''s name)
Current Term: (currentTerm)
Current Year: (currentYear)
Number of Students: (number of students)
Number of Instructors: (number of instructors)
Number of Courses: (number of courses)

The information above is to be written out first. Immediately following the above the information for each student has to be written out as specified below:

Undergrad/Grad Student:
Name: (student''s name)
UFID: (student''s ufid)
D.O.B: (student''s dob)
GPA: (student''s gpa)
Number of Courses: (number of courses the student is enrolled in)

Immediately following the above the information for each instructor has to be written out as specified below:

Instructor:
Name: (instructor''s name)
UFID: (instructor''s ufid)
D.O.B: (instructor''s dob)

Immediately following the above the information for each course has to be written out as specified below:

Course:
(type) (number)
(title)
Number of credits: (numCredits)
Instructor UFID: (UFID of the instructor)
Number of TAs: (number of TAs)
TA UFIDs: (ufid of first ta),(ufid of second ta),...,(ufid of last ta)
Capacity: (capacity)
Current Enrollment: (currentEnrollment)
Student UFIDs: (ufid of first student),(ufid of second student),...,(ufid of last student)


That signifies the end of the file.


Use TestDriver1 to test your solution to Part A.
This driver will produce a file named university.txt. Use the output file provided to compare whether your program writes it out properly.

PART B: This part will involve reading from a file and reconstructing all the objects in the Sakai system.

Create the class EmptyFileException, which will be a subclass of Exception.. This exception is thrown when a file is empty. It will have the following properties and methods:
Properties:
----------
- String filename; // This represents the name of the file which is empty

Constructors:
------------
- EmptyFileException()
Empty constructor which does nothing
- EmptyFileException(String filename)
Takes in the name of the file which is empty and set''s the properties appropriately

Methods:
--------
public String toString();
It will return a string in this format:

The file (filename) is empty.


Modify the University.java file by adding this method:
public static University readFromFile(String filename):
-This method will read in all the university info from a file and construct the university object.
-If the object is properly created it is returned, otherwise a null object is returned.
-If the file to read from is empty, the method will try-and-catch the EmptyFileException created above.
When the exception is caught it''s information is printed out (via the toString method).

(HINT: Try to use helper methods for reading in different kinds of objects - Student, Instructor and Course.)

Use TestDriver2 to test your solution. It tries to read in the university.txt file. Compare with our output.

Related Discussions:- Java project, computer programming

What is dynamic binding, Dynamic Binding: - Binding refers to the linking ...

Dynamic Binding: - Binding refers to the linking of a procedure call to the code to be executed in response to the call. Dynamic binding (late binding) means that the code associa

Calculate the appropriate weight for each query term, 1-Create ir3.py based...

1-Create ir3.py based on ir2.py 2-Repeatedly prompt the user for a query (if they enter "q", then quit) 3-Find the terms in the query, and calculate the appropriate weight fo

Identify the type of addressing, specify the function of the instruction an...

specify the function of the instruction and also specify whether its right or wrong-: (5) 1) MOV [BX],AX? Register Indirect addressing 2) MOV CX,[BX+DI]?Base plus index add

Html code to create a web page design , 1.  Develop HTML code to create a W...

1.  Develop HTML code to create a Web page with the red background and title "My First Page" in any other color. 2.  Develop an HTML document with details of your name, telephon

Abstraction hierarchy of mechanisms, Abstraction hierarchy of mechanisms ...

Abstraction hierarchy of mechanisms Given  the light-sensitive the motor and resistor,  we could  find  several  ways  of interconnecting them, using bits of ceramic and metal

Define a procedure that takes a list as a single argument, (a) Define a pro...

(a) Define a procedure (subsets x) that takes a list as a single argument and returns all 2^n subsets of that list, i.e. the power set of the list; e.g. (subsets '(a b c)) ==> (

Shell script to find a particular pattern from the file, Normal 0 ...

Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4

Lexical analyzer - xml table output, Lexical Analyzer: Symbol Table - Ho...

Lexical Analyzer: Symbol Table - Holds the symbols accepted by the lexical analyzer or parser.  Each symbol may be a terminal or a non-terminal.  Terminal symbols are listed

insertion sort algortihm, Define a higher order version of the insertion s...

Define a higher order version of the insertion sort algortihm. That is define functions insertBy :: Ord b => (a->b) -> a -> [a] -> [a] inssortBy :: Ord b => (a->b) -> [a] ->

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd