DAT 305 Wk 2 – Apply – Linked Lists

0 items
DAT 305 Wk 2 - Apply - Linked Lists
DAT 305 Wk 2 – Apply – Linked Lists
$10.00
Go to the store page
  • Description

DAT 305 Wk 2 – Apply – Linked Lists

In this assignment, students will expand on the information provided in the course.

 

Answer the following in a 2- to 3-page paper:

  1. Singly-linked list & doubly-linked list

  • What is the difference between a singly-linked list and a doubly-linked list?

  • In what situation would you use a singly-linked list over a doubly-linked list?

  • In what situation would you use a doubly-linked list over a singly-linked list?

  1. If a node is in a linked list with N nodes, how many nodes will be traversed during a search for the node?

  • Explain the best- and worst-case search scenarios.

  • Explain why a singly-linked list defines a RemoveAfter() function, while a doubly-linked list defines a Remove() function.

  • Could a RemoveAfter() function also be defined for a doubly-linked list? Explain why or why not.

  • Could a Remove() function also be defined for a singly-linked list? Explain why or why not.

 

Format your paper according to appropriate course-level APA guidelines.

 

Submit your paper.