COMP 202 Data Structures and

Algorithms

Bal Krishna Bal, PhD

http://ku.edu.np/cse/faculty/bal/

Acknowledgement: Some of the material has been adopted from

https://www.tutorialspoint.com/data_structures_algorithms/
 About myself

Assistant Professor at KU, DoCSE since 2009

Research areas and interests Natural Language

Processing and Software Localization.
 About the course

Course organization

We will use the Course Management System Piazza
(https://piazza.com) for managing course materials
and announcements. Please wait for invitation via
email to join Piazza.

Twice a week Tuesday ( 1 hour) and Friday (2
hours) Tutorial and Lecture

Text book
Data Structures using C and C++, Second
Edition. Langsam, Augenstein, Tenenbaum

Evaluation scheme

Semester evaluation 50%

End-Semester evaluation 50%
 About the course

Course organization

Internal Assessment Marks Allocation

Tests (2) 15 (6+9)

Quizzes (2) 15(7+8)

Assignments 5

Mini Project 10

Viva (End of semester) - 5
 About the course

Develop capability to understand data structures and

algorithms.

Develop capability to design and implement data/structure

algorithm for a particular task.

Program code = Data Structure + Algorithm

 Data Structures Overview

Programmatic way of storing data so that data can be used

efficiently.

Some common terms:

Interface:

Each data structure has an interface.

Interface represents the set of operations that a data
structure supports.

An interface only provides the list of supported
operations, type of parameters they can accept and
return type of these operations.
Implementation:

Provides the internal representation of a data structure.

Implementation also provides the definition of the
algorithms used in the operations of the data structure.
 Need for Data Structure

Three common problems applications face these days include

the following:

Data Search

Consider searching an element among 106 elements. Search

gets slower as data size increases.

Processor Speed

Even high processing speeds cannot handle large amounts of

data efficiently.

Multiple Requests

Even very fast server fails when it comes to handling

simultaneous data search requests.
 Execution Time Cases

Three cases for comparing the execution times of data

structures.

Worst case

Maximum execution time or consumption of other resources.

Average case

Average execution time or consumption of other resources.

Best case

Least possible execution time or consumption of other
resources.
 Basic Terminology

Data Data are values or set of values.

Data item Refers to single unit of values.

Group items Data item divided into sub items.

Elementary items Data item that cannot be divided.

Attribute and Entity An entity is that which contains certain

attributes or properties which may be assigned values.

Entity set Entities of similar attributes form an entity set.

Field Single elementary unit of information representing an

attribute of an entity.

Record Collection of field values of a given entity.

File Collection of records of entities in a given entity set.

 Algorithm - Basics

Step by step procedure defining a set of instructions to be

executed in certain order to get the desired output.

Programming language independent

Some important categories of algorithms

Search

Sort

Characteristics of an Algorithm

Unambiguous Each step or phase and their input/outputs

should be clear and must lead to only one meaning.

Finite input Should have 0 or more well defined inputs

Finite output Should have 1 or more well defined and

desired outputs

Termination Terminates after a finite number of steps

Feasible in terms of the available resources

Programming language independent

 Writing an algorithm

Example 1

Problem: Design an algorithm to add numbers and display

result

step 1 START
step 2 declare three integers a, b & c
step 3 define values of a & b
step 4 add values of a & b
step 5 store output of step 4 to c
step 6 print c
step 7 STOP
Algorithms tell the programmer how to code the program.
 Writing an algorithm

Alternative algorithm to Example 1

Problem: Design an algorithm to add numbers and display

result

step 1 START ADD

step 2 get values of a & b
step 3 c a + b
step 4 display c
step 5 STOP

The alternative algorithm above ignores all the unnecessary

definitions and focuses on the operations being used to
describe the process of reaching to the result.
 Analyzing algorithms

Algorithms are designed to get solution to a given problem.

A problem can be solved in more than one ways.

Hence, there is a need to analyze these proposed solutions and

implement the best suitable.

Efficiency of an algorithm can be analyzed at two different stages,

before implementation and after implementation:

A priori analysis (a.k.a theoretical analysis of an algorithm).

Efficiency of algorithm is measured by assuming that all other

factors e.g. processor speed, are constant and have no effect on

implementation.

A posterior analysis ( a.k.a empirical analysis of an algorithm).

Selected algorithm is implemented using programming language.
This is then executed on target computer machine. Actual statistics
like running time and space required, are collected.

In this course, we will be basically dealing with a priori analysis.

 Analyzing algorithms

Algorithm analysis deals with the execution or running time of various

operations involved.

Running time of an operation can be defined as no. of computer

instructions executed per operation.
 Algorithmic Complexity

Suppose X is an algorithm and n is the size of input data, the time and
space used by Algorithm X are the two main factors which decide the
efficiency of X.

Time Factor The time is measured by counting the number of key

operations such as comparisons in sorting algorithm.

Space Factor The space is measured by counting the maximum

memory space required by the algorithm.

The complexity of an algorithm f(n) gives the running time and/or

storage space required by algorithm in terms of n as the size of the

input data.

 Space Complexity

Space complexity of an algorithm represents the amount of

memory space required by the algorithm in its life cycle.

Space required by an algorithm is equal to the sum of the

following two components:

A fixed part that is a space required to store certain data and

variables, that are independent of the size of the problem. For
example, simple variables and constants used, program size etc.

A variable part is a space required by variables, whose size

depends on the size of the problem. For example, dynamic
memory allocation, recursion stack space etc.

Space complexity S(P) of any algorithm P is S(P) = C + S(I),

where C is the fixed part and S(I) is the variable part of the
algorithm which depends on instance characteristics I.
 Space Complexity

Example
Algorithm: SUM(A, B)
Step 1 - START
Step 2 - C A + B + 10
Step 3 - Stop

Here we have three variables A, B and C and one constant.

Hence, S(P) = 1+3.
Now, space depends on data types of given variables and
constant
types and it will be multiplied accordingly.
 Time Complexity

Time complexity of an algorithm represents the amount of time

required by the algorithm to run to completion.

Time requirements can be defined as a numerical function T(n),

where T(n) can be measured as the number of steps, provided
each step consumes a constant time.

For example, addition of two n-bit integers takes n steps.

Consequently, the total computational time is T(n) = c*n, where

c is the time taken for addition of two bits.

Here, we observe that T(n) grows linearly as input size increases.

 Asymptotic Analysis

Asymptotic analysis of an algorithm refers to defining the

mathematical boundary/framing of its run-time performance.

Using asymptotic analysis, we can very well conclude the best

case, average case and worst case scenario of an algorithm.

Asymptotic analysis refers to computing the running time of any

operation in mathematical units of computation.

For example, running time of one operation is computed as f(n)

and may be for another operation it is computed as g(n 2).

In the above example, it means that the first operation running

time will increase linearly with the increase in n whereas the
running time of the second operation will increase in a quadratic
manner when n increases.

Similarly, the running time of both operations will nearly be the

same if n is significantly small.
 Asymptotic Analysis

Usually, time required by an algorithm falls under three types:

Best case Minimum time required for program execution.

Average case Average time required for program execution.

Worst case Maximum time required for program execution.

 Asymptotic Notations

Following are commonly used asymptotic notations used in

calculating running time complexity of an algorithm.

(Big Oh) Notation

(Omega) Notation

(Theta) Notation

 Asymptotic Notations

(Big Oh) Notation

The O(n) is the formal way to express the upper bound of an

algorithms running time.

It measures the worst case time complexity or longest amount

of time an algorithm can possibly take to complete.

For example, for a function f(n)

(f(n)) = { g(n) : there exists c > 0 and k such that g(n) c.f(n) for all n > k. }
 Asymptotic Notations

Omega Notation,

The (n) is the formal way to express the lower bound of an

algorithms running time.

It measures the best case time complexity or best amount

of time an algorithm can possibly take to complete.

For example, for a function f(n)

(f(n)) { g(n) : there exists c > 0 and k such that g(n) c.f(n) for all n > k. }
 Asymptotic Notations

Theta Notation,

The (n) is the formal way to express both the lower and upper
bound of an algorithms running time.

It is represented as follows:

For example, for a function f(n)

(f(n)) = { g(n) if and only if g(n) = (f(n)) and g(n) = (f(n)) for all n > k. }
Common Asymptotic Notations
constant

O(1)

logarithmic O(logn)

linear O(n)

n log n O( n log n)

quadratic O(n2)

cubic O(n3)

polynomial nO(1)

exponential 2O(n)
Data Structures Basic Concepts

Data Structure is a way to organize data in such a way that it can
be used efficiently.

Data Definition

A particular data can be defined with the following characteristics:

Atomic Definition defines a single concept.

Traceable Definition should be able to map to some data
element.

Accurate Definition should be ambiguous.

Clear and Concise Definition should be understandable.
Data Structures Basic Concepts

Data Object represents an object having a data.

Data Type

Data type is a way to classify various types of data such as

integer, string etc. which determines:

The values that can be used with the corresponding type of data

The type of operations that can be performed on the
corresponding type of data.

Data are of two types:

Built-in data type

Derived data type
Data Structures Basic Concepts

Built-in Data Type

Those data types for which a language has built-in support. For
example, most of the language provides the following built-in data
types:

Integers

Boolean(true, false)

Floating(Decimal numbers)

Characters and Strings
Data Structures Basic Concepts

Derived Data Type

These are implementation independent as they can be
implemented in one way or the other. These data types are
normally built by a combination of primary or built-in data types
and associated operations on them. For example,

List

Array

Stack

Queue
Data Structures Basic Concepts

Basic Operations
The data in the data structures are processed by certain
operations. The choice of a particular data structure largely
depends on the frequency of the operation that needs to be
performed on the data structure:

Traversing

Searching

Insertion

Deletion

Sorting

Merging
 Next Lecture

Abstract Data Types