CS210: Data Structures and Algorithms
Final Exam
Date: November 27, 2013 9am-1pm
Max.Marks : 290
Closed Book/Notes
No Cell Phones
Instructions.
1. Please answer all parts of a question together. You may leave blank spaces if you wish to
return later to co

ESO211 (Data Structures and Algorithms)
Lectures 4 to 7
Shashank K Mehta
1
Abstract Data Types (ADTs)
Data forms provided by most languages such as integers, oating point numbers,
characters, booleans etc are the basic data-types. In most programs we may

ESO207: Assignment 3
Due on 27 August,2015
Note Every time you give an algorithm pseudo-code, please ensure that you give
sucient explanation so one can understand easily. Also give the proof of correctness
(show that it indeed computes the desired result

ESO207: Assignment2
Dur Date 19 Aug 2015
NOTE: Please submit the solution in the class. The solution should be a printout of a .pdf file.
Q.1. You are given a histogram consisting of n vertical bars each of unit width. Your aim is to
compute the axis-para

ESO207: Assignment 3
Due on 28 August,2015
Note Every time you give an algorithm pseudo-code, please ensure that you give
sucient explanation so one can understand easily. Also give the proof of correctness
(show that it indeed computes the desired result

ESO207: Assignment 4
Due on 5 October,2015
Note With pseudo-code give sucient explanation so one can understand easily.
Also give the proof of correctness (show that it indeed computes the desired result)
and provide the time complexity analysis (not just

ESO207: Assignment 5
Due on 16 October, 2015
Q1 You are located at the top-left corner (i.e., (1, 1)of an m n grid. You can
only move either down or right at any point in time. Some cells of the grid are given
to be blocked and you cannot enter such cells

ESO207: Assignment 6
Due on 4 November, 2015
Q1 Given a circle with origin as its center. Also given several arcs: (1 , 1 ], (2 , 2 ], . . .
where j-th arc starts at angular position j and moving anti-clockwise ends at the angular position j . Give a gree

RAIK 283
Data Structures & Algorithms
0-1 Knapsack problem
Dr. Ying Lu
ylu@cse.unl.edu
1
RAIK 283
Data Structures & Algorithms
Giving credit where credit is due:
Most of slides for this lecture are based on slides
created by Dr. David Luebke, University

ACA Summer School
Data Structures and Algorithms
Lecture 1
Vijay Keswani
IIT Kanpur
June 20, 2016
Prerequisites and Clarications
Complexity analysis
Outline
Order notation
Prerequisites and Clarications
Complexity analysis
Order notation
Basic Data Struct

Divide and Conquer
Trees
Binary Tree
Tree traversals
Binary Search Tree
Binary Heaps
ACA Summer School
Course: Data Structures and Algorithms
Lecture 2
Ashutosh Tiwari
ACA, IIT Kanpur
June 21, 2016
Ashutosh Tiwari
ACA Summer School Course: Data Structures

ESO207: Data Structures and Algorithms
Mid Semester Exam 1
Time: 120min.
Max. Marks: 120
Problem 1. For each of the problems listed below, (i) give a recurrence that describes its worst-case
running time, and, (ii) give its worst-case running time using n

Resmi N.G.
Reference:
Data Structures and Algorithms:
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman
Syllabus
Module I (11 hours)
Review of Data Types - Scalar Types - Primitive types - Enumerated types - Subranges - Arrays- sparse
matrices - represen

Mid Semester Test, 16 September 2015
ESO207: Data Structures and Algorithms
Time 120 minutes
Max Marks 50
Please clearly mark the question number and put a horizontal line after each answer. You may use any
result proven in the class without proving again

ESO211 (Data Structures and Algorithms)
Lectures 4 to 7
Shashank K Mehta
1
Abstract Data Types (ADTs)
Data forms provided by most languages such as integers, floating point numbers,
characters, booleans etc are the basic data-types. In most programs we ma

ESO207 (Data Structures and Algorithms)
Lectures 1 to 3
Shashank K Mehta
1
Random Access Machine
The computers of today can be simplied into the following model. These have
a control unit, a memory where locations have address 0 to N, and a data-path
wher

ESO211 (Data Structures and Algorithms)
Lectures 17 to 21
Shashank K Mehta
1
Heap Data Stucture
A max-heap is a combination of two structures: (i) It is an almost-complete
binary tree and (ii) also a sequence/list such that any node preceeds its childrnod

ESO211 (Data Structures and Algorithms) Lectures 25 to 29
Shashank K Mehta
1
Divide and Conquer Paradigm
This is a very general approach to solve a computing problem. Given a problem instance with size
parameter n. The devide and conquer approach involves

ESO207A
Assignment 1 Solutions
September 2, 2015
Solution. 1.1
1. Proving that the time complexity of an algorithm is O(n2 ) if and only if it is O(n2 + 109 n) is equivalent
to proving the following two statements, where T (n) is the time complexity of th

CS210: Data Structures and Algorithms
Notes 6
1
12 Aug 2013
Strassens Algorithm
Multiplying Square Matrices
Let A = (aij ) and B = (bij ) be n n square matrices. The product C = A B is defined as an
n n matrix C = (cij ), where, the entry cij is defined a

1
CS210: Data Structures and Algorithms
July-Nov 2013
Notes 4
Recursion-tree
Recursion Tree Method
The substitution method that we have seen above is good for proving the correctness of a solution.
But it requires that we have a good guess of the form of

CS210: Data Structures and Algorithms
Notes 3
1
July-Nov 2013
Recurrence Equations: Substitution Method
Recurrence Equations
Recurrence equations show up very often in the analysis of algorithms. This is because recursion
is a very popular design tool for

CS210: Data Structures and Algorithms
Notes 5
1
9 Aug 2013
Recurrence Master-theorem
Recurrence Master Theorem
The master method gives a recipe for solving recurrences of the form
T (n) = aT (n/b) + f (n)
where, a 1 and b > 1 and f (n) is an asymptoticall

ESO207: Data Structures and Algorithms
Mid Semester Exam 1
Time: 120min.
Max. Marks: 120
Problem 1. For each of the problems listed below, (i) give a recurrence that describes its worst-case
running time, and, (ii) give its worst-case running time using n

ESO207 (Data Structures and Algorithms)
Lectures 1 to 3
Shashank K Mehta
1
Random Access Machine
The computers of today can be simplified into the following model. These have
a control unit, a memory where locations have address 0 to N, and a data-path
wh

ESO207: Data Structures and Algorithms
Time: 4 hrs.
End Semester Exam Solutions
Maximum Marks: 250
Instructions.
a. There are 6 questions, each carrying 50 marks. You may answer any 5 questions. The first two questions
have parts with different problems.

ESO211 (Data Structures and Algorithms)
Lectures 33-34
Shashank K Mehta
1
Some denitions about graphs
Denition 1 An undirected graph is (V, E) where the elements of set V are
called vertices and E is a collection of some vertex 2-sets (sets containing two

ESO207: Programming Assignment 1
Due on 6 Sept, 2015. To be submitted online.
Problem In this assignment you are required to implement k-way
Merge Sort algorithm.
In this version partition the input sequence of integers into k almost
equal (may dier by at