AfterAcademy Tech
In this blog, we will learn about data abstraction and how it achieved using its three levels. We will learn the working of all the three levels of data abstraction.
12 Dec 2019
Using recursion, certain problems can be solved quite easily. Several algorithms design techniques and data structures are based on recursive thinking.
Given a Binary Search Tree, find the Kth Largest element in the given tree.
In this blog, we will learn about various data models present in DBMS. We will also learn about various types of data models present along with advantages and disadvantages of each model.
Given a binary tree, invert the binary tree and return it. An inverted form of a Binary Tree is another Binary Tree with left and right children of all non-leaf nodes interchanged. You may also call it the mirror of the input tree.
In this blog, we will learn what is RDBMS and how it is different from DBMS. People often use these words intechangeably. But there is a difference between these two terms. So, let's learn how.
Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.
Given an array say A having n elements, the task is to sort the array in wavy manner. In wavy manner the array is in the form where A[0] >= A[1] <= A[2] >= A[3] <= A[4] >= …..
In this blog, we are going to learn what is activation function and it's types. We will also learn what is a good Activation function and when to use which Activation function in Neural Network.
In this blog, we will learn what is DBMS and a traditional file system. We will also dive deep and understand the problems of the file system and get to know how DBMS resolved these problems.
