*** Expert in online exams *** Expert in solving Exercises ***
*** Expert in Set, Functions, Logics, Relations, Graphs***
Dear sir,
We are a team of 10 people including me responsible for computer science and mathematics-related projects.
I have completed my B.Sc.(Engg.) and [login to view URL](Engg.) in Computer Science and Engineering. In engineering, I studied the topics you mentioned from the courses "Discrete Mathematics" and "Algorithms".
I learnt in Graph:
[login to view URL] and types of graphs.
[login to view URL] graphs, complete bipartite graphs.
[login to view URL] of graphs.
7.Isomorphism.
[login to view URL], connected components.
[login to view URL] and Hamilton paths.
[login to view URL] algorithms: Dijkstra's algorithm etc.
[login to view URL] colouring.
[login to view URL] of Tree: pre, post and In-order.
[login to view URL] trees: BST, AVL, BT, N-ary Tree etc.
[login to view URL] algorithms: DFS, BFS.
[login to view URL] tree and algorithms: Kruskal, Prim etc.
I learnt in Logics, Functions, Relations and Sets:
[login to view URL] logic.
[login to view URL] Equivalence.
[login to view URL], Qualifiers and nested qualifiers.
[login to view URL] of inference.
[login to view URL] Forms.
[login to view URL] and proof techniques.
[login to view URL] Functions.
[login to view URL] of function.
[login to view URL], Surgective and Bijective Functions.
[login to view URL], Symmetric, Transitive, N-ary Relations.
[login to view URL] Relations: Matrix and directed graph.
[login to view URL] of relations.
[login to view URL] Relations.
[login to view URL] ordering.
[login to view URL] and set operations.
I can start now. Let's talk and get started!
Best regards,
Md. Mridha.