1 / 9

Data Structures Lecture-1:Introduction

Data Structures Lecture-1:Introduction. Books. Data Structures Using C and C++ By Y. Langsam, M. J. Augenstein, A. M. Tenenbaum Data Structures and Algorithms By A. V. Aho, J. E. Hopcroft, J. D. Ullman Schaum's Outline Series, Theory and problems of Data Structures By Seymour Lipschutz

midori
Download Presentation

Data Structures Lecture-1:Introduction

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Data StructuresLecture-1:Introduction

  2. Books • Data Structures Using C and C++ ByY. Langsam, M. J. Augenstein, A. M. Tenenbaum • Data Structures and Algorithms By A. V. Aho, J. E. Hopcroft, J. D. Ullman • Schaum's Outline Series, Theory and problems of Data Structures By Seymour Lipschutz Some topics will be covered from other books. Material will be provided for these topics.

  3. Course Contents • Introduction • Complexity Analysis • Simple Data Types and Abstract Data Types • Arrays and Lists • Elementary Data Structures • Stack and Queues • Recursion and Time Complexity of Recursive Algorithms • Trees and Graphs • Set structure • Searching techniques • Hashing • Sorting techniques

  4. What is a Computer Program? • To exactly know, what is data structure? We must know: • What is a computer program? Some mysterious processing Output Input

  5. Definition • An organization of information, usually in memory, for better algorithm efficiency • such as queue, stack, linked list, heap, dictionary, and tree,

  6. 3 steps in the study of data structures • Logical or mathematical description of the structure • Implementation of the structure on the computer • Quantitative analysis of the structure, which includes determining the amount of memory needed to store the structure and the time required to process the structure

  7. Data may be organized in many ways • E.g., arrays, linked lists, trees etc. • The choice of particular data model depends on two consideration: • It must be rich enough in structure to mirror the actual relationships of data in the real world • The structure should be simple enough that one can effectively process the data when necessary

  8. Example • Data structure for storing data of students:- • Arrays • Linked Lists • Issues • Space needed • Operations efficiency (Time required to complete operations) • Retrieval • Insertion • Deletion

  9. What data structure to use? Data structures let the input and output be represented in a way that can be handled efficiently and effectively. array Linked list queue tree stack

More Related