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.

Slides:



Advertisements
Similar presentations
PROGRAMMING LANGUAGE (JAVA) UNIT 42 BY ROBERT BUTTERFIELD TELEPHONE Data Structures and Algorithms.
Advertisements

CHP-5 LinkedList.
Data Structures.
Overview of Data Structures and Algorithms
Data Structures: A Pseudocode Approach with C
C o n f i d e n t i a l Developed By Nitendra NextHome Subject Name: Data Structure Using C Unit : Overview of Queues.
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.
Lecture - 1 on Data Structures. Prepared by, Jesmin Akhter, Lecturer, IIT,JU Data Type and Data Structure Data type Set of possible values for variables.
1 Problem Solving Abstraction Oftentimes, different real-world problems can be modeled using the same underlying idea Examples: Runtime storage, Undo operation.
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.
CS 307 Fundamentals of Computer Science 1 Abstract Data Types many slides taken from Mike Scott, UT Austin.
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.
Basic Definitions Data Structures: Data Structures: A data structure is a systematic way of organizing and accessing data. Or, It’s the logical relationship.
INTRODUCTION TO DATA STRUCTURE. Topics To Be Discussed………………………. Meaning of Data Structure Classification of Data Structure Data Structure Operations.
1 ES 314 Advanced Programming Lec 2 Sept 3 Goals: Complete the discussion of problem Review of C++ Object-oriented design Arrays and pointers.
Data Structures 1- Course Syllabus. 2- Introduction about Data Structures.
Data Structures Lecture-1:Introduction
Copyright © Wondershare Software Introduction to Data Structures Prepared by: Eng. Ahmed & Mohamed Taha.
Comp 249 Programming Methodology Chapter 15 Linked Data Structure - Part B Dr. Aiman Hanna Department of Computer Science & Software Engineering Concordia.
Lecture No.01 Data Structures Dr. Sohail Aslam
Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Cpt S 122 – Data Structures Custom Templatized Data Structures.
Introduction to Data Structures. Definition Data structure is representation of the logical relationship existing between individual elements of data.
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.
Data Structures and Abstract Data Types "Get your data structures correct first, and the rest of the program will write itself." - David Jones.
Unit III : Introduction To Data Structures and Analysis Of Algorithm 10/8/ Objective : 1.To understand primitive storage structures and types 2.To.
Lecture 10: Class Review Dr John Levine Algorithms and Complexity March 13th 2006.
Computer Science Department Data Structures and Algorithms Lecture 1.
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.
CS212: DATA STRUCTURES Lecture 1: Introduction. What is this course is about ?  Data structures : conceptual and concrete ways to organize data for efficient.
Prepared By Ms.R.K.Dharme Head Computer Department.
1 CS 350 Data Structures Chaminade University of Honolulu.
 DATA STRUCTURE DATA STRUCTURE  DATA STRUCTURE OPERATIONS DATA STRUCTURE OPERATIONS  BIG-O NOTATION BIG-O NOTATION  TYPES OF DATA STRUCTURE TYPES.
Data structures Abstract data types Java classes for Data structures and ADTs.
Data Structures and Algorithms Lecture 1 Instructor: Quratulain Date: 1 st Sep, 2009.
Data Structure Introduction.
Data Structures Lecture 1: Introduction. Course Contents Data Types   Overview, Introductory concepts   Data Types, meaning and implementation  
Data Structure & Algorithm
Lecture by: Prof. Pooja Vaishnav.  Language Processor implementations are highly influenced by the kind of storage structure used for program variables.
Fundamentals of Java Lesson 13: Linear Collections: Lists.
Elementary Data Organization. Outline  Data, Entity and Information  Primitive data types  Non primitive data Types  Data structure  Definition 
Subject Name : Data Structure Using C Title : Linked Lists
1 Data Organization Example 1: Heap storage management –Keep track of free chunks of memory Example 2: A simple text editor –Maintain a sequence of lines.
2 Obaid Ullah HOD Computer Science Dept. Superior University Sialkot Campus.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI CSCI 240 Elementary Data Structures Array Lists Array Lists Dale.
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
Data Structure and Algorithms
Data Structure and Algorithm Introduction.  The manner in which computer program is being developed is not as simple as you may possibly think.  It.
Computer Science: A Structured Programming Approach Using C1 Objectives ❏ To introduce the basic concepts of linked lists ❏ To introduce the basic concepts.
ARRAYS IN C/C++ (1-Dimensional & 2-Dimensional) Introduction 1-D 2-D Applications Operations Limitations Conclusion Bibliography.
LINKED LISTS.
DATA STRUCURES II CSC QUIZ 1. What is Data Structure ? 2. Mention the classifications of data structure giving example of each. 3. Briefly explain.
1 Data Organization Example 1: Heap storage management Maintain a sequence of free chunks of memory Find an appropriate chunk when allocation is requested.
Data Structure By Amee Trivedi.
Course Developer/Writer: A. J. Ikuomola
Data Structure Interview Question and Answers
Abstraction A tool (concept) to manage complexity
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.
Data Structures Interview / VIVA Questions and Answers
Introduction to Data Structure
Map interface Empty() - return true if the map is empty; else return false Size() - return the number of elements in the map Find(key) - if there is an.
structures and their relationships." - Linus Torvalds
structures and their relationships." - Linus Torvalds
Arrays and Linked Lists
Introduction to Data Structures
Introduction to Data Structures
Introduction to Data Structure
structures and their relationships." - Linus Torvalds
Presentation transcript:

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

Unit-2 Overview of Data Structure Developed By Nitendra Overview of Data Structure A data structure is the organization of data in a computer's memory or in a file. The proper choice of a data structure can lead to more efficient programs. At the lowest level, there are data structures supplied and supported by the CPU (or computer chip), itself. At the second level of the data structures spectrum are the data structures supported by particular programming languages. These vary a lot from language to language. The size of the computer memory size sometimes very small with respect to the file size. That time the file splits into number of fragments and swap into the memory. NextHome

Unit-2 Overview of Data Structure Developed By Nitendra A data structure is a representation of data and the operations allowed on that data. A specification, an application and an implementation view of a collection of one or more items of data, and the operations necessary and sufficient to interact with the collection. The specification is the definition of the data structure as an abstract data type. The specification forms the programming interface for the data structure. The application level is a way of modeling real-life data in a specific context. It is happening specially for the memory management. Definition NextHome

Unit-2 Overview of Data Structure Developed By Nitendra Some example data structures are: array, stack, queue, linked list, binary tree, hash table, heap, and graph. Data structures are often used to build databases. Typically, data structures are manipulated using various algorithms. Example of Data Structure NextHome

Unit-2 Overview of Data Structure Developed By Nitendra When primitive data types are not sufficient to handle the data then we have to define some data type along with its activities, storage structures, algorithms. The ADT is the data type which has the following components 1) Operations: Specifications of external appearance of a data structure 2) Storage Structures: Organizations of data implemented in lower- level data structures 3) Algorithms: Description on how to manipulate information in the storage structures to obtain the results defined for the operations Abstract Data Types (ADT) NextHome

Unit-2 Overview of Data Structure Developed By Nitendra The abstract (or logical) level is the specification of the data structure -the "what" but not the "how." At this level. the user or data structure designer is free to think outside the bounds of anyone programming language. For instance. a linear list type would consist of a collection of list nodes such that they formed a sequence. The operations defined for this list might be insert. delete, sort and retrieve. The Abstract Level NextHome

Unit-2 Overview of Data Structure Developed By Nitendra At the application or user level, the user is modeling real-life data in a specific context. In our list example. we might specify what kind of items were stored in the list and how long the list is. The context will determine the definitions of the operations. For example, if the list was a list of character data, the operations would have a different meaning than if we were talking about a grocery list. The Application Level NextHome

Unit-2 Overview of Data Structure Developed By Nitendra The implementation level is where the model becomes compileable, executable code. We need to determine where the data will reside and allocate space in that storage area. We also need to create the sequence of instructions that will cause the operations to perform as specified. The Implementation Level NextHome

Unit-2 Overview of Data Structure Developed By Nitendra NextHome

Unit-2 Overview of Data Structure Developed By Nitendra There are two types of Data Structures 1.Linear Data Structure A data structure is said to be linear if its elements form a sequence or a linear list. Examples: Arrays Linked Lists Stacks, Queues NextHome

Unit-2 Overview of Data Structure Developed By Nitendra Pictorial Representation of Array a[0]a[1]a[2]a[3]a[4] a[0][0]a[0][1]a[0][2]a[0][3]a[0][4] a[1][0]a[1][1]a[1][2]a[1][3]a[1][4] a[2][0]a[2][1]a[2][2]a[2][3]a[2][4] One Dimension Two Dimension NextHome

Unit-2 Overview of Data Structure Developed By Nitendra Pictorial Representation of Linked Lists Linked List: NULL Tail Node Address Part Data Part Arbitrary Address of the Node Head Node NextHome

Unit-2 Overview of Data Structure Developed By Nitendra Pictorial Representation of Stack NextHome

Unit-2 Overview of Data Structure Developed By Nitendra Pictorial Representation of Queue NextHome

Unit-2 Overview of Data Structure Developed By Nitendra Traversal: Travel through the data structure Search: Traversal through the data structure for a given element Insertion: Adding new elements to the data structure Deletion: Removing an element from the data structure Sorting: Arranging the elements in some type of order Merging: Combining two similar data structures into one Operations on Linear Structures NextHome

Unit-2 Overview of Data Structure Developed By Nitendra 2. Non Linear Data Structure A data structure is said to be non linear if its elements cannot form a sequence or a linear list. Examples: Trees Tree terminology Binary Search Trees Tree Traversal NextHome

Unit-2 Overview of Data Structure Developed By Nitendra