This note covers the following topics:
Algorithms and Data Structures, Introduction to Java, Software Development,
Writing Classes, Writing Classes in Java, Unit Testing, Building Large Java
Applications, Inheritance and Polymorphism, Interfaces, A Math Review, Algorithm
Analysis, Data Types versus Data Structures, Collections, Stacks ,Queues, Lists,
Recursion, Sorting, Trees, Oriented Trees, Ordered Trees, Binary Trees, Sets and
Dictionaries, Search Trees, Binary Search Trees, Red-Black Trees.
covers the following topics: Algorithm Analysis, algorithmic patterns, Standard
I/O and iostream, Foundational Data Structures and Basic Abstract Data Types,
Linked-list, Stacks and Queues, PA1 walkthrough, Pointer, Hashing, Recursion and
Recurrence Relations, Trees, Binary Search Trees, Range and Multidimensional
Searches, Heaps, Tries, Balanced Search Trees, Binary-tree Representations of
The field of approximation algorithms has
developed in response to the difficulty in solving a good many optimization
problems exactly. This note will present general techniques that underly these
This note covers the following
topics: Self adjusting data structures, amortized analysis, self adjusting
lists, Splay trees, their performance and related conjectures, Hashing, FKS
perfect hashing, Cuckoo hasing, dynamic perfect hashing, Fusion Trees, Fully
dynamic connectivity in polylogarithmic time, Dynamic all pairs shortest paths,
Linear time construction of Suffix trees and arrays, Succinct Data Structures,
External memory data structures, Geometric data structures, Top trees,
Retroactive data structures, Online optimal structure for planar point
This note explains the
following topics related to Algorithm Analysis and Design:
Introduction to Design and analysis of algorithms, Growth of
Functions, Recurrences, Solution of Recurrences by
substitution,Recursion tree method, Master Method, Design and
analysis of Divide and Conquer Algorithms, Worst case analysis of
merge sort, quick sort and binary search, Heaps and Heap sort,
Priority Queue, Lower Bounds for Sorting.
Author(s): Mr. S.K.
Sathua, Dr. M.R. Kabat and Dr. R. Mohanty
note will examine various data structures for storing and accessing information
together with relationships between the items being stored, and algorithms for efficiently
finding solutions to various problems, both relative to the data structures and
queries and operations based on the relationships between the items stored.
Topics covered includes: Algorithm analysis, List, stacks and queues, Trees and
hierarchical orders, Ordered trees, Search trees, Priority queues, Sorting
algorithms, Hash functions and hash tables, Equivalence relations and disjoint
sets, Graph algorithms, Algorithm design and Theory of computation.
In computer science, an
algorithm is a self-contained step-by-step set of operations to be performed.
Topics covered includes: Algorithmic Primitives for Graphs, Greedy Algorithms,
Divide and Conquer, Dynamic Programming, Network Flow, NP and Computational
Intractability, PSPACE, Approximation Algorithms, Local Search, Randomized
note covers the following topics related to Algorithm Analysis and Design: Model
and Analysis, Warm up problems, Brute force and Greedy strategy, Dynamic
Programming, Searching, Multidimensional Searching and Geometric algorithms,
Fast Fourier Transform and Applictions, String matching and finger printing,
Graph Algorithms, NP Completeness and Approximation Algorithms.
This thesis presents efficient algorithms for internal and
external parallel sorting and remote data update. Topics covered includes: Internal Parallel
Sorting, External Parallel Sorting, The rsync algorithm, rsync
enhancements and optimizations and Further applications for rsync.