Dr. Anusha
Creator of whiletrue.live.
Treated more than 2000 patients as dentist.
Interested in dentistry, software development and computational biology.
About Me
As a dentist with 4 years of clinical experience, I have developed a keen interest in the intersection of healthcare and technology, particularly in the field of software development. With my passion for both dentistry and software, I am excited to explore new ways of improving patient care through innovative technological solutions. I am currently pursuing master’s in Bioinformatics, where I am gaining expertise in the intersection of biology and software. In addition to my work as a dentist, I have written several blogs on various dental problems and software. I am excited to continue exploring the field of Bioinformatics and applying my knowledge to advance healthcare through technology.
Software Development
As a dentist-turned-software developer, I bring a unique perspective to the field of healthcare technology. With experience in both clinical dentistry and software development, I am uniquely positioned to bridge the gap between these two fields. With a strong background in both clinical dentistry and programming, I am passionate about creating innovative software solutions that improve patient care and enhance the practice of dentistry. My expertise in languages such as Python, Java, and R, coupled with my studies in bioinformatics, has equipped me with the skills necessary to build robust and effective software systems. I am excited to continue exploring the limitless potential of technology in the healthcare industry.
Computational Biology (Bioinformatics)
In today’s era of big data and advanced technologies, computational methods have become increasingly essential to the field of biology. As a dentist with a passion for software development, I recognized the importance of these methods early on in my career. Pursuing an MS in Bioinformatics has allowed me to develop a deeper understanding of the power of computation in biological research. With a strong background in programming languages such as Python, Java, and R, I have developed a skill set that allows me to tackle complex biological problems with confidence. I am particularly interested in leveraging my expertise to contribute to the development of new therapies and technologies that improve patient outcomes. Whether it’s developing computational models to predict drug efficacy or analyzing genomic data to uncover new biomarkers, I am excited to continue exploring the possibilities of computational biology and make a meaningful impact in the field.
Dentistry
Started my career as a dental professional with vast knowledge of dental care and dental services. Motivated and bilingual licensed dentist with more than 4 years of experience in providing good and effective dental care to patients. I have treated more than 2000 patients while working as dentist.
Expertise in all areas of general dentistry combined with experience in effective business and staff management. Passionate in being updated with new advancements in dentistry and skilled in digital intraoral scanning and CEREC technology.
Exposed to various types of cases and good understanding on restorative dentistry, periodontics, oral surgery, prosthodontics and pediatrics.
Selection Sort vs Bubble Sort
The selection sort algorithm generally is the first sorting algorithm that is taught to us. Here in every iteration of the inner loop, the smallest element is replaced with the starting element in each loop. The bubble sort algorithm might look a little bit confusing when we first study it. But here is the easy explanation of it. Here swapping is carried on in two ways. In every iteration of the outer loop, the largest element is found and swapped with the last element in the loop.
Posted September 12, 2022 by Rohith and Anusha ‐ 1 min read
⌖ quick-references blog selection-sort bubble-sort differences
Quick Sort vs Merge Sort
Quick sort is a comparison based sorting algorithm that follows the divide and conquer technique to sort the arrays. In quick sort, we usually use a pivot (key) element to compare and interchange the position of the element based on some condition. Merge sort is a most important sorting techniques that work on the divide and conquer strategies. It is the most popular sorting techniques used to sort data that is externally available in a file.
BFS vs DFS
BFS i.e. Breadth-First Search, is a vertex-based technique for finding the shortest path in the graph. It uses a Queue data structure that follows first in first out. DFS i.e. Depth First Search, is an edge-based technique. It uses the Stack data structure and performs two stages, first visited vertices are pushed into the stack, and second if there are no vertices then visited vertices are popped.
Binary Tree vs B Tree
A binary tree is the special type of general tree. Unlike B-tree, in a binary tree a node can have at most two nodes. In a binary tree, there is a limitation on the degree of a node because the nodes in a binary tree can’t have more than two child node(or degree two). B-Tree is known as a self-balancing tree as its nodes are sorted in the inorder traversal. Unlike the binary trees, in B-tree, a node can have more than two children.
Data Type vs Data Structure
In general both data type and data structure seems to be the same thing as both deals with the nature and organizing of data but among two one describes the type and nature of data while other represents the collections in which that data can be stored.
Posted September 12, 2022 by Rohith and Anusha ‐ 2 min read
⌖ quick-references blog data-type data-structure differences