NAME TANIYA SEAL
MOBILE NUMBER
DATE OF BIRTH
EMAIL
RESIDENTIAL ADDRESS
DESIGNATION DEPARTMENT EDUCATIONAL QUALIFICATION TEACHING EXPERIENCE
State Aided College Teacher - II Computer Science
STUDY MATERIALS DESCRIPTION
DEPARTMENT NAME MODULE NAME TOPIC NAME YOUR PREVIOUS STUDY MATERIALS
Computer Science Hashing Hash Table CLICK HERE FOR VIEW
Computer Science Hashing Hash functions, Uniform hashing CLICK HERE FOR VIEW
Computer Science Hashing Universal hash functions CLICK HERE FOR VIEW
Computer Science Hashing Open addressing, Perfect Hashing CLICK HERE FOR VIEW
Computer Science Question set -1 Module 1(graph) and Module 2 (Divide and Conqure) CLICK HERE FOR VIEW
Computer Science Question set - 2 Module 3(Hashing) CLICK HERE FOR VIEW
Computer Science Algorithm Design Techniques Greedy Algorithm:Minimum Spanning tree CLICK HERE FOR VIEW
Computer Science Algorithm Design Techniques Greedy Algorithm:Activity Scheduling CLICK HERE FOR VIEW
Computer Science Algorithm Design Techniques Greedy Algorithm:Huffman Coding CLICK HERE FOR VIEW
Computer Science Algorithm Design Techniques Greedy Algorithm:Disjoint Set Data Structures CLICK HERE FOR VIEW
Computer Science Algorithm Design Techniques Greedy Algorithm: Amortized analysis CLICK HERE FOR VIEW
Computer Science Algorithm Design Techniques Dynamic Programming: Longest common subsequence problem CLICK HERE FOR VIEW
Computer Science Algorithm Design Techniques Dynamic Programming: Matrix Chain multiplication CLICK HERE FOR VIEW
Computer Science Algorithm Design Techniques Dynamic Programming:All pair shortest path CLICK HERE FOR VIEW
Computer Science Algorithm Design Techniques Dynamic Programming:Knapsack problem CLICK HERE FOR VIEW
Computer Science Algorithm Design Techniques Dynamic Programming:Optimal binary search tree CLICK HERE FOR VIEW
Computer Science NP Completeness and related topics NP Completeness: Informal concepts of deterministic and nondeterministic algorithms CLICK HERE FOR VIEW
Computer Science NP Completeness and related topics P and NP, NP-completeness and reducibility, statement of Cook’s theorem CLICK HERE FOR VIEW
Computer Science NP Completeness and related topics Some standard NP-complete problems- Clique, Travelling salesman problem, Vertex cover, Hamiltonian Cycle, 3-coloring problem. CLICK HERE FOR VIEW
Computer Science NP Completeness and related topics Backtracking, Branch and Bound:Graph coloring CLICK HERE FOR VIEW
Computer Science NP Completeness and related topics Backtracking, Branch and Bound:8 queens CLICK HERE FOR VIEW
Computer Science NP Completeness and related topics Backtracking, Branch and Bound:Knapsac CLICK HERE FOR VIEW
Computer Science Network flow and Matching Algorithms Maximum flow problem and the Ford Fulkerson Algorithm, Maximum flows and minimum cuts CLICK HERE FOR VIEW
Computer Science Network flow and Matching Algorithms Matching problem, Bipartite matching. CLICK HERE FOR VIEW