Array is fixed length and Array is a simple sequence of numbers which are not concerned about each-others positions but linked list is variable length In array values are accessing easy but linked list is some time taken process because search either forward or backward In array updating operations are time taken comparing with linked list Array is not grow-able and linked list is grow-able
ASP (Active Server Pages) and ASP.NET are both server side technologies for building web sites and web applications, ASP.NET is Managed compiled code – asp is interpreted. and ASP.net is fully Object oriented. ASP.NET has been entirely re-architected to provide a highly productive programming experience based on the .NET Framework, and a robust infrastructure for building reliable and scalable web applications. Answer 1: ASP: Code is Interpreted ASP.NET: Code is Compiled ASP: Business Logic and Presentation Logic are in a single file ASP.NET: Business Logic and Presentation Logic are in separate files (.cs or .vb) and (.aspx) respectively. ASP: No … Click here to continue reading.
Imagine that we have a database and one table. Stored procedure returns 3 columns of table: ID, name, value. Name and value can be a null in database. How to map or represent such values in .net code? When I map a null value to a string or double variable I get an error. I have heard that one of solutions can be converting and representing db.null as a minimum value of used type. Is it a good technique? And what in situation when I need the entire values variable can represent from minimum to maximum? If you have NULL … Click here to continue reading.
A hash table is a generic data structure providing for fast and random retrieval of objects. It is sometimes called a map or a dictionary (although the implementations may differ). Its a key-value pairs. The tenet of a hash table is that the location of an object in the data structure is computed from the key associated with the object when it is stored into the hash table. For that reason, retrieving an object from a hash table is very fast. Of course, the key associated with the object must be unique.
YY,yyyy – year qq.q – quarter mm,m – month dy,y – day wk,ww – week dw – weekday hh – hour mi,n – minute ss,s – second ms – milliseconds