Evaluation #68534
Details
904185251
rsaekow6@gatech.edu
Student
pglenn8
12800 Abrams Rd, Dallas, TX 75243-2199
United States
[ 145840 ]
Programming Fundamentals III
Spring 2025
(Semester Basis)
4 credit hours
CS 1XXX, 1 credit hours OR
CS 1331, 3 credit hours AND
CS 1XXX, 1 credit hours
Policy
CS 1XXX, 1 credit hours OR
CS 1331, 3 credit hours AND
CS 1XXX, 1 credit hours
Policy
dept-to-r1
Options
Notes
2025-08-19 09:27:28 - Makesia D Scott <ms366>
Credit awarded for CS 1331
2025-08-18 17:34:17 - Pauline Marilyn Glenn <pglenn8>
Note for Registrar: Can be CS 1331 or CS 1301 depending on what student needs.
2025-08-14 01:16:40 - Rapeeporn Saekow <rsaekow6>
In the second file that I have uploaded, I have included some lab assignments I could find on my current laptop. All of the assignments were requested to be submitted in txt format, including all the functional code running according to the given question and problem. I have included Lab 19 1A 1B 1C 2A 2B Lab 20 3A 3B Lab 21 1A 1B 2A 2B
2025-08-14 01:03:28 - Rapeeporn Saekow <rsaekow6>
This class was taught in Java. Sample Lab Assignment: package com.mycompany.lab18_1a; /** * File: Lab18_1A * Name: Rapeeporn Saekow (Yuka) * This program will use recursive method to receive a parameter and * return the sum of the even number less than it. */ import java.util.*; import java.io.*; public class Lab18_1A { public static void main(String[] args) { int result, num; Scanner keyboard = new Scanner(System.in); System.out.print("Enter a number: "); num = keyboard.nextInt(); result = addEvenOnly (num); System.out.println("The result of adding even number only is: " + result); } public static int addEvenOnly(int num) { if (num ==0) return 0; // base case, terminate at 0 else { if (num %2 == 0) //num is even return num + addEvenOnly(num - 1); else //num is odd return addEvenOnly(num - 1); } } } package com.mycompany.lab18_1b; /** * File: Lab18_1B * Name: Rapeeporn Saekow (Yuka) * This program will use recursive method to read the array from the .txt file * and count for the number that divisible by 3 */ import java.util.*; import java.io.*; public class Lab18_1B { public static void main(String[] args) throws FileNotFoundException { int result; int [] array = new int [10]; //read 10 numbers from the text file File file = new File ("Input18_1B2.txt"); Scanner infile = new Scanner (file); int i = 0; while (infile.hasNext()) //read into the array { array[i] = infile.nextInt(); i++; } infile.close(); result = countDiv3Num (array, 0); System.out.println("Array: " + Arrays.toString(array)); System.out.println("Total amount of numbers that divisible by 3: " + result); } public static int countDiv3Num (int[] array, int index) { if (index == array.length - 1) //base case - end of array { if (array[index] % 3 == 0)//checking the last index if it's div by 3 return 1; else return 0; } else { if (array[index] % 3 == 0) return 1 + countDiv3Num(array, index + 1); // adding up the count else return countDiv3Num(array, index+1); //move to next index } } }
2025-07-24 13:52:31 - Emma L Norrell <epresberg6>
See note from department: "Note for student: What language was this class taught in? Please provide homework assignments you completed." Please upload documentation and resubmit
2025-07-24 12:40:07 - Pauline Marilyn Glenn <pglenn8>
Note for student: What language was this class taught in? Please provide homework assignments you completed.
2025-07-22 11:36:59 - Rapeeporn Saekow <rsaekow6>
Richland College is part of the DCCCD, which is now known as Dallas College. COSC2436 is the third course of the Programming Fundamental Sequence. Course Description: Further applications of programming techniques, introducing the fundamental concepts of data structures and algorithms. Topics include recursion, fundamental data structures (including stacks, queues, linked lists, hash tables, trees, and graphs), and algorithmic analysis. This course may use instructional examples and assignments from various programming languages, including but not limited to C, Objective-C, C++, C#, and/or Java.
Trail Log
2025-08-19 09:27:28
Final equivalencies entered by Makesia D Scott (ms366) Final equiv: CS 1301 (3 hrs) AND CS 1XXX (1 hrs) OR CS 1331 (3 hrs) AND CS 1XXX (1 hrs). Policy. Phase set to Complete.
2025-08-18 17:34:17
Draft equivalencies entered by Pauline Marilyn Glenn (pglenn8) Draft equiv: CS 1301 (3 hrs) AND CS 1XXX (1 hrs) OR CS 1331 (3 hrs) AND CS 1XXX (1 hrs). Policy. Phase set to Registrar 2.
2025-08-15 15:44:44
Assigned to Pauline Marilyn Glenn (pglenn8) by Emma L Norrell (epresberg6). Phase set to Department.
2025-08-14 01:16:08
Supplemental file attached to evaluation by Rapeeporn Saekow (904185251).
2025-08-14 01:03:38
Supplemental file attached to evaluation by Rapeeporn Saekow (904185251).
2025-08-14 01:03:28
Resubmitted to Registrar 1 by Rapeeporn Saekow (904185251). Phase set to Registrar 1.
2025-07-24 13:52:31
Sent back to Student by Emma L Norrell (epresberg6). Phase set to Student. Must be resubmitted.
2025-07-24 12:40:07
Pass by Pauline Marilyn Glenn (pglenn8). Returned to Registrar's Office without evaluating. Phase set to Registrar 1.
2025-07-23 12:27:42
Assigned to Pauline Marilyn Glenn (pglenn8) by Jake D Vaughn (jvaughn67). Phase set to Department.
2025-07-22 11:36:59
Evaluation initiated by Rapeeporn Saekow (904185251). Phase set to Registrar 1.