Programming & Computer Science Answers

Find the infix equivalents of the following postfix equivalents:

(A) A B + C * D –

Write a Java GUI application that will keep track of student results at a local college. The

application must contain the results that a student has obtained for a test, assignment and exam.

Q.3.1 On the form create a list box that will allow the user to select the student ID

populated from the text file. Also create a search button that when clicked will

display the average, highest and lowest result according to the student number.

(5)

Q.3.2 Create a sequential file (student.txt) that contains data for the following fields:

 The student ID number;

 The student test result; The student assignment result;

 The student exam result.

Q.3.2 Load the data from the student.txt file and populate the list box with the student

numbers.

(10)

Q.3.3 Calculate the average result obtained by the student. (8)

Q.3.4 Determine the highest and lowest result that the student obtained from the three

assessments.

Write a c program to perform deletion operation on BST. While deleting, consider all the deletion cases.

a. Deletion of node with degree 0.

b. Deletion of node with degree 1.

c. Deletion of node with degree 2.

Write a program to implement a binary search tree (BST) having following functionalities.

 BSTInsert(): This function adds a given ITEM to the BST. If the ITEM already exists in the BST then it

will not insert the ITEM any more.

 BSTInorderStack(): This function finds Inorder traversal sequence of a BST using stack. You are not

supposed to use recursive implementation of Inorder traversal

Consider the following reference string: 7 0 1 2 0 3 0 4 2. Let the number of frames are 3 and 4. Show the allocation frames to the memory and calculate the number of page faults when LRU page replacement policy is used.

Did you know that in lotteries, a 3-digit number with the same numbers in all digits like 777 will hit the jackpot in a casino? In the same manner, let's make a program that will test if a certain 3-digit number hits a jackpot or not by identifying if all the digits of a given number is the same as the second inputted number. If it is, print "Jackpot!"; else, print "Nah".

Let's try this out now!

Create an algorithm that will able to read the age of an individual and determine if it qualified to vote or not. The qualifying age to vote is 18 and above. If the age is 18 below, display "too young!". Note that there is no such age as 0 or negative however display "Invalid age" if age is above 100 display "Out of range".

Create a program that will read the values of A and B. Compare the two values of A & B then print which of the values is higher including the remark "Higher".

SAMPLE OUTPUT: Input your first name: John Input your last name: Doe Input your course: 3515 Input your address: Sta. Cruz, Tinambac, C.5. Input your birth year: 1999. Hello John Doe, you are a BSIS student from Sta Cruz, Tinambac, C.S. your age is 22

LOOPS ( READ QUESTION AND SOLVE IT AS REQUIRED)

If diff is 0, then guess is correct and the program outputs a message indicating that the user guessed the correct number.

1. If diff is greater than or equal to 50, the program outputs the message indicating that the guess is very high (if guess is greater than num) or very low (if guess is less than num).

2. If diff is greater than or equal to 30 and less than 50, the program outputs the message indicating that the guess is high (if guess is greater than num) or low (if guess is less than num).

3. If diff is greater than or equal to 15 and less than 30, the program outputs the message indicating that the guess is moderately high (if guess is greater than num) or moderately low (if guess is less than num).

4. If diff is greater than 0 and less than 15, the program outputs the message indicating that the guess is somewhat high (if guess is greater than num) or somewhat low (if guess is less than num).

Give the user no more than five tries to guess the number.