
0
Practice Problems
Explore hundreds of real problems pulled from every UCF Foundation exam since 2015. Search, filter, and track what you've done - build confidence in topics and prepare for the FE.
Study Plans
Stay organized with study plans for the UCF Foundation Exam. Try the FE-100 — it covers every topic and helps you progress easily. Focus on a single category or practice with mock exams.
Submission
Write your code or submit your notes to get instant feedback graded by AI using the official FE rubric. See a breakdown of your score, with explanations for each part. Auto-grading is just an estimate, but it's a quick way to check your progress as you practice.
Auto-Grading Score
7/10
- Loop conditionRubric2/2ptsDetails
You used the correct loop condition exactly as specified.
- Check word1Rubric1/1ptsDetails
You correctly guarded the
word1
branch withif (word1 != NULL)
. - Print word1Rubric2/2ptsDetails
You correctly printed
word1->letter
with the properprintf
format. - Advance word1Rubric1/1ptsDetails
You advanced the
word1
pointer correctly. - Check word2Rubric1/1ptsDetails
You have an
if (word2 != NULL)
check in place. - Print word2Rubric0/2ptsDetails
The code does not print
word2->letter
in theword2
branch. - Advance word2Rubric0/1ptsDetails
The pointer
word2
is never advanced before the next iteration.
Missed Points Feedback
You correctly set up the loop and handled the word1
branch, but you never print or advance word2
. In the if (word2 != NULL)
block, replace the continue;
with a printf("%c", word2->letter);
and then word2 = word2->next;
to fix it.
Linked Lists
Recursion
Algorithm Analysis


Made with for UCF Knights
We're here to make studying for the Foundation Exam a little easier — and maybe even a bit more fun. Dive in, practice, and know you're not alone on this journey!
If you're interested in updating content, adding video solutions, fixing mistakes, or hosting FE workshops — you are welcome to join my team.
Join My Team