b'Computer ScienceDynamic QueuesRyan G. Slaybaugh, Parker A. Harris and William J. LeeSponsor: Dr. Anurag Dasgupta, Department of Computer ScienceQueue data structures are used in various aspects of everyday life including areas such as doctors offices, drive through establishments, online multiplayer game matchmaking, and any other situation that requires strict access to the first element within a list. A dynamic queue builds upon the regular queue by allowing the list to grow or shrink as needed to accommodate the given elements. In this paper we take a look at the dynamic queue data structure and three problems that utilize such a list. The first problem, a simulation of a fast food drive through. The second, a simulation of an online match-making game. The final problem, the traversal of the nodes of a binary tree. By utilizing the dynamic queue data structure, we show how these problems can be solved.Properties, Functions, and Real Life Uses of Circular Doubly Linked ListMisty N. Van Dyke and Luke L. EdmonsonSponsor: Dr. Anurag Dasgupta, Department of Computer ScienceUnderstanding how circular doubly linked list functions first requires an understanding of its parent data structure, Linked List, and how it primarily functions. Linked lists are generally looked at as an alternative to arrays, are dynamic data structures. Therefore, they can be easily extended or reduced to fit any data set. Methods such as insertion and deletion are much more manageable with a linked list in comparison to static arrays where these types of functions are either inefficient or undoable. All of these properties carry over to the circular doubly linked list but come with their own specifications. One major difference includes the ability of nodes in a circular doubly linked list can traverse to the next or previous node. There are also minor differences that include how operations such as deletion works, as only one reference address is needed for deletion in a circular doubly linked list compared to a regular linked list. There are obviously disadvantages that come along with the advantages, or else arrays would not be as commonly used in the landscape of programming. Arrays allow for immediate access and references to each individual object, while linked lists require the entire list to be traversed.43'