Teach yourself Java module
COL106 (Sem I, 2015-16)
Chinmay Narayan and Prathmesh Kallurkar
July 29, 2015
The aim of this Java lab module is to kick-start students in programming Java
by introducing th
Case Study: Searching for Patterns
Problem: find all occurrences of pattern P
of length m inside the text T of length n.
Exact matching problem
1
String Matching - Applications
Text
editing
Term re
Graphs Definition
A graph G = (V,E) is composed of:
V: set of vertices
EVV: set of edges connecting the vertices
An edge e = (u,v) is a pair of vertices
(u,v) is ordered, if G is a directed graph
Priority Queues
Scheduling example
The priority queue ADT
Implementing a priority queue with a sequence
Binary Heaps
Insertion in a Heaps and Heapify
1
Scheduling
In a multi-user computer system, mult
Red-Black Trees
What are they?
Their relation to 2-4 trees
Deletion in red-black trees
Red-Black Trees
A red black tree is a binary search tree in which
each node is colored red or black.
The root
Shortest Path
Generalize distance to weighted setting
Digraph G = (V,E) with weight function W: E R
(assigning real values to edges)
Weight of path p = v1 v2 vk is
k1
w( p) w(vi , vi 1 )
i 1
Short
Insertion in red-black trees
a-b trees
What are they?
Insertion and deletion in a-b trees
Insertion in red-black trees
Let
k be the key being inserted
As in the case of a BST we first search for
k
Binary Heaps
Delete-min
Building
a heap in O(n) time
Heap Sort
1
Delete-min
The
minimum element is the one at the
top of the heap.
We can delete this and move one of its
children up to fill the s
COL 702, Tutorial Sheet 1
1. Solve the following recurrence equations given T (1) = O(1)
(a) T (n) = T (n/2) + bn log n
(b) T (n) = aT (n 1) + bnc
2. Show that the solution to the recurrence X(1) = 1
COL 702, Tutorial Sheet 2
1. Given a binary tree of N leaf nodes, show that the average distance from leaf nodes to the root node
is (log N ) for any binary tree.
Hint: Suppose the minimum tree has x
COL 702, Problem Sheet 3
1. Consider the following special case of UNION-FIND. There are three phases where in each phase
all the UNIONS precede the FIND. Can you design a more efficient implementatio
COL 702, Practice problems - not for submission
1. A coffee can contains some black beans and white beans. The following process is repeated as long as possible.
Randomly select two beans from the can
Name
COL 702 Advanced Data Structures and Algorithms
Minor 1, Sem I 2017-18, Max 40, Time 1 hr
Entry No.
Group
Note Write in the space provided below the question including back of the page.
Every alg
Name
COL 702 Advanced Data Structures and Algorithms
Minor 2, Sem I 2017-18, Max 40, Time 1 hr
Entry No.
Group
Note Write in the space provided below the question including back of the page.
Every alg
Created by EDGAR Online, Inc.
MYLAN N.V.
Table_Of_Contents
Form Type: 10-K
Period End: Dec 31, 2016
Date Filed: Mar 01, 2017
Table Of Contents
Table Of Contents
-TABLE1
TABLE2
TABLE3
TABLE4
TABLE5
TAB
RESULTS OF OPERATING PEOPLE EXPRESS AIRLINE
Complete (one per team) and upload to Canvas before H&SC class on
Managing Human Resources for Organizational Performance
Sept. 21 for T, Th teams (sections
To do list for next week
1. Study the concept of equity value, enterprise value and valuation multiple P/E and EV/ EBITDA
Understand following functions in excel- XIRR, data table
Summary (this in no
Work at McK
1. Pharma engagement
OBJ: Operational transformation program which aimed at improving the availability, quality and safety of their
manufacturing unit.
CONTRIBUTION: availability dimension
QUESTION 5
Assets
Cash
Account receivables
Inventories
Other current assets
Total current assets
Net fixed assets
Investments
Other non current assets
Total assets
Liabilities
Accounts payables
othe C
8/26/2017 Amazon.com - Online Return Center
All items must be sent by Sep 22, 2017. Tell us about your return experience.
Store Information:
Instructions will be emailed to you shortly. Store Informat
AVL-Trees
Balanced binary tree
The disadvantage of a binary search tree is
that its height can be as large as N-1
This means that the time needed to perform
insertion and deletion and many other
opera
Multi-Way Search Trees
(B Trees)
Multiway Search Trees
An m-way search tree is a tree in which, for
some integer m called the order of the tree,
each node has at most m children.
If n <= m is the numb
B+ Tree
What is a B+ Tree
A B+ tree is a balanced tree in which every path from
the root of the tree to a leaf is of the same length.
Each non-leaf node of the tree has between [n/2] and
[n] children,
Stack-Queues
Lecture 4
Different kinds of list
Commonly used variation of lists are:
Stack
Queue
Dequeue
Stack
A stack is a data structure that works like a
stack of items, such as pile of plates i
Data Structure
Lecture 3
Data Structure
Formally define Data structure as:
DS describes not only set of objects but the
ways
they are related,
the set of operations which may be applied to the
eleme
Graph - 1
Acknowledgement:
Material taken from Fundamentals of Data
Structures in C, Ellis Horowitz and Sartaj Sahni
1
Definition
A graph, G=(V, E), consists of two sets:
a finite set of vertices(V),
Graph - 2
Minimum Spanning Trees
1
Some Graph Operations
Traversal
Given G=(V,E) and vertex v, find all wV,
such that w connects v.
Depth First Search (DFS)
preorder tree traversal
Breadth First Sea
Balanced Binary Trees
Red-Black Trees
Red-Black Trees
What are they?
A redblack tree is a data structure which is a
type of self-balancing binary search tree.
Their relation to 2-4 trees (B-trees of