CSE 101 Lecture Notes - Lecture 12: Memory Address, Oneword, Linked List
72 views11 pages
29 Jun 2016
School
Department
Course
Professor
Document Summary
Data structures are different ways of organizing data. An optimal way of representing data is required to solve a problem as efficiently as possible with computer programs. Data structures and algorithms together form the heart and soul of computer science as a field of study. One of the most fundamental concepts in data structures is that of a collection. A collection is an entity in a program that contains other entities. A list is an example of a simple yet very useful kind of collection. Items can be added to the end of a list, deleted, inserted in the middle, and perform other operations on lists. Index, a position of an item in a list, offers ways to access data stored in a list. Bracket notation is used to indicate the item to be retrieved from a list. For example, in a list called names, then names[1] would refer to the first name in the list.
Get access
Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers