Working in .net technology
14
Alok Kumar Pandey Active Contributor - AspNetCommunity Director, Strategic Product Development at Braindigit IT Solution .NET Learnin g Working in .NET Technology MSP SummIT 2013
-
Upload
alok-pandey -
Category
Technology
-
view
1.976 -
download
1
description
@MSP SummIT 2013, to present "Working in .NET Technology" at Mirabel Resort Dhulikhel,
Transcript of Working in .net technology
Alok Kumar Pandey
Active Contributor - AspNetCommunity
Director, Strategic Product Development at Braindigit IT Solution
.NETLearning
Working in .NET Technology
MSP SummIT 2013
Working .NET Technology
What is in .NET?
The Microsoft .NET Framework is a software technology.
Why .NET not else?
18.6 % Web Server Side Language till Sept 2013
Web Server IIS 18.6%
Build tomorrow's business applications today
Area of ASP.NET
Scope
Global Content Mgmt Software Market to Reach US$12.8 Billion by 2017 (source: http://www.strategyr.com)
170M active sites now The growing Cloud, Embedded and Windows
Phone system are well supported in .NET & Growing
Large number of Big companies are working in .NET technology.
Development
Development
Which one to use
Speed of Common Operationsadd to end
remove from end
insert at middleremove
from middleRandom Access
In-order Access
Search for specific element
Notes
Array O(n) O(n) O(n) O(n) O(1) O(1) O(n)Most efficient use of memory; use in cases where data size is fixed.
List<T>best case O(1); worst case O(n)
O(1) O(n) O(n) O(1) O(1) O(n)Implementation is optimized for speed. In many cases, List will be the best choice.
Collection<T>best case O(1); worst case O(n)
O(1) O(n) O(n) O(1) O(1) O(n)List is a better choice, unless publicly exposed as API.
LinkedList<T> O(1) O(1) O(1) O(1) O(n) O(1) O(n)Many operations are fast, but watch out for cache coherency.
Stack<T>best case O(1); worst case O(n)
O(1) N/A N/A N/A N/A N/AShouldn't be selected for performance reasons, but algorithmic ones.
Queue<T>best case O(1); worst case O(n)
O(1) N/A N/A N/A N/A N/AShouldn't be selected for performance reasons, but algorithmic ones.
Dictionary<K,T>best case O(1); worst case O(n)
O(1)best case O(1); worst case O(n)
O(1) O(1)* O(1)* O(1)
Although in-order access time is constant time, it is usually slower than other structures due to the over-head of looking up the key.
http://www.dotnetcurry.com/ShowArticle.aspx?ID=190
Resources
http://www.asp.net/ (Learn)
http://www.codeplex.com/ (Open Source => ASP.NET MVC, Web API, and Web Pages (Razor) )
http://channel9.msdn.com/
And many more
Our Strategic Objectives
Thank You
www.aspnetcommunity.org
AspNetCommunity
ASP.NET,C#/VB.NET Developer/Programmer
Facebook Group Twitter
@AspNetCommunityASP.NET Community
