CS331Week4
3 Pages

CS331Week4

Course Number: CS 560, Fall 2009

College/University: Illinois Tech

Word Count: 420

Rating:

Document Preview

CS 331 Week 4 Reading: Algorithms and Data Structures by Alan Parker, Section 3.4 Objectives: 1. Understanding linked list data structures 2. To implement linked list in programming Concepts: 1. Introduction to linked list 2. Linked list types and operations 3. Implementing linked list in programming Outline: 1. Introduction to Linked list i. What is linked list ii. Differences between linked list and other data...

Unformatted Document Excerpt
Coursehero >> Illinois >> Illinois Tech >> CS 560

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

CS 331 Week 4 Reading: Algorithms and Data Structures by Alan Parker, Section 3.4 Objectives: 1. Understanding linked list data structures 2. To implement linked list in programming Concepts: 1. Introduction to linked list 2. Linked list types and operations 3. Implementing linked list in programming Outline: 1. Introduction to Linked list i. What is linked list ii. Differences between linked list and other data structures iii. Advantages and limitations of linked list 2. Linked list types and operations i. Singly linked list ii. Doubly linked list iii. Circular linked list 3. Lab Exercise: Implementing linked list in programming Reference: 1. http://library.books24x7.com.ezproxy.gl.iit.edu/book/id_14841/viewer.asp?bookid=1484 1&chunkid=0994537176 2. http://en.wikipedia.org/wiki/Linked_list CS 331 Week 4- Page 1 CS 331- Week4- Lecture notes 1. Introduction to Linked list i. What is linked list i. A data structure in which each data item points to the next data item. ii. An address variable along with each data item which stores the address of next data item iii. Node, data and next address ii. Differences between linked list and other data structures i. Comparison with stacks ii. Comparison with queues iii. Comparison with arrays iii. Advantages and limitations of linked list i. Advantages 1. Takes limited space 2. Number of operations ii. Limitations 1. Searching elements 2. Time 2. Linked list types and operations i. Singly linked list i. Definition: A singly linked list is like a queue, except you can look at the nodes in the list without destroying the lists. ii. Creating singly linked list iii. Operations on Nodes 1. Add: from beginning, end, and middle 2. Delete: form beginning, end and middle iv. Traversing a list v. Deleting singly linked list ii. Doubly linked list i. Definition: A type of Linked List in which each data item points to the next and also to the previous data item. ii. Creating doubly linked list iii. Operations on Nodes 1. Add: from beginning, end, and middle 2. Delete: from beginning, end, and middle iv. Traversing a list v. Deleting doubly linked list iii. Circular linked list i. Definitio...
MOST POPULAR MATERIALS FROM CS 560
MOST POPULAR MATERIALS FROM CS
MOST POPULAR MATERIALS FROM Illinois Tech