Publication Tech Interview YouTube Say Hello

Publication

Popular Tags

AfterAcademy Tech

What is the degree of relation in DBMS?

In this blog, we will learn about the degree of relationship in DBMS. We will also see what are its types depending upon various degree possible and discuss what is the maximum and minimum degree possible in relation.

30 Dec 2019

AfterAcademy Tech

Reverse a Linked List from position M to N

This is an interview problem asked in companies like Amazon, Facebook and Microsoft. The problem is to reverse a linked list from position m to n and print the reversed linked list.

27 Dec 2019

AfterAcademy Tech

Queue and its basic operations

Queue is a necessary addition in a programmer's toolkit. We will discuss the basic design structure of queue and what operations are performed on it. This blog also discusses the implementation of queue using arrays and linked lists

27 Dec 2019

AfterAcademy Tech

What are the different types of relationships in DBMS?

In this blog, we will study various types of relationships in DBMS which help in defining the association between various entities. Also, we will discuss the types of participation constraints which may exist between the relationship and the entity type.

27 Dec 2019

AfterAcademy Tech

Stack and its basic Operations

Stack is a very useful concept that a good programmer could use for their benefit. We will be discussing the basic design of stack and the operations that can be performed on it. We shall be also discussing the implementation of stack.

26 Dec 2019

AfterAcademy Tech

Differentiate between Weak and Strong entity

In this blog, we will see the difference between a strong and a weak entity. We will also see various terms which are used to describe a strong and weak entity with the help of in-depth examples.

26 Dec 2019

AfterAcademy Tech

Comparison of Sorting Algorithms

In this blog, we will analyze and compare different sorting algorithms on the basis of different parameters like Time Complexity, Inplace/Outplace, Stability, etc.

25 Dec 2019

AfterAcademy Tech

Flatten Binary Tree to Linked List

Given a binary tree, flatten it to a linked list in-place. After flattening, the left of each node should point to NULL and right should contain the next node in level order so that it resembles a singly linked list.

24 Dec 2019

AfterAcademy Tech

Analysis of Recursion in Programming

In this blog, we will analyze the recursive algorithm using Recurrence Tree Method, Master theorem. We will also discuss the advantages and disadvantages of recursion.

24 Dec 2019

AfterAcademy Tech

Sorted Array to Balanced BST

Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differs by more than one.

24 Dec 2019