DAT 305 Wk 1 Discussion – Algorithms

Post a total of 3 substantive responses over 2 separate days for full participation. This includes your initial post and 2 replies to classmates or your faculty member.

Due Day 3

Respond to the following in a minimum of 175 words:

Discuss an example of an algorithm. In general, is there only one correct algorithm for a given problem? Explain.

Due Day 7

Post 2 replies to classmates or your faculty member. Be constructive and professional.

DAT 305 Wk 2 Discussion – Singly-Linked and Doubly-Linked Lists

Post a total of 3 substantive responses over 2 separate days for full participation. This includes your initial post and 2 replies to classmates or your faculty member.

Due Day 3

Respond to the following in a minimum of 175 words:

What is the difference between a singly-linked list and a doubly-linked list? Provide a situation in which you would 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?

Due Day 7

Post 2 replies to classmates or your faculty member. Be constructive and professional.

DAT 305 Wk 3 Discussion – Stacks vs. Queues vs. Hash Tables

Post a total of 3 substantive responses over 2 separate days for full participation. This includes your initial post and 2 replies to classmates or your faculty member.

Due Day 3

Respond to the following in a minimum of 175 words:

Determining the difference among stacks, queues, and hash tables can be confusing to some people, especially those who are not in the data field. Provide an example that clearly describes these differences. This can be an example in layman’s terms or a visual description (i.e., a stack of dishes).

Due Day 7

Post 2 replies to classmates or your faculty member. Be constructive and professional.

DAT 305 Wk 4 Discussion – Binary Search Trees

Post a total of 3 substantive responses over 2 separate days for full participation. This includes your initial post and 2 replies to classmates or your faculty member.

Due Day 3

Respond to the following in a minimum of 175 words:

An important property of a binary search tree is being able to easily find the maximum and minimum key in the tree. Discuss a simple rule to identify these keys. What is the output of a BFS traversal in a normal binary search tree if the key insert order is “1,2,3,4,5,6,7”? When do you struggle with finding the max and min key in the tree?

Due Day 7

Post 2 replies to classmates or your faculty member. Be constructive and professional.

DAT 305 Wk 5 Discussion – Adjacency List Representation

Post a total of 3 substantive responses over 2 separate days for full participation. This includes your initial post and 2 replies to classmates or your faculty member.

Due Day 3

Respond to the following in a minimum of 175 words:

Discuss a disadvantage of adjacency list representation of a weighted graph representation. Why is it a disadvantage?

Due Day 7

Post 2 replies to classmates or your faculty member. Be constructive and professional.