Publication Tech Interview YouTube Say Hello

Publication

Popular Tags

AfterAcademy Tech

What is Pattern matching in SQL and how it is done?

In this blog, we will see what is pattern matching in SQL. We will also learn to perform pattern matching with examples.

22 Apr 2020

AfterAcademy Tech

What are Paging and Segmentation?

In this blog, we will learn about two non-contiguous memory allocation technique i.e. paging and segmentation. We will also learn how the logical address is converted into the physical address in both the techniques. Further, we will analyze the advantages and disadvantages of each technique.

22 Apr 2020

AfterAcademy Tech

What are demand-paging and pre-paging?

In this blog, we will learn how pages are brought into the main memory in virtual memory systems. We will see two ways of doing this i.e. demand paging and pre-paging.

22 Apr 2020

AfterAcademy Tech

Authentication vs Authorization

Authentication and Authorization are closely related terms and we shall discuss the difference between the two in this blog.

12 Apr 2020

AfterAcademy Tech

TypeScript Tutorial For Beginners

In this tutorial, We are going to learn about the basics of Typescript. If you are having any doubts, whether to use typescript over javascript or Do I really need it? then this article is for you. Learn the concepts behind Typescript and its necessity in today's world.

09 Apr 2020

AfterAcademy Tech

How to become Developer Student Clubs Leads?

If you want to share your knowledge with others and want to learn back from them, then you must be in some community. Developer Student Clubs is one such community by Google Developers. Learn how to become a Developer Student Clubs lead at your campus.

08 Apr 2020

AfterAcademy Tech

Heap Building and Heap Sort

Heap is a very useful data structure that every programmer should know well. The heap data structure is used in Heap Sort, Priority Queues. The understanding of heaps helps us to know about memory management. In this blog, we will discuss the various about Heap Building and Heap Sort.

07 Apr 2020

AfterAcademy Tech

Longest Increasing Subsequence - Interview Problem

You are given an array A with N elements. You need to find the longest increasing subsequence in the array.

07 Apr 2020

AfterAcademy Tech

Longest Common Prefix

Find the LCP. This is a very famous interview problem and demonstrates the use of various approaches and techniques to solve.

07 Apr 2020

AfterAcademy Tech

What is Belady’s Anomaly?

In this blog, we will learn what is Belady's anomaly and we will analyze how increasing the frame number leads to Beladys Anomaly in FIFO.

07 Apr 2020