Matching Theory
Matching:
Let G = (V , E ) be a simple graph. A subset M of E is called a
matching in G if no pair of edges e1 and e2 of M share a
common vertex.
M E is called a matching in G if, for
Lecture 1: Overview
BT 3051 Data Structures and Algorithms for Biology
Karthik Raman
Department of Biotechnology
Indian Institute of Technology Madras
August 2, 2016
Overview
What is an algorithm?
Cou
BT 3051 Data Structures and Algorithms for Biology
JulNov 2016
Assignment 1
16th August 2016
Due date: 23rd August, 2016 @ 17:00
Maximum marks: 20
Instructions: Write Python codes to solve the problem
BT 3051 Data Structures and Algorithms for Biology
JulNov 2016
Assignment 2: Object-oriented Programming
14th September 2016
Due date: 21st September, 2016 @ 17:00
Maximum marks: 50
Instructions: Writ
BT 3051 Data Structures and Algorithms for Biology
JulNov 2016
Self-assessment Exercises
Karthik Raman
Department of Biotechnology
Indian Institute of Technology Madras
Last updated: September 2, 2016
3.3. Asymptotic Analysis
3.3
123
Asymptotic Analysis
In algorithm analysis, we focus on the growth rate of the running time as a function
of the input size n, taking a big-picture approach. For exampl
CSE 5311 Homework 5 Solution
Problem 25.1-3
What does the matrix
L(0)
0
0
= 0
.
.
.
.
.
.
.
.
0
.
.
.
.
.
.
used in the shortest-paths algorithms correspond to in regular matrix multiplication?
CHAPTER 25
All-Pairs Shortest Paths
April 2015
25.2 The Floyd-Warshall algorithm
We will use a different dynamic-programming formulation
to solve the all-pairs shortest-paths problem on a directed
gra
Monte Carlo Simulation and Resampling
Tom Carsey (Instructor)
Jeff Harden (TA)
ICPSR Summer Course
Summer, 2011
Monte Carlo Simulation and Resampling
1/68
Resampling
Resampling methods share many sim
Lecture 2: Introduction to Algorithms
BT 3051 Data Structures and Algorithms for Biology
Karthik Raman
Department of Biotechnology
Indian Institute of Technology Madras
August 3, 2016
Introduction
Exa
BT 3051 Data Structures and Algorithms for Biology
JulNov 2016
Assignment 0
9th August 2016
Due date: 12th August, 2016 @ 17:00
Maximum marks: 15
Instructions: Write Python codes to solve the problems
Lecture 6: Introduction to Data Structures
BT 3051 Data Structures and Algorithms for Biology
Karthik Raman
Department of Biotechnology
Indian Institute of Technology Madras
August 16, 2016
Introducti
Lecture 10: Elementary Sorts
BT 3051 Data Structures and Algorithms for Biology
Karthik Raman
Department of Biotechnology
Indian Institute of Technology Madras
August 30, 2016
Introduction
Elementary
Lecture 7: Basics of Data Structures
BT 3051 Data Structures and Algorithms for Biology
Karthik Raman
Department of Biotechnology
Indian Institute of Technology Madras
August 17, 2016
Introduction
Arr
Lecture 12: Insertion, Faster Sorts
BT 3051 Data Structures and Algorithms for Biology
Karthik Raman
Department of Biotechnology
Indian Institute of Technology Madras
September 6, 2016
Insertion Sort
Lecture 4: Analysis of Algorithms
BT 3051 Data Structures and Algorithms for Biology
Karthik Raman
Department of Biotechnology
Indian Institute of Technology Madras
August 8, 2016
Introduction
Analysi
Lecture 0: Administrivia/Introduction
BT 3051 Data Structures and Algorithms for Biology
Karthik Raman
Department of Biotechnology
Indian Institute of Technology Madras
August 1, 2016
Administrivia
Lo
Lecture 08: Basic Data Structures
BT 3051 Data Structures and Algorithms for Biology
Karthik Raman
Department of Biotechnology
Indian Institute of Technology Madras
August 22, 2016
Stacks
Queue
Stacks
Lecture 09: More Data Structures
BT 3051 Data Structures and Algorithms for Biology
Karthik Raman
Department of Biotechnology
Indian Institute of Technology Madras
August 29, 2016
Queue
Linked Lists
T
Lecture 3: Basics: Introduction to Python
BT 3051 Data Structures and Algorithms for Biology
Karthik Raman
Department of Biotechnology
Indian Institute of Technology Madras
August 4, 2016
Why Python?
Introduction
Asymptotic Notations
What is a fast algorithm?
Consider the following problems:
1. Genome Assembly Problem. Find the shortest common
super-string of a set of sequences (reads): given stri
CHAPTER 23
Minimum Spanning Trees
Dec 2015
In the design of electronic circuitry, it is often necessary to
make the pins of several components electrically equivalent by
wiring them together. To inter
Tutorial #7
CS2800: Design and Analysis of Algorithms
Hasit Bhatt & John Augustine
Due on: March 4, 2017 (start of class)
1. Consider the following graph.
(a) What is the cost of its minimum spanning
( CS2800 Tutorial 5)
John Augustine ,
Dept. of Computer Sci. & Engg.,
IIT Madras.
March 13, 2017
1. Perform depth-first search on each of the following graphs; whenever there is a choice of vertices,
Tutorial #8
CS2800: Design and Analysis of Algorithms
Hasit Bhatt & John Augustine
Due on: March 10, 2017 (start of class)
Solutions to all problems in the given tutorial should be divided into the fo
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Department of Mathematics, IIT Madras
MA2040 - Probability, Statistics and Stochastic Processes
January - May 2017
Problem Set I
Solutions to PART I
1. = cfw_1, 2, 3, 4, 5, 6. Let us denote P (cfw_i)
BT 3051 Data Structures and Algorithms for Biology
JulNov 2016
Assignment 3: Parsing and Regular Expressions
31st October 2016
Due date: 7th November, 2016 @ 17:00
Maximum marks: 25
Instructions: Writ
#BT3051 Assignment 3
#Roll number: BE14B020
#Collaborators: BE14B035, BE14B033
Regular Expression
Can be generated
Cant be
generated
Description
a)
'<(.)(.)(.).\3\2\1>' (dictionary)
rotator, reviver
r
BT 3051 Data Structures and Algorithms for Biology
JulNov 2016
Course Plan
Karthik Raman
Department of Biotechnology
Indian Institute of Technology Madras
Lectures
Lectures:
Labs:
Venue:
E-mail:
Oce:
Tutorial 2 (CS2800): Algorithms on Numbers in the
Maths Notebook Model
John Augustine, Dept. of Computer Sci. & Engg., IIT Madras.
Friday, Jan 20, 2017
1.
Solution:
a b (mod N)
for some integer k,
a