Description: Introduction to the fundamentals of Data Structures. In this session, we start discussing the principles of implementing a data structure algorithm. In the case of a LinkedList, a node is comprised of the data to be stored in each list item and a reference to the next node in the list.
ACM CCECC
N/A
AP CS A
N/A
CS2
N/A
Description: As we now have defined our Node class, it is time to start implementing the method that will allow us to store data. Algon with it, it is essential to have a method to know if our data structure is empty or holding values.
ACM CCECC
N/A
AP CS A
N/A
CS2
N/A
Description: Now that we understand the principles of a Linked List, we can start implementing some iterative and recursive methods with the use of Object-Oriented Programming. The first method students will be implementing will be print(), which will show what the List has stored.
ACM CCECC
[Operations on Linked Lists]
SDF-10. Create simple programs that include each of the following data structures: lists, stacks, queues, hash tables, graphs, and trees.
AP CS A
N/A
CS2
[Operations on Linked Lists]
130.422.c.3.h Identify and use a list object data structure to traverse, search, insert, and delete data.
Description: In this session, the third method students will be implementing will be size(), which will return the size of a List. The method will be iteratively and recursively implemented.
ACM CCECC
[Operations on Linked Lists]
SDF-10. Create simple programs that include each of the following data structures: lists, stacks, queues, hash tables, graphs, and trees.
AP CS A
N/A
CS2
[Operations on Linked Lists]
130.422.c.3.h Identify and use a list object data structure to traverse, search, insert, and delete data.
Description: In this session, the fourth method students will be implementing will be add(x, p), where x is the element that will be passed to the method, and p the position of the List where the element x is planned to be stored. The method will be adding more elements to a List and will be iteratively and recursively implemented.
ACM CCECC
[Operations on Linked Lists]
SDF-10. Create simple programs that include each of the following data structures: lists, stacks, queues, hash tables, graphs, and trees.
AP CS A
N/A
CS2
[Operations on Linked Lists]
130.422.c.3.h Identify and use a list object data structure to traverse, search, insert, and delete data.
Description: In this session, the second method students will be implementing will be find(), which will look for data in a List. The method will be iteratively and recursively implemented.
ACM CCECC
[Operations on Linked Lists]
SDF-10. Create simple programs that include each of the following data structures: lists, stacks, queues, hash tables, graphs, and trees.
AP CS A
N/A
CS2
[Operations on Linked Lists]
130.422.c.3.h Identify and use a list object data structure to traverse, search, insert, and delete data.
Description: In this session, the fifth and last method students will be implementing will be remove(), which will be getting rid of elements in a List. The method will be iteratively and recursively implemented.
ACM CCECC
[Operations on Linked Lists]
SDF-10. Create simple programs that include each of the following data structures: lists, stacks, queues, hash tables, graphs, and trees.
AP CS A
N/A
CS2
[Operations on Linked Lists]
130.422.c.3.h Identify and use a list object data structure to traverse, search, insert, and delete data.