Topological Sort

Topological sorting for any graph is possible if it is a DAG

Directed Acyclic Graph (DAG)

A directed graph with no cycle is called DAG

                          

Topological Sort is the linear ordering of the vertices such that for every directed edge UV(U->V) vertex U comes before V in the ordering.

Introduction to ASP.NET Core

ASP

Overview 

ASP.NET Core is the new version of the ASP.NET web framework mainly targeted to run on .NET Core platform. 

ASP.NET Core is a free, open-source, and cross-platform framework for building cloud-based applications, web apps, IoT apps, and mobile backends. It is designed to run on the cloud as well as on-premises. 

RPA using UI Path

What is RPA?

Robotic Process Automation (RPA) is the technology that allows to automate any task which humans do it manually. In other words, we can say RPA is a software program which copies the human action while interacting with the computer applications and automates the repetitive and rule based processes.

Why RPA?

RPA can be helpful to fill the gap between systems and process. RPA helps to ensure that tasks is completed more quickly as the tool can retrieve the data from the background. Tool can do repetitive work more quickly, accurately, and tirelessly than humans.

RPA helps in fast release, less time consumption, less cost consumption and quality is also assured with the correctness.

Concurrency in Transaction

Concurrency

Concurrency means allowing more than one transaction to operate simultaneously on a same database.

Concurrency has many advantages

1. Reduces waiting time

2. Reduces the Response time.

3. Increases resource utilization

4. Increases Efficiency.

Problems

1.

 

Clone a linked list with next and random pointer

 

We have a double linked list where each node consists of three pointers data, random and next. Now our task is to clone this linked list

                                                           LinkedList

Let’s first dive deep into the 1st solution of this problem

This method stores the next and random pointer (of original list) in an array first, then modifies the original Linked List (to create copy), creates a copy. And finally restores the original list.

Displaying 1 - 10 (of 39 posts)
Displaying 1 - 10 (of 39 posts)