Introduction

This document introduces data structures and algorithms. It defines key terms like data items, entities, records, and files. It explains that data structures arrange data efficiently in memory or storage for input/output problems. Common data structure classifications include primitive types and linear/non-linear structures like arrays, lists, trees and graphs. Standard operations on data include traversing, inserting, deleting, updating, sorting, searching and merging. Algorithms are sets of rules to solve problems in finite time and must be precise, unambiguous, correct, and terminate in a finite number of steps. Analysis considers an algorithm's time and space complexities.

Uploaded by

Badnaam Raja

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% found this document useful (0 votes)

7 views12 pages

Introduction

Uploaded by

Badnaam Raja

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/ 12

Introduction to Data Structures

and Algorithms

Prof. Jasmin T Jose

SCOPE
VIT Vellore
Terminologies
• Data Items
– A single unit of values
– Key element in any computational task
• Entity
– has some attributes or properties with values
– Eg. Employee
• Information
– Processed data
– Data with its attributes
• Field
– Single elementary unit represents an attribute of an entity.
• Record
– Collection of field values of an entity
• Entity set/file
– Collection of records
What is Data Structure and Why?
• Arrangement of data in a computer memory
or even disk storage.
• A sequence of values that are arranged
efficiently, to serve for the purpose of being
input or output for any problem.
• No single data structures works well for all
purposes.
Data Structure

• A data structure is a way to store and organize data in

order to facilitate access and modifications.
• DS Classification:
– Primitive DS- all primitive data types
• Integer, floating , double, char, pointers
– Non primitive DS
• Linear/sequential-Array, List, Stack, Queue
• Non-linear/non-sequential/ random-Trees, Graphs
• Introduction about different Data Structures
• Array
• Stack
• Queue
• Linked List
• Tree
• Graph
Standard Operations
• Operations to access and modify data
– Traversing
– Insertion
– Deletion
– Updation
– Sorting
– Searching
– Merging
Algorithms

• A set of rules for carrying out a calculation by

hand or with some machine.
• A finite sequence of instructions to perform any
computation.
• An Algorithm is a well defined computational
procedure that takes input and produces output.
• There are multiple algorithms to perform different
operations on each Data Structures.
Algorithms
• Is a sequence of precise instructions for solving a
problem in a finite amount of time.
• Properties of an effective algorithm:
– It must have finite number of inputs and at least one output.
– All instructions must be precise and unambiguous
(definiteness)
– It must give correct solution in all cases (correctness)
– It must terminate after a finite no. of steps. It must
eventually end (Finiteness)
– (Effectiveness)
Problem Solving Phase
• Define the problem
• Outline the solution
– Identify a suitable technique
– Write the algorithm
– Check the correctness of the algorithm
– Check the complexity of algorithm for comparison
Proof of Correctness
• If the output of the algorithm gives correct
output for every input instances, then it is
correct.
• Proof of correctness is based on algorithm.
• Check with all possible test cases.
Analysis of Algorithm
• Two complexities to be considered:
– Time Complexity :- Number of computational
operations to be performed
– Space Complexity :- The memory space occupied
by the algorithm to store the required data