This note covers the following topics: Computational Models,
Complexity measures, Power increasing resourses, Basic relatton
amomg the models and measures, Reducibility, completeness and
closure under reductions, Deterministics and nondeterministics
logarithmic space, Deterministics polynomial time, Polynomial
Hierarchy and Polynomial space.
This note covers the following topics: Design and
analysis of algorithms, Growth of Functions, Recurrences, Solution
of Recurrences by substitution, Recursion tree method, Master
Method, Worst case analysis of merge sort, quick sort and binary
search, Design and analysis of Divide and Conquer Algorithms, Heaps
and Heap sort, Priority Queue, Lower Bounds for Sorting, Dynamic
Programming algorithms, Matrix Chain Multiplication, Elements of
Dynamic Programming, Longest Common Subsequence, Greedy Algorithms,
Activity Selection Problem, Elements of Greedy Strategy, Fractional
Knapsack Problem, Huffman Codes, Graph Algorithm - BFS and DFS,
Minimum Spanning Trees, Kruskal algorithm, Prim's Algorithm, Fourier
transforms and Rabin-Karp Algorithm.
This note will cover
classic and modern algorithmic ideas that are central to many areas of Computer
Science. The focus is on most powerful paradigms and techniques of how to design
algorithms, and measure their efficiency. The topics will include hashing,
sketching, dimension reduction, linear programming, spectral graph theory,
gradient descent, multiplicative weights, compressed sensing, and others.
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.
The material of this book is aimed at advanced
undergraduate information (or computer) science students,
postgraduate library science students, and research workers in the
field of IR. Some of the chapters, particular chapter 6, make simple
use of a little advanced mathematics.