Week 5 Summmative assessment

.docx

School

University of Phoenix *

*We aren’t endorsed by this school

Course

305

Subject

Computer Science

Date

Feb 20, 2024

Type

docx

Pages

Uploaded by AgentCranePerson1078

Summative Assessment: Data Structures Reflection Julie M Regets University of Phoenix DAT/305 Joe Lodewyck July 3, 2023

In this course, I was enjoying the learning in the first four weeks, I recall best those things we reiterated via the weekly discussions:  algorithms - any problem, task or calculation that that can be completed via the description of the specific steps needed to find the answer either in English, hardware, psuedocode or in a programming language.  data structures – the way we organize and work with data.  binary search trees – A way to sort data and make searching faster by cutting down on the number of stops a search must make looking for a value.  singly and doubly linked lists - consist of a "head", a series of nodes that contain data with a pointer to the next node, and a "tail" pointing to null. SSLs search unilaterally and DLLs have a second pointer and can search bidirectionally.  hash tables – a ‘bucketed” approach to sorting.  stacks & queues– stacks (last in, first Out), queues (first in, first out). While the Zybooks information does a relatively good job of defining and creating exercises that help comprehension, it does not always provide the context that helps with grasping the concepts. I did find simple google searches helped to find material on the topics that was worded in such a way as to turn on the proverbial lightbulb. However, this course has highlighted the fact that I have a lot to learn. I particularly struggled with the concepts of week five adjacency list content, particularly those of breadth first, topological sorts, and the concepts in Zybooks, chapter 5:15 through 5:29. I was able to complete the exercises, but I am seriously struggling with the context in which these algorithms are used. In my limited experience, it seems I grasp these things when I do the coding myself rather then just running the code in a simulator provided. I have also been finding that the content of the actual Zybooks assignments and “additional learning activities” are not always sufficient in furthering my understanding in terms of application and as I advance in my courses, I may need to go outside of the provided materials to gain more insight. It is my hope that the exposure to these concepts I am gaining

Your preview ends here

Eager to read complete document? Join bartleby learn and gain access to the full version