CS212: DATA STRUCTURES Lecture 1: Introduction. What is this course is about ?  Data structures : conceptual and concrete ways to organize data for efficient.

Slides:



Advertisements
Similar presentations
Student Projects in the Course Data Structures
Advertisements

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,
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.
DAST, Spring © L. Joskowicz 1 Data Structures – LECTURE 1 Introduction Motivation: algorithms and abstract data types Easy problems, hard problems.
CSCE156: Introduction to Computer Science II Instructor Stephen Scott Website
CS 315 Data Structures B. Ravikumar Office: 116 I Darwin Hall Phone: Course Web site:
Review for Test 2 i206 Fall 2010 John Chuang. 2 Topics  Operating System and Memory Hierarchy  Algorithm analysis and Big-O Notation  Data structures.
Abstract Data Types (ADT)
Data Structures Introduction. What is data? (Latin) Plural of datum = something given.
Administrivia- Introduction CSE 373 Data Structures.
Basic Definitions Data Structures: Data Structures: A data structure is a systematic way of organizing and accessing data. Or, It’s the logical relationship.
The Design and Analysis of Algorithms
DAST, Spring © L. Joskowicz 1 Data Structures – LECTURE 1 Introduction Motivation: algorithms and abstract data types Easy problems, hard problems.
Introduction - The Need for Data Structures Data structures organize data –This gives more efficient programs. More powerful computers encourage more complex.
1 A Introduction to Data Structures and Algorithm Analysis Data Structures Asst. Professor Kiran Soni.
CSCE 3110 Data Structures and Algorithm Analysis.
Data Structures and Programming.  John Edgar2.
Data Structures Lecture-1:Introduction
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.
Introduction to Programming G50PRO University of Nottingham Unit 1 : Introduction Paul Tennent
WEEK 1 CS 361: ADVANCED DATA STRUCTURES AND ALGORITHMS Dong Si Dept. of Computer Science 1.
Data Structures Lecture 1: Introduction Azhar Maqsood NUST Institute of Information Technology (NIIT)
Lecture No.01 Data Structures Dr. Sohail Aslam
Design and Analysis of Algorithms CSC201 Shahid Hussain 1.
ITEC 2620A Introduction to Data Structures
Computer Science Department Data Structures and Algorithms Lecture 1.
Java Collections An Introduction to Abstract Data Types, Data Structures, and Algorithms David A Watt and Deryck F Brown © 2001, D.A. Watt and D.F. Brown.
Dr. Engr. Sami ur Rahman Assistant Professor Department of Computer Science University of Malakand Data Structure: Introduction.
Instructor Information: Dr. Radwa El Shawi Room: Week # 1: Overview & Review.
DATA STRUCTURES (CS212D) Week # 1: Overview & Review.
Prepared By Ms.R.K.Dharme Head Computer Department.
1 CS 350 Data Structures Chaminade University of Honolulu.
CS 206 Introduction to Computer Science II 09 / 10 / 2009 Instructor: Michael Eckmann.
Overview of Course Java Review 1. This Course Covers, using Java Abstract data types Design, what you want them to do (OOD) Techniques, used in implementation.
ITEC 2620M Introduction to Data Structures Instructor: Prof. Z. Yang Course Website: ec2620m.htm Office: Tel 3049.
Chapter 1 Data Structures and Algorithms. Primary Goals Present commonly used data structures Present commonly used data structures Introduce the idea.
Data Structures and Algorithms Lecture 1 Instructor: Quratulain Date: 1 st Sep, 2009.
Data Structures Lecture 1: Introduction. Course Contents Data Types   Overview, Introductory concepts   Data Types, meaning and implementation  
Data Structures and Algorithms Dr. Tehseen Zia Assistant Professor Dept. Computer Science and IT University of Sargodha Lecture 1.
Elementary Data Organization. Outline  Data, Entity and Information  Primitive data types  Non primitive data Types  Data structure  Definition 
2 Obaid Ullah HOD Computer Science Dept. Superior University Sialkot Campus.
DATA STRUCTURES (CS212D) Overview & Review Instructor Information 2  Instructor Information:  Dr. Radwa El Shawi  Room: 
Topic 2 Collections. 2-2 Objectives Define the concepts and terminology related to collections Discuss the abstract design of collections.
REEM ALMOTIRI Information Technology Department Majmaah University.
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
1 A Practical Introduction to Data Structures and Algorithm Analysis Chaminade University of Honolulu Department of Computer Science Text by Clifford Shaffer.
Data Structure and Algorithms
 FUNDAMENTALS OF ALGORITHMS.  FUNDAMENTALS OF DATA STRUCTURES.  TREES.  GRAPHS AND THEIR APPLICATIONS.  STORAGE MANAGEMENT.
BITS Pilani Pilani Campus Data Structure and Algorithms Design Dr. Maheswari Karthikeyan Lecture1.
Introduction to Algorithm Complexity Bit Sum Problem.
Data Structures Dr. Abd El-Aziz Ahmed Assistant Professor Institute of Statistical Studies and Research, Cairo University Springer 2015 DS.
Maitrayee Mukerji. INPUT MEMORY PROCESS OUTPUT DATA INFO.
Lecture 1 Data Structures Aamir Zia. Introduction Course outline Rules and regulations Course contents Good Programming Practices Data Types and Data.
Mohammed I DAABO COURSE CODE: CSC 355 COURSE TITLE: Data Structures.
Advanced Data Structures Lecture 1
Introduction toData structures and Algorithms
COMP9024: Data Structures and Algorithms
Course Developer/Writer: A. J. Ikuomola
CS 315 Data Structures B. Ravikumar Office: 116 I Darwin Hall Phone:
What is “Data Structures”?
Introduction to Data Structure
CS302 Data Structures Fall 2012.
Data Structures (CS212D) Overview & Review.
Data Structures: Introductory lecture
Week # 1: Overview & Review
Data Structures (CS212D) Overview & Review.
ITEC 2620M Introduction to Data Structures
CS Fall 2012, Lab 11 Haohan Zhu.
COP3530- Data Structures Introduction
CSCE156: Introduction to Computer Science II
Presentation transcript:

CS212: DATA STRUCTURES Lecture 1: Introduction

What is this course is about ?  Data structures : conceptual and concrete ways to organize data for efficient storage and efficient manipulation.  Employment of this data structures is the designed of efficient algorithms

What is this course is about ? Con..  The data structures deal with the study of how the data is organized in the memory, how efficiently it can be retrieved and manipulated and possible ways in which different data items are logically related.  They go hand by hand with a particular algorithm.  Data structures can be classified into : 1- Primitive data structure 2-Non primitive data structure

Data structures classification 1- Primitive data structure  These are data structures that can be manipulated directly by machine instructions.  In C language, the different primitive data structures are integer, float,character, double.

Data structures classification con.. 2-Non Primitive data structure These are data structures that can not be manipulated directly by machine instructions. Arrays, linked list, files, etc are some of none primitive data structures and are classified into linear data structures and non-linear data structures.

Why do we need data them ?  Computers take on more and more complex tasks.  Imagine index of 8 billion pages (google)  Software implementation and maintenance is difficult  Clean conceptual frame work allows for more efficient and more correct code.

Why do we need data them ?  Requirements for a good software  Clean design  Easy maintenance  Reliable  Easy to use  Fast algorithms Efficient Data Structure Efficient algorithm

Selecting a data structures Select a data structure as follows: 1. Analyze the problem to determine the resource constraints a solution must meet. 2. Determine the basic operations that must be supported. 3. Select the data structure that best meets these requirements.

Data Structure philosophy  Each data structure has costs and benefits.  Rarely is one data structure better than another in all situations.  A data structure requires:  Space for each data item it stores.  Time to perform each basic operation programming effort.

What you need ?  Programming experience with java  Textbook Data structures and algorithms with java Michael T.goodRich 4 th Edition

Topics  Array  Linked list  Recursion  Stack  Queue  Tree  Graph  Hashing