This document provides an overview of basic terminology related to data structures and algorithms, including definitions and examples of sets, values, and entities. It discusses the classification of data structures into primitive and non-primitive types, as well as operations such as traversing, searching, inserting, and deleting. Additionally, it touches on abstract data types and considerations for choosing data models.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
21 views32 pages
Chapter 1
This document provides an overview of basic terminology related to data structures and algorithms, including definitions and examples of sets, values, and entities. It discusses the classification of data structures into primitive and non-primitive types, as well as operations such as traversing, searching, inserting, and deleting. Additionally, it touches on abstract data types and considerations for choosing data models.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 32
DATA STRUCTURE
AND ALGORITHM CHAPTER 1 BASIC TERMINOLO GY
SET OF VALUES – EXAMPLES (BOOLEAN – {TRUE, FALSE}
VALUES – EXAMPLE (INT NUM – 3) BASIC TERMINOLO GY BASIC TERMINOLO GY ADDITIONAL TERMINOLO GY ADDITIONAL TERMINOLO GY:EXAMPL ES
EXAMPLE: ENTITY – PERSON
ATTRIBUTES OF PERSON – NAME, AGE, SEX, AADHAR NUMBE VALUES OF THE ATTRIBUTES - ADDITIONAL TERMINOLO GY RECORDS STEPS IN STUDY DATA STRUCTURE S DATA STRUCTUR ES DATA STRUCTUR ES - DEFINITIO N SOMETHIN G TO CONSIDER WHEN CHOOSE DATA MODEL CLASSIFICAT ION OF DATA STRUCTURE S PRIMITIVE DATA STRUCTUR ES NON- PRIMITIVE DATA STRUCTUR ES DATA STRUCTUR E IS LINEAR IF.. DATA STRUCTUR E IS NON- LINEAR IF.. DATA STRUCTUR ES OPERATIO N TRAVERSI NG SEARCHIN G INSERTING DELETING OTHER TWO OPERATIO NS ABSTRACT DATA TYPES ADT MODEL DIFFEREN T PARTS OF ADT MODEL ALGORITH MS ALGORITH MS ALGORITH M: SORTING WHICH DATA STRUCTUR ES TO USE? TIME SPACE TRADE OFF END