5 views

Uploaded by Souvik Paul

Use at your own risk

- Plain English explanation of Big O
- M.E Data Structures Lab
- QuickSort in C#
- Lightweight Invariants with Full Dependent Types
- 7 - 2 - Selection (708)
- Railway Route Optimization System Using Dijkstra Method
- C-Sorting
- Multi Pivot Paper Draft 2015-10-12
- Data Structure Material
- 7-sort
- computer practical
- Sorting Algorithm
- Sorting 32
- Amazon Placement Paoers
- lecture10.ppt
- H8-solution[www.alirezaweb.com].pdf
- DB2 Performance Roadmap Long
- Sync Sort
- Datastage Interview Qa
- 107352_Lec06b_QuicksortV2

You are on page 1of 5

Loop Invariant, time complexity, Runtime,

parameterise the runtime by size of the input.

2. Analysis of Insertion Sort Types of Analysis: Worst case, Best case and

Average case. Machine dependency, Asymptotic

Notation, Big-Theta.

omega, Time complexity of Insertion sort: Worst

case, best case, average case. Merge Sort.

4. Recurrence of Merge Sort Merge sort, run time of merge sort, recurrence,

Recursive tree.

method of induction.

aT(n/b) + f(n). Master method, Proof idea of

mater method.

search, powering a number.

Strassen's Algorithm.

technique, Straseen's idea, VLSI layout,

Embedding.

Liner time Partition subroutine, pivot element

11. Analysis of Quicksort. Pseudo code for Quicksort, worst case, best cast,

almost best case, good pivot, bad pivot.

12. Randomized Quicksort More analysis on Quicksort, problem with fixing

the position of the pivot element, choosing the

pivot element randomly, Randomised Quicksort,

Average case analysis, Expected runtime of

Randomized Quicksort.

complete binary tree Max-heap, heap operations,

Max-Hepify.

Build-Max-Heap, Heap Sort

15. Decision Tree How fast we can sort? worst case runtime of

Comparison based sorting algorithms, Decision

Tree model.

Sort, Stable sorting, linear time complexity of

counting sort.

17. Radix Sort & Bucket Sort Radix sort, digit-by-digit sort, Analysis of Radix

Sort, bucket sort, analysis of bucket sort.

18. Order Statistics Finding the i-th smallest element from a given n

numbers, minimum, maximum, median, Naive

approach, partition, select algorithm, analysis of

select algorithm, worst case runtime of select

runtime is linear, worst case runtime is O(n^2).

20. Worst case linear time order statistics Good pivot, generate the good pivot recursively,

SELECT algorithm, worst case runtime.

21. Hash Function Symbol table problem, Direct access table, Hash

function, collision, resolving collision by

chaining, analysis of chaining.

division method, multiplication method,

resolving collision by open addressing, example

of open addressing, linear probing, double

probing.

weakness of hashing, Random choice of hash

function, Universal hashing, Universality is

good.

24. Perfect Hashing Construction a set of universal hash functions,

perfect hashing, static hash table, Analysis of

perfect hashing.

25. Binary Search Tree (BST) Sort Binary search tree (BST), build BST, inoder-

tree-walk, BST sort, runtime of BST sort,

relationship between BST sort and Quick Sort

26. Randomly build BST Randomised BST sort, randomly build BST,

expected height of a randomly build BST

27. Red Black Tree Balanced binary search tree, Red Black Tree,

Black height, red black tree is balanced.

28. Red Black Tree (Cont...) Modifying operation, re-coloring, rotations, red

black tree insertion.

Statistics, OS-Select

interval search, interval tree.

with size u, Insert, Delete, Successor, array, bit

vector, O(log log u).

32. Van Emde Boas data structure Fixed-universe success problem, bit vector, one-

dimensional array, two dimensional array,

augmenting the data structure, non-empty bits,

more augmentations, maximum bits and

minimum bits.

33. Amortized analysis How large should a hash table be? Dynamic

table, overflow, worst case analysis, tighter

analysis, amortized analysis.

geometric objects, basic structures, orthogonal

range search, 1D range tree.

35. Computational Geometry (cont....) 1D range query, split node, 2D range tree, 2D

range query, line segment intersections, sweep

lines.

simplification, length of the longest common

subsequence, hallmarks of dynamic

programming, optimal substructure, overlapping

sub problems.

37. Longest common subsequence Recursive algorithms for length of the longest

common subsequence, memoization algorithm,

dynamic programming algorithm.

adjacency matrix, adjacency list, minimum

spanning tree, optimal substructure.

Prim's algorithms, example of prim's algorithms.

application of graph search, rubix cube, god

number, breath-first-search (BFS).

BFS, O(V+E), shortest path, depth-first-search

(DFS), exploring until stuck, back tracking,

recursively explore, DFS, classification of edges:

tree edge, forward edge, back edge and cross

edge. Cycle detection.

42. Shortest path problem Path in a graph, shortest path, weight of shortest

path, existence of shortest path, negative weight

cycle, optimal substructure, triangular inequality.

idea of Dijktra's, No negative cycle, pseudo code

of Dijktra's, time complexity of Dijktra's.

algorithms, correctness of Dijktra's algorithm.

can handle negative cycle, time complexity of

Bellman-Ford, example of Bellman-Ford.

negative weight cycle then Bellman Ford gives

the shortest path weights.

constraints, constraints graph, unstatisfiable

constraints, negative weight cycle, statisfiable

constraints.

48. All pairs shortest path All pairs shortest paths, adjacency matrix,

Bellman Ford, O(n^4), dynamic programming.

49. Floyd-Warshall Dynamic programming, matrix multiplication,

O(n^3 log n), Floyd Warshall, O(n^3).

reweighting, dijktra's, johnson's Algorithm

accounting analysis of dynamic table.

53. Disjoint set data structure Dynamic collection of pair wise disjoint sets,

MAKE-SET, UNION, FIND_SET.

54. Find-Union

Coin flipping.

- Plain English explanation of Big OUploaded byshankshera
- M.E Data Structures LabUploaded bysam4ets
- QuickSort in C#Uploaded byCrom Mik
- Lightweight Invariants with Full Dependent TypesUploaded byEdwin Brady
- 7 - 2 - Selection (708)Uploaded byeshwaar1
- Railway Route Optimization System Using Dijkstra MethodUploaded byEditor IJRITCC
- C-SortingUploaded bySuv Ultimatum
- Multi Pivot Paper Draft 2015-10-12Uploaded byvivek upadhyay
- Data Structure MaterialUploaded bygani525
- 7-sortUploaded byJitendra Singh Rauthan
- computer practicalUploaded bysachinprasad
- Sorting AlgorithmUploaded byAijin
- Sorting 32Uploaded bydmybook
- Amazon Placement PaoersUploaded bynaninanyesh
- lecture10.pptUploaded byAnonymous niE5VQOH
- H8-solution[www.alirezaweb.com].pdfUploaded byVahid Esmaeilzadeh
- DB2 Performance Roadmap LongUploaded byTiago Feitor
- Sync SortUploaded byApurva Kapoor
- Datastage Interview QaUploaded byRam Sita
- 107352_Lec06b_QuicksortV2Uploaded byvignesvaran
- CSE680-07QuickSort(1)Uploaded byGaspar dela Rosa Jr.
- DSA naveen as_1Uploaded byMarsha Wong
- lecture26.pptUploaded byAnonymous niE5VQOH
- Chap3 Query ProcessingUploaded bysammy21791
- Bubble sort presentationUploaded byMuhammed Ifkaz
- MergeUploaded bymydummymail
- Elementary AlgorithmsUploaded byAbel Varghese David
- prac_quiz1sol.pdfUploaded byporkerria
- B108 PI MechanicsUploaded byanand
- lecture3.pdfUploaded byblackhatson13

- Startup Roadmap 3Uploaded bySouvik Paul
- Upto MidsemUploaded bySouvik Paul
- question paperUploaded bySouvik Paul
- Petroleum Fraction at Ion OverviewUploaded byphobos2000
- Ref.txtUploaded bySouvik Paul
- Notes Fuel GasesUploaded bySouvik Paul
- Commision IngUploaded bySouvik Paul
- SolutionUploaded bySouvik Paul
- Chapter7_ControlLoop.pdfUploaded byrkprasad
- 0wtHJHUploaded bySouvik Paul
- Seagate InvoiceUploaded bySouvik Paul
- quiz1Uploaded bySouvik Paul
- QQ_2136069552.txtUploaded bySouvik Paul
- Foe EndsemUploaded bySouvik Paul
- MIP Thickener Design-02.pdfUploaded bysheizareh
- MIT2_017JF09_p13Uploaded bySouvik Paul
- Shell&Tube Exchanger DesignUploaded byabhmars
- YesUploaded bySouvik Paul
- FINAL McCabe-Thiele Paper for Nonideal ASEE FORMATUploaded byKatherine Stela Rucabado Llatas
- Review Unit SystemsUploaded byeterbee
- Design 1 AnalysisUploaded bySouvik Paul
- Contexts.txtUploaded bySouvik Paul
- ASSIGNMENT 3.pdfUploaded bySouvik Paul
- Prediction of the Liquid Viscosity for Petroleum FractionsUploaded bySouvik Paul
- Mean Metal TempsUploaded bySouvik Paul
- UG_SCHOLARSHIPS.pdfUploaded bySouvik Paul
- AnnexureIUploaded byBhanu Tej
- PED Assignment II_Group GUploaded bySouvik Paul

- SchwiegelshohnUploaded bysfofoby
- Design of a genetic algorithm for a NP-hard optimisation problemUploaded byMatthew Sparkes
- L01Uploaded byRonak Chaudhary
- Improved PrefixSpan Algorithm for Efficient Processing of Large DataUploaded byEditor IJRITCC
- Keep up with the trends (Excel)Uploaded bySpider Financial
- LOGIC Advanced 1994Uploaded bynaksap
- preskill_1_to_6(LectureNote).pdfUploaded byIvan Cheung
- Time complexityUploaded byAshly
- Art of Programming Contest SE for UvaUploaded bymarcelozeballos96
- Software Engineering Solved McqsUploaded byshilpareddy888
- An Efficient Construction of Itinerary Planning for Multi-UsersUploaded byijtetjournal
- Algorithms and Data StructuresUploaded by程国强
- MIT6870_ORSU_lecture2: overview on object recognition and one practical exampleUploaded byzukun
- NPcompleteUploaded bypoja_sinha
- Chpt7Uploaded byThemine Daha
- Algorithm DesignUploaded byMaria Simonetti
- interview.docxUploaded byMukeshVerma
- Google Interview QuestionsUploaded byradz143
- Analysis of Heap OperationsUploaded bySohaib Azam
- notes.pdfUploaded bykr d
- String KernelsUploaded bySrirangam Ramaraj
- Encoding constants in Watermarking graphUploaded byjyothimonc
- DSA Book.pdfUploaded bySathish kumar
- MIT203.pdf for MSc ITUploaded byManish Kumar
- Data StrutcterUploaded byharas10
- teorema Rado-EdmondsUploaded byalthea181
- lecture28.pptUploaded bySonia Jaguaco
- Time ComplexityUploaded byAvi Singh
- Introduction to Algorithms: A Creative ApproachUploaded byanimesh_ccna
- prac_quiz1sol.pdfUploaded byporkerria