Milan  Reilly

Milan Reilly

1635563465

What Does It Take to Become A .NET Solution Architect?

When I started my career path in software engineering, I promised myself that I would never say no to a challenging project because I knew that this is the only way that will make me grow professionally. Few years later I started focusing more on the architecture design of the software solution rather than just writing good quality code.

In 2021, I published my first book about solution architecture with .NET, I consider it as a step by step guide for any senior developer on how to become a solution architect.

#dotnet 

What is GEEK

Buddha Community

What Does It Take to Become A .NET Solution Architect?

How Do I Pass the AWS Solutions Architect Associate Exam? Careerera

The AWS solutions architect associate exam is one of the most difficult certification exams in the world. There are many certifications for various things such as the PMP certification and the CISSP certification, but it is the AWS solutions architect associate exam which takes the crown when it comes to difficulty.

How to Qualify an AWS Certified Solutions Architect Associate Exam?

Naturally, given the difficulty of the exam many people wonder, “How Do I Pass the AWS Solutions Architect Associate Exam?” on the first attempt. This is a very valid question and, in this article, we will discuss all the ways in which one can maximize his chances of passing the AWS solutions architect associate exam in the first attempt.

Before starting we must remember one thing – the AWS platform is a beast of a platform and is vast beyond comprehension. So, for a beginner looking to take the AWS solutions architect associate exam it will not be possible to cover all the topics and services related to the AWS platform.

However, one can make one’s best attempt to cover all the core concepts and topics which are most relevant and pertinent to the AWS platform. A candidate for the AWS solutions architect associate exam in particular should keep himself updated on all the most recent advances and developments in the field of AWS.

Which services are tested most frequently on the exam?

  1. Amazon EC2 -

This service is used to create virtual machines which are offsite. It is also used to manage things such as ports, security, and storage because of its many features. It allows the users to utilize AWS’ vast computing capabilities on-demand. With a ‘scale as you grow’ philosophy the user is not trapped into an agreement in which they will have to purchase excessive resources from Amazon.
They only have to make use of as many resources as they need. The Amazon EC2 web interface allows the software developers to configure and resize the compute machines to their heart’s content with minimal friction and absolutely no confusion whatsoever. All decent AWS Solutions Architect Associate Certification courses teach how to make use of this service.

  1. Amazon RDS -

The full form of Amazon RDS is Amazon Relational Database Service. It is an extremely useful service launched by Amazon. It is used by software developers to create a database with all the features of a full-fledged offline database in a matter of minutes.

The main purpose of Amazon RDS is to set up relational databases in the cloud. These databases can be set up, operated, and scaled very easily and very smoothly. Amazon provides a very seamless and slick interface which is ideal for operating the databases thus created.

The databases are very cost-effective and can be resized very easily. They provide all facilities to carry out administrative tasks such as hardware provisioning, database setup, patching and backups. With the help of these databases, one will be able to give their applications fast performance, high availability, security and compatibility.

  1. Amazon S3 -

The full form of Amazon S3 is Amazon Simple Storage Service. It is a service which provides a lot of expediency to software developers in the matter of storage. Software developers can create objects through programming and they can then store those objects which they have coded into the Amazon S3 service.

This service is responsible in a large part for having made AWS the leading cloud services provider in the world. Truly Jeff Bezos must have been inspired by a divine vision when he conceived of this service. This service leads the industry in terms of scalability, data availability, security, and performance.

How difficult is the AWS solutions architect associate exam?

As we have mentioned before, the AWS platform is vast beyond comprehension. It contains multitudes of services and all of them have their own various configuration options and switches. This means that for a candidate who is just starting his journey of becoming a AWS certified solution architect associate it is not possible to master the whole platform immediately.

It will take many years and a lot of practical and hands-on experience before he is able to do so. But the AWS solutions architect associate exam has a very extensive syllabus and is thus prohibitively difficult for the candidates. Its syllabus contains the following domains of knowledge -

• Design Resilient Architectures - 34%
• Define Performant Architecture – 24%
• Specify Secure Applications and Architectures – 24%
• Design Cost-Optimized Architectures – 10%
• Define Operationally Excellent Architectures – 8%

Some tips which will help to clear the exam -

  1. Read as many AWS whitepapers as possible -

The AWS whitepapers explain many core concepts of the AWS platform in very technical, precise, and accurate language. For a candidate preparing for the AWS solutions architect associate exam, it is very beneficial to read the whitepapers as they will illuminate many technical and hard to grasp concepts of the AWS platform in a detailed and scientific way.

  1. Make use of the process of elimination for multiple correct answers -

On the AWS solutions architect associate exam there will be many questions which will have multiple options. For those questions the candidate should first try to identify and eliminate the incorrect options so that they have to contemplate a fewer number of options while trying to find the correct answer.

  1. Try to spot questions which have hints and details about other questions -

Many times, there will be questions on the exam which will contain hints and details pertinent to other questions on the exam. So, the candidate should keep a weather eye out for such questions and read all questions carefully with this aspect of the exam kept in mind firmly. This trick is taught in many AWS Solutions Architect Associate Certification courses.

  1. Take an AWS solution architect associate course -

The best way to pass the AWS solutions architect associate exam is to take an AWS solution architect associate course. This will help the candidate because they will be studying under the guidance of seasoned and experienced instructors who will be able to bring their world-class teaching skills and subject matter expertise to bear to make the learners fully prepared for the exam.

#how do i pass the aws solutions architect associate exam #how to qualify an aws certified solutions architect associate exam #aws solutions architect associate exam #aws solutions architect associate certification courses #aws certified solution architect associate #aws solution architect associate course

Einar  Hintz

Einar Hintz

1602560783

jQuery Ajax CRUD in ASP.NET Core MVC with Modal Popup

In this article, we’ll discuss how to use jQuery Ajax for ASP.NET Core MVC CRUD Operations using Bootstrap Modal. With jQuery Ajax, we can make HTTP request to controller action methods without reloading the entire page, like a single page application.

To demonstrate CRUD operations – insert, update, delete and retrieve, the project will be dealing with details of a normal bank transaction. GitHub repository for this demo project : https://bit.ly/33KTJAu.

Sub-topics discussed :

  • Form design for insert and update operation.
  • Display forms in modal popup dialog.
  • Form post using jQuery Ajax.
  • Implement MVC CRUD operations with jQuery Ajax.
  • Loading spinner in .NET Core MVC.
  • Prevent direct access to MVC action method.

Create ASP.NET Core MVC Project

In Visual Studio 2019, Go to File > New > Project (Ctrl + Shift + N).

From new project window, Select Asp.Net Core Web Application_._

Image showing how to create ASP.NET Core Web API project in Visual Studio.

Once you provide the project name and location. Select Web Application(Model-View-Controller) and uncheck HTTPS Configuration. Above steps will create a brand new ASP.NET Core MVC project.

Showing project template selection for .NET Core MVC.

Setup a Database

Let’s create a database for this application using Entity Framework Core. For that we’ve to install corresponding NuGet Packages. Right click on project from solution explorer, select Manage NuGet Packages_,_ From browse tab, install following 3 packages.

Showing list of NuGet Packages for Entity Framework Core

Now let’s define DB model class file – /Models/TransactionModel.cs.

public class TransactionModel
{
    [Key]
    public int TransactionId { get; set; }

    [Column(TypeName ="nvarchar(12)")]
    [DisplayName("Account Number")]
    [Required(ErrorMessage ="This Field is required.")]
    [MaxLength(12,ErrorMessage ="Maximum 12 characters only")]
    public string AccountNumber { get; set; }

    [Column(TypeName ="nvarchar(100)")]
    [DisplayName("Beneficiary Name")]
    [Required(ErrorMessage = "This Field is required.")]
    public string BeneficiaryName { get; set; }

    [Column(TypeName ="nvarchar(100)")]
    [DisplayName("Bank Name")]
    [Required(ErrorMessage = "This Field is required.")]
    public string BankName { get; set; }

    [Column(TypeName ="nvarchar(11)")]
    [DisplayName("SWIFT Code")]
    [Required(ErrorMessage = "This Field is required.")]
    [MaxLength(11)]
    public string SWIFTCode { get; set; }

    [DisplayName("Amount")]
    [Required(ErrorMessage = "This Field is required.")]
    public int Amount { get; set; }

    [DisplayFormat(DataFormatString = "{0:MM/dd/yyyy}")]
    public DateTime Date { get; set; }
}

C#Copy

Here we’ve defined model properties for the transaction with proper validation. Now let’s define  DbContextclass for EF Core.

#asp.net core article #asp.net core #add loading spinner in asp.net core #asp.net core crud without reloading #asp.net core jquery ajax form #asp.net core modal dialog #asp.net core mvc crud using jquery ajax #asp.net core mvc with jquery and ajax #asp.net core popup window #bootstrap modal popup in asp.net core mvc. bootstrap modal popup in asp.net core #delete and viewall in asp.net core #jquery ajax - insert #jquery ajax form post #modal popup dialog in asp.net core #no direct access action method #update #validation in modal popup

Pesquisa Linear em Python

Nesta postagem python, você aprenderá o seguinte:

  • O que é uma pesquisa linear?
  • Algoritmo de pesquisa linear
  • Escreva um programa Python para pesquisa linear usando loop while
  • Escreva um programa Python para pesquisa linear usando o loop for
  • Pesquisa linear no programa Python usando recursão

O que é uma pesquisa linear?

Em primeiro lugar, uma pesquisa linear, também conhecida como pesquisa sequencial, este método é usado para localizar um elemento dentro de uma lista ou array. Ele verifica cada elemento da lista um por um / sequencialmente até que uma correspondência seja encontrada ou toda a lista tenha sido pesquisada.

Algoritmo de pesquisa linear

Implemente a pesquisa linear seguindo as etapas abaixo:

  • Percorra a lista / array usando um loop.
  • Em cada iteração, associe o target valor ao  valor fornecido da lista / matriz.
    • Se os valores corresponderem, retorne o índice atual da lista / matriz.
    • Caso contrário, vá para o próximo elemento de array / lista.
  • Se nenhuma correspondência for encontrada, retorne  -1.

Escreva um programa Python para pesquisa linear usando loop while

# python program for linear search using while loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

i = 0
flag = False

while i < len(lst):
	if lst[i] == x:
		flag = True
		break

	i = i + 1

if flag == 1:
	print('{} was found at index {}.'.format(x, i))
else:
	print('{} was not found.'.format(x))

Depois de executar o programa, a saída será:

Enter size of list :-  5
Enter the array of 0 element :-  10
Enter the array of 1 element :-  23
Enter the array of 2 element :-  56
Enter the array of 3 element :-  89
Enter the array of 4 element :-  200
Enter number to search in list :-  89
89 was found at index 3.

Escreva um programa Python para pesquisa linear usando o loop for

# python program for linear search using for loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

i = 0
flag = False

for i in range(len(lst)):
    if lst[i] == x:
        flag = True
        break

if flag == 1:
	print('{} was found at index {}.'.format(x, i))
else:
	print('{} was not found.'.format(x))

Depois de executar o programa, a saída será:

Enter size of list :-  6
Enter the array of 0 element :-  25
Enter the array of 1 element :-  50
Enter the array of 2 element :-  100
Enter the array of 3 element :-  200
Enter the array of 4 element :-  250
Enter the array of 5 element :-  650
Enter number to search in list :-  200
200 was found at index 3.

Pesquisa linear no programa Python usando recursão

# python program for linear search using for loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

# Recursive function to linear search x in arr[l..r]  
def recLinearSearch( arr, l, r, x): 
    if r < l: 
        return -1
    if arr[l] == x: 
        return l 
    if arr[r] == x: 
        return r 
    return recLinearSearch(arr, l+1, r-1, x) 

res = recLinearSearch(lst, 0, len(lst)-1, x) 

if res != -1:
	print('{} was found at index {}.'.format(x, res))
else:
	print('{} was not found.'.format(x))

Depois de executar o programa, a saída será:

Enter size of list :-  5
Enter the array of 0 element :-  14
Enter the array of 1 element :-  25
Enter the array of 2 element :-  63
Enter the array of 3 element :-  42
Enter the array of 4 element :-  78
Enter number to search in list :-  78
78 was found at index 4.

Lineare Suche in Python

In diesem Python-Beitrag erfahren Sie Folgendes:

  • Was ist eine lineare Suche?
  • Linearer Suchalgorithmus
  • Schreiben Sie ein Python-Programm für die lineare Suche mit While-Schleife
  • Schreiben Sie ein Python-Programm für die lineare Suche mit der For-Schleife
  • Lineare Suche im Python-Programm mit Rekursion

Was ist eine lineare Suche?

Eine lineare Suche, auch bekannt als sequentielle Suche, diese Methode wird verwendet, um ein Element innerhalb einer Liste oder eines Arrays zu finden. Es überprüft jedes Element der Liste nacheinander / sequentiell, bis eine Übereinstimmung gefunden wird oder die gesamte Liste durchsucht wurde.

Linearer Suchalgorithmus

Implementieren Sie die lineare Suche mit den folgenden Schritten:

  • Durchlaufen Sie die Liste/das Array mit einer Schleife.
  • Verknüpfen Sie in jeder Iteration den  target Wert mit dem angegebenen Wert der Liste/des Arrays.
    • Wenn die Werte übereinstimmen, geben Sie den aktuellen Index der Liste/des Arrays zurück.
    • Fahren Sie andernfalls mit dem nächsten Array-/Listenelement fort.
  • Wenn keine Übereinstimmung gefunden wird, geben Sie zurück  -1.

Schreiben Sie ein Python-Programm für die lineare Suche mit While-Schleife

# python program for linear search using while loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

i = 0
flag = False

while i < len(lst):
	if lst[i] == x:
		flag = True
		break

	i = i + 1

if flag == 1:
	print('{} was found at index {}.'.format(x, i))
else:
	print('{} was not found.'.format(x))

Nach der Ausführung des Programms lautet die Ausgabe:

Enter size of list :-  5
Enter the array of 0 element :-  10
Enter the array of 1 element :-  23
Enter the array of 2 element :-  56
Enter the array of 3 element :-  89
Enter the array of 4 element :-  200
Enter number to search in list :-  89
89 was found at index 3.

Schreiben Sie ein Python-Programm für die lineare Suche mit der For-Schleife

# python program for linear search using for loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

i = 0
flag = False

for i in range(len(lst)):
    if lst[i] == x:
        flag = True
        break

if flag == 1:
	print('{} was found at index {}.'.format(x, i))
else:
	print('{} was not found.'.format(x))

Nach der Ausführung des Programms lautet die Ausgabe:

Enter size of list :-  6
Enter the array of 0 element :-  25
Enter the array of 1 element :-  50
Enter the array of 2 element :-  100
Enter the array of 3 element :-  200
Enter the array of 4 element :-  250
Enter the array of 5 element :-  650
Enter number to search in list :-  200
200 was found at index 3.

Lineare Suche im Python-Programm mit Rekursion

# python program for linear search using for loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

# Recursive function to linear search x in arr[l..r]  
def recLinearSearch( arr, l, r, x): 
    if r < l: 
        return -1
    if arr[l] == x: 
        return l 
    if arr[r] == x: 
        return r 
    return recLinearSearch(arr, l+1, r-1, x) 

res = recLinearSearch(lst, 0, len(lst)-1, x) 

if res != -1:
	print('{} was found at index {}.'.format(x, res))
else:
	print('{} was not found.'.format(x))

Nach der Ausführung des Programms lautet die Ausgabe:

Enter size of list :-  5
Enter the array of 0 element :-  14
Enter the array of 1 element :-  25
Enter the array of 2 element :-  63
Enter the array of 3 element :-  42
Enter the array of 4 element :-  78
Enter number to search in list :-  78
78 was found at index 4.

Линейный поиск в Python

В этом посте на Python вы узнаете следующее:

  • Что такое линейный поиск?
  • Алгоритм линейного поиска
  • Напишите программу на Python для линейного поиска с использованием цикла while
  • Напишите программу на Python для линейного поиска с использованием цикла For
  • Линейный поиск в программе Python с использованием рекурсии

Что такое линейный поиск?

Прежде всего, линейный поиск, также известный как последовательный поиск, этот метод используется для поиска элемента в списке или массиве. Он проверяет каждый элемент списка один за другим / последовательно, пока не будет найдено совпадение или пока не будет выполнен поиск по всему списку.

Алгоритм линейного поиска

Реализуйте линейный поиск, выполнив следующие шаги:

  • Просмотрите список / массив, используя цикл.
  • На каждой итерации связывайте  target значение с заданным значением списка / массива.
    • Если значения совпадают, вернуть текущий индекс списка / массива.
    • В противном случае перейдите к следующему элементу массива / списка.
  • Если совпадений не найдено, вернитесь  -1.

Напишите программу на Python для линейного поиска с использованием цикла while

# python program for linear search using while loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

i = 0
flag = False

while i < len(lst):
	if lst[i] == x:
		flag = True
		break

	i = i + 1

if flag == 1:
	print('{} was found at index {}.'.format(x, i))
else:
	print('{} was not found.'.format(x))

После выполнения программы вывод будет:

Enter size of list :-  5
Enter the array of 0 element :-  10
Enter the array of 1 element :-  23
Enter the array of 2 element :-  56
Enter the array of 3 element :-  89
Enter the array of 4 element :-  200
Enter number to search in list :-  89
89 was found at index 3.

Напишите программу на Python для линейного поиска с использованием цикла For

# python program for linear search using for loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

i = 0
flag = False

for i in range(len(lst)):
    if lst[i] == x:
        flag = True
        break

if flag == 1:
	print('{} was found at index {}.'.format(x, i))
else:
	print('{} was not found.'.format(x))

После выполнения программы вывод будет:

Enter size of list :-  6
Enter the array of 0 element :-  25
Enter the array of 1 element :-  50
Enter the array of 2 element :-  100
Enter the array of 3 element :-  200
Enter the array of 4 element :-  250
Enter the array of 5 element :-  650
Enter number to search in list :-  200
200 was found at index 3.

Линейный поиск в программе Python с использованием рекурсии

# python program for linear search using for loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

# Recursive function to linear search x in arr[l..r]  
def recLinearSearch( arr, l, r, x): 
    if r < l: 
        return -1
    if arr[l] == x: 
        return l 
    if arr[r] == x: 
        return r 
    return recLinearSearch(arr, l+1, r-1, x) 

res = recLinearSearch(lst, 0, len(lst)-1, x) 

if res != -1:
	print('{} was found at index {}.'.format(x, res))
else:
	print('{} was not found.'.format(x))

После выполнения программы вывод будет:

Enter size of list :-  5
Enter the array of 0 element :-  14
Enter the array of 1 element :-  25
Enter the array of 2 element :-  63
Enter the array of 3 element :-  42
Enter the array of 4 element :-  78
Enter number to search in list :-  78
78 was found at index 4.