9/27/2016IT 1791 Abstraction A tool (concept) to manage complexity Hide irrelevant details; focus on the features needed Primitive date types are already.

Slides:



Advertisements
Similar presentations
Data Structures A data structure is a collection of data organized in some fashion that permits access to individual elements stored in the structure This.
Advertisements

Computer Science 112 Fundamentals of Programming II Overview of Collections.
Binary Trees CSC 220. Your Observations (so far data structures) Array –Unordered Add, delete, search –Ordered Linked List –??
Lecture # 02 07/02/2013Dr. Muhammad Umair 1. 07/02/2013Dr. Muhammad Umair 2  Numeric  Integer Numbers  0,10,15,4563 etc.  Fractional Number  10.5,
Trees Chapter 8.
CHAPTER 3 COLLECTIONS Abstract Data Types. 2 A data type consists of a set of values or elements, called its domain, and a set of operators acting on.
Fall 2007CS 2251 Trees Chapter 8. Fall 2007CS 2252 Chapter Objectives To learn how to use a tree to represent a hierarchical organization of information.
Trees Chapter 8. Chapter 8: Trees2 Chapter Objectives To learn how to use a tree to represent a hierarchical organization of information To learn how.
Liang, Introduction to Java Programming, Sixth Edition, (c) 2007 Pearson Education, Inc. All rights reserved L16 (Chapter 22) Java Collections.
1 Data Structures  We can now explore some advanced techniques for organizing and managing information  Chapter 12 of the book focuses on: dynamic structures.
COMPSCI 125 Spring 2005 ©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display. Odds and Ends Strings (from Chapter 9) StringTokenizer.
Liang, Introduction to Java Programming, Tenth Edition, (c) 2013 Pearson Education, Inc. All rights reserved. 1 Chapter 20 Lists, Stacks, Queues, and Priority.
Liang, Introduction to Java Programming, Ninth Edition, (c) 2013 Pearson Education, Inc. All rights reserved. 1 Chapter 22 Lists, Stacks, Queues, and Priority.
C o n f i d e n t i a l Developed By Nitendra NextHome Subject Name: Data Structure Using C Title: Overview of Data Structure.
Trees. Tree Terminology Chapter 8: Trees 2 A tree consists of a collection of elements or nodes, with each node linked to its successors The node at the.
Chapter 3 List Stacks and Queues. Data Structures Data structure is a representation of data and the operations allowed on that data. Data structure is.
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved Chapter 22 Java Collections.
Java™ How to Program, 9/e Presented by: Dr. José M. Reyes Álamo © Copyright by Pearson Education, Inc. All Rights Reserved.
Computer Science Department Data Structures and Algorithms Lecture 1.
© 2011 Pearson Addison-Wesley. All rights reserved 11 B-1 Chapter 11 (continued) Trees.
Trees Chapter 8. Chapter 8: Trees2 Chapter Objectives To learn how to use a tree to represent a hierarchical organization of information To learn how.
Spring 2010CS 2251 Trees Chapter 6. Spring 2010CS 2252 Chapter Objectives Learn to use a tree to represent a hierarchical organization of information.
CSS446 Spring 2014 Nan Wang  Java Collection Framework ◦ LinkedList ◦ Set ◦ Map 2.
Data Structures Lecture 1: Introduction. Course Contents Data Types   Overview, Introductory concepts   Data Types, meaning and implementation  
Chapter 12: Collections by Lewis and Loftus (Updated by Dan Fleck) Coming up: Collections.
CSS446 Spring 2014 Nan Wang  Java Collection Framework ◦ Stack ◦ Queue & Priority Queue 2.
Data Structures Chapter 6. Data Structure A data structure is a representation of data and the operations allowed on that data. Examples: 1.Array 2.Record.
Chapter 12 Abstract Data Type. Understand the concept of an abstract data type (ADT). Understand the concept of a linear list as well as its operations.
Abstract Data Type EnhanceEdu.
CSC 205 – Java Programming II Lecture 30 April 3, 2002.
3-1 Java's Collection Framework Another use of polymorphism and interfaces Rick Mercer.
Week 15 – Monday.  What did we talk about last time?  Tries.
Chapter 0: Introduction
G64ADS Advanced Data Structures
Set Collection A Bag is a general collection class that implements the Collection interface. A Set is a collection that resembles a Bag with the provision.
Trees Chapter 15.
Course Developer/Writer: A. J. Ikuomola
Fundamentals of Programming II Overview of Collections
Chapter 11 Heap.
Trees Chapter 11 (continued)
Trees Chapter 11 (continued)
CS Data Structures Chapter 8 Lists Mehmet H Gunes
Chapter 20 Lists, Stacks, Queues, and Priority Queues
Abstraction A tool (concept) to manage complexity
Priority Queues and Heaps
Data Structures Data Structure is a way of collecting and organising data in such a way that we can perform operations on these data in an effective.
Week 15 – Monday CS221.
Bohyung Han CSE, POSTECH
Data Structures and Database Applications Abstract Data Types
Road Map CS Concepts Data Structures Java Language Java Collections
structures and their relationships." - Linus Torvalds
CSC 205 – Java Programming II
structures and their relationships." - Linus Torvalds
Chapter 20 Lists, Stacks, Queues, and Priority Queues
(Java Collections Framework) AbstractSequentialList
Based on Sedgewick and Wayne
List Implementations Chapter 9.
Arrays and Collections
Object-Oriented Programming Paradigm
Dynamic Data Structures and Generics
Introduction to Computer Science for Majors II
Priority Queues (Chapter 6.6):
Introduction to Data Structure
Priority Queues (Chapter 6):
Chapter 12 Heap ADT © 2011 Pearson Addison-Wesley. All rights reserved.
Tables and Priority Queues
structures and their relationships." - Linus Torvalds
Chapter 20 Lists, Stacks, Queues, and Priority Queues
Presentation transcript:

9/27/2016IT 1791 Abstraction A tool (concept) to manage complexity Hide irrelevant details; focus on the features needed Primitive date types are already abstracted from bits 0/1 Examples Integer addition File deletion using icons The brakes on a car Television remotes

9/27/2016IT 1792 Some here are primitive data types Characterize data into different kinds for convenience 1.bit 2.byte 3.integer 4.ascii 5.character 6.array 7.string 8.real 9.record + operations objects

9/27/2016IT 1793 Data Type (how to view it) Specification View of a data type –Data values –Operations defined on those values  Abstract Data Type (ADT) – use of abstraction! Implementation View of a data type –Language-specific representation for the values –Implementation of the operations  Implementation of an ADT

9/27/2016IT 1794 Abstract model of Priority Queues ( Specification View) Priority Queue a black box insert one item Get the one with the highest priority the minimum one (or maximum) Abstract Data Type (ADT)

5 Abstract model of Priority Queues ( Implementation View) Binary Search Tree or Binary Heap? insert one item Get the one with the highest priority the minimum one (or maximum) Abstract Data Type (ADT) 9/27/2016IT 179

9/27/2016IT 1796 Collection List LinkedList {interface} AbstractList {abstract} ArrayList Java Provides a List interface for several implementations {interface} The Java Collections Framework (JCF) RandomAccess {interface} AbstractSequentialList {abstract} Stack Vector UML Class Diagram Queue {interface}

9/27/2016IT 1797 Typical Collection Operations Add an element Remove an element Replace an element Retrieve an element Determine if a collection contains an element Get the collection’s size Determine if a collection is empty Traverse a collection Determine if two collections are equal Clone a collection Serialize a collection Most collections support the same operations, but may give them different names.