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.
Single Linked List vs Doubly Linked List
Both Singly linked list and Doubly linked list are the implementation of Linked list in which every element of singly-linked list contains some data and a link to the next element, which allows to keep the structure. On the other hand, every node in a doubly-linked list also contains a link to the previous node.
Posted September 12, 2022 by Rohith and Anusha ‐ 2 min read
⌖ quick-references blog single-linked-list doubly-linked-list differences
Binary Search Tree vs Avl Tree
The binary search tree is a tree data structure that follows the condition of the binary tree. As we know, that tree can have 'n' number of children, whereas; the binary tree can contain the utmost two children. An AVL tree is a self-balancing binary search tree where the difference between heights of left and right subtrees cannot be more than one.
Posted September 12, 2022 by Rohith and Anusha ‐ 3 min read
⌖ quick-references blog binary-search-tree avl-tree differences
Red Black Tree vs Avl Tree
An AVL tree is a self-balancing binary search tree where the difference between heights of left and right subtrees cannot be more than one. A Red Black Tree is a category of the self-balancing binary search tree.
Delete vs Drop
Delete is a Data Manipulation Language command, DML command and is used to remove tuples/records from a relation/table. Whereas Drop is a Data Definition Language, DDL command and is used to remove named elements of schema like relations/table, constraints or entire schema.
Linear Search vs Binary Search
Linear search is a search that finds an element in the list by searching the element sequentially until the element is found in the list. On the other hand, a binary search is a search that finds the middle element in the list recursively until the middle element is matched with a searched element.
Posted September 12, 2022 by Rohith and Anusha ‐ 2 min read
⌖ quick-references blog linear-search binary-search differences