NAME |
TANIYA SEAL |
|
EMAIL |
taniyaseal@surendranathcollege.ac.in |
DESIGNATION |
DEPARTMENT |
State Aided College Teacher - II |
Computer Science |
EDUCATIONAL QUALIFICATION |
TEACHING EXPERIENCE |
-
B.Sc. (Physics Hons) from the University of Calcutta in 2013.
-
B.Tech. (Computer Science & Engineering) from the University of Calcutta in 2016.
-
M.Tech. (Computer Science & Engineering) from the University of Calcutta in 2018.
-
Ph.D. (Computer Science & Engineering) Registered from the University of Calcutta in 2019.
|
4+ years.( 2 years as State Aided College Teacher and 2 years as Guest Lecturer) |
|
AREA OF RESEARCH |
Natural Language Processing. |
AREA OF INTEREST |
Artificial Intelligence, Machine learning, Pattern recognition, Data mining, and Information retrieval. |
PUBLICATIONS |
[1] Seal, T. (2021). Finding Research Trends of Countries and Research Collaboration Opportunities in Computer Science Using Text Mining and Clustering Analysis. Journal of Scientific Research, 65(5), 336- 346.
[2] Seal, T. and Bandyopadhyay, S.K.(2018). Face Recognition by Machine Learning Approach. International Journal of Trend in Research and Development, 5(3), 507-523.
[3] Seal, T., Tomar, S.S. and Bandyopadhyay, S.K.(2018). Higher Dimensional Grammar for Detection of Various Objects. International Journal of Engineering Science and Computing, 6(8), 18272 - 18281.
[4] Seal, T. and Bandyopadhyay, S.K.(2018). An Implementation for Framework for Chemical Structure using Graph Grammar. Journal for Research, 12(3), 58-66.
[5] Sarkar, S., Seal, T. and Bandyopadhyay, S.K.(2016). Sentiment Analysis in objective view. Journal for Research, 2(2), 26-29. |
SEMINAR & SYMPOSIA |
-
Participated in National Conference On Science & Technology : Rural Development, organized by ISCA, Kolkata Chapter & Surendranath College, Kolkata, from 20th to 21st January, 2020.
-
Participated in Motivational Webnar entitled mastering your mind, organized by IQAC, Surendranath College, on 21st June, 2021.
|
RESEARCH ACTIVITIES |
UG Dissertation Topic
PG Dissertation Topic
Doctoral Research Area
|
ACHIEVEMENTS |
|
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 |
|
|